./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix016_power.opt_rmo.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix016_power.opt_rmo.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version bcb38a6f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix016_power.opt_rmo.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix016_power.opt_rmo.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-bcb38a6-m [2024-06-03 21:22:53,701 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-03 21:22:53,784 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-03 21:22:53,791 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-03 21:22:53,792 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-03 21:22:53,821 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-03 21:22:53,822 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-03 21:22:53,822 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-03 21:22:53,823 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-03 21:22:53,827 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-03 21:22:53,827 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-03 21:22:53,827 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-03 21:22:53,828 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-03 21:22:53,829 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-03 21:22:53,830 INFO L153 SettingsManager]: * Use SBE=true [2024-06-03 21:22:53,830 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-03 21:22:53,830 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-03 21:22:53,830 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-03 21:22:53,831 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-03 21:22:53,831 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-03 21:22:53,831 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-03 21:22:53,832 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-03 21:22:53,832 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-03 21:22:53,832 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-03 21:22:53,833 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-03 21:22:53,833 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-03 21:22:53,833 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-03 21:22:53,833 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-03 21:22:53,834 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-03 21:22:53,834 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-03 21:22:53,835 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-03 21:22:53,836 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-03 21:22:53,836 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 21:22:53,836 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-03 21:22:53,836 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-03 21:22:53,836 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-03 21:22:53,837 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-03 21:22:53,837 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-03 21:22:53,837 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-03 21:22:53,837 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-03 21:22:53,838 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-03 21:22:53,838 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-03 21:22:53,838 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-03 21:22:53,838 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-03 21:22:54,117 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-03 21:22:54,144 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-03 21:22:54,146 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-03 21:22:54,147 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-03 21:22:54,148 INFO L274 PluginConnector]: CDTParser initialized [2024-06-03 21:22:54,149 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix016_power.opt_rmo.opt.i [2024-06-03 21:22:55,409 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-03 21:22:55,650 INFO L384 CDTParser]: Found 1 translation units. [2024-06-03 21:22:55,650 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix016_power.opt_rmo.opt.i [2024-06-03 21:22:55,671 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32431545c/7e95ecc2bfed4983aabf868e42e8db44/FLAGc62928ef6 [2024-06-03 21:22:55,686 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32431545c/7e95ecc2bfed4983aabf868e42e8db44 [2024-06-03 21:22:55,688 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-03 21:22:55,688 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-03 21:22:55,689 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/mix016_power.opt_rmo.opt.yml/witness.yml [2024-06-03 21:22:55,941 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-03 21:22:55,942 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-03 21:22:55,943 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-03 21:22:55,943 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-03 21:22:55,948 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-03 21:22:55,948 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 09:22:55" (1/2) ... [2024-06-03 21:22:55,949 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36f24b2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:22:55, skipping insertion in model container [2024-06-03 21:22:55,949 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 09:22:55" (1/2) ... [2024-06-03 21:22:55,950 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3cb8dba1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:22:55, skipping insertion in model container [2024-06-03 21:22:55,951 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 09:22:55" (2/2) ... [2024-06-03 21:22:55,951 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36f24b2f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:22:55, skipping insertion in model container [2024-06-03 21:22:55,951 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 09:22:55" (2/2) ... [2024-06-03 21:22:55,952 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-03 21:22:56,053 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-03 21:22:56,054 INFO L97 edCorrectnessWitness]: Location invariant before [L839-L839] ((((((((((((((((((((! multithreaded || x$r_buff0_thd0 == (_Bool)0) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 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 )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 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 )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )x) - (long long )z >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff1) - (long long )z >= 0LL) && (1LL + (long long )y) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$read_delayed) - (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )weak$$choice0) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 1) && y <= 1) && z <= 1) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 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)) && (x == 0 || x == 1)) && (x$mem_tmp == 0 || x$mem_tmp == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 1)) && (x$w_buff1 == 0 || x$w_buff1 == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)))) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0) [2024-06-03 21:22:56,055 INFO L97 edCorrectnessWitness]: Location invariant before [L842-L842] ((((((((((((((((((((! multithreaded || x$r_buff0_thd0 == (_Bool)0) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 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 )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 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 )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )x) - (long long )z >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff1) - (long long )z >= 0LL) && (1LL + (long long )y) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$read_delayed) - (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )weak$$choice0) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 1) && y <= 1) && z <= 1) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 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)) && (x == 0 || x == 1)) && (x$mem_tmp == 0 || x$mem_tmp == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 1)) && (x$w_buff1 == 0 || x$w_buff1 == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)))) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0) [2024-06-03 21:22:56,056 INFO L97 edCorrectnessWitness]: Location invariant before [L841-L841] ((((((((((((((((((((! multithreaded || x$r_buff0_thd0 == (_Bool)0) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 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 )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 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 )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )x) - (long long )z >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff1) - (long long )z >= 0LL) && (1LL + (long long )y) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$read_delayed) - (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )weak$$choice0) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 1) && y <= 1) && z <= 1) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 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)) && (x == 0 || x == 1)) && (x$mem_tmp == 0 || x$mem_tmp == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 1)) && (x$w_buff1 == 0 || x$w_buff1 == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)))) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0) [2024-06-03 21:22:56,056 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-03 21:22:56,056 INFO L106 edCorrectnessWitness]: ghost_update [L837-L837] multithreaded = 1; [2024-06-03 21:22:56,102 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-03 21:22:56,486 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 21:22:56,500 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-03 21:22:56,981 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 21:22:57,019 INFO L206 MainTranslator]: Completed translation [2024-06-03 21:22:57,020 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:22:57 WrapperNode [2024-06-03 21:22:57,020 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-03 21:22:57,021 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-03 21:22:57,021 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-03 21:22:57,021 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-03 21:22:57,055 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 03.06 09:22:57" (1/1) ... [2024-06-03 21:22:57,100 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 03.06 09:22:57" (1/1) ... [2024-06-03 21:22:57,244 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 127 [2024-06-03 21:22:57,245 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-03 21:22:57,246 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-03 21:22:57,246 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-03 21:22:57,246 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-03 21:22:57,257 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:22:57" (1/1) ... [2024-06-03 21:22:57,257 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:22:57" (1/1) ... [2024-06-03 21:22:57,280 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:22:57" (1/1) ... [2024-06-03 21:22:57,323 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-03 21:22:57,323 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:22:57" (1/1) ... [2024-06-03 21:22:57,324 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:22:57" (1/1) ... [2024-06-03 21:22:57,362 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:22:57" (1/1) ... [2024-06-03 21:22:57,364 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:22:57" (1/1) ... [2024-06-03 21:22:57,380 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:22:57" (1/1) ... [2024-06-03 21:22:57,387 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:22:57" (1/1) ... [2024-06-03 21:22:57,409 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-03 21:22:57,410 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-03 21:22:57,410 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-03 21:22:57,410 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-03 21:22:57,411 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:22:57" (1/1) ... [2024-06-03 21:22:57,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 21:22:57,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-03 21:22:57,441 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-03 21:22:57,460 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-03 21:22:57,483 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-03 21:22:57,484 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-03 21:22:57,484 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-03 21:22:57,484 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-03 21:22:57,484 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-03 21:22:57,485 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-03 21:22:57,485 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-03 21:22:57,485 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-03 21:22:57,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-03 21:22:57,486 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-03 21:22:57,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-03 21:22:57,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-03 21:22:57,487 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-03 21:22:57,649 INFO L244 CfgBuilder]: Building ICFG [2024-06-03 21:22:57,652 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-03 21:22:59,153 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-03 21:22:59,154 INFO L293 CfgBuilder]: Performing block encoding [2024-06-03 21:22:59,468 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-03 21:22:59,468 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-03 21:22:59,469 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 09:22:59 BoogieIcfgContainer [2024-06-03 21:22:59,469 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-03 21:22:59,472 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-03 21:22:59,472 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-03 21:22:59,475 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-03 21:22:59,476 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.06 09:22:55" (1/4) ... [2024-06-03 21:22:59,476 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@161a86bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 09:22:59, skipping insertion in model container [2024-06-03 21:22:59,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 09:22:55" (2/4) ... [2024-06-03 21:22:59,477 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@161a86bd and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 09:22:59, skipping insertion in model container [2024-06-03 21:22:59,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:22:57" (3/4) ... [2024-06-03 21:22:59,478 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@161a86bd and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 09:22:59, skipping insertion in model container [2024-06-03 21:22:59,478 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 09:22:59" (4/4) ... [2024-06-03 21:22:59,479 INFO L112 eAbstractionObserver]: Analyzing ICFG mix016_power.opt_rmo.opt.i [2024-06-03 21:22:59,495 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-03 21:22:59,495 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-03 21:22:59,496 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-03 21:22:59,625 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-03 21:22:59,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 42 transitions, 96 flow [2024-06-03 21:22:59,740 INFO L124 PetriNetUnfolderBase]: 0/39 cut-off events. [2024-06-03 21:22:59,741 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 21:22:59,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 39 events. 0/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 59 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-03 21:22:59,744 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 42 transitions, 96 flow [2024-06-03 21:22:59,747 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 33 transitions, 75 flow [2024-06-03 21:22:59,756 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-03 21:22:59,762 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;@13fb552b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-03 21:22:59,762 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-03 21:22:59,771 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-03 21:22:59,771 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-03 21:22:59,771 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 21:22:59,772 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:22:59,772 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-03 21:22:59,773 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-03 21:22:59,805 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:22:59,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1569246658, now seen corresponding path program 1 times [2024-06-03 21:22:59,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:22:59,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054931709] [2024-06-03 21:22:59,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:22:59,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:23:00,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:23:06,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:23:06,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:23:06,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054931709] [2024-06-03 21:23:06,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054931709] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:23:06,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:23:06,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-03 21:23:06,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595949749] [2024-06-03 21:23:06,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:23:06,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-03 21:23:06,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:23:06,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-03 21:23:06,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-03 21:23:06,957 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 42 [2024-06-03 21:23:06,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 75 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:23:06,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:23:06,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 42 [2024-06-03 21:23:06,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:23:08,082 INFO L124 PetriNetUnfolderBase]: 946/1552 cut-off events. [2024-06-03 21:23:08,082 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2024-06-03 21:23:08,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3060 conditions, 1552 events. 946/1552 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 7731 event pairs, 638 based on Foata normal form. 1/1484 useless extension candidates. Maximal degree in co-relation 3045. Up to 1431 conditions per place. [2024-06-03 21:23:08,097 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 32 selfloop transitions, 4 changer transitions 0/43 dead transitions. [2024-06-03 21:23:08,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 43 transitions, 173 flow [2024-06-03 21:23:08,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-03 21:23:08,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-03 21:23:08,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2024-06-03 21:23:08,110 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191 [2024-06-03 21:23:08,111 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 75 flow. Second operand 3 states and 78 transitions. [2024-06-03 21:23:08,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 43 transitions, 173 flow [2024-06-03 21:23:08,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 43 transitions, 168 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-03 21:23:08,118 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 102 flow [2024-06-03 21:23:08,119 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2024-06-03 21:23:08,123 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 0 predicate places. [2024-06-03 21:23:08,123 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 102 flow [2024-06-03 21:23:08,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:23:08,124 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:23:08,124 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:23:08,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-03 21:23:08,125 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-03 21:23:08,127 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:23:08,127 INFO L85 PathProgramCache]: Analyzing trace with hash -512501091, now seen corresponding path program 1 times [2024-06-03 21:23:08,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:23:08,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162687148] [2024-06-03 21:23:08,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:23:08,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:23:08,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:23:13,142 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-03 21:23:13,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:23:13,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162687148] [2024-06-03 21:23:13,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162687148] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:23:13,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:23:13,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-03 21:23:13,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531190150] [2024-06-03 21:23:13,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:23:13,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-03 21:23:13,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:23:13,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-03 21:23:13,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-03 21:23:13,271 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42 [2024-06-03 21:23:13,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 102 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:23:13,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:23:13,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42 [2024-06-03 21:23:13,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:23:14,212 INFO L124 PetriNetUnfolderBase]: 1110/1753 cut-off events. [2024-06-03 21:23:14,213 INFO L125 PetriNetUnfolderBase]: For 339/339 co-relation queries the response was YES. [2024-06-03 21:23:14,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3976 conditions, 1753 events. 1110/1753 cut-off events. For 339/339 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 8519 event pairs, 641 based on Foata normal form. 3/1746 useless extension candidates. Maximal degree in co-relation 3961. Up to 1652 conditions per place. [2024-06-03 21:23:14,227 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 40 selfloop transitions, 7 changer transitions 0/53 dead transitions. [2024-06-03 21:23:14,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 53 transitions, 242 flow [2024-06-03 21:23:14,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-03 21:23:14,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-03 21:23:14,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 98 transitions. [2024-06-03 21:23:14,231 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2024-06-03 21:23:14,231 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 102 flow. Second operand 4 states and 98 transitions. [2024-06-03 21:23:14,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 53 transitions, 242 flow [2024-06-03 21:23:14,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 53 transitions, 238 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-03 21:23:14,233 INFO L231 Difference]: Finished difference. Result has 46 places, 39 transitions, 138 flow [2024-06-03 21:23:14,233 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=138, PETRI_PLACES=46, PETRI_TRANSITIONS=39} [2024-06-03 21:23:14,234 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 3 predicate places. [2024-06-03 21:23:14,234 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 138 flow [2024-06-03 21:23:14,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:23:14,235 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:23:14,235 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:23:14,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-03 21:23:14,235 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-03 21:23:14,236 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:23:14,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1292335935, now seen corresponding path program 1 times [2024-06-03 21:23:14,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:23:14,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304750511] [2024-06-03 21:23:14,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:23:14,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:23:14,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:23:20,666 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-03 21:23:20,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:23:20,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304750511] [2024-06-03 21:23:20,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304750511] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:23:20,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:23:20,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-03 21:23:20,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438138059] [2024-06-03 21:23:20,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:23:20,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-03 21:23:20,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:23:20,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-03 21:23:20,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-03 21:23:20,847 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42 [2024-06-03 21:23:20,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 138 flow. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:23:20,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:23:20,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42 [2024-06-03 21:23:20,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:23:21,945 INFO L124 PetriNetUnfolderBase]: 1104/1746 cut-off events. [2024-06-03 21:23:21,946 INFO L125 PetriNetUnfolderBase]: For 954/954 co-relation queries the response was YES. [2024-06-03 21:23:21,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4422 conditions, 1746 events. 1104/1746 cut-off events. For 954/954 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 8467 event pairs, 517 based on Foata normal form. 3/1739 useless extension candidates. Maximal degree in co-relation 4405. Up to 1628 conditions per place. [2024-06-03 21:23:21,960 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 47 selfloop transitions, 10 changer transitions 0/63 dead transitions. [2024-06-03 21:23:21,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 63 transitions, 320 flow [2024-06-03 21:23:21,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 21:23:21,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 21:23:21,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 120 transitions. [2024-06-03 21:23:21,965 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2024-06-03 21:23:21,965 INFO L175 Difference]: Start difference. First operand has 46 places, 39 transitions, 138 flow. Second operand 5 states and 120 transitions. [2024-06-03 21:23:21,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 63 transitions, 320 flow [2024-06-03 21:23:21,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 63 transitions, 306 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-03 21:23:21,969 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 174 flow [2024-06-03 21:23:21,969 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=174, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2024-06-03 21:23:21,970 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 6 predicate places. [2024-06-03 21:23:21,970 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 174 flow [2024-06-03 21:23:21,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:23:21,970 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:23:21,971 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:23:21,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-03 21:23:21,971 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-03 21:23:21,971 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:23:21,972 INFO L85 PathProgramCache]: Analyzing trace with hash -171948796, now seen corresponding path program 1 times [2024-06-03 21:23:21,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:23:21,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824017012] [2024-06-03 21:23:21,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:23:21,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:23:22,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:23:27,541 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-03 21:23:27,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:23:27,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824017012] [2024-06-03 21:23:27,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824017012] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:23:27,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:23:27,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 21:23:27,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380574954] [2024-06-03 21:23:27,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:23:27,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 21:23:27,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:23:27,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 21:23:27,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-03 21:23:27,780 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42 [2024-06-03 21:23:27,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 174 flow. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:23:27,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:23:27,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42 [2024-06-03 21:23:27,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:23:28,936 INFO L124 PetriNetUnfolderBase]: 1095/1729 cut-off events. [2024-06-03 21:23:28,936 INFO L125 PetriNetUnfolderBase]: For 1758/1758 co-relation queries the response was YES. [2024-06-03 21:23:28,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4815 conditions, 1729 events. 1095/1729 cut-off events. For 1758/1758 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 8392 event pairs, 375 based on Foata normal form. 6/1725 useless extension candidates. Maximal degree in co-relation 4797. Up to 1583 conditions per place. [2024-06-03 21:23:28,949 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 51 selfloop transitions, 12 changer transitions 0/69 dead transitions. [2024-06-03 21:23:28,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 69 transitions, 374 flow [2024-06-03 21:23:28,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 21:23:28,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 21:23:28,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 138 transitions. [2024-06-03 21:23:28,951 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5476190476190477 [2024-06-03 21:23:28,952 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 174 flow. Second operand 6 states and 138 transitions. [2024-06-03 21:23:28,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 69 transitions, 374 flow [2024-06-03 21:23:28,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 69 transitions, 350 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-03 21:23:28,957 INFO L231 Difference]: Finished difference. Result has 51 places, 43 transitions, 193 flow [2024-06-03 21:23:28,958 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=193, PETRI_PLACES=51, PETRI_TRANSITIONS=43} [2024-06-03 21:23:28,959 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 8 predicate places. [2024-06-03 21:23:28,959 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 193 flow [2024-06-03 21:23:28,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:23:28,960 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:23:28,960 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:23:28,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-03 21:23:28,960 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-03 21:23:28,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:23:28,961 INFO L85 PathProgramCache]: Analyzing trace with hash 592445197, now seen corresponding path program 1 times [2024-06-03 21:23:28,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:23:28,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774696263] [2024-06-03 21:23:28,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:23:28,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:23:29,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:23:37,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:23:37,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:23:37,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774696263] [2024-06-03 21:23:37,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774696263] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:23:37,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:23:37,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 21:23:37,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510497124] [2024-06-03 21:23:37,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:23:37,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 21:23:37,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:23:37,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 21:23:37,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-03 21:23:37,339 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42 [2024-06-03 21:23:37,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 193 flow. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:23:37,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:23:37,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42 [2024-06-03 21:23:37,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:23:38,125 INFO L124 PetriNetUnfolderBase]: 920/1575 cut-off events. [2024-06-03 21:23:38,125 INFO L125 PetriNetUnfolderBase]: For 2263/2263 co-relation queries the response was YES. [2024-06-03 21:23:38,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4513 conditions, 1575 events. 920/1575 cut-off events. For 2263/2263 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 8112 event pairs, 378 based on Foata normal form. 2/1571 useless extension candidates. Maximal degree in co-relation 4494. Up to 1382 conditions per place. [2024-06-03 21:23:38,135 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 42 selfloop transitions, 8 changer transitions 0/57 dead transitions. [2024-06-03 21:23:38,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 57 transitions, 337 flow [2024-06-03 21:23:38,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 21:23:38,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 21:23:38,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2024-06-03 21:23:38,136 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49523809523809526 [2024-06-03 21:23:38,136 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 193 flow. Second operand 5 states and 104 transitions. [2024-06-03 21:23:38,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 57 transitions, 337 flow [2024-06-03 21:23:38,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 57 transitions, 304 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-03 21:23:38,140 INFO L231 Difference]: Finished difference. Result has 52 places, 46 transitions, 206 flow [2024-06-03 21:23:38,140 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=206, PETRI_PLACES=52, PETRI_TRANSITIONS=46} [2024-06-03 21:23:38,140 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 9 predicate places. [2024-06-03 21:23:38,141 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 46 transitions, 206 flow [2024-06-03 21:23:38,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:23:38,141 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:23:38,141 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:23:38,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-03 21:23:38,142 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 21:23:38,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:23:38,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1669640882, now seen corresponding path program 1 times [2024-06-03 21:23:38,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:23:38,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090339384] [2024-06-03 21:23:38,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:23:38,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:23:38,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:23:46,756 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-03 21:23:46,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:23:46,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090339384] [2024-06-03 21:23:46,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090339384] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:23:46,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:23:46,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 21:23:46,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608057529] [2024-06-03 21:23:46,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:23:46,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 21:23:46,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:23:46,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 21:23:46,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-03 21:23:46,923 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-03 21:23:46,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 46 transitions, 206 flow. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:23:46,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:23:46,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-03 21:23:46,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:23:47,871 INFO L124 PetriNetUnfolderBase]: 1112/1778 cut-off events. [2024-06-03 21:23:47,872 INFO L125 PetriNetUnfolderBase]: For 3805/3805 co-relation queries the response was YES. [2024-06-03 21:23:47,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5609 conditions, 1778 events. 1112/1778 cut-off events. For 3805/3805 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 8655 event pairs, 448 based on Foata normal form. 4/1782 useless extension candidates. Maximal degree in co-relation 5588. Up to 1635 conditions per place. [2024-06-03 21:23:47,881 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 51 selfloop transitions, 11 changer transitions 0/68 dead transitions. [2024-06-03 21:23:47,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 68 transitions, 400 flow [2024-06-03 21:23:47,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 21:23:47,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 21:23:47,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 122 transitions. [2024-06-03 21:23:47,883 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48412698412698413 [2024-06-03 21:23:47,883 INFO L175 Difference]: Start difference. First operand has 52 places, 46 transitions, 206 flow. Second operand 6 states and 122 transitions. [2024-06-03 21:23:47,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 68 transitions, 400 flow [2024-06-03 21:23:47,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 68 transitions, 378 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-03 21:23:47,887 INFO L231 Difference]: Finished difference. Result has 55 places, 49 transitions, 240 flow [2024-06-03 21:23:47,887 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=240, PETRI_PLACES=55, PETRI_TRANSITIONS=49} [2024-06-03 21:23:47,888 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 12 predicate places. [2024-06-03 21:23:47,888 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 49 transitions, 240 flow [2024-06-03 21:23:47,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:23:47,888 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:23:47,888 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:23:47,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-03 21:23:47,889 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-03 21:23:47,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:23:47,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1658766392, now seen corresponding path program 2 times [2024-06-03 21:23:47,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:23:47,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368624090] [2024-06-03 21:23:47,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:23:47,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:23:47,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:23:56,424 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-03 21:23:56,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:23:56,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368624090] [2024-06-03 21:23:56,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368624090] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:23:56,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:23:56,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 21:23:56,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582259017] [2024-06-03 21:23:56,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:23:56,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 21:23:56,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:23:56,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 21:23:56,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-03 21:23:56,588 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-03 21:23:56,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 49 transitions, 240 flow. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:23:56,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:23:56,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-03 21:23:56,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:23:57,430 INFO L124 PetriNetUnfolderBase]: 1118/1803 cut-off events. [2024-06-03 21:23:57,430 INFO L125 PetriNetUnfolderBase]: For 5232/5240 co-relation queries the response was YES. [2024-06-03 21:23:57,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6113 conditions, 1803 events. 1118/1803 cut-off events. For 5232/5240 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 8907 event pairs, 449 based on Foata normal form. 12/1815 useless extension candidates. Maximal degree in co-relation 6091. Up to 1617 conditions per place. [2024-06-03 21:23:57,441 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 47 selfloop transitions, 16 changer transitions 0/69 dead transitions. [2024-06-03 21:23:57,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 69 transitions, 438 flow [2024-06-03 21:23:57,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 21:23:57,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 21:23:57,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 122 transitions. [2024-06-03 21:23:57,442 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48412698412698413 [2024-06-03 21:23:57,442 INFO L175 Difference]: Start difference. First operand has 55 places, 49 transitions, 240 flow. Second operand 6 states and 122 transitions. [2024-06-03 21:23:57,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 69 transitions, 438 flow [2024-06-03 21:23:57,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 69 transitions, 408 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-03 21:23:57,446 INFO L231 Difference]: Finished difference. Result has 57 places, 52 transitions, 282 flow [2024-06-03 21:23:57,446 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=210, 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=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=282, PETRI_PLACES=57, PETRI_TRANSITIONS=52} [2024-06-03 21:23:57,447 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 14 predicate places. [2024-06-03 21:23:57,447 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 52 transitions, 282 flow [2024-06-03 21:23:57,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:23:57,448 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:23:57,448 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:23:57,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-03 21:23:57,448 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 21:23:57,448 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:23:57,449 INFO L85 PathProgramCache]: Analyzing trace with hash 2071731012, now seen corresponding path program 1 times [2024-06-03 21:23:57,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:23:57,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112106943] [2024-06-03 21:23:57,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:23:57,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:23:57,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:24:06,083 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-03 21:24:06,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:24:06,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112106943] [2024-06-03 21:24:06,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112106943] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:24:06,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:24:06,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 21:24:06,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964425126] [2024-06-03 21:24:06,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:24:06,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 21:24:06,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:24:06,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 21:24:06,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-03 21:24:06,362 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-03 21:24:06,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 52 transitions, 282 flow. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:24:06,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:24:06,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-03 21:24:06,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:24:07,264 INFO L124 PetriNetUnfolderBase]: 1172/1961 cut-off events. [2024-06-03 21:24:07,264 INFO L125 PetriNetUnfolderBase]: For 6654/6654 co-relation queries the response was YES. [2024-06-03 21:24:07,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6842 conditions, 1961 events. 1172/1961 cut-off events. For 6654/6654 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 10107 event pairs, 444 based on Foata normal form. 2/1953 useless extension candidates. Maximal degree in co-relation 6819. Up to 1733 conditions per place. [2024-06-03 21:24:07,277 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 57 selfloop transitions, 14 changer transitions 0/77 dead transitions. [2024-06-03 21:24:07,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 77 transitions, 511 flow [2024-06-03 21:24:07,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 21:24:07,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 21:24:07,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 136 transitions. [2024-06-03 21:24:07,279 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46258503401360546 [2024-06-03 21:24:07,279 INFO L175 Difference]: Start difference. First operand has 57 places, 52 transitions, 282 flow. Second operand 7 states and 136 transitions. [2024-06-03 21:24:07,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 77 transitions, 511 flow [2024-06-03 21:24:07,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 77 transitions, 462 flow, removed 9 selfloop flow, removed 4 redundant places. [2024-06-03 21:24:07,284 INFO L231 Difference]: Finished difference. Result has 61 places, 58 transitions, 320 flow [2024-06-03 21:24:07,284 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=320, PETRI_PLACES=61, PETRI_TRANSITIONS=58} [2024-06-03 21:24:07,285 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 18 predicate places. [2024-06-03 21:24:07,285 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 58 transitions, 320 flow [2024-06-03 21:24:07,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:24:07,285 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:24:07,285 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:24:07,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-03 21:24:07,286 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-03 21:24:07,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:24:07,286 INFO L85 PathProgramCache]: Analyzing trace with hash -219378468, now seen corresponding path program 1 times [2024-06-03 21:24:07,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:24:07,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933292738] [2024-06-03 21:24:07,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:24:07,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:24:07,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:24:16,223 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-03 21:24:16,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:24:16,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933292738] [2024-06-03 21:24:16,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933292738] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:24:16,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:24:16,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 21:24:16,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705705380] [2024-06-03 21:24:16,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:24:16,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 21:24:16,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:24:16,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 21:24:16,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 21:24:16,393 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-03 21:24:16,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 58 transitions, 320 flow. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:24:16,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:24:16,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-03 21:24:16,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:24:17,398 INFO L124 PetriNetUnfolderBase]: 1289/2062 cut-off events. [2024-06-03 21:24:17,398 INFO L125 PetriNetUnfolderBase]: For 9268/9268 co-relation queries the response was YES. [2024-06-03 21:24:17,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7895 conditions, 2062 events. 1289/2062 cut-off events. For 9268/9268 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 10285 event pairs, 467 based on Foata normal form. 2/2059 useless extension candidates. Maximal degree in co-relation 7870. Up to 1883 conditions per place. [2024-06-03 21:24:17,410 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 65 selfloop transitions, 14 changer transitions 0/86 dead transitions. [2024-06-03 21:24:17,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 86 transitions, 576 flow [2024-06-03 21:24:17,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 21:24:17,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 21:24:17,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 142 transitions. [2024-06-03 21:24:17,411 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48299319727891155 [2024-06-03 21:24:17,411 INFO L175 Difference]: Start difference. First operand has 61 places, 58 transitions, 320 flow. Second operand 7 states and 142 transitions. [2024-06-03 21:24:17,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 86 transitions, 576 flow [2024-06-03 21:24:17,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 86 transitions, 536 flow, removed 9 selfloop flow, removed 4 redundant places. [2024-06-03 21:24:17,416 INFO L231 Difference]: Finished difference. Result has 64 places, 61 transitions, 356 flow [2024-06-03 21:24:17,416 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=356, PETRI_PLACES=64, PETRI_TRANSITIONS=61} [2024-06-03 21:24:17,417 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 21 predicate places. [2024-06-03 21:24:17,417 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 61 transitions, 356 flow [2024-06-03 21:24:17,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:24:17,417 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:24:17,417 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:24:17,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-03 21:24:17,418 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-03 21:24:17,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:24:17,418 INFO L85 PathProgramCache]: Analyzing trace with hash -200846528, now seen corresponding path program 1 times [2024-06-03 21:24:17,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:24:17,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888048067] [2024-06-03 21:24:17,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:24:17,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:24:17,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:24:27,528 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-03 21:24:27,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:24:27,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888048067] [2024-06-03 21:24:27,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888048067] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:24:27,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:24:27,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:24:27,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445682587] [2024-06-03 21:24:27,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:24:27,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:24:27,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:24:27,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:24:27,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:24:27,748 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-03 21:24:27,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 61 transitions, 356 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:24:27,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:24:27,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-03 21:24:27,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:24:28,647 INFO L124 PetriNetUnfolderBase]: 1154/1922 cut-off events. [2024-06-03 21:24:28,647 INFO L125 PetriNetUnfolderBase]: For 9892/9892 co-relation queries the response was YES. [2024-06-03 21:24:28,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7444 conditions, 1922 events. 1154/1922 cut-off events. For 9892/9892 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 9771 event pairs, 410 based on Foata normal form. 4/1912 useless extension candidates. Maximal degree in co-relation 7418. Up to 1689 conditions per place. [2024-06-03 21:24:28,659 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 65 selfloop transitions, 16 changer transitions 0/87 dead transitions. [2024-06-03 21:24:28,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 87 transitions, 606 flow [2024-06-03 21:24:28,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:24:28,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:24:28,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions. [2024-06-03 21:24:28,660 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2024-06-03 21:24:28,660 INFO L175 Difference]: Start difference. First operand has 64 places, 61 transitions, 356 flow. Second operand 8 states and 154 transitions. [2024-06-03 21:24:28,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 87 transitions, 606 flow [2024-06-03 21:24:28,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 87 transitions, 554 flow, removed 14 selfloop flow, removed 5 redundant places. [2024-06-03 21:24:28,665 INFO L231 Difference]: Finished difference. Result has 67 places, 63 transitions, 375 flow [2024-06-03 21:24:28,665 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=375, PETRI_PLACES=67, PETRI_TRANSITIONS=63} [2024-06-03 21:24:28,666 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 24 predicate places. [2024-06-03 21:24:28,666 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 63 transitions, 375 flow [2024-06-03 21:24:28,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:24:28,667 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:24:28,667 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:24:28,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-03 21:24:28,667 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 21:24:28,667 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:24:28,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1158459859, now seen corresponding path program 1 times [2024-06-03 21:24:28,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:24:28,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498142209] [2024-06-03 21:24:28,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:24:28,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:24:28,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:24:41,287 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-03 21:24:41,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:24:41,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498142209] [2024-06-03 21:24:41,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498142209] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:24:41,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:24:41,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 21:24:41,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120094361] [2024-06-03 21:24:41,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:24:41,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 21:24:41,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:24:41,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 21:24:41,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-03 21:24:41,402 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:24:41,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 63 transitions, 375 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-03 21:24:41,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:24:41,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:24:41,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:24:42,267 INFO L124 PetriNetUnfolderBase]: 1358/2139 cut-off events. [2024-06-03 21:24:42,267 INFO L125 PetriNetUnfolderBase]: For 13649/13649 co-relation queries the response was YES. [2024-06-03 21:24:42,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8764 conditions, 2139 events. 1358/2139 cut-off events. For 13649/13649 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 10371 event pairs, 514 based on Foata normal form. 1/2140 useless extension candidates. Maximal degree in co-relation 8737. Up to 2024 conditions per place. [2024-06-03 21:24:42,286 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 61 selfloop transitions, 8 changer transitions 0/74 dead transitions. [2024-06-03 21:24:42,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 74 transitions, 555 flow [2024-06-03 21:24:42,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 21:24:42,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 21:24:42,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2024-06-03 21:24:42,289 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4380952380952381 [2024-06-03 21:24:42,289 INFO L175 Difference]: Start difference. First operand has 67 places, 63 transitions, 375 flow. Second operand 5 states and 92 transitions. [2024-06-03 21:24:42,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 74 transitions, 555 flow [2024-06-03 21:24:42,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 74 transitions, 502 flow, removed 12 selfloop flow, removed 6 redundant places. [2024-06-03 21:24:42,298 INFO L231 Difference]: Finished difference. Result has 66 places, 66 transitions, 372 flow [2024-06-03 21:24:42,298 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=372, PETRI_PLACES=66, PETRI_TRANSITIONS=66} [2024-06-03 21:24:42,298 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 23 predicate places. [2024-06-03 21:24:42,299 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 66 transitions, 372 flow [2024-06-03 21:24:42,299 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-03 21:24:42,299 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:24:42,299 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:24:42,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-03 21:24:42,300 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-03 21:24:42,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:24:42,300 INFO L85 PathProgramCache]: Analyzing trace with hash -464458515, now seen corresponding path program 1 times [2024-06-03 21:24:42,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:24:42,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333843997] [2024-06-03 21:24:42,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:24:42,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:24:42,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:24:51,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:24:51,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:24:51,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333843997] [2024-06-03 21:24:51,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333843997] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:24:51,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:24:51,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:24:51,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043426286] [2024-06-03 21:24:51,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:24:51,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:24:51,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:24:51,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:24:51,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:24:51,305 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:24:51,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 66 transitions, 372 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-03 21:24:51,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:24:51,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:24:51,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:24:52,416 INFO L124 PetriNetUnfolderBase]: 1449/2244 cut-off events. [2024-06-03 21:24:52,416 INFO L125 PetriNetUnfolderBase]: For 18473/18473 co-relation queries the response was YES. [2024-06-03 21:24:52,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9839 conditions, 2244 events. 1449/2244 cut-off events. For 18473/18473 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 10776 event pairs, 514 based on Foata normal form. 2/2246 useless extension candidates. Maximal degree in co-relation 9811. Up to 2082 conditions per place. [2024-06-03 21:24:52,431 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 78 selfloop transitions, 17 changer transitions 0/101 dead transitions. [2024-06-03 21:24:52,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 101 transitions, 686 flow [2024-06-03 21:24:52,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:24:52,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:24:52,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2024-06-03 21:24:52,433 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44642857142857145 [2024-06-03 21:24:52,434 INFO L175 Difference]: Start difference. First operand has 66 places, 66 transitions, 372 flow. Second operand 8 states and 150 transitions. [2024-06-03 21:24:52,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 101 transitions, 686 flow [2024-06-03 21:24:52,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 101 transitions, 658 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-06-03 21:24:52,443 INFO L231 Difference]: Finished difference. Result has 73 places, 75 transitions, 464 flow [2024-06-03 21:24:52,443 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=464, PETRI_PLACES=73, PETRI_TRANSITIONS=75} [2024-06-03 21:24:52,443 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 30 predicate places. [2024-06-03 21:24:52,444 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 75 transitions, 464 flow [2024-06-03 21:24:52,444 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-03 21:24:52,444 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:24:52,444 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:24:52,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-03 21:24:52,445 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-03 21:24:52,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:24:52,445 INFO L85 PathProgramCache]: Analyzing trace with hash -265156725, now seen corresponding path program 2 times [2024-06-03 21:24:52,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:24:52,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431093849] [2024-06-03 21:24:52,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:24:52,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:24:52,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:25:01,525 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-03 21:25:01,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:25:01,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431093849] [2024-06-03 21:25:01,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431093849] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:25:01,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:25:01,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:25:01,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945984045] [2024-06-03 21:25:01,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:25:01,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:25:01,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:25:01,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:25:01,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:25:01,795 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:25:01,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 75 transitions, 464 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-03 21:25:01,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:25:01,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:25:01,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:25:02,844 INFO L124 PetriNetUnfolderBase]: 1493/2315 cut-off events. [2024-06-03 21:25:02,844 INFO L125 PetriNetUnfolderBase]: For 22028/22036 co-relation queries the response was YES. [2024-06-03 21:25:02,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10789 conditions, 2315 events. 1493/2315 cut-off events. For 22028/22036 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 11202 event pairs, 516 based on Foata normal form. 12/2327 useless extension candidates. Maximal degree in co-relation 10758. Up to 2037 conditions per place. [2024-06-03 21:25:02,858 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 74 selfloop transitions, 29 changer transitions 0/109 dead transitions. [2024-06-03 21:25:02,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 109 transitions, 812 flow [2024-06-03 21:25:02,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:25:02,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:25:02,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions. [2024-06-03 21:25:02,862 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46130952380952384 [2024-06-03 21:25:02,862 INFO L175 Difference]: Start difference. First operand has 73 places, 75 transitions, 464 flow. Second operand 8 states and 155 transitions. [2024-06-03 21:25:02,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 109 transitions, 812 flow [2024-06-03 21:25:02,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 109 transitions, 768 flow, removed 17 selfloop flow, removed 3 redundant places. [2024-06-03 21:25:02,875 INFO L231 Difference]: Finished difference. Result has 79 places, 83 transitions, 569 flow [2024-06-03 21:25:02,875 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=569, PETRI_PLACES=79, PETRI_TRANSITIONS=83} [2024-06-03 21:25:02,876 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 36 predicate places. [2024-06-03 21:25:02,876 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 83 transitions, 569 flow [2024-06-03 21:25:02,877 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-03 21:25:02,877 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:25:02,877 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:25:02,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-03 21:25:02,877 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 21:25:02,878 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:25:02,878 INFO L85 PathProgramCache]: Analyzing trace with hash -257805075, now seen corresponding path program 3 times [2024-06-03 21:25:02,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:25:02,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537489666] [2024-06-03 21:25:02,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:25:02,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:25:02,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:25:12,190 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-03 21:25:12,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:25:12,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537489666] [2024-06-03 21:25:12,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537489666] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:25:12,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:25:12,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:25:12,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929523272] [2024-06-03 21:25:12,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:25:12,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:25:12,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:25:12,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:25:12,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:25:12,388 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:25:12,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 83 transitions, 569 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-03 21:25:12,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:25:12,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:25:12,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:25:13,515 INFO L124 PetriNetUnfolderBase]: 1515/2347 cut-off events. [2024-06-03 21:25:13,515 INFO L125 PetriNetUnfolderBase]: For 26593/26601 co-relation queries the response was YES. [2024-06-03 21:25:13,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11843 conditions, 2347 events. 1515/2347 cut-off events. For 26593/26601 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 11298 event pairs, 516 based on Foata normal form. 12/2359 useless extension candidates. Maximal degree in co-relation 11809. Up to 2069 conditions per place. [2024-06-03 21:25:13,531 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 77 selfloop transitions, 35 changer transitions 0/118 dead transitions. [2024-06-03 21:25:13,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 118 transitions, 969 flow [2024-06-03 21:25:13,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:25:13,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:25:13,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions. [2024-06-03 21:25:13,535 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2024-06-03 21:25:13,535 INFO L175 Difference]: Start difference. First operand has 79 places, 83 transitions, 569 flow. Second operand 8 states and 154 transitions. [2024-06-03 21:25:13,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 118 transitions, 969 flow [2024-06-03 21:25:13,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 118 transitions, 864 flow, removed 23 selfloop flow, removed 5 redundant places. [2024-06-03 21:25:13,551 INFO L231 Difference]: Finished difference. Result has 83 places, 92 transitions, 659 flow [2024-06-03 21:25:13,551 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=659, PETRI_PLACES=83, PETRI_TRANSITIONS=92} [2024-06-03 21:25:13,553 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 40 predicate places. [2024-06-03 21:25:13,553 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 92 transitions, 659 flow [2024-06-03 21:25:13,553 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-03 21:25:13,553 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:25:13,553 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:25:13,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-03 21:25:13,554 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-03 21:25:13,554 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:25:13,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1931283421, now seen corresponding path program 4 times [2024-06-03 21:25:13,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:25:13,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249433008] [2024-06-03 21:25:13,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:25:13,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:25:13,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:25:23,096 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-03 21:25:23,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:25:23,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249433008] [2024-06-03 21:25:23,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249433008] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:25:23,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:25:23,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:25:23,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128643990] [2024-06-03 21:25:23,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:25:23,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:25:23,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:25:23,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:25:23,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:25:23,222 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:25:23,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 92 transitions, 659 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-03 21:25:23,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:25:23,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:25:23,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:25:24,360 INFO L124 PetriNetUnfolderBase]: 1526/2363 cut-off events. [2024-06-03 21:25:24,360 INFO L125 PetriNetUnfolderBase]: For 30958/30966 co-relation queries the response was YES. [2024-06-03 21:25:24,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12645 conditions, 2363 events. 1526/2363 cut-off events. For 30958/30966 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 11397 event pairs, 516 based on Foata normal form. 10/2373 useless extension candidates. Maximal degree in co-relation 12609. Up to 2029 conditions per place. [2024-06-03 21:25:24,373 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 73 selfloop transitions, 51 changer transitions 0/130 dead transitions. [2024-06-03 21:25:24,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 130 transitions, 1163 flow [2024-06-03 21:25:24,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:25:24,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:25:24,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 175 transitions. [2024-06-03 21:25:24,376 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46296296296296297 [2024-06-03 21:25:24,376 INFO L175 Difference]: Start difference. First operand has 83 places, 92 transitions, 659 flow. Second operand 9 states and 175 transitions. [2024-06-03 21:25:24,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 130 transitions, 1163 flow [2024-06-03 21:25:24,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 130 transitions, 1079 flow, removed 25 selfloop flow, removed 3 redundant places. [2024-06-03 21:25:24,388 INFO L231 Difference]: Finished difference. Result has 90 places, 98 transitions, 815 flow [2024-06-03 21:25:24,388 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=575, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=815, PETRI_PLACES=90, PETRI_TRANSITIONS=98} [2024-06-03 21:25:24,389 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 47 predicate places. [2024-06-03 21:25:24,389 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 98 transitions, 815 flow [2024-06-03 21:25:24,389 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-03 21:25:24,389 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:25:24,389 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:25:24,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-03 21:25:24,390 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 21:25:24,390 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:25:24,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1552515957, now seen corresponding path program 1 times [2024-06-03 21:25:24,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:25:24,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422885809] [2024-06-03 21:25:24,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:25:24,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:25:24,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:25:36,955 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-03 21:25:36,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:25:36,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422885809] [2024-06-03 21:25:36,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422885809] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:25:36,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:25:36,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 21:25:36,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707562517] [2024-06-03 21:25:36,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:25:36,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 21:25:36,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:25:36,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 21:25:36,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-03 21:25:37,077 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:25:37,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 98 transitions, 815 flow. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:25:37,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:25:37,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:25:37,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:25:38,080 INFO L124 PetriNetUnfolderBase]: 1440/2263 cut-off events. [2024-06-03 21:25:38,080 INFO L125 PetriNetUnfolderBase]: For 29330/29330 co-relation queries the response was YES. [2024-06-03 21:25:38,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12231 conditions, 2263 events. 1440/2263 cut-off events. For 29330/29330 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 10968 event pairs, 479 based on Foata normal form. 2/2265 useless extension candidates. Maximal degree in co-relation 12193. Up to 2138 conditions per place. [2024-06-03 21:25:38,093 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 95 selfloop transitions, 11 changer transitions 0/111 dead transitions. [2024-06-03 21:25:38,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 111 transitions, 1077 flow [2024-06-03 21:25:38,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 21:25:38,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 21:25:38,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions. [2024-06-03 21:25:38,097 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4246031746031746 [2024-06-03 21:25:38,097 INFO L175 Difference]: Start difference. First operand has 90 places, 98 transitions, 815 flow. Second operand 6 states and 107 transitions. [2024-06-03 21:25:38,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 111 transitions, 1077 flow [2024-06-03 21:25:38,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 111 transitions, 1002 flow, removed 18 selfloop flow, removed 5 redundant places. [2024-06-03 21:25:38,119 INFO L231 Difference]: Finished difference. Result has 91 places, 101 transitions, 800 flow [2024-06-03 21:25:38,119 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=740, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=800, PETRI_PLACES=91, PETRI_TRANSITIONS=101} [2024-06-03 21:25:38,120 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 48 predicate places. [2024-06-03 21:25:38,120 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 101 transitions, 800 flow [2024-06-03 21:25:38,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:25:38,120 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:25:38,120 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:25:38,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-03 21:25:38,121 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-03 21:25:38,121 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:25:38,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1480550565, now seen corresponding path program 1 times [2024-06-03 21:25:38,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:25:38,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537060798] [2024-06-03 21:25:38,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:25:38,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:25:38,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:25:47,300 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-03 21:25:47,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:25:47,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537060798] [2024-06-03 21:25:47,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537060798] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:25:47,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:25:47,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:25:47,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986731898] [2024-06-03 21:25:47,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:25:47,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:25:47,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:25:47,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:25:47,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:25:47,446 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-03 21:25:47,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 101 transitions, 800 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:25:47,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:25:47,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-03 21:25:47,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:25:48,685 INFO L124 PetriNetUnfolderBase]: 1473/2308 cut-off events. [2024-06-03 21:25:48,685 INFO L125 PetriNetUnfolderBase]: For 36737/36737 co-relation queries the response was YES. [2024-06-03 21:25:48,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13470 conditions, 2308 events. 1473/2308 cut-off events. For 36737/36737 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 11563 event pairs, 327 based on Foata normal form. 4/2306 useless extension candidates. Maximal degree in co-relation 13430. Up to 2073 conditions per place. [2024-06-03 21:25:48,698 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 108 selfloop transitions, 15 changer transitions 0/134 dead transitions. [2024-06-03 21:25:48,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 134 transitions, 1164 flow [2024-06-03 21:25:48,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:25:48,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:25:48,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 160 transitions. [2024-06-03 21:25:48,701 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2024-06-03 21:25:48,701 INFO L175 Difference]: Start difference. First operand has 91 places, 101 transitions, 800 flow. Second operand 8 states and 160 transitions. [2024-06-03 21:25:48,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 134 transitions, 1164 flow [2024-06-03 21:25:48,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 134 transitions, 1126 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-06-03 21:25:48,717 INFO L231 Difference]: Finished difference. Result has 95 places, 103 transitions, 843 flow [2024-06-03 21:25:48,717 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=762, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=843, PETRI_PLACES=95, PETRI_TRANSITIONS=103} [2024-06-03 21:25:48,717 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 52 predicate places. [2024-06-03 21:25:48,718 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 103 transitions, 843 flow [2024-06-03 21:25:48,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:25:48,718 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:25:48,718 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:25:48,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-03 21:25:48,718 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-03 21:25:48,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:25:48,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1480611015, now seen corresponding path program 2 times [2024-06-03 21:25:48,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:25:48,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824321573] [2024-06-03 21:25:48,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:25:48,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:25:48,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:25:57,539 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-03 21:25:57,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:25:57,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824321573] [2024-06-03 21:25:57,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824321573] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:25:57,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:25:57,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:25:57,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242138829] [2024-06-03 21:25:57,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:25:57,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:25:57,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:25:57,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:25:57,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:25:57,763 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-03 21:25:57,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 103 transitions, 843 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:25:57,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:25:57,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-03 21:25:57,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:25:58,978 INFO L124 PetriNetUnfolderBase]: 1465/2309 cut-off events. [2024-06-03 21:25:58,978 INFO L125 PetriNetUnfolderBase]: For 40484/40484 co-relation queries the response was YES. [2024-06-03 21:25:58,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13765 conditions, 2309 events. 1465/2309 cut-off events. For 40484/40484 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 11659 event pairs, 424 based on Foata normal form. 4/2306 useless extension candidates. Maximal degree in co-relation 13724. Up to 2087 conditions per place. [2024-06-03 21:25:58,991 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 108 selfloop transitions, 16 changer transitions 0/135 dead transitions. [2024-06-03 21:25:58,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 135 transitions, 1211 flow [2024-06-03 21:25:58,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:25:58,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:25:58,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 160 transitions. [2024-06-03 21:25:58,994 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2024-06-03 21:25:58,994 INFO L175 Difference]: Start difference. First operand has 95 places, 103 transitions, 843 flow. Second operand 8 states and 160 transitions. [2024-06-03 21:25:58,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 135 transitions, 1211 flow [2024-06-03 21:25:59,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 135 transitions, 1148 flow, removed 18 selfloop flow, removed 6 redundant places. [2024-06-03 21:25:59,015 INFO L231 Difference]: Finished difference. Result has 97 places, 105 transitions, 867 flow [2024-06-03 21:25:59,015 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=780, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=867, PETRI_PLACES=97, PETRI_TRANSITIONS=105} [2024-06-03 21:25:59,015 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 54 predicate places. [2024-06-03 21:25:59,016 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 105 transitions, 867 flow [2024-06-03 21:25:59,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:25:59,016 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:25:59,016 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:25:59,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-03 21:25:59,016 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-03 21:25:59,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:25:59,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1483412485, now seen corresponding path program 1 times [2024-06-03 21:25:59,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:25:59,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929670024] [2024-06-03 21:25:59,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:25:59,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:25:59,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:26:08,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:26:08,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:26:08,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929670024] [2024-06-03 21:26:08,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929670024] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:26:08,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:26:08,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:26:08,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46773884] [2024-06-03 21:26:08,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:26:08,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:26:08,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:26:08,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:26:08,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:26:08,728 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:26:08,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 105 transitions, 867 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:26:08,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:26:08,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:26:08,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:26:09,931 INFO L124 PetriNetUnfolderBase]: 1604/2491 cut-off events. [2024-06-03 21:26:09,931 INFO L125 PetriNetUnfolderBase]: For 46706/46706 co-relation queries the response was YES. [2024-06-03 21:26:09,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14812 conditions, 2491 events. 1604/2491 cut-off events. For 46706/46706 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 12208 event pairs, 444 based on Foata normal form. 2/2493 useless extension candidates. Maximal degree in co-relation 14770. Up to 2299 conditions per place. [2024-06-03 21:26:09,946 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 118 selfloop transitions, 20 changer transitions 0/144 dead transitions. [2024-06-03 21:26:09,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 144 transitions, 1308 flow [2024-06-03 21:26:09,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:26:09,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:26:09,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions. [2024-06-03 21:26:09,949 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4497354497354497 [2024-06-03 21:26:09,949 INFO L175 Difference]: Start difference. First operand has 97 places, 105 transitions, 867 flow. Second operand 9 states and 170 transitions. [2024-06-03 21:26:09,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 144 transitions, 1308 flow [2024-06-03 21:26:09,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 144 transitions, 1236 flow, removed 20 selfloop flow, removed 6 redundant places. [2024-06-03 21:26:09,967 INFO L231 Difference]: Finished difference. Result has 101 places, 111 transitions, 936 flow [2024-06-03 21:26:09,967 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=798, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=936, PETRI_PLACES=101, PETRI_TRANSITIONS=111} [2024-06-03 21:26:09,968 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 58 predicate places. [2024-06-03 21:26:09,968 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 111 transitions, 936 flow [2024-06-03 21:26:09,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:26:09,968 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:26:09,968 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:26:09,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-03 21:26:09,968 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 21:26:09,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:26:09,969 INFO L85 PathProgramCache]: Analyzing trace with hash -253976707, now seen corresponding path program 3 times [2024-06-03 21:26:09,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:26:09,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848273830] [2024-06-03 21:26:09,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:26:09,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:26:10,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:26:17,996 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-03 21:26:17,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:26:17,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848273830] [2024-06-03 21:26:17,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848273830] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:26:17,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:26:17,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:26:17,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008842353] [2024-06-03 21:26:17,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:26:17,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:26:17,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:26:17,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:26:17,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:26:18,166 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:26:18,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 111 transitions, 936 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-03 21:26:18,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:26:18,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:26:18,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:26:19,445 INFO L124 PetriNetUnfolderBase]: 1531/2428 cut-off events. [2024-06-03 21:26:19,445 INFO L125 PetriNetUnfolderBase]: For 53102/53102 co-relation queries the response was YES. [2024-06-03 21:26:19,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15163 conditions, 2428 events. 1531/2428 cut-off events. For 53102/53102 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 12356 event pairs, 397 based on Foata normal form. 8/2436 useless extension candidates. Maximal degree in co-relation 15119. Up to 2168 conditions per place. [2024-06-03 21:26:19,461 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 108 selfloop transitions, 20 changer transitions 0/140 dead transitions. [2024-06-03 21:26:19,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 140 transitions, 1310 flow [2024-06-03 21:26:19,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:26:19,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:26:19,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-06-03 21:26:19,465 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44345238095238093 [2024-06-03 21:26:19,465 INFO L175 Difference]: Start difference. First operand has 101 places, 111 transitions, 936 flow. Second operand 8 states and 149 transitions. [2024-06-03 21:26:19,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 140 transitions, 1310 flow [2024-06-03 21:26:19,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 140 transitions, 1216 flow, removed 30 selfloop flow, removed 6 redundant places. [2024-06-03 21:26:19,491 INFO L231 Difference]: Finished difference. Result has 103 places, 113 transitions, 944 flow [2024-06-03 21:26:19,491 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=842, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=944, PETRI_PLACES=103, PETRI_TRANSITIONS=113} [2024-06-03 21:26:19,492 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 60 predicate places. [2024-06-03 21:26:19,492 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 113 transitions, 944 flow [2024-06-03 21:26:19,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:26:19,493 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:26:19,494 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:26:19,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-03 21:26:19,494 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-03 21:26:19,495 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:26:19,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1598703655, now seen corresponding path program 2 times [2024-06-03 21:26:19,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:26:19,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144968077] [2024-06-03 21:26:19,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:26:19,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:26:19,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:26:28,917 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-03 21:26:28,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:26:28,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144968077] [2024-06-03 21:26:28,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144968077] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:26:28,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:26:28,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:26:28,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144055474] [2024-06-03 21:26:28,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:26:28,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:26:28,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:26:28,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:26:28,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:26:29,282 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:26:29,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 113 transitions, 944 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:26:29,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:26:29,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:26:29,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:26:30,637 INFO L124 PetriNetUnfolderBase]: 1660/2582 cut-off events. [2024-06-03 21:26:30,637 INFO L125 PetriNetUnfolderBase]: For 57690/57690 co-relation queries the response was YES. [2024-06-03 21:26:30,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16095 conditions, 2582 events. 1660/2582 cut-off events. For 57690/57690 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 12765 event pairs, 439 based on Foata normal form. 2/2584 useless extension candidates. Maximal degree in co-relation 16050. Up to 2373 conditions per place. [2024-06-03 21:26:30,650 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 118 selfloop transitions, 25 changer transitions 0/149 dead transitions. [2024-06-03 21:26:30,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 149 transitions, 1397 flow [2024-06-03 21:26:30,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:26:30,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:26:30,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions. [2024-06-03 21:26:30,651 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4470899470899471 [2024-06-03 21:26:30,651 INFO L175 Difference]: Start difference. First operand has 103 places, 113 transitions, 944 flow. Second operand 9 states and 169 transitions. [2024-06-03 21:26:30,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 149 transitions, 1397 flow [2024-06-03 21:26:30,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 149 transitions, 1294 flow, removed 28 selfloop flow, removed 7 redundant places. [2024-06-03 21:26:30,675 INFO L231 Difference]: Finished difference. Result has 105 places, 119 transitions, 996 flow [2024-06-03 21:26:30,675 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=850, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=996, PETRI_PLACES=105, PETRI_TRANSITIONS=119} [2024-06-03 21:26:30,675 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 62 predicate places. [2024-06-03 21:26:30,675 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 119 transitions, 996 flow [2024-06-03 21:26:30,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:26:30,675 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:26:30,676 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:26:30,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-03 21:26:30,676 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-03 21:26:30,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:26:30,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1598876635, now seen corresponding path program 3 times [2024-06-03 21:26:30,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:26:30,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614646572] [2024-06-03 21:26:30,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:26:30,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:26:30,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:26:40,519 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-03 21:26:40,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:26:40,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614646572] [2024-06-03 21:26:40,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614646572] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:26:40,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:26:40,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:26:40,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455301369] [2024-06-03 21:26:40,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:26:40,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:26:40,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:26:40,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:26:40,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:26:40,673 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:26:40,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 119 transitions, 996 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:26:40,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:26:40,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:26:40,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:26:41,831 INFO L124 PetriNetUnfolderBase]: 1655/2575 cut-off events. [2024-06-03 21:26:41,831 INFO L125 PetriNetUnfolderBase]: For 60047/60047 co-relation queries the response was YES. [2024-06-03 21:26:41,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16025 conditions, 2575 events. 1655/2575 cut-off events. For 60047/60047 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 12734 event pairs, 439 based on Foata normal form. 2/2577 useless extension candidates. Maximal degree in co-relation 15980. Up to 2366 conditions per place. [2024-06-03 21:26:41,847 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 118 selfloop transitions, 25 changer transitions 0/149 dead transitions. [2024-06-03 21:26:41,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 149 transitions, 1358 flow [2024-06-03 21:26:41,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:26:41,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:26:41,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions. [2024-06-03 21:26:41,850 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4470899470899471 [2024-06-03 21:26:41,850 INFO L175 Difference]: Start difference. First operand has 105 places, 119 transitions, 996 flow. Second operand 9 states and 169 transitions. [2024-06-03 21:26:41,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 149 transitions, 1358 flow [2024-06-03 21:26:41,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 149 transitions, 1222 flow, removed 42 selfloop flow, removed 8 redundant places. [2024-06-03 21:26:41,880 INFO L231 Difference]: Finished difference. Result has 106 places, 119 transitions, 918 flow [2024-06-03 21:26:41,880 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=860, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=918, PETRI_PLACES=106, PETRI_TRANSITIONS=119} [2024-06-03 21:26:41,881 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 63 predicate places. [2024-06-03 21:26:41,881 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 119 transitions, 918 flow [2024-06-03 21:26:41,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:26:41,881 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:26:41,881 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:26:41,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-03 21:26:41,882 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-03 21:26:41,882 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:26:41,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1598883393, now seen corresponding path program 1 times [2024-06-03 21:26:41,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:26:41,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44597825] [2024-06-03 21:26:41,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:26:41,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:26:41,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:26:50,940 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-03 21:26:50,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:26:50,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44597825] [2024-06-03 21:26:50,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44597825] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:26:50,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:26:50,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:26:50,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413253658] [2024-06-03 21:26:50,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:26:50,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:26:50,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:26:50,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:26:50,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:26:51,220 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:26:51,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 119 transitions, 918 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:26:51,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:26:51,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:26:51,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:26:52,536 INFO L124 PetriNetUnfolderBase]: 1678/2608 cut-off events. [2024-06-03 21:26:52,536 INFO L125 PetriNetUnfolderBase]: For 65317/65317 co-relation queries the response was YES. [2024-06-03 21:26:52,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16316 conditions, 2608 events. 1678/2608 cut-off events. For 65317/65317 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 12916 event pairs, 436 based on Foata normal form. 4/2609 useless extension candidates. Maximal degree in co-relation 16272. Up to 2410 conditions per place. [2024-06-03 21:26:52,552 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 127 selfloop transitions, 19 changer transitions 0/152 dead transitions. [2024-06-03 21:26:52,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 152 transitions, 1338 flow [2024-06-03 21:26:52,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:26:52,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:26:52,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 167 transitions. [2024-06-03 21:26:52,554 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4417989417989418 [2024-06-03 21:26:52,554 INFO L175 Difference]: Start difference. First operand has 106 places, 119 transitions, 918 flow. Second operand 9 states and 167 transitions. [2024-06-03 21:26:52,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 152 transitions, 1338 flow [2024-06-03 21:26:52,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 152 transitions, 1243 flow, removed 10 selfloop flow, removed 7 redundant places. [2024-06-03 21:26:52,577 INFO L231 Difference]: Finished difference. Result has 108 places, 121 transitions, 922 flow [2024-06-03 21:26:52,577 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=823, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=922, PETRI_PLACES=108, PETRI_TRANSITIONS=121} [2024-06-03 21:26:52,578 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 65 predicate places. [2024-06-03 21:26:52,578 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 121 transitions, 922 flow [2024-06-03 21:26:52,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:26:52,578 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:26:52,578 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:26:52,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-03 21:26:52,578 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-03 21:26:52,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:26:52,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1598883145, now seen corresponding path program 4 times [2024-06-03 21:26:52,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:26:52,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864997188] [2024-06-03 21:26:52,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:26:52,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:26:52,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:27:01,689 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-03 21:27:01,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:27:01,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864997188] [2024-06-03 21:27:01,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864997188] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:27:01,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:27:01,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:27:01,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257223990] [2024-06-03 21:27:01,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:27:01,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:27:01,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:27:01,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:27:01,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:27:01,922 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:27:01,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 121 transitions, 922 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:27:01,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:27:01,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:27:01,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:27:03,141 INFO L124 PetriNetUnfolderBase]: 1686/2621 cut-off events. [2024-06-03 21:27:03,141 INFO L125 PetriNetUnfolderBase]: For 70361/70361 co-relation queries the response was YES. [2024-06-03 21:27:03,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16721 conditions, 2621 events. 1686/2621 cut-off events. For 70361/70361 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 12994 event pairs, 438 based on Foata normal form. 2/2623 useless extension candidates. Maximal degree in co-relation 16676. Up to 2343 conditions per place. [2024-06-03 21:27:03,157 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 104 selfloop transitions, 44 changer transitions 0/154 dead transitions. [2024-06-03 21:27:03,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 154 transitions, 1366 flow [2024-06-03 21:27:03,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:27:03,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:27:03,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions. [2024-06-03 21:27:03,159 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2024-06-03 21:27:03,159 INFO L175 Difference]: Start difference. First operand has 108 places, 121 transitions, 922 flow. Second operand 9 states and 171 transitions. [2024-06-03 21:27:03,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 154 transitions, 1366 flow [2024-06-03 21:27:03,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 154 transitions, 1285 flow, removed 23 selfloop flow, removed 7 redundant places. [2024-06-03 21:27:03,183 INFO L231 Difference]: Finished difference. Result has 110 places, 124 transitions, 1015 flow [2024-06-03 21:27:03,183 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=841, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1015, PETRI_PLACES=110, PETRI_TRANSITIONS=124} [2024-06-03 21:27:03,184 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 67 predicate places. [2024-06-03 21:27:03,184 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 124 transitions, 1015 flow [2024-06-03 21:27:03,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:27:03,184 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:27:03,184 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:27:03,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-03 21:27:03,185 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 21:27:03,185 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:27:03,185 INFO L85 PathProgramCache]: Analyzing trace with hash 2125713512, now seen corresponding path program 1 times [2024-06-03 21:27:03,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:27:03,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162915690] [2024-06-03 21:27:03,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:27:03,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:27:03,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:27:17,150 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-03 21:27:17,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:27:17,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162915690] [2024-06-03 21:27:17,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162915690] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:27:17,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:27:17,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 21:27:17,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46170464] [2024-06-03 21:27:17,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:27:17,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 21:27:17,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:27:17,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 21:27:17,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-03 21:27:17,231 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-03 21:27:17,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 124 transitions, 1015 flow. Second operand has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:27:17,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:27:17,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-03 21:27:17,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:27:18,451 INFO L124 PetriNetUnfolderBase]: 1812/2753 cut-off events. [2024-06-03 21:27:18,451 INFO L125 PetriNetUnfolderBase]: For 77519/77519 co-relation queries the response was YES. [2024-06-03 21:27:18,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17964 conditions, 2753 events. 1812/2753 cut-off events. For 77519/77519 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 13214 event pairs, 480 based on Foata normal form. 2/2755 useless extension candidates. Maximal degree in co-relation 17918. Up to 2650 conditions per place. [2024-06-03 21:27:18,470 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 127 selfloop transitions, 19 changer transitions 0/150 dead transitions. [2024-06-03 21:27:18,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 150 transitions, 1503 flow [2024-06-03 21:27:18,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:27:18,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:27:18,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 137 transitions. [2024-06-03 21:27:18,471 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40773809523809523 [2024-06-03 21:27:18,471 INFO L175 Difference]: Start difference. First operand has 110 places, 124 transitions, 1015 flow. Second operand 8 states and 137 transitions. [2024-06-03 21:27:18,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 150 transitions, 1503 flow [2024-06-03 21:27:18,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 150 transitions, 1353 flow, removed 33 selfloop flow, removed 7 redundant places. [2024-06-03 21:27:18,508 INFO L231 Difference]: Finished difference. Result has 111 places, 130 transitions, 992 flow [2024-06-03 21:27:18,508 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=865, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=992, PETRI_PLACES=111, PETRI_TRANSITIONS=130} [2024-06-03 21:27:18,508 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 68 predicate places. [2024-06-03 21:27:18,508 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 130 transitions, 992 flow [2024-06-03 21:27:18,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:27:18,509 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:27:18,509 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:27:18,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-03 21:27:18,509 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 21:27:18,509 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:27:18,509 INFO L85 PathProgramCache]: Analyzing trace with hash 23397575, now seen corresponding path program 4 times [2024-06-03 21:27:18,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:27:18,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401961924] [2024-06-03 21:27:18,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:27:18,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:27:18,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:27:27,283 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-03 21:27:27,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:27:27,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401961924] [2024-06-03 21:27:27,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401961924] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:27:27,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:27:27,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:27:27,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240020138] [2024-06-03 21:27:27,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:27:27,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:27:27,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:27:27,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:27:27,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:27:27,471 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-03 21:27:27,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 130 transitions, 992 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:27:27,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:27:27,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-03 21:27:27,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:27:28,593 INFO L124 PetriNetUnfolderBase]: 1589/2519 cut-off events. [2024-06-03 21:27:28,593 INFO L125 PetriNetUnfolderBase]: For 82514/82534 co-relation queries the response was YES. [2024-06-03 21:27:28,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16946 conditions, 2519 events. 1589/2519 cut-off events. For 82514/82534 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 12912 event pairs, 398 based on Foata normal form. 14/2533 useless extension candidates. Maximal degree in co-relation 16899. Up to 2189 conditions per place. [2024-06-03 21:27:28,612 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 109 selfloop transitions, 39 changer transitions 0/162 dead transitions. [2024-06-03 21:27:28,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 162 transitions, 1463 flow [2024-06-03 21:27:28,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:27:28,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:27:28,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 157 transitions. [2024-06-03 21:27:28,615 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46726190476190477 [2024-06-03 21:27:28,615 INFO L175 Difference]: Start difference. First operand has 111 places, 130 transitions, 992 flow. Second operand 8 states and 157 transitions. [2024-06-03 21:27:28,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 162 transitions, 1463 flow [2024-06-03 21:27:28,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 162 transitions, 1419 flow, removed 14 selfloop flow, removed 4 redundant places. [2024-06-03 21:27:28,648 INFO L231 Difference]: Finished difference. Result has 116 places, 138 transitions, 1164 flow [2024-06-03 21:27:28,648 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=948, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1164, PETRI_PLACES=116, PETRI_TRANSITIONS=138} [2024-06-03 21:27:28,649 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 73 predicate places. [2024-06-03 21:27:28,649 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 138 transitions, 1164 flow [2024-06-03 21:27:28,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:27:28,649 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:27:28,649 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:27:28,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-03 21:27:28,650 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-03 21:27:28,650 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:27:28,650 INFO L85 PathProgramCache]: Analyzing trace with hash 23582273, now seen corresponding path program 2 times [2024-06-03 21:27:28,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:27:28,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97181116] [2024-06-03 21:27:28,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:27:28,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:27:28,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:27:38,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:27:38,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:27:38,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97181116] [2024-06-03 21:27:38,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97181116] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:27:38,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:27:38,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:27:38,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751884391] [2024-06-03 21:27:38,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:27:38,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:27:38,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:27:38,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:27:38,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:27:38,385 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:27:38,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 138 transitions, 1164 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:27:38,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:27:38,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:27:38,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:27:39,550 INFO L124 PetriNetUnfolderBase]: 1709/2659 cut-off events. [2024-06-03 21:27:39,551 INFO L125 PetriNetUnfolderBase]: For 89062/89068 co-relation queries the response was YES. [2024-06-03 21:27:39,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18128 conditions, 2659 events. 1709/2659 cut-off events. For 89062/89068 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 13248 event pairs, 435 based on Foata normal form. 10/2669 useless extension candidates. Maximal degree in co-relation 18078. Up to 2403 conditions per place. [2024-06-03 21:27:39,568 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 134 selfloop transitions, 30 changer transitions 0/172 dead transitions. [2024-06-03 21:27:39,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 172 transitions, 1658 flow [2024-06-03 21:27:39,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:27:39,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:27:39,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 168 transitions. [2024-06-03 21:27:39,570 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-06-03 21:27:39,570 INFO L175 Difference]: Start difference. First operand has 116 places, 138 transitions, 1164 flow. Second operand 9 states and 168 transitions. [2024-06-03 21:27:39,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 172 transitions, 1658 flow [2024-06-03 21:27:39,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 172 transitions, 1512 flow, removed 45 selfloop flow, removed 4 redundant places. [2024-06-03 21:27:39,612 INFO L231 Difference]: Finished difference. Result has 123 places, 144 transitions, 1202 flow [2024-06-03 21:27:39,612 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1030, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1202, PETRI_PLACES=123, PETRI_TRANSITIONS=144} [2024-06-03 21:27:39,612 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 80 predicate places. [2024-06-03 21:27:39,612 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 144 transitions, 1202 flow [2024-06-03 21:27:39,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:27:39,613 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:27:39,613 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:27:39,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-03 21:27:39,613 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-03 21:27:39,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:27:39,613 INFO L85 PathProgramCache]: Analyzing trace with hash 370077409, now seen corresponding path program 5 times [2024-06-03 21:27:39,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:27:39,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583285834] [2024-06-03 21:27:39,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:27:39,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:27:39,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:27:48,692 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-03 21:27:48,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:27:48,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583285834] [2024-06-03 21:27:48,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583285834] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:27:48,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:27:48,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:27:48,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932604370] [2024-06-03 21:27:48,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:27:48,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:27:48,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:27:48,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:27:48,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:27:48,855 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:27:48,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 144 transitions, 1202 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:27:48,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:27:48,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:27:48,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:27:50,134 INFO L124 PetriNetUnfolderBase]: 1720/2672 cut-off events. [2024-06-03 21:27:50,134 INFO L125 PetriNetUnfolderBase]: For 93022/93022 co-relation queries the response was YES. [2024-06-03 21:27:50,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18365 conditions, 2672 events. 1720/2672 cut-off events. For 93022/93022 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 13295 event pairs, 442 based on Foata normal form. 2/2673 useless extension candidates. Maximal degree in co-relation 18312. Up to 2327 conditions per place. [2024-06-03 21:27:50,152 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 112 selfloop transitions, 54 changer transitions 0/174 dead transitions. [2024-06-03 21:27:50,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 174 transitions, 1686 flow [2024-06-03 21:27:50,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:27:50,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:27:50,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 173 transitions. [2024-06-03 21:27:50,154 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4576719576719577 [2024-06-03 21:27:50,154 INFO L175 Difference]: Start difference. First operand has 123 places, 144 transitions, 1202 flow. Second operand 9 states and 173 transitions. [2024-06-03 21:27:50,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 174 transitions, 1686 flow [2024-06-03 21:27:50,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 174 transitions, 1579 flow, removed 28 selfloop flow, removed 5 redundant places. [2024-06-03 21:27:50,206 INFO L231 Difference]: Finished difference. Result has 127 places, 147 transitions, 1301 flow [2024-06-03 21:27:50,206 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1095, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1301, PETRI_PLACES=127, PETRI_TRANSITIONS=147} [2024-06-03 21:27:50,207 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 84 predicate places. [2024-06-03 21:27:50,207 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 147 transitions, 1301 flow [2024-06-03 21:27:50,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:27:50,207 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:27:50,207 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:27:50,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-03 21:27:50,208 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-03 21:27:50,208 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:27:50,208 INFO L85 PathProgramCache]: Analyzing trace with hash 259757385, now seen corresponding path program 6 times [2024-06-03 21:27:50,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:27:50,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042178705] [2024-06-03 21:27:50,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:27:50,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:27:50,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:27:59,847 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-03 21:27:59,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:27:59,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042178705] [2024-06-03 21:27:59,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042178705] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:27:59,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:27:59,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:27:59,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390700139] [2024-06-03 21:27:59,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:27:59,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:27:59,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:27:59,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:27:59,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:28:00,144 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:28:00,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 147 transitions, 1301 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:28:00,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:28:00,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:28:00,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:28:01,412 INFO L124 PetriNetUnfolderBase]: 1731/2698 cut-off events. [2024-06-03 21:28:01,412 INFO L125 PetriNetUnfolderBase]: For 101046/101046 co-relation queries the response was YES. [2024-06-03 21:28:01,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18958 conditions, 2698 events. 1731/2698 cut-off events. For 101046/101046 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 13512 event pairs, 442 based on Foata normal form. 2/2699 useless extension candidates. Maximal degree in co-relation 18904. Up to 2242 conditions per place. [2024-06-03 21:28:01,430 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 91 selfloop transitions, 84 changer transitions 0/183 dead transitions. [2024-06-03 21:28:01,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 183 transitions, 2015 flow [2024-06-03 21:28:01,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:28:01,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:28:01,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 174 transitions. [2024-06-03 21:28:01,433 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4603174603174603 [2024-06-03 21:28:01,433 INFO L175 Difference]: Start difference. First operand has 127 places, 147 transitions, 1301 flow. Second operand 9 states and 174 transitions. [2024-06-03 21:28:01,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 183 transitions, 2015 flow [2024-06-03 21:28:01,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 183 transitions, 1833 flow, removed 39 selfloop flow, removed 7 redundant places. [2024-06-03 21:28:01,486 INFO L231 Difference]: Finished difference. Result has 129 places, 153 transitions, 1481 flow [2024-06-03 21:28:01,486 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1119, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1481, PETRI_PLACES=129, PETRI_TRANSITIONS=153} [2024-06-03 21:28:01,487 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 86 predicate places. [2024-06-03 21:28:01,487 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 153 transitions, 1481 flow [2024-06-03 21:28:01,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:28:01,488 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:28:01,488 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:28:01,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-03 21:28:01,488 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-03 21:28:01,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:28:01,489 INFO L85 PathProgramCache]: Analyzing trace with hash 259757633, now seen corresponding path program 3 times [2024-06-03 21:28:01,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:28:01,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557081709] [2024-06-03 21:28:01,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:28:01,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:28:01,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:28:11,109 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-03 21:28:11,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:28:11,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557081709] [2024-06-03 21:28:11,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557081709] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:28:11,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:28:11,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:28:11,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241028456] [2024-06-03 21:28:11,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:28:11,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:28:11,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:28:11,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:28:11,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:28:11,385 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:28:11,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 153 transitions, 1481 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:28:11,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:28:11,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:28:11,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:28:12,619 INFO L124 PetriNetUnfolderBase]: 1748/2728 cut-off events. [2024-06-03 21:28:12,619 INFO L125 PetriNetUnfolderBase]: For 110026/110030 co-relation queries the response was YES. [2024-06-03 21:28:12,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19655 conditions, 2728 events. 1748/2728 cut-off events. For 110026/110030 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 13769 event pairs, 440 based on Foata normal form. 8/2736 useless extension candidates. Maximal degree in co-relation 19600. Up to 2331 conditions per place. [2024-06-03 21:28:12,638 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 110 selfloop transitions, 66 changer transitions 0/184 dead transitions. [2024-06-03 21:28:12,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 184 transitions, 1977 flow [2024-06-03 21:28:12,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:28:12,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:28:12,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions. [2024-06-03 21:28:12,641 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2024-06-03 21:28:12,641 INFO L175 Difference]: Start difference. First operand has 129 places, 153 transitions, 1481 flow. Second operand 9 states and 171 transitions. [2024-06-03 21:28:12,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 184 transitions, 1977 flow [2024-06-03 21:28:12,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 184 transitions, 1810 flow, removed 50 selfloop flow, removed 5 redundant places. [2024-06-03 21:28:12,698 INFO L231 Difference]: Finished difference. Result has 133 places, 155 transitions, 1525 flow [2024-06-03 21:28:12,698 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1316, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1525, PETRI_PLACES=133, PETRI_TRANSITIONS=155} [2024-06-03 21:28:12,698 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 90 predicate places. [2024-06-03 21:28:12,698 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 155 transitions, 1525 flow [2024-06-03 21:28:12,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:28:12,699 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:28:12,699 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:28:12,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-03 21:28:12,699 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-03 21:28:12,699 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:28:12,699 INFO L85 PathProgramCache]: Analyzing trace with hash 251483175, now seen corresponding path program 7 times [2024-06-03 21:28:12,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:28:12,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788203500] [2024-06-03 21:28:12,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:28:12,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:28:12,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:28:21,997 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-03 21:28:21,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:28:21,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788203500] [2024-06-03 21:28:21,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788203500] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:28:21,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:28:21,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:28:21,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847159490] [2024-06-03 21:28:21,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:28:21,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:28:21,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:28:21,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:28:21,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:28:22,258 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:28:22,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 155 transitions, 1525 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:28:22,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:28:22,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:28:22,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:28:23,613 INFO L124 PetriNetUnfolderBase]: 1743/2713 cut-off events. [2024-06-03 21:28:23,613 INFO L125 PetriNetUnfolderBase]: For 112182/112182 co-relation queries the response was YES. [2024-06-03 21:28:23,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19668 conditions, 2713 events. 1743/2713 cut-off events. For 112182/112182 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 13595 event pairs, 442 based on Foata normal form. 2/2714 useless extension candidates. Maximal degree in co-relation 19611. Up to 2363 conditions per place. [2024-06-03 21:28:23,631 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 120 selfloop transitions, 55 changer transitions 0/183 dead transitions. [2024-06-03 21:28:23,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 183 transitions, 1949 flow [2024-06-03 21:28:23,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:28:23,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:28:23,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions. [2024-06-03 21:28:23,633 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.455026455026455 [2024-06-03 21:28:23,634 INFO L175 Difference]: Start difference. First operand has 133 places, 155 transitions, 1525 flow. Second operand 9 states and 172 transitions. [2024-06-03 21:28:23,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 183 transitions, 1949 flow [2024-06-03 21:28:23,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 183 transitions, 1720 flow, removed 50 selfloop flow, removed 7 redundant places. [2024-06-03 21:28:23,715 INFO L231 Difference]: Finished difference. Result has 135 places, 155 transitions, 1414 flow [2024-06-03 21:28:23,715 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1296, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1414, PETRI_PLACES=135, PETRI_TRANSITIONS=155} [2024-06-03 21:28:23,716 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 92 predicate places. [2024-06-03 21:28:23,716 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 155 transitions, 1414 flow [2024-06-03 21:28:23,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:28:23,716 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:28:23,716 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:28:23,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-03 21:28:23,716 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 21:28:23,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:28:23,717 INFO L85 PathProgramCache]: Analyzing trace with hash 597978807, now seen corresponding path program 4 times [2024-06-03 21:28:23,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:28:23,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602712272] [2024-06-03 21:28:23,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:28:23,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:28:23,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:28:33,109 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-03 21:28:33,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:28:33,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602712272] [2024-06-03 21:28:33,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602712272] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:28:33,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:28:33,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:28:33,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141928243] [2024-06-03 21:28:33,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:28:33,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:28:33,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:28:33,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:28:33,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:28:33,327 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:28:33,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 155 transitions, 1414 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:28:33,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:28:33,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:28:33,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:28:34,603 INFO L124 PetriNetUnfolderBase]: 1760/2743 cut-off events. [2024-06-03 21:28:34,603 INFO L125 PetriNetUnfolderBase]: For 118301/118305 co-relation queries the response was YES. [2024-06-03 21:28:34,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19857 conditions, 2743 events. 1760/2743 cut-off events. For 118301/118305 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 13794 event pairs, 440 based on Foata normal form. 8/2751 useless extension candidates. Maximal degree in co-relation 19799. Up to 2482 conditions per place. [2024-06-03 21:28:34,622 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 148 selfloop transitions, 32 changer transitions 0/188 dead transitions. [2024-06-03 21:28:34,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 188 transitions, 1940 flow [2024-06-03 21:28:34,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:28:34,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:28:34,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 167 transitions. [2024-06-03 21:28:34,625 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4417989417989418 [2024-06-03 21:28:34,625 INFO L175 Difference]: Start difference. First operand has 135 places, 155 transitions, 1414 flow. Second operand 9 states and 167 transitions. [2024-06-03 21:28:34,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 188 transitions, 1940 flow [2024-06-03 21:28:34,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 188 transitions, 1671 flow, removed 22 selfloop flow, removed 10 redundant places. [2024-06-03 21:28:34,687 INFO L231 Difference]: Finished difference. Result has 135 places, 160 transitions, 1324 flow [2024-06-03 21:28:34,687 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1324, PETRI_PLACES=135, PETRI_TRANSITIONS=160} [2024-06-03 21:28:34,687 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 92 predicate places. [2024-06-03 21:28:34,688 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 160 transitions, 1324 flow [2024-06-03 21:28:34,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:28:34,688 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:28:34,688 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:28:34,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-03 21:28:34,688 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 21:28:34,689 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:28:34,689 INFO L85 PathProgramCache]: Analyzing trace with hash 606549687, now seen corresponding path program 5 times [2024-06-03 21:28:34,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:28:34,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284400149] [2024-06-03 21:28:34,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:28:34,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:28:34,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:28:44,996 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-03 21:28:44,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:28:44,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284400149] [2024-06-03 21:28:44,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284400149] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:28:44,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:28:44,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:28:44,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206296718] [2024-06-03 21:28:44,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:28:44,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:28:44,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:28:44,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:28:44,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:28:45,187 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:28:45,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 160 transitions, 1324 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:28:45,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:28:45,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:28:45,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:28:46,586 INFO L124 PetriNetUnfolderBase]: 1872/2932 cut-off events. [2024-06-03 21:28:46,586 INFO L125 PetriNetUnfolderBase]: For 135168/135172 co-relation queries the response was YES. [2024-06-03 21:28:46,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21338 conditions, 2932 events. 1872/2932 cut-off events. For 135168/135172 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 15033 event pairs, 437 based on Foata normal form. 8/2940 useless extension candidates. Maximal degree in co-relation 21280. Up to 2216 conditions per place. [2024-06-03 21:28:46,604 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 113 selfloop transitions, 80 changer transitions 0/201 dead transitions. [2024-06-03 21:28:46,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 201 transitions, 2094 flow [2024-06-03 21:28:46,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:28:46,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:28:46,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 178 transitions. [2024-06-03 21:28:46,607 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4708994708994709 [2024-06-03 21:28:46,607 INFO L175 Difference]: Start difference. First operand has 135 places, 160 transitions, 1324 flow. Second operand 9 states and 178 transitions. [2024-06-03 21:28:46,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 201 transitions, 2094 flow [2024-06-03 21:28:46,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 201 transitions, 1985 flow, removed 33 selfloop flow, removed 4 redundant places. [2024-06-03 21:28:46,668 INFO L231 Difference]: Finished difference. Result has 141 places, 165 transitions, 1554 flow [2024-06-03 21:28:46,669 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1215, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1554, PETRI_PLACES=141, PETRI_TRANSITIONS=165} [2024-06-03 21:28:46,669 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 98 predicate places. [2024-06-03 21:28:46,669 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 165 transitions, 1554 flow [2024-06-03 21:28:46,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:28:46,670 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:28:46,670 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:28:46,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-03 21:28:46,670 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-03 21:28:46,670 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:28:46,671 INFO L85 PathProgramCache]: Analyzing trace with hash -883366964, now seen corresponding path program 2 times [2024-06-03 21:28:46,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:28:46,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720742682] [2024-06-03 21:28:46,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:28:46,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:28:46,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:29:00,545 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-03 21:29:00,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:29:00,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720742682] [2024-06-03 21:29:00,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720742682] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:29:00,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:29:00,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 21:29:00,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537511317] [2024-06-03 21:29:00,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:29:00,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 21:29:00,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:29:00,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 21:29:00,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-03 21:29:00,698 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-03 21:29:00,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 165 transitions, 1554 flow. Second operand has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:29:00,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:29:00,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-03 21:29:00,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:29:01,819 INFO L124 PetriNetUnfolderBase]: 1970/3020 cut-off events. [2024-06-03 21:29:01,819 INFO L125 PetriNetUnfolderBase]: For 140947/140947 co-relation queries the response was YES. [2024-06-03 21:29:01,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22389 conditions, 3020 events. 1970/3020 cut-off events. For 140947/140947 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 15053 event pairs, 518 based on Foata normal form. 2/3021 useless extension candidates. Maximal degree in co-relation 22329. Up to 2911 conditions per place. [2024-06-03 21:29:01,840 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 154 selfloop transitions, 18 changer transitions 0/176 dead transitions. [2024-06-03 21:29:01,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 176 transitions, 1968 flow [2024-06-03 21:29:01,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 21:29:01,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 21:29:01,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions. [2024-06-03 21:29:01,841 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42063492063492064 [2024-06-03 21:29:01,841 INFO L175 Difference]: Start difference. First operand has 141 places, 165 transitions, 1554 flow. Second operand 6 states and 106 transitions. [2024-06-03 21:29:01,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 176 transitions, 1968 flow [2024-06-03 21:29:01,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 176 transitions, 1793 flow, removed 47 selfloop flow, removed 5 redundant places. [2024-06-03 21:29:01,909 INFO L231 Difference]: Finished difference. Result has 142 places, 165 transitions, 1421 flow [2024-06-03 21:29:01,909 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1379, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1421, PETRI_PLACES=142, PETRI_TRANSITIONS=165} [2024-06-03 21:29:01,909 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 99 predicate places. [2024-06-03 21:29:01,910 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 165 transitions, 1421 flow [2024-06-03 21:29:01,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:29:01,910 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:29:01,910 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:29:01,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-03 21:29:01,910 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 21:29:01,910 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:29:01,910 INFO L85 PathProgramCache]: Analyzing trace with hash 26969480, now seen corresponding path program 1 times [2024-06-03 21:29:01,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:29:01,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829053977] [2024-06-03 21:29:01,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:29:01,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:29:01,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:29:12,164 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-03 21:29:12,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:29:12,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829053977] [2024-06-03 21:29:12,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829053977] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:29:12,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:29:12,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 21:29:12,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392631821] [2024-06-03 21:29:12,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:29:12,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 21:29:12,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:29:12,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 21:29:12,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-03 21:29:12,358 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:29:12,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 165 transitions, 1421 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-03 21:29:12,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:29:12,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:29:12,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:29:13,409 INFO L124 PetriNetUnfolderBase]: 1771/2803 cut-off events. [2024-06-03 21:29:13,409 INFO L125 PetriNetUnfolderBase]: For 123457/123457 co-relation queries the response was YES. [2024-06-03 21:29:13,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20009 conditions, 2803 events. 1771/2803 cut-off events. For 123457/123457 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 14396 event pairs, 434 based on Foata normal form. 1/2804 useless extension candidates. Maximal degree in co-relation 19947. Up to 2653 conditions per place. [2024-06-03 21:29:13,431 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 163 selfloop transitions, 17 changer transitions 0/185 dead transitions. [2024-06-03 21:29:13,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 185 transitions, 1939 flow [2024-06-03 21:29:13,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 21:29:13,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 21:29:13,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions. [2024-06-03 21:29:13,432 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42517006802721086 [2024-06-03 21:29:13,432 INFO L175 Difference]: Start difference. First operand has 142 places, 165 transitions, 1421 flow. Second operand 7 states and 125 transitions. [2024-06-03 21:29:13,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 185 transitions, 1939 flow [2024-06-03 21:29:13,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 185 transitions, 1903 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-06-03 21:29:13,492 INFO L231 Difference]: Finished difference. Result has 144 places, 171 transitions, 1487 flow [2024-06-03 21:29:13,492 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1385, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1487, PETRI_PLACES=144, PETRI_TRANSITIONS=171} [2024-06-03 21:29:13,492 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 101 predicate places. [2024-06-03 21:29:13,492 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 171 transitions, 1487 flow [2024-06-03 21:29:13,492 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-03 21:29:13,492 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:29:13,493 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:29:13,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-03 21:29:13,493 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 21:29:13,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:29:13,493 INFO L85 PathProgramCache]: Analyzing trace with hash 2137147304, now seen corresponding path program 2 times [2024-06-03 21:29:13,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:29:13,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350153985] [2024-06-03 21:29:13,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:29:13,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:29:13,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:29:23,281 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-03 21:29:23,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:29:23,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350153985] [2024-06-03 21:29:23,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350153985] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:29:23,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:29:23,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 21:29:23,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791872157] [2024-06-03 21:29:23,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:29:23,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 21:29:23,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:29:23,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 21:29:23,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-03 21:29:23,387 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:29:23,387 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 171 transitions, 1487 flow. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:29:23,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:29:23,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:29:23,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:29:24,422 INFO L124 PetriNetUnfolderBase]: 1768/2799 cut-off events. [2024-06-03 21:29:24,422 INFO L125 PetriNetUnfolderBase]: For 129025/129025 co-relation queries the response was YES. [2024-06-03 21:29:24,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20381 conditions, 2799 events. 1768/2799 cut-off events. For 129025/129025 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 14359 event pairs, 434 based on Foata normal form. 1/2800 useless extension candidates. Maximal degree in co-relation 20318. Up to 2662 conditions per place. [2024-06-03 21:29:24,443 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 164 selfloop transitions, 11 changer transitions 0/180 dead transitions. [2024-06-03 21:29:24,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 180 transitions, 1859 flow [2024-06-03 21:29:24,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 21:29:24,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 21:29:24,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions. [2024-06-03 21:29:24,444 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42063492063492064 [2024-06-03 21:29:24,444 INFO L175 Difference]: Start difference. First operand has 144 places, 171 transitions, 1487 flow. Second operand 6 states and 106 transitions. [2024-06-03 21:29:24,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 180 transitions, 1859 flow [2024-06-03 21:29:24,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 180 transitions, 1809 flow, removed 20 selfloop flow, removed 3 redundant places. [2024-06-03 21:29:24,508 INFO L231 Difference]: Finished difference. Result has 147 places, 171 transitions, 1465 flow [2024-06-03 21:29:24,508 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1437, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1465, PETRI_PLACES=147, PETRI_TRANSITIONS=171} [2024-06-03 21:29:24,509 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 104 predicate places. [2024-06-03 21:29:24,509 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 171 transitions, 1465 flow [2024-06-03 21:29:24,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:29:24,509 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:29:24,509 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:29:24,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-03 21:29:24,510 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-03 21:29:24,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:29:24,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1258851681, now seen corresponding path program 1 times [2024-06-03 21:29:24,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:29:24,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496377168] [2024-06-03 21:29:24,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:29:24,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:29:24,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:29:34,674 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-03 21:29:34,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:29:34,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496377168] [2024-06-03 21:29:34,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496377168] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:29:34,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:29:34,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:29:34,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510659631] [2024-06-03 21:29:34,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:29:34,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:29:34,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:29:34,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:29:34,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:29:34,961 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:29:34,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 171 transitions, 1465 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:29:34,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:29:34,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:29:34,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:29:36,600 INFO L124 PetriNetUnfolderBase]: 1913/2983 cut-off events. [2024-06-03 21:29:36,600 INFO L125 PetriNetUnfolderBase]: For 164518/164518 co-relation queries the response was YES. [2024-06-03 21:29:36,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22903 conditions, 2983 events. 1913/2983 cut-off events. For 164518/164518 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 15283 event pairs, 471 based on Foata normal form. 8/2986 useless extension candidates. Maximal degree in co-relation 22838. Up to 2739 conditions per place. [2024-06-03 21:29:36,623 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 180 selfloop transitions, 23 changer transitions 0/213 dead transitions. [2024-06-03 21:29:36,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 213 transitions, 2065 flow [2024-06-03 21:29:36,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:29:36,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:29:36,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 189 transitions. [2024-06-03 21:29:36,626 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45 [2024-06-03 21:29:36,627 INFO L175 Difference]: Start difference. First operand has 147 places, 171 transitions, 1465 flow. Second operand 10 states and 189 transitions. [2024-06-03 21:29:36,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 213 transitions, 2065 flow [2024-06-03 21:29:36,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 213 transitions, 2035 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-06-03 21:29:36,719 INFO L231 Difference]: Finished difference. Result has 152 places, 174 transitions, 1592 flow [2024-06-03 21:29:36,719 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1435, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1592, PETRI_PLACES=152, PETRI_TRANSITIONS=174} [2024-06-03 21:29:36,720 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 109 predicate places. [2024-06-03 21:29:36,720 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 174 transitions, 1592 flow [2024-06-03 21:29:36,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:29:36,720 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:29:36,720 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:29:36,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-03 21:29:36,720 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-03 21:29:36,721 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:29:36,721 INFO L85 PathProgramCache]: Analyzing trace with hash 499690963, now seen corresponding path program 2 times [2024-06-03 21:29:36,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:29:36,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664506269] [2024-06-03 21:29:36,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:29:36,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:29:36,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:29:48,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:29:48,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:29:48,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664506269] [2024-06-03 21:29:48,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664506269] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:29:48,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:29:48,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:29:48,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393623715] [2024-06-03 21:29:48,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:29:48,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:29:48,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:29:48,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:29:48,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:29:48,466 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:29:48,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 174 transitions, 1592 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:29:48,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:29:48,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:29:48,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:29:50,019 INFO L124 PetriNetUnfolderBase]: 1988/3110 cut-off events. [2024-06-03 21:29:50,020 INFO L125 PetriNetUnfolderBase]: For 182443/182443 co-relation queries the response was YES. [2024-06-03 21:29:50,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24415 conditions, 3110 events. 1988/3110 cut-off events. For 182443/182443 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 16182 event pairs, 483 based on Foata normal form. 16/3126 useless extension candidates. Maximal degree in co-relation 24349. Up to 2768 conditions per place. [2024-06-03 21:29:50,042 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 178 selfloop transitions, 27 changer transitions 0/215 dead transitions. [2024-06-03 21:29:50,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 215 transitions, 2204 flow [2024-06-03 21:29:50,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:29:50,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:29:50,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 189 transitions. [2024-06-03 21:29:50,046 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45 [2024-06-03 21:29:50,046 INFO L175 Difference]: Start difference. First operand has 152 places, 174 transitions, 1592 flow. Second operand 10 states and 189 transitions. [2024-06-03 21:29:50,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 215 transitions, 2204 flow [2024-06-03 21:29:50,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 215 transitions, 2073 flow, removed 45 selfloop flow, removed 8 redundant places. [2024-06-03 21:29:50,143 INFO L231 Difference]: Finished difference. Result has 154 places, 176 transitions, 1590 flow [2024-06-03 21:29:50,143 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1461, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1590, PETRI_PLACES=154, PETRI_TRANSITIONS=176} [2024-06-03 21:29:50,143 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 111 predicate places. [2024-06-03 21:29:50,143 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 176 transitions, 1590 flow [2024-06-03 21:29:50,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:29:50,143 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:29:50,144 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:29:50,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-03 21:29:50,144 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-03 21:29:50,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:29:50,144 INFO L85 PathProgramCache]: Analyzing trace with hash 505053343, now seen corresponding path program 3 times [2024-06-03 21:29:50,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:29:50,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925129911] [2024-06-03 21:29:50,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:29:50,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:29:50,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:29:59,282 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-03 21:29:59,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:29:59,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925129911] [2024-06-03 21:29:59,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925129911] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:29:59,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:29:59,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:29:59,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315104367] [2024-06-03 21:29:59,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:29:59,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:29:59,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:29:59,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:29:59,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:29:59,539 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:29:59,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 176 transitions, 1590 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:29:59,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:29:59,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:29:59,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:30:01,138 INFO L124 PetriNetUnfolderBase]: 2046/3208 cut-off events. [2024-06-03 21:30:01,138 INFO L125 PetriNetUnfolderBase]: For 195941/195941 co-relation queries the response was YES. [2024-06-03 21:30:01,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25159 conditions, 3208 events. 2046/3208 cut-off events. For 195941/195941 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 16834 event pairs, 498 based on Foata normal form. 16/3224 useless extension candidates. Maximal degree in co-relation 25092. Up to 2894 conditions per place. [2024-06-03 21:30:01,163 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 179 selfloop transitions, 26 changer transitions 0/215 dead transitions. [2024-06-03 21:30:01,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 215 transitions, 2193 flow [2024-06-03 21:30:01,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:30:01,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:30:01,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 188 transitions. [2024-06-03 21:30:01,166 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44761904761904764 [2024-06-03 21:30:01,166 INFO L175 Difference]: Start difference. First operand has 154 places, 176 transitions, 1590 flow. Second operand 10 states and 188 transitions. [2024-06-03 21:30:01,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 215 transitions, 2193 flow [2024-06-03 21:30:01,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 215 transitions, 2120 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-06-03 21:30:01,265 INFO L231 Difference]: Finished difference. Result has 156 places, 177 transitions, 1635 flow [2024-06-03 21:30:01,266 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1517, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1635, PETRI_PLACES=156, PETRI_TRANSITIONS=177} [2024-06-03 21:30:01,266 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 113 predicate places. [2024-06-03 21:30:01,266 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 177 transitions, 1635 flow [2024-06-03 21:30:01,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:30:01,267 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:30:01,267 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:30:01,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-03 21:30:01,267 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 21:30:01,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:30:01,267 INFO L85 PathProgramCache]: Analyzing trace with hash 505255153, now seen corresponding path program 4 times [2024-06-03 21:30:01,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:30:01,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473756537] [2024-06-03 21:30:01,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:30:01,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:30:01,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:30:10,015 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-03 21:30:10,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:30:10,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473756537] [2024-06-03 21:30:10,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473756537] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:30:10,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:30:10,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:30:10,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279983266] [2024-06-03 21:30:10,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:30:10,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:30:10,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:30:10,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:30:10,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:30:10,284 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:30:10,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 177 transitions, 1635 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:30:10,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:30:10,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:30:10,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:30:11,908 INFO L124 PetriNetUnfolderBase]: 2104/3316 cut-off events. [2024-06-03 21:30:11,908 INFO L125 PetriNetUnfolderBase]: For 207238/207238 co-relation queries the response was YES. [2024-06-03 21:30:11,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26088 conditions, 3316 events. 2104/3316 cut-off events. For 207238/207238 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 17768 event pairs, 518 based on Foata normal form. 16/3332 useless extension candidates. Maximal degree in co-relation 26020. Up to 2923 conditions per place. [2024-06-03 21:30:11,932 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 161 selfloop transitions, 45 changer transitions 0/216 dead transitions. [2024-06-03 21:30:11,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 216 transitions, 2239 flow [2024-06-03 21:30:11,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:30:11,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:30:11,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 190 transitions. [2024-06-03 21:30:11,935 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2024-06-03 21:30:11,935 INFO L175 Difference]: Start difference. First operand has 156 places, 177 transitions, 1635 flow. Second operand 10 states and 190 transitions. [2024-06-03 21:30:11,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 216 transitions, 2239 flow [2024-06-03 21:30:12,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 216 transitions, 2162 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-06-03 21:30:12,055 INFO L231 Difference]: Finished difference. Result has 158 places, 178 transitions, 1713 flow [2024-06-03 21:30:12,056 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1558, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1713, PETRI_PLACES=158, PETRI_TRANSITIONS=178} [2024-06-03 21:30:12,056 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 115 predicate places. [2024-06-03 21:30:12,056 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 178 transitions, 1713 flow [2024-06-03 21:30:12,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:30:12,057 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:30:12,057 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:30:12,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-03 21:30:12,057 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-03 21:30:12,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:30:12,057 INFO L85 PathProgramCache]: Analyzing trace with hash 722383605, now seen corresponding path program 5 times [2024-06-03 21:30:12,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:30:12,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336689817] [2024-06-03 21:30:12,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:30:12,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:30:12,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:30:20,662 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-03 21:30:20,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:30:20,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336689817] [2024-06-03 21:30:20,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336689817] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:30:20,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:30:20,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:30:20,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940402053] [2024-06-03 21:30:20,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:30:20,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:30:20,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:30:20,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:30:20,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:30:20,926 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:30:20,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 178 transitions, 1713 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:30:20,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:30:20,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:30:20,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:30:22,419 INFO L124 PetriNetUnfolderBase]: 2189/3461 cut-off events. [2024-06-03 21:30:22,420 INFO L125 PetriNetUnfolderBase]: For 215080/215080 co-relation queries the response was YES. [2024-06-03 21:30:22,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27293 conditions, 3461 events. 2189/3461 cut-off events. For 215080/215080 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 18783 event pairs, 516 based on Foata normal form. 12/3470 useless extension candidates. Maximal degree in co-relation 27224. Up to 2841 conditions per place. [2024-06-03 21:30:22,448 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 173 selfloop transitions, 38 changer transitions 0/221 dead transitions. [2024-06-03 21:30:22,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 221 transitions, 2392 flow [2024-06-03 21:30:22,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:30:22,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:30:22,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 191 transitions. [2024-06-03 21:30:22,451 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45476190476190476 [2024-06-03 21:30:22,451 INFO L175 Difference]: Start difference. First operand has 158 places, 178 transitions, 1713 flow. Second operand 10 states and 191 transitions. [2024-06-03 21:30:22,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 221 transitions, 2392 flow [2024-06-03 21:30:22,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 221 transitions, 2277 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-06-03 21:30:22,647 INFO L231 Difference]: Finished difference. Result has 161 places, 180 transitions, 1787 flow [2024-06-03 21:30:22,647 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1598, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1787, PETRI_PLACES=161, PETRI_TRANSITIONS=180} [2024-06-03 21:30:22,647 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 118 predicate places. [2024-06-03 21:30:22,647 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 180 transitions, 1787 flow [2024-06-03 21:30:22,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:30:22,648 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:30:22,648 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:30:22,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-03 21:30:22,648 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 21:30:22,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:30:22,648 INFO L85 PathProgramCache]: Analyzing trace with hash -664478682, now seen corresponding path program 1 times [2024-06-03 21:30:22,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:30:22,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604164059] [2024-06-03 21:30:22,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:30:22,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:30:22,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:30:38,330 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-03 21:30:38,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:30:38,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604164059] [2024-06-03 21:30:38,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604164059] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:30:38,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:30:38,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:30:38,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743229852] [2024-06-03 21:30:38,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:30:38,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:30:38,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:30:38,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:30:38,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:30:38,494 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-03 21:30:38,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 180 transitions, 1787 flow. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:30:38,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:30:38,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-03 21:30:38,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:30:39,949 INFO L124 PetriNetUnfolderBase]: 2289/3565 cut-off events. [2024-06-03 21:30:39,949 INFO L125 PetriNetUnfolderBase]: For 214505/214505 co-relation queries the response was YES. [2024-06-03 21:30:39,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28055 conditions, 3565 events. 2289/3565 cut-off events. For 214505/214505 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 18989 event pairs, 572 based on Foata normal form. 2/3567 useless extension candidates. Maximal degree in co-relation 27984. Up to 3421 conditions per place. [2024-06-03 21:30:39,977 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 181 selfloop transitions, 26 changer transitions 0/211 dead transitions. [2024-06-03 21:30:39,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 211 transitions, 2499 flow [2024-06-03 21:30:39,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:30:39,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:30:39,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 153 transitions. [2024-06-03 21:30:39,978 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40476190476190477 [2024-06-03 21:30:39,978 INFO L175 Difference]: Start difference. First operand has 161 places, 180 transitions, 1787 flow. Second operand 9 states and 153 transitions. [2024-06-03 21:30:39,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 211 transitions, 2499 flow [2024-06-03 21:30:40,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 211 transitions, 2401 flow, removed 18 selfloop flow, removed 7 redundant places. [2024-06-03 21:30:40,157 INFO L231 Difference]: Finished difference. Result has 164 places, 189 transitions, 1861 flow [2024-06-03 21:30:40,157 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1689, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1861, PETRI_PLACES=164, PETRI_TRANSITIONS=189} [2024-06-03 21:30:40,157 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 121 predicate places. [2024-06-03 21:30:40,157 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 189 transitions, 1861 flow [2024-06-03 21:30:40,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:30:40,158 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:30:40,158 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:30:40,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-03 21:30:40,158 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-03 21:30:40,159 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:30:40,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1903153217, now seen corresponding path program 6 times [2024-06-03 21:30:40,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:30:40,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868309778] [2024-06-03 21:30:40,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:30:40,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:30:40,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:30:48,825 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-03 21:30:48,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:30:48,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868309778] [2024-06-03 21:30:48,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868309778] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:30:48,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:30:48,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:30:48,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679346430] [2024-06-03 21:30:48,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:30:48,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:30:48,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:30:48,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:30:48,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:30:49,197 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:30:49,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 189 transitions, 1861 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:30:49,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:30:49,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:30:49,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:30:50,952 INFO L124 PetriNetUnfolderBase]: 2276/3611 cut-off events. [2024-06-03 21:30:50,952 INFO L125 PetriNetUnfolderBase]: For 235875/235879 co-relation queries the response was YES. [2024-06-03 21:30:50,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28759 conditions, 3611 events. 2276/3611 cut-off events. For 235875/235879 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 19902 event pairs, 554 based on Foata normal form. 20/3631 useless extension candidates. Maximal degree in co-relation 28686. Up to 3197 conditions per place. [2024-06-03 21:30:50,980 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 174 selfloop transitions, 47 changer transitions 0/231 dead transitions. [2024-06-03 21:30:50,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 231 transitions, 2540 flow [2024-06-03 21:30:50,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:30:50,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:30:50,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 189 transitions. [2024-06-03 21:30:50,986 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45 [2024-06-03 21:30:50,986 INFO L175 Difference]: Start difference. First operand has 164 places, 189 transitions, 1861 flow. Second operand 10 states and 189 transitions. [2024-06-03 21:30:50,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 231 transitions, 2540 flow [2024-06-03 21:30:51,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 231 transitions, 2489 flow, removed 17 selfloop flow, removed 4 redundant places. [2024-06-03 21:30:51,158 INFO L231 Difference]: Finished difference. Result has 171 places, 196 transitions, 2030 flow [2024-06-03 21:30:51,158 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1810, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2030, PETRI_PLACES=171, PETRI_TRANSITIONS=196} [2024-06-03 21:30:51,159 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 128 predicate places. [2024-06-03 21:30:51,159 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 196 transitions, 2030 flow [2024-06-03 21:30:51,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:30:51,160 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:30:51,160 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:30:51,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-03 21:30:51,160 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-03 21:30:51,161 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:30:51,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1908717407, now seen corresponding path program 7 times [2024-06-03 21:30:51,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:30:51,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818094261] [2024-06-03 21:30:51,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:30:51,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:30:51,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:31:00,846 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-03 21:31:00,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:31:00,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818094261] [2024-06-03 21:31:00,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818094261] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:31:00,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:31:00,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:31:00,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860839648] [2024-06-03 21:31:00,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:31:00,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:31:00,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:31:00,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:31:00,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:31:01,209 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:31:01,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 196 transitions, 2030 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:31:01,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:31:01,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:31:01,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:31:03,219 INFO L124 PetriNetUnfolderBase]: 2334/3719 cut-off events. [2024-06-03 21:31:03,219 INFO L125 PetriNetUnfolderBase]: For 252483/252487 co-relation queries the response was YES. [2024-06-03 21:31:03,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30066 conditions, 3719 events. 2334/3719 cut-off events. For 252483/252487 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 20820 event pairs, 569 based on Foata normal form. 20/3739 useless extension candidates. Maximal degree in co-relation 29990. Up to 3268 conditions per place. [2024-06-03 21:31:03,259 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 168 selfloop transitions, 54 changer transitions 0/232 dead transitions. [2024-06-03 21:31:03,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 232 transitions, 2664 flow [2024-06-03 21:31:03,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:31:03,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:31:03,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 191 transitions. [2024-06-03 21:31:03,262 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45476190476190476 [2024-06-03 21:31:03,262 INFO L175 Difference]: Start difference. First operand has 171 places, 196 transitions, 2030 flow. Second operand 10 states and 191 transitions. [2024-06-03 21:31:03,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 232 transitions, 2664 flow [2024-06-03 21:31:03,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 232 transitions, 2535 flow, removed 18 selfloop flow, removed 7 redundant places. [2024-06-03 21:31:03,494 INFO L231 Difference]: Finished difference. Result has 174 places, 197 transitions, 2078 flow [2024-06-03 21:31:03,494 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1901, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2078, PETRI_PLACES=174, PETRI_TRANSITIONS=197} [2024-06-03 21:31:03,495 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 131 predicate places. [2024-06-03 21:31:03,495 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 197 transitions, 2078 flow [2024-06-03 21:31:03,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:31:03,495 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:31:03,495 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:31:03,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-03 21:31:03,495 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 21:31:03,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:31:03,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1412702479, now seen corresponding path program 8 times [2024-06-03 21:31:03,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:31:03,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993380049] [2024-06-03 21:31:03,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:31:03,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:31:03,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:31:13,282 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-03 21:31:13,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:31:13,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993380049] [2024-06-03 21:31:13,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993380049] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:31:13,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:31:13,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:31:13,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065870695] [2024-06-03 21:31:13,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:31:13,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:31:13,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:31:13,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:31:13,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:31:13,504 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:31:13,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 197 transitions, 2078 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:31:13,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:31:13,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:31:13,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:31:15,237 INFO L124 PetriNetUnfolderBase]: 2368/3773 cut-off events. [2024-06-03 21:31:15,237 INFO L125 PetriNetUnfolderBase]: For 256618/256622 co-relation queries the response was YES. [2024-06-03 21:31:15,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30657 conditions, 3773 events. 2368/3773 cut-off events. For 256618/256622 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 21217 event pairs, 569 based on Foata normal form. 12/3785 useless extension candidates. Maximal degree in co-relation 30581. Up to 3405 conditions per place. [2024-06-03 21:31:15,270 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 175 selfloop transitions, 48 changer transitions 0/233 dead transitions. [2024-06-03 21:31:15,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 233 transitions, 2715 flow [2024-06-03 21:31:15,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:31:15,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:31:15,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 190 transitions. [2024-06-03 21:31:15,272 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2024-06-03 21:31:15,272 INFO L175 Difference]: Start difference. First operand has 174 places, 197 transitions, 2078 flow. Second operand 10 states and 190 transitions. [2024-06-03 21:31:15,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 233 transitions, 2715 flow [2024-06-03 21:31:15,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 233 transitions, 2578 flow, removed 16 selfloop flow, removed 8 redundant places. [2024-06-03 21:31:15,474 INFO L231 Difference]: Finished difference. Result has 176 places, 200 transitions, 2161 flow [2024-06-03 21:31:15,474 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1941, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2161, PETRI_PLACES=176, PETRI_TRANSITIONS=200} [2024-06-03 21:31:15,474 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 133 predicate places. [2024-06-03 21:31:15,474 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 200 transitions, 2161 flow [2024-06-03 21:31:15,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:31:15,475 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:31:15,475 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:31:15,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-03 21:31:15,475 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 21:31:15,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:31:15,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1412493229, now seen corresponding path program 9 times [2024-06-03 21:31:15,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:31:15,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572521144] [2024-06-03 21:31:15,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:31:15,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:31:15,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:31:25,130 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-03 21:31:25,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:31:25,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572521144] [2024-06-03 21:31:25,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572521144] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:31:25,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:31:25,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:31:25,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063167000] [2024-06-03 21:31:25,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:31:25,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:31:25,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:31:25,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:31:25,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:31:25,403 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:31:25,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 200 transitions, 2161 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:31:25,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:31:25,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:31:25,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:31:27,262 INFO L124 PetriNetUnfolderBase]: 2445/3915 cut-off events. [2024-06-03 21:31:27,262 INFO L125 PetriNetUnfolderBase]: For 280537/280537 co-relation queries the response was YES. [2024-06-03 21:31:27,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32507 conditions, 3915 events. 2445/3915 cut-off events. For 280537/280537 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 22322 event pairs, 594 based on Foata normal form. 12/3926 useless extension candidates. Maximal degree in co-relation 32430. Up to 3137 conditions per place. [2024-06-03 21:31:27,295 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 166 selfloop transitions, 66 changer transitions 0/242 dead transitions. [2024-06-03 21:31:27,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 242 transitions, 3088 flow [2024-06-03 21:31:27,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:31:27,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:31:27,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 196 transitions. [2024-06-03 21:31:27,297 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2024-06-03 21:31:27,297 INFO L175 Difference]: Start difference. First operand has 176 places, 200 transitions, 2161 flow. Second operand 10 states and 196 transitions. [2024-06-03 21:31:27,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 242 transitions, 3088 flow [2024-06-03 21:31:27,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 242 transitions, 2865 flow, removed 55 selfloop flow, removed 10 redundant places. [2024-06-03 21:31:27,511 INFO L231 Difference]: Finished difference. Result has 177 places, 202 transitions, 2218 flow [2024-06-03 21:31:27,512 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1938, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2218, PETRI_PLACES=177, PETRI_TRANSITIONS=202} [2024-06-03 21:31:27,512 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 134 predicate places. [2024-06-03 21:31:27,512 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 202 transitions, 2218 flow [2024-06-03 21:31:27,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:31:27,513 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:31:27,513 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:31:27,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-03 21:31:27,513 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-03 21:31:27,514 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:31:27,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1357265875, now seen corresponding path program 10 times [2024-06-03 21:31:27,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:31:27,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419904865] [2024-06-03 21:31:27,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:31:27,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:31:27,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:31:36,833 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-03 21:31:36,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:31:36,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419904865] [2024-06-03 21:31:36,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419904865] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:31:36,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:31:36,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:31:36,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672927464] [2024-06-03 21:31:36,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:31:36,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:31:36,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:31:36,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:31:36,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:31:37,130 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:31:37,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 202 transitions, 2218 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:31:37,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:31:37,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:31:37,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:31:38,947 INFO L124 PetriNetUnfolderBase]: 2454/3923 cut-off events. [2024-06-03 21:31:38,947 INFO L125 PetriNetUnfolderBase]: For 286162/286166 co-relation queries the response was YES. [2024-06-03 21:31:38,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32421 conditions, 3923 events. 2454/3923 cut-off events. For 286162/286166 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 22388 event pairs, 590 based on Foata normal form. 12/3935 useless extension candidates. Maximal degree in co-relation 32344. Up to 3555 conditions per place. [2024-06-03 21:31:38,984 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 178 selfloop transitions, 50 changer transitions 0/238 dead transitions. [2024-06-03 21:31:38,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 238 transitions, 2873 flow [2024-06-03 21:31:38,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:31:38,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:31:38,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 188 transitions. [2024-06-03 21:31:38,988 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44761904761904764 [2024-06-03 21:31:38,988 INFO L175 Difference]: Start difference. First operand has 177 places, 202 transitions, 2218 flow. Second operand 10 states and 188 transitions. [2024-06-03 21:31:38,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 238 transitions, 2873 flow [2024-06-03 21:31:39,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 238 transitions, 2718 flow, removed 19 selfloop flow, removed 7 redundant places. [2024-06-03 21:31:39,269 INFO L231 Difference]: Finished difference. Result has 180 places, 205 transitions, 2295 flow [2024-06-03 21:31:39,269 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2063, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2295, PETRI_PLACES=180, PETRI_TRANSITIONS=205} [2024-06-03 21:31:39,270 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 137 predicate places. [2024-06-03 21:31:39,270 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 205 transitions, 2295 flow [2024-06-03 21:31:39,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:31:39,270 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:31:39,271 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:31:39,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-03 21:31:39,271 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-03 21:31:39,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:31:39,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1613968195, now seen corresponding path program 11 times [2024-06-03 21:31:39,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:31:39,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312008025] [2024-06-03 21:31:39,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:31:39,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:31:39,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:31:49,555 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-03 21:31:49,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:31:49,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312008025] [2024-06-03 21:31:49,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312008025] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:31:49,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:31:49,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:31:49,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83092399] [2024-06-03 21:31:49,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:31:49,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:31:49,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:31:49,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:31:49,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:31:49,788 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:31:49,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 205 transitions, 2295 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:31:49,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:31:49,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:31:49,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:31:51,689 INFO L124 PetriNetUnfolderBase]: 2512/4028 cut-off events. [2024-06-03 21:31:51,690 INFO L125 PetriNetUnfolderBase]: For 310280/310280 co-relation queries the response was YES. [2024-06-03 21:31:51,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33729 conditions, 4028 events. 2512/4028 cut-off events. For 310280/310280 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 23209 event pairs, 617 based on Foata normal form. 16/4043 useless extension candidates. Maximal degree in co-relation 33651. Up to 3438 conditions per place. [2024-06-03 21:31:51,725 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 138 selfloop transitions, 93 changer transitions 0/241 dead transitions. [2024-06-03 21:31:51,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 241 transitions, 2959 flow [2024-06-03 21:31:51,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:31:51,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:31:51,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 191 transitions. [2024-06-03 21:31:51,728 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45476190476190476 [2024-06-03 21:31:51,728 INFO L175 Difference]: Start difference. First operand has 180 places, 205 transitions, 2295 flow. Second operand 10 states and 191 transitions. [2024-06-03 21:31:51,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 241 transitions, 2959 flow [2024-06-03 21:31:51,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 241 transitions, 2742 flow, removed 56 selfloop flow, removed 9 redundant places. [2024-06-03 21:31:51,952 INFO L231 Difference]: Finished difference. Result has 181 places, 206 transitions, 2337 flow [2024-06-03 21:31:51,952 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2078, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2337, PETRI_PLACES=181, PETRI_TRANSITIONS=206} [2024-06-03 21:31:51,952 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 138 predicate places. [2024-06-03 21:31:51,953 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 206 transitions, 2337 flow [2024-06-03 21:31:51,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:31:51,953 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:31:51,953 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:31:51,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-03 21:31:51,953 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-03 21:31:51,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:31:51,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1357475125, now seen corresponding path program 12 times [2024-06-03 21:31:51,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:31:51,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393278305] [2024-06-03 21:31:51,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:31:51,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:31:52,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:32:01,729 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-03 21:32:01,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:32:01,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393278305] [2024-06-03 21:32:01,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393278305] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:32:01,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:32:01,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:32:01,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77641487] [2024-06-03 21:32:01,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:32:01,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:32:01,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:32:01,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:32:01,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:32:01,921 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:32:01,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 206 transitions, 2337 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:32:01,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:32:01,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:32:01,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:32:03,976 INFO L124 PetriNetUnfolderBase]: 2675/4315 cut-off events. [2024-06-03 21:32:03,976 INFO L125 PetriNetUnfolderBase]: For 353424/353424 co-relation queries the response was YES. [2024-06-03 21:32:03,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37376 conditions, 4315 events. 2675/4315 cut-off events. For 353424/353424 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 25455 event pairs, 656 based on Foata normal form. 12/4326 useless extension candidates. Maximal degree in co-relation 37298. Up to 3592 conditions per place. [2024-06-03 21:32:04,012 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 174 selfloop transitions, 65 changer transitions 0/249 dead transitions. [2024-06-03 21:32:04,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 249 transitions, 3370 flow [2024-06-03 21:32:04,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:32:04,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:32:04,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 195 transitions. [2024-06-03 21:32:04,015 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2024-06-03 21:32:04,015 INFO L175 Difference]: Start difference. First operand has 181 places, 206 transitions, 2337 flow. Second operand 10 states and 195 transitions. [2024-06-03 21:32:04,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 249 transitions, 3370 flow [2024-06-03 21:32:04,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 249 transitions, 3151 flow, removed 18 selfloop flow, removed 8 redundant places. [2024-06-03 21:32:04,297 INFO L231 Difference]: Finished difference. Result has 184 places, 209 transitions, 2467 flow [2024-06-03 21:32:04,298 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2118, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2467, PETRI_PLACES=184, PETRI_TRANSITIONS=209} [2024-06-03 21:32:04,298 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 141 predicate places. [2024-06-03 21:32:04,298 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 209 transitions, 2467 flow [2024-06-03 21:32:04,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:32:04,299 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:32:04,299 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:32:04,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-03 21:32:04,299 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-03 21:32:04,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:32:04,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1357467685, now seen corresponding path program 13 times [2024-06-03 21:32:04,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:32:04,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337343468] [2024-06-03 21:32:04,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:32:04,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:32:04,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:32:14,407 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-03 21:32:14,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:32:14,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337343468] [2024-06-03 21:32:14,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337343468] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:32:14,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:32:14,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:32:14,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369711863] [2024-06-03 21:32:14,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:32:14,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:32:14,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:32:14,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:32:14,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:32:14,588 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:32:14,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 209 transitions, 2467 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:32:14,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:32:14,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:32:14,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:32:16,512 INFO L124 PetriNetUnfolderBase]: 2647/4274 cut-off events. [2024-06-03 21:32:16,512 INFO L125 PetriNetUnfolderBase]: For 349879/349883 co-relation queries the response was YES. [2024-06-03 21:32:16,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36181 conditions, 4274 events. 2647/4274 cut-off events. For 349879/349883 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 25200 event pairs, 653 based on Foata normal form. 20/4294 useless extension candidates. Maximal degree in co-relation 36101. Up to 3812 conditions per place. [2024-06-03 21:32:16,551 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 181 selfloop transitions, 53 changer transitions 0/244 dead transitions. [2024-06-03 21:32:16,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 244 transitions, 3073 flow [2024-06-03 21:32:16,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:32:16,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:32:16,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 190 transitions. [2024-06-03 21:32:16,554 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2024-06-03 21:32:16,554 INFO L175 Difference]: Start difference. First operand has 184 places, 209 transitions, 2467 flow. Second operand 10 states and 190 transitions. [2024-06-03 21:32:16,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 244 transitions, 3073 flow [2024-06-03 21:32:16,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 244 transitions, 2957 flow, removed 22 selfloop flow, removed 6 redundant places. [2024-06-03 21:32:16,915 INFO L231 Difference]: Finished difference. Result has 188 places, 209 transitions, 2464 flow [2024-06-03 21:32:16,915 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2351, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2464, PETRI_PLACES=188, PETRI_TRANSITIONS=209} [2024-06-03 21:32:16,916 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 145 predicate places. [2024-06-03 21:32:16,916 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 209 transitions, 2464 flow [2024-06-03 21:32:16,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:32:16,916 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:32:16,917 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:32:16,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-03 21:32:16,917 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 21:32:16,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:32:16,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1613975635, now seen corresponding path program 14 times [2024-06-03 21:32:16,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:32:16,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995778449] [2024-06-03 21:32:16,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:32:16,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:32:16,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:32:27,142 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-03 21:32:27,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:32:27,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995778449] [2024-06-03 21:32:27,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995778449] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:32:27,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:32:27,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:32:27,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576115012] [2024-06-03 21:32:27,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:32:27,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:32:27,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:32:27,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:32:27,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:32:27,412 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:32:27,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 209 transitions, 2464 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:32:27,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:32:27,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:32:27,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:32:29,332 INFO L124 PetriNetUnfolderBase]: 2664/4308 cut-off events. [2024-06-03 21:32:29,332 INFO L125 PetriNetUnfolderBase]: For 348638/348638 co-relation queries the response was YES. [2024-06-03 21:32:29,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36651 conditions, 4308 events. 2664/4308 cut-off events. For 348638/348638 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 25529 event pairs, 655 based on Foata normal form. 4/4311 useless extension candidates. Maximal degree in co-relation 36569. Up to 3713 conditions per place. [2024-06-03 21:32:29,372 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 140 selfloop transitions, 98 changer transitions 0/248 dead transitions. [2024-06-03 21:32:29,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 248 transitions, 3210 flow [2024-06-03 21:32:29,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:32:29,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:32:29,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 193 transitions. [2024-06-03 21:32:29,374 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4595238095238095 [2024-06-03 21:32:29,374 INFO L175 Difference]: Start difference. First operand has 188 places, 209 transitions, 2464 flow. Second operand 10 states and 193 transitions. [2024-06-03 21:32:29,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 248 transitions, 3210 flow [2024-06-03 21:32:29,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 248 transitions, 3069 flow, removed 19 selfloop flow, removed 8 redundant places. [2024-06-03 21:32:29,755 INFO L231 Difference]: Finished difference. Result has 191 places, 214 transitions, 2728 flow [2024-06-03 21:32:29,756 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2323, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2728, PETRI_PLACES=191, PETRI_TRANSITIONS=214} [2024-06-03 21:32:29,756 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 148 predicate places. [2024-06-03 21:32:29,756 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 214 transitions, 2728 flow [2024-06-03 21:32:29,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:32:29,756 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:32:29,756 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:32:29,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-03 21:32:29,756 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 21:32:29,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:32:29,757 INFO L85 PathProgramCache]: Analyzing trace with hash -528249907, now seen corresponding path program 15 times [2024-06-03 21:32:29,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:32:29,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930731023] [2024-06-03 21:32:29,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:32:29,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:32:29,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:32:40,546 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-03 21:32:40,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:32:40,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930731023] [2024-06-03 21:32:40,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930731023] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:32:40,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:32:40,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:32:40,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641439873] [2024-06-03 21:32:40,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:32:40,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:32:40,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:32:40,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:32:40,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:32:40,824 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:32:40,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 214 transitions, 2728 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:32:40,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:32:40,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:32:40,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:32:42,748 INFO L124 PetriNetUnfolderBase]: 2716/4407 cut-off events. [2024-06-03 21:32:42,748 INFO L125 PetriNetUnfolderBase]: For 374562/374566 co-relation queries the response was YES. [2024-06-03 21:32:42,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38185 conditions, 4407 events. 2716/4407 cut-off events. For 374562/374566 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 26075 event pairs, 627 based on Foata normal form. 16/4423 useless extension candidates. Maximal degree in co-relation 38101. Up to 2594 conditions per place. [2024-06-03 21:32:42,791 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 142 selfloop transitions, 105 changer transitions 0/257 dead transitions. [2024-06-03 21:32:42,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 257 transitions, 3738 flow [2024-06-03 21:32:42,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:32:42,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:32:42,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 195 transitions. [2024-06-03 21:32:42,794 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2024-06-03 21:32:42,794 INFO L175 Difference]: Start difference. First operand has 191 places, 214 transitions, 2728 flow. Second operand 10 states and 195 transitions. [2024-06-03 21:32:42,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 257 transitions, 3738 flow [2024-06-03 21:32:43,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 257 transitions, 3452 flow, removed 87 selfloop flow, removed 6 redundant places. [2024-06-03 21:32:43,131 INFO L231 Difference]: Finished difference. Result has 195 places, 216 transitions, 2800 flow [2024-06-03 21:32:43,131 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2442, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2800, PETRI_PLACES=195, PETRI_TRANSITIONS=216} [2024-06-03 21:32:43,131 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 152 predicate places. [2024-06-03 21:32:43,131 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 216 transitions, 2800 flow [2024-06-03 21:32:43,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:32:43,131 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:32:43,131 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:32:43,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-03 21:32:43,132 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 21:32:43,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:32:43,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1827289486, now seen corresponding path program 2 times [2024-06-03 21:32:43,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:32:43,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299112676] [2024-06-03 21:32:43,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:32:43,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:32:43,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:32:58,524 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-03 21:32:58,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:32:58,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299112676] [2024-06-03 21:32:58,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299112676] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:32:58,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:32:58,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:32:58,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489448910] [2024-06-03 21:32:58,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:32:58,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:32:58,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:32:58,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:32:58,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:32:58,655 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-03 21:32:58,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 216 transitions, 2800 flow. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:32:58,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:32:58,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-03 21:32:58,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:33:00,480 INFO L124 PetriNetUnfolderBase]: 2819/4511 cut-off events. [2024-06-03 21:33:00,481 INFO L125 PetriNetUnfolderBase]: For 377794/377794 co-relation queries the response was YES. [2024-06-03 21:33:00,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38993 conditions, 4511 events. 2819/4511 cut-off events. For 377794/377794 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 26459 event pairs, 723 based on Foata normal form. 2/4512 useless extension candidates. Maximal degree in co-relation 38907. Up to 4317 conditions per place. [2024-06-03 21:33:00,519 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 200 selfloop transitions, 29 changer transitions 0/233 dead transitions. [2024-06-03 21:33:00,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 233 transitions, 3508 flow [2024-06-03 21:33:00,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 21:33:00,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 21:33:00,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 122 transitions. [2024-06-03 21:33:00,520 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41496598639455784 [2024-06-03 21:33:00,520 INFO L175 Difference]: Start difference. First operand has 195 places, 216 transitions, 2800 flow. Second operand 7 states and 122 transitions. [2024-06-03 21:33:00,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 233 transitions, 3508 flow [2024-06-03 21:33:00,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 233 transitions, 3337 flow, removed 36 selfloop flow, removed 6 redundant places. [2024-06-03 21:33:00,844 INFO L231 Difference]: Finished difference. Result has 196 places, 219 transitions, 2741 flow [2024-06-03 21:33:00,844 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2629, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2741, PETRI_PLACES=196, PETRI_TRANSITIONS=219} [2024-06-03 21:33:00,845 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 153 predicate places. [2024-06-03 21:33:00,845 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 219 transitions, 2741 flow [2024-06-03 21:33:00,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:33:00,845 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:33:00,845 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:33:00,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-03 21:33:00,845 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 21:33:00,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:33:00,846 INFO L85 PathProgramCache]: Analyzing trace with hash -654301692, now seen corresponding path program 3 times [2024-06-03 21:33:00,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:33:00,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512211727] [2024-06-03 21:33:00,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:33:00,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:33:00,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:33:16,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:33:16,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:33:16,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512211727] [2024-06-03 21:33:16,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512211727] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:33:16,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:33:16,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:33:16,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412391664] [2024-06-03 21:33:16,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:33:16,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:33:16,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:33:16,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:33:16,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:33:16,244 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-03 21:33:16,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 219 transitions, 2741 flow. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:33:16,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:33:16,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-03 21:33:16,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:33:17,967 INFO L124 PetriNetUnfolderBase]: 2813/4503 cut-off events. [2024-06-03 21:33:17,967 INFO L125 PetriNetUnfolderBase]: For 378977/378977 co-relation queries the response was YES. [2024-06-03 21:33:17,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38658 conditions, 4503 events. 2813/4503 cut-off events. For 378977/378977 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 26398 event pairs, 723 based on Foata normal form. 2/4504 useless extension candidates. Maximal degree in co-relation 38570. Up to 4312 conditions per place. [2024-06-03 21:33:18,009 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 200 selfloop transitions, 28 changer transitions 0/232 dead transitions. [2024-06-03 21:33:18,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 232 transitions, 3293 flow [2024-06-03 21:33:18,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 21:33:18,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 21:33:18,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 122 transitions. [2024-06-03 21:33:18,010 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41496598639455784 [2024-06-03 21:33:18,010 INFO L175 Difference]: Start difference. First operand has 196 places, 219 transitions, 2741 flow. Second operand 7 states and 122 transitions. [2024-06-03 21:33:18,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 232 transitions, 3293 flow [2024-06-03 21:33:18,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 232 transitions, 3191 flow, removed 30 selfloop flow, removed 4 redundant places. [2024-06-03 21:33:18,387 INFO L231 Difference]: Finished difference. Result has 199 places, 219 transitions, 2701 flow [2024-06-03 21:33:18,387 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2639, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2701, PETRI_PLACES=199, PETRI_TRANSITIONS=219} [2024-06-03 21:33:18,387 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 156 predicate places. [2024-06-03 21:33:18,388 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 219 transitions, 2701 flow [2024-06-03 21:33:18,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:33:18,388 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:33:18,388 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:33:18,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-03 21:33:18,388 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 21:33:18,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:33:18,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1620820218, now seen corresponding path program 1 times [2024-06-03 21:33:18,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:33:18,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074926174] [2024-06-03 21:33:18,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:33:18,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:33:18,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:33:30,153 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-03 21:33:30,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:33:30,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074926174] [2024-06-03 21:33:30,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074926174] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:33:30,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:33:30,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 21:33:30,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993877676] [2024-06-03 21:33:30,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:33:30,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 21:33:30,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:33:30,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 21:33:30,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-03 21:33:30,332 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:33:30,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 219 transitions, 2701 flow. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:33:30,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:33:30,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:33:30,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:33:32,035 INFO L124 PetriNetUnfolderBase]: 2676/4364 cut-off events. [2024-06-03 21:33:32,036 INFO L125 PetriNetUnfolderBase]: For 346256/346256 co-relation queries the response was YES. [2024-06-03 21:33:32,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36559 conditions, 4364 events. 2676/4364 cut-off events. For 346256/346256 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 26275 event pairs, 640 based on Foata normal form. 1/4358 useless extension candidates. Maximal degree in co-relation 36470. Up to 4151 conditions per place. [2024-06-03 21:33:32,074 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 215 selfloop transitions, 14 changer transitions 0/238 dead transitions. [2024-06-03 21:33:32,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 238 transitions, 3241 flow [2024-06-03 21:33:32,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 21:33:32,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 21:33:32,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions. [2024-06-03 21:33:32,075 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-03 21:33:32,075 INFO L175 Difference]: Start difference. First operand has 199 places, 219 transitions, 2701 flow. Second operand 7 states and 126 transitions. [2024-06-03 21:33:32,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 238 transitions, 3241 flow [2024-06-03 21:33:32,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 238 transitions, 3179 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-06-03 21:33:32,429 INFO L231 Difference]: Finished difference. Result has 200 places, 222 transitions, 2721 flow [2024-06-03 21:33:32,429 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2639, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2721, PETRI_PLACES=200, PETRI_TRANSITIONS=222} [2024-06-03 21:33:32,429 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 157 predicate places. [2024-06-03 21:33:32,429 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 222 transitions, 2721 flow [2024-06-03 21:33:32,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:33:32,430 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:33:32,430 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:33:32,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-03 21:33:32,430 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 21:33:32,430 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:33:32,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1649926768, now seen corresponding path program 1 times [2024-06-03 21:33:32,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:33:32,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585038815] [2024-06-03 21:33:32,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:33:32,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:33:32,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:33:43,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:33:43,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:33:43,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585038815] [2024-06-03 21:33:43,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585038815] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:33:43,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:33:43,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:33:43,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637761663] [2024-06-03 21:33:43,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:33:43,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:33:43,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:33:43,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:33:43,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:33:43,937 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:33:43,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 222 transitions, 2721 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 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-03 21:33:43,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:33:43,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:33:43,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:33:45,545 INFO L124 PetriNetUnfolderBase]: 2694/4391 cut-off events. [2024-06-03 21:33:45,545 INFO L125 PetriNetUnfolderBase]: For 357991/357991 co-relation queries the response was YES. [2024-06-03 21:33:45,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37129 conditions, 4391 events. 2694/4391 cut-off events. For 357991/357991 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 26429 event pairs, 639 based on Foata normal form. 2/4386 useless extension candidates. Maximal degree in co-relation 37039. Up to 4157 conditions per place. [2024-06-03 21:33:45,584 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 213 selfloop transitions, 26 changer transitions 0/248 dead transitions. [2024-06-03 21:33:45,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 248 transitions, 3427 flow [2024-06-03 21:33:45,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:33:45,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:33:45,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions. [2024-06-03 21:33:45,586 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4255952380952381 [2024-06-03 21:33:45,586 INFO L175 Difference]: Start difference. First operand has 200 places, 222 transitions, 2721 flow. Second operand 8 states and 143 transitions. [2024-06-03 21:33:45,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 248 transitions, 3427 flow [2024-06-03 21:33:45,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 248 transitions, 3367 flow, removed 18 selfloop flow, removed 5 redundant places. [2024-06-03 21:33:45,878 INFO L231 Difference]: Finished difference. Result has 204 places, 231 transitions, 2817 flow [2024-06-03 21:33:45,878 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2661, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2817, PETRI_PLACES=204, PETRI_TRANSITIONS=231} [2024-06-03 21:33:45,878 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 161 predicate places. [2024-06-03 21:33:45,878 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 231 transitions, 2817 flow [2024-06-03 21:33:45,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 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-03 21:33:45,878 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:33:45,878 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:33:45,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-03 21:33:45,879 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 21:33:45,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:33:45,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1649926582, now seen corresponding path program 2 times [2024-06-03 21:33:45,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:33:45,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755424946] [2024-06-03 21:33:45,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:33:45,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:33:45,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:33:57,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:33:57,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:33:57,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755424946] [2024-06-03 21:33:57,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755424946] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:33:57,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:33:57,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 21:33:57,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220826785] [2024-06-03 21:33:57,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:33:57,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 21:33:57,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:33:57,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 21:33:57,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 21:33:57,545 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:33:57,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 231 transitions, 2817 flow. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:33:57,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:33:57,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:33:57,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:33:59,194 INFO L124 PetriNetUnfolderBase]: 2713/4417 cut-off events. [2024-06-03 21:33:59,195 INFO L125 PetriNetUnfolderBase]: For 368724/368724 co-relation queries the response was YES. [2024-06-03 21:33:59,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37960 conditions, 4417 events. 2713/4417 cut-off events. For 368724/368724 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 26536 event pairs, 640 based on Foata normal form. 1/4411 useless extension candidates. Maximal degree in co-relation 37868. Up to 4186 conditions per place. [2024-06-03 21:33:59,239 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 216 selfloop transitions, 26 changer transitions 0/251 dead transitions. [2024-06-03 21:33:59,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 251 transitions, 3547 flow [2024-06-03 21:33:59,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 21:33:59,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 21:33:59,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 128 transitions. [2024-06-03 21:33:59,240 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43537414965986393 [2024-06-03 21:33:59,240 INFO L175 Difference]: Start difference. First operand has 204 places, 231 transitions, 2817 flow. Second operand 7 states and 128 transitions. [2024-06-03 21:33:59,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 251 transitions, 3547 flow [2024-06-03 21:33:59,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 251 transitions, 3503 flow, removed 17 selfloop flow, removed 3 redundant places. [2024-06-03 21:33:59,660 INFO L231 Difference]: Finished difference. Result has 208 places, 237 transitions, 2937 flow [2024-06-03 21:33:59,660 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2773, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2937, PETRI_PLACES=208, PETRI_TRANSITIONS=237} [2024-06-03 21:33:59,661 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 165 predicate places. [2024-06-03 21:33:59,661 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 237 transitions, 2937 flow [2024-06-03 21:33:59,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:33:59,661 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:33:59,661 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:33:59,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-03 21:33:59,661 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 21:33:59,662 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:33:59,662 INFO L85 PathProgramCache]: Analyzing trace with hash -311984532, now seen corresponding path program 2 times [2024-06-03 21:33:59,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:33:59,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541437452] [2024-06-03 21:33:59,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:33:59,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:33:59,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:34:10,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:34:10,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:34:10,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541437452] [2024-06-03 21:34:10,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541437452] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:34:10,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:34:10,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:34:10,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042258235] [2024-06-03 21:34:10,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:34:10,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:34:10,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:34:10,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:34:10,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:34:10,244 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:34:10,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 237 transitions, 2937 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 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-03 21:34:10,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:34:10,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:34:10,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:34:11,862 INFO L124 PetriNetUnfolderBase]: 2714/4419 cut-off events. [2024-06-03 21:34:11,862 INFO L125 PetriNetUnfolderBase]: For 380895/380895 co-relation queries the response was YES. [2024-06-03 21:34:11,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38284 conditions, 4419 events. 2714/4419 cut-off events. For 380895/380895 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 26547 event pairs, 639 based on Foata normal form. 3/4415 useless extension candidates. Maximal degree in co-relation 38190. Up to 4208 conditions per place. [2024-06-03 21:34:11,904 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 226 selfloop transitions, 16 changer transitions 0/251 dead transitions. [2024-06-03 21:34:11,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 251 transitions, 3483 flow [2024-06-03 21:34:11,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 21:34:11,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 21:34:11,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions. [2024-06-03 21:34:11,905 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41156462585034015 [2024-06-03 21:34:11,905 INFO L175 Difference]: Start difference. First operand has 208 places, 237 transitions, 2937 flow. Second operand 7 states and 121 transitions. [2024-06-03 21:34:11,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 251 transitions, 3483 flow [2024-06-03 21:34:12,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 251 transitions, 3421 flow, removed 23 selfloop flow, removed 3 redundant places. [2024-06-03 21:34:12,258 INFO L231 Difference]: Finished difference. Result has 212 places, 240 transitions, 2954 flow [2024-06-03 21:34:12,258 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2875, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2954, PETRI_PLACES=212, PETRI_TRANSITIONS=240} [2024-06-03 21:34:12,258 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 169 predicate places. [2024-06-03 21:34:12,258 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 240 transitions, 2954 flow [2024-06-03 21:34:12,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 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-03 21:34:12,258 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:34:12,259 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:34:12,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-03 21:34:12,259 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 21:34:12,259 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:34:12,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1827058288, now seen corresponding path program 3 times [2024-06-03 21:34:12,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:34:12,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539950336] [2024-06-03 21:34:12,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:34:12,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:34:12,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:34:23,167 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-03 21:34:23,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:34:23,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539950336] [2024-06-03 21:34:23,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539950336] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:34:23,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:34:23,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:34:23,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45254025] [2024-06-03 21:34:23,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:34:23,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:34:23,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:34:23,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:34:23,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:34:23,310 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:34:23,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 240 transitions, 2954 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 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-03 21:34:23,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:34:23,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:34:23,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:34:25,039 INFO L124 PetriNetUnfolderBase]: 2708/4411 cut-off events. [2024-06-03 21:34:25,039 INFO L125 PetriNetUnfolderBase]: For 385466/385466 co-relation queries the response was YES. [2024-06-03 21:34:25,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38314 conditions, 4411 events. 2708/4411 cut-off events. For 385466/385466 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 26490 event pairs, 638 based on Foata normal form. 2/4406 useless extension candidates. Maximal degree in co-relation 38218. Up to 4191 conditions per place. [2024-06-03 21:34:25,085 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 222 selfloop transitions, 22 changer transitions 0/253 dead transitions. [2024-06-03 21:34:25,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 253 transitions, 3476 flow [2024-06-03 21:34:25,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:34:25,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:34:25,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 137 transitions. [2024-06-03 21:34:25,092 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40773809523809523 [2024-06-03 21:34:25,093 INFO L175 Difference]: Start difference. First operand has 212 places, 240 transitions, 2954 flow. Second operand 8 states and 137 transitions. [2024-06-03 21:34:25,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 253 transitions, 3476 flow [2024-06-03 21:34:25,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 253 transitions, 3411 flow, removed 18 selfloop flow, removed 5 redundant places. [2024-06-03 21:34:25,530 INFO L231 Difference]: Finished difference. Result has 215 places, 240 transitions, 2939 flow [2024-06-03 21:34:25,530 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2889, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2939, PETRI_PLACES=215, PETRI_TRANSITIONS=240} [2024-06-03 21:34:25,531 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 172 predicate places. [2024-06-03 21:34:25,531 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 240 transitions, 2939 flow [2024-06-03 21:34:25,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 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-03 21:34:25,531 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:34:25,531 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:34:25,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-03 21:34:25,531 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 21:34:25,532 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:34:25,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1827058102, now seen corresponding path program 3 times [2024-06-03 21:34:25,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:34:25,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209738553] [2024-06-03 21:34:25,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:34:25,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:34:25,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:34:36,247 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-03 21:34:36,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:34:36,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209738553] [2024-06-03 21:34:36,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209738553] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:34:36,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:34:36,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 21:34:36,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353109878] [2024-06-03 21:34:36,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:34:36,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 21:34:36,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:34:36,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 21:34:36,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 21:34:36,416 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:34:36,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 240 transitions, 2939 flow. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:34:36,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:34:36,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:34:36,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:34:38,198 INFO L124 PetriNetUnfolderBase]: 2705/4407 cut-off events. [2024-06-03 21:34:38,198 INFO L125 PetriNetUnfolderBase]: For 391096/391096 co-relation queries the response was YES. [2024-06-03 21:34:38,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38333 conditions, 4407 events. 2705/4407 cut-off events. For 391096/391096 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 26526 event pairs, 638 based on Foata normal form. 1/4401 useless extension candidates. Maximal degree in co-relation 38236. Up to 4202 conditions per place. [2024-06-03 21:34:38,239 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 227 selfloop transitions, 14 changer transitions 0/250 dead transitions. [2024-06-03 21:34:38,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 250 transitions, 3445 flow [2024-06-03 21:34:38,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 21:34:38,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 21:34:38,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions. [2024-06-03 21:34:38,242 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40816326530612246 [2024-06-03 21:34:38,242 INFO L175 Difference]: Start difference. First operand has 215 places, 240 transitions, 2939 flow. Second operand 7 states and 120 transitions. [2024-06-03 21:34:38,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 250 transitions, 3445 flow [2024-06-03 21:34:38,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 250 transitions, 3344 flow, removed 23 selfloop flow, removed 7 redundant places. [2024-06-03 21:34:38,628 INFO L231 Difference]: Finished difference. Result has 215 places, 240 transitions, 2872 flow [2024-06-03 21:34:38,629 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2838, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2872, PETRI_PLACES=215, PETRI_TRANSITIONS=240} [2024-06-03 21:34:38,629 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 172 predicate places. [2024-06-03 21:34:38,629 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 240 transitions, 2872 flow [2024-06-03 21:34:38,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:34:38,629 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:34:38,630 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:34:38,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-03 21:34:38,630 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 21:34:38,630 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:34:38,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1502399388, now seen corresponding path program 1 times [2024-06-03 21:34:38,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:34:38,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496997677] [2024-06-03 21:34:38,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:34:38,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:34:38,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:34:49,539 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-03 21:34:49,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:34:49,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496997677] [2024-06-03 21:34:49,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496997677] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:34:49,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:34:49,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:34:49,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563859242] [2024-06-03 21:34:49,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:34:49,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:34:49,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:34:49,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:34:49,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:34:49,908 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:34:49,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 240 transitions, 2872 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:34:49,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:34:49,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:34:49,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:34:52,307 INFO L124 PetriNetUnfolderBase]: 2816/4550 cut-off events. [2024-06-03 21:34:52,307 INFO L125 PetriNetUnfolderBase]: For 475247/475251 co-relation queries the response was YES. [2024-06-03 21:34:52,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41104 conditions, 4550 events. 2816/4550 cut-off events. For 475247/475251 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 27011 event pairs, 495 based on Foata normal form. 12/4552 useless extension candidates. Maximal degree in co-relation 41006. Up to 4166 conditions per place. [2024-06-03 21:34:52,366 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 255 selfloop transitions, 18 changer transitions 0/286 dead transitions. [2024-06-03 21:34:52,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 286 transitions, 3636 flow [2024-06-03 21:34:52,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:34:52,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:34:52,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 188 transitions. [2024-06-03 21:34:52,369 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44761904761904764 [2024-06-03 21:34:52,369 INFO L175 Difference]: Start difference. First operand has 215 places, 240 transitions, 2872 flow. Second operand 10 states and 188 transitions. [2024-06-03 21:34:52,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 286 transitions, 3636 flow [2024-06-03 21:34:52,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 286 transitions, 3590 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-03 21:34:52,936 INFO L231 Difference]: Finished difference. Result has 220 places, 243 transitions, 2963 flow [2024-06-03 21:34:52,936 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2826, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2963, PETRI_PLACES=220, PETRI_TRANSITIONS=243} [2024-06-03 21:34:52,936 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 177 predicate places. [2024-06-03 21:34:52,937 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 243 transitions, 2963 flow [2024-06-03 21:34:52,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:34:52,937 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:34:52,937 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:34:52,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-03 21:34:52,937 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 21:34:52,937 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:34:52,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1525634482, now seen corresponding path program 2 times [2024-06-03 21:34:52,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:34:52,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500931343] [2024-06-03 21:34:52,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:34:52,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:34:52,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:35:02,940 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-03 21:35:02,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:35:02,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500931343] [2024-06-03 21:35:02,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500931343] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:35:02,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:35:02,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:35:02,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852015034] [2024-06-03 21:35:02,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:35:02,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:35:02,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:35:02,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:35:02,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:35:03,408 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:35:03,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 243 transitions, 2963 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:35:03,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:35:03,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:35:03,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:35:05,747 INFO L124 PetriNetUnfolderBase]: 2845/4599 cut-off events. [2024-06-03 21:35:05,747 INFO L125 PetriNetUnfolderBase]: For 478702/478706 co-relation queries the response was YES. [2024-06-03 21:35:05,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41804 conditions, 4599 events. 2845/4599 cut-off events. For 478702/478706 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 27495 event pairs, 633 based on Foata normal form. 4/4599 useless extension candidates. Maximal degree in co-relation 41704. Up to 4256 conditions per place. [2024-06-03 21:35:05,799 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 252 selfloop transitions, 23 changer transitions 0/288 dead transitions. [2024-06-03 21:35:05,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 288 transitions, 3735 flow [2024-06-03 21:35:05,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:35:05,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:35:05,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 189 transitions. [2024-06-03 21:35:05,800 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45 [2024-06-03 21:35:05,800 INFO L175 Difference]: Start difference. First operand has 220 places, 243 transitions, 2963 flow. Second operand 10 states and 189 transitions. [2024-06-03 21:35:05,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 288 transitions, 3735 flow [2024-06-03 21:35:06,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 288 transitions, 3641 flow, removed 31 selfloop flow, removed 7 redundant places. [2024-06-03 21:35:06,426 INFO L231 Difference]: Finished difference. Result has 224 places, 248 transitions, 3055 flow [2024-06-03 21:35:06,426 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2869, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3055, PETRI_PLACES=224, PETRI_TRANSITIONS=248} [2024-06-03 21:35:06,426 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 181 predicate places. [2024-06-03 21:35:06,426 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 248 transitions, 3055 flow [2024-06-03 21:35:06,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:35:06,427 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:35:06,427 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:35:06,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-03 21:35:06,427 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 21:35:06,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:35:06,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1616018418, now seen corresponding path program 3 times [2024-06-03 21:35:06,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:35:06,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799320254] [2024-06-03 21:35:06,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:35:06,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:35:06,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:35:17,335 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-03 21:35:17,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:35:17,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799320254] [2024-06-03 21:35:17,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799320254] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:35:17,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:35:17,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:35:17,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082285192] [2024-06-03 21:35:17,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:35:17,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:35:17,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:35:17,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:35:17,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:35:17,551 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:35:17,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 248 transitions, 3055 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:35:17,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:35:17,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:35:17,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:35:19,727 INFO L124 PetriNetUnfolderBase]: 2886/4670 cut-off events. [2024-06-03 21:35:19,727 INFO L125 PetriNetUnfolderBase]: For 509860/509864 co-relation queries the response was YES. [2024-06-03 21:35:19,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42778 conditions, 4670 events. 2886/4670 cut-off events. For 509860/509864 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 28033 event pairs, 653 based on Foata normal form. 12/4678 useless extension candidates. Maximal degree in co-relation 42676. Up to 4322 conditions per place. [2024-06-03 21:35:19,772 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 258 selfloop transitions, 20 changer transitions 0/291 dead transitions. [2024-06-03 21:35:19,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 291 transitions, 3822 flow [2024-06-03 21:35:19,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:35:19,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:35:19,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 188 transitions. [2024-06-03 21:35:19,775 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44761904761904764 [2024-06-03 21:35:19,775 INFO L175 Difference]: Start difference. First operand has 224 places, 248 transitions, 3055 flow. Second operand 10 states and 188 transitions. [2024-06-03 21:35:19,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 291 transitions, 3822 flow [2024-06-03 21:35:20,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 291 transitions, 3671 flow, removed 54 selfloop flow, removed 7 redundant places. [2024-06-03 21:35:20,232 INFO L231 Difference]: Finished difference. Result has 228 places, 250 transitions, 3040 flow [2024-06-03 21:35:20,232 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2906, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3040, PETRI_PLACES=228, PETRI_TRANSITIONS=250} [2024-06-03 21:35:20,233 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 185 predicate places. [2024-06-03 21:35:20,233 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 250 transitions, 3040 flow [2024-06-03 21:35:20,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:35:20,233 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:35:20,233 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:35:20,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-03 21:35:20,234 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 21:35:20,234 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:35:20,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1077980996, now seen corresponding path program 4 times [2024-06-03 21:35:20,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:35:20,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404140497] [2024-06-03 21:35:20,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:35:20,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:35:20,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:35:31,348 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-03 21:35:31,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:35:31,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404140497] [2024-06-03 21:35:31,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404140497] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:35:31,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:35:31,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:35:31,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631374800] [2024-06-03 21:35:31,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:35:31,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:35:31,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:35:31,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:35:31,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:35:31,583 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:35:31,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 250 transitions, 3040 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:35:31,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:35:31,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:35:31,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:35:33,670 INFO L124 PetriNetUnfolderBase]: 2927/4741 cut-off events. [2024-06-03 21:35:33,670 INFO L125 PetriNetUnfolderBase]: For 530202/530206 co-relation queries the response was YES. [2024-06-03 21:35:33,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43407 conditions, 4741 events. 2927/4741 cut-off events. For 530202/530206 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 28643 event pairs, 668 based on Foata normal form. 12/4749 useless extension candidates. Maximal degree in co-relation 43303. Up to 4381 conditions per place. [2024-06-03 21:35:33,717 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 252 selfloop transitions, 25 changer transitions 0/290 dead transitions. [2024-06-03 21:35:33,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 290 transitions, 3787 flow [2024-06-03 21:35:33,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:35:33,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:35:33,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 187 transitions. [2024-06-03 21:35:33,720 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4452380952380952 [2024-06-03 21:35:33,720 INFO L175 Difference]: Start difference. First operand has 228 places, 250 transitions, 3040 flow. Second operand 10 states and 187 transitions. [2024-06-03 21:35:33,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 290 transitions, 3787 flow [2024-06-03 21:35:34,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 290 transitions, 3698 flow, removed 27 selfloop flow, removed 7 redundant places. [2024-06-03 21:35:34,237 INFO L231 Difference]: Finished difference. Result has 232 places, 252 transitions, 3087 flow [2024-06-03 21:35:34,237 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2951, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3087, PETRI_PLACES=232, PETRI_TRANSITIONS=252} [2024-06-03 21:35:34,238 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 189 predicate places. [2024-06-03 21:35:34,238 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 252 transitions, 3087 flow [2024-06-03 21:35:34,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:35:34,238 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:35:34,238 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:35:34,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-03 21:35:34,239 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 21:35:34,239 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:35:34,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1248798746, now seen corresponding path program 5 times [2024-06-03 21:35:34,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:35:34,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297721891] [2024-06-03 21:35:34,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:35:34,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:35:34,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:35:44,996 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-03 21:35:44,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:35:44,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297721891] [2024-06-03 21:35:44,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297721891] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:35:44,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:35:44,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:35:44,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833316686] [2024-06-03 21:35:44,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:35:44,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:35:44,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:35:44,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:35:44,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:35:45,310 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:35:45,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 252 transitions, 3087 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:35:45,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:35:45,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:35:45,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:35:47,569 INFO L124 PetriNetUnfolderBase]: 2968/4812 cut-off events. [2024-06-03 21:35:47,570 INFO L125 PetriNetUnfolderBase]: For 546545/546549 co-relation queries the response was YES. [2024-06-03 21:35:47,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44136 conditions, 4812 events. 2968/4812 cut-off events. For 546545/546549 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 29180 event pairs, 668 based on Foata normal form. 12/4820 useless extension candidates. Maximal degree in co-relation 44030. Up to 4393 conditions per place. [2024-06-03 21:35:47,621 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 252 selfloop transitions, 30 changer transitions 0/295 dead transitions. [2024-06-03 21:35:47,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 295 transitions, 3879 flow [2024-06-03 21:35:47,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:35:47,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:35:47,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 188 transitions. [2024-06-03 21:35:47,622 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44761904761904764 [2024-06-03 21:35:47,622 INFO L175 Difference]: Start difference. First operand has 232 places, 252 transitions, 3087 flow. Second operand 10 states and 188 transitions. [2024-06-03 21:35:47,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 295 transitions, 3879 flow [2024-06-03 21:35:48,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 295 transitions, 3788 flow, removed 23 selfloop flow, removed 7 redundant places. [2024-06-03 21:35:48,265 INFO L231 Difference]: Finished difference. Result has 236 places, 256 transitions, 3181 flow [2024-06-03 21:35:48,266 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2996, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3181, PETRI_PLACES=236, PETRI_TRANSITIONS=256} [2024-06-03 21:35:48,266 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 193 predicate places. [2024-06-03 21:35:48,266 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 256 transitions, 3181 flow [2024-06-03 21:35:48,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:35:48,266 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:35:48,266 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:35:48,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-03 21:35:48,267 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 21:35:48,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:35:48,267 INFO L85 PathProgramCache]: Analyzing trace with hash 474149097, now seen corresponding path program 1 times [2024-06-03 21:35:48,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:35:48,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544491237] [2024-06-03 21:35:48,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:35:48,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:35:48,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:35:59,678 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-03 21:35:59,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:35:59,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544491237] [2024-06-03 21:35:59,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544491237] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:35:59,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:35:59,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:35:59,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610827772] [2024-06-03 21:35:59,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:35:59,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:35:59,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:35:59,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:35:59,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:35:59,862 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-03 21:35:59,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 256 transitions, 3181 flow. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:35:59,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:35:59,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-03 21:35:59,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:36:01,774 INFO L124 PetriNetUnfolderBase]: 3073/4931 cut-off events. [2024-06-03 21:36:01,774 INFO L125 PetriNetUnfolderBase]: For 547447/547447 co-relation queries the response was YES. [2024-06-03 21:36:01,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45317 conditions, 4931 events. 3073/4931 cut-off events. For 547447/547447 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 29511 event pairs, 724 based on Foata normal form. 2/4933 useless extension candidates. Maximal degree in co-relation 45209. Up to 4748 conditions per place. [2024-06-03 21:36:01,828 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 260 selfloop transitions, 27 changer transitions 0/291 dead transitions. [2024-06-03 21:36:01,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 291 transitions, 4171 flow [2024-06-03 21:36:01,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:36:01,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:36:01,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 153 transitions. [2024-06-03 21:36:01,829 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40476190476190477 [2024-06-03 21:36:01,829 INFO L175 Difference]: Start difference. First operand has 236 places, 256 transitions, 3181 flow. Second operand 9 states and 153 transitions. [2024-06-03 21:36:01,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 291 transitions, 4171 flow [2024-06-03 21:36:02,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 291 transitions, 4041 flow, removed 37 selfloop flow, removed 7 redundant places. [2024-06-03 21:36:02,542 INFO L231 Difference]: Finished difference. Result has 239 places, 267 transitions, 3319 flow [2024-06-03 21:36:02,542 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3051, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3319, PETRI_PLACES=239, PETRI_TRANSITIONS=267} [2024-06-03 21:36:02,543 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 196 predicate places. [2024-06-03 21:36:02,543 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 267 transitions, 3319 flow [2024-06-03 21:36:02,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:36:02,543 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:36:02,543 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:36:02,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-03 21:36:02,543 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 21:36:02,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:36:02,544 INFO L85 PathProgramCache]: Analyzing trace with hash 875990737, now seen corresponding path program 2 times [2024-06-03 21:36:02,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:36:02,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377182705] [2024-06-03 21:36:02,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:36:02,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:36:02,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:36:12,683 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-03 21:36:12,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:36:12,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377182705] [2024-06-03 21:36:12,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377182705] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:36:12,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:36:12,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:36:12,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498457273] [2024-06-03 21:36:12,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:36:12,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:36:12,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:36:12,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:36:12,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:36:12,810 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-03 21:36:12,810 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 267 transitions, 3319 flow. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:36:12,810 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:36:12,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-03 21:36:12,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:36:14,733 INFO L124 PetriNetUnfolderBase]: 3083/4947 cut-off events. [2024-06-03 21:36:14,733 INFO L125 PetriNetUnfolderBase]: For 557695/557695 co-relation queries the response was YES. [2024-06-03 21:36:14,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45716 conditions, 4947 events. 3083/4947 cut-off events. For 557695/557695 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 29610 event pairs, 724 based on Foata normal form. 2/4949 useless extension candidates. Maximal degree in co-relation 45606. Up to 4793 conditions per place. [2024-06-03 21:36:14,788 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 266 selfloop transitions, 20 changer transitions 0/290 dead transitions. [2024-06-03 21:36:14,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 290 transitions, 4058 flow [2024-06-03 21:36:14,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:36:14,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:36:14,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions. [2024-06-03 21:36:14,790 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2024-06-03 21:36:14,790 INFO L175 Difference]: Start difference. First operand has 239 places, 267 transitions, 3319 flow. Second operand 9 states and 147 transitions. [2024-06-03 21:36:14,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 290 transitions, 4058 flow [2024-06-03 21:36:15,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 290 transitions, 3894 flow, removed 75 selfloop flow, removed 4 redundant places. [2024-06-03 21:36:15,691 INFO L231 Difference]: Finished difference. Result has 244 places, 271 transitions, 3304 flow [2024-06-03 21:36:15,691 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3201, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3304, PETRI_PLACES=244, PETRI_TRANSITIONS=271} [2024-06-03 21:36:15,692 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 201 predicate places. [2024-06-03 21:36:15,692 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 271 transitions, 3304 flow [2024-06-03 21:36:15,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:36:15,692 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:36:15,692 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:36:15,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-03 21:36:15,693 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 21:36:15,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:36:15,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1593706105, now seen corresponding path program 1 times [2024-06-03 21:36:15,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:36:15,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364726537] [2024-06-03 21:36:15,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:36:15,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:36:15,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:36: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-03 21:36:31,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:36:31,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364726537] [2024-06-03 21:36:31,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364726537] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:36:31,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:36:31,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:36:31,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232114691] [2024-06-03 21:36:31,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:36:31,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:36:31,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:36:31,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:36:31,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 Killed by 15