./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix016_pso.opt_tso.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_pso.opt_tso.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_pso.opt_tso.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix016_pso.opt_tso.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:25:39,609 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-03 21:25:39,642 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-03 21:25:39,645 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-03 21:25:39,646 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-03 21:25:39,658 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-03 21:25:39,659 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-03 21:25:39,659 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-03 21:25:39,660 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-03 21:25:39,660 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-03 21:25:39,660 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-03 21:25:39,660 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-03 21:25:39,661 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-03 21:25:39,661 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-03 21:25:39,661 INFO L153 SettingsManager]: * Use SBE=true [2024-06-03 21:25:39,662 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-03 21:25:39,662 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-03 21:25:39,662 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-03 21:25:39,662 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-03 21:25:39,663 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-03 21:25:39,663 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-03 21:25:39,663 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-03 21:25:39,664 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-03 21:25:39,664 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-03 21:25:39,664 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-03 21:25:39,664 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-03 21:25:39,664 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-03 21:25:39,665 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-03 21:25:39,665 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-03 21:25:39,665 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-03 21:25:39,665 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-03 21:25:39,666 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-03 21:25:39,666 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 21:25:39,666 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-03 21:25:39,666 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-03 21:25:39,666 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-03 21:25:39,666 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-03 21:25:39,667 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-03 21:25:39,667 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-03 21:25:39,667 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-03 21:25:39,667 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-03 21:25:39,667 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-03 21:25:39,668 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-03 21:25:39,668 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:25:39,851 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-03 21:25:39,874 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-03 21:25:39,876 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-03 21:25:39,877 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-03 21:25:39,878 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-03 21:25:39,879 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_pso.opt_tso.opt.yml/witness.yml [2024-06-03 21:25:40,065 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-03 21:25:40,066 INFO L274 PluginConnector]: CDTParser initialized [2024-06-03 21:25:40,067 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix016_pso.opt_tso.opt.i [2024-06-03 21:25:41,162 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-03 21:25:41,353 INFO L384 CDTParser]: Found 1 translation units. [2024-06-03 21:25:41,353 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix016_pso.opt_tso.opt.i [2024-06-03 21:25:41,378 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c29d18ccc/395374c07fb2482e8ff27d6b93bd3c89/FLAGfc7ba97c7 [2024-06-03 21:25:41,396 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c29d18ccc/395374c07fb2482e8ff27d6b93bd3c89 [2024-06-03 21:25:41,398 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-03 21:25:41,399 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-03 21:25:41,401 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-03 21:25:41,401 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-03 21:25:41,404 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-03 21:25:41,405 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 09:25:40" (1/2) ... [2024-06-03 21:25:41,407 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@657dc148 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:25:41, skipping insertion in model container [2024-06-03 21:25:41,407 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 09:25:40" (1/2) ... [2024-06-03 21:25:41,408 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5e6699e3 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:25:41, skipping insertion in model container [2024-06-03 21:25:41,408 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 09:25:41" (2/2) ... [2024-06-03 21:25:41,409 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@657dc148 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:25:41, skipping insertion in model container [2024-06-03 21:25:41,409 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 09:25:41" (2/2) ... [2024-06-03 21:25:41,409 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-03 21:25:41,491 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-03 21:25:41,492 INFO L97 edCorrectnessWitness]: Location invariant before [L846-L846] ((((((((((((((((((((! multithreaded || y$r_buff1_thd1 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )z >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )z >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )z >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )z >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )z >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )z >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )z >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )z >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )z >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )z >= 0LL) && (long long )y$w_buff1 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (1LL + (long long )x) - (long long )z >= 0LL) && (1LL + (long long )y) - (long long )z >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (1LL + (long long )y$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )y$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )y$w_buff1) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd1 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && x <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && z <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_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)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)) && (z == 0 || z == 1)))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0) [2024-06-03 21:25:41,493 INFO L97 edCorrectnessWitness]: Location invariant before [L849-L849] ((((((((((((((((((((! multithreaded || y$r_buff1_thd1 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )z >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )z >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )z >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )z >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )z >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )z >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )z >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )z >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )z >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )z >= 0LL) && (long long )y$w_buff1 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (1LL + (long long )x) - (long long )z >= 0LL) && (1LL + (long long )y) - (long long )z >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (1LL + (long long )y$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )y$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )y$w_buff1) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd1 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && x <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && z <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_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)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)) && (z == 0 || z == 1)))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0) [2024-06-03 21:25:41,493 INFO L97 edCorrectnessWitness]: Location invariant before [L848-L848] ((((((((((((((((((((! multithreaded || y$r_buff1_thd1 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )z >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )z >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )z >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )z >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )z >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )z >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )z >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )z >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )z >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )z >= 0LL) && (long long )y$w_buff1 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (1LL + (long long )x) - (long long )z >= 0LL) && (1LL + (long long )y) - (long long )z >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (1LL + (long long )y$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )y$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )y$w_buff1) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd1 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && x <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && z <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_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)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)) && (z == 0 || z == 1)))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0) [2024-06-03 21:25:41,494 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-03 21:25:41,494 INFO L106 edCorrectnessWitness]: ghost_update [L844-L844] multithreaded = 1; [2024-06-03 21:25:41,530 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-03 21:25:41,829 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 21:25:41,836 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:25:42,155 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 21:25:42,186 INFO L206 MainTranslator]: Completed translation [2024-06-03 21:25:42,186 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:25:42 WrapperNode [2024-06-03 21:25:42,186 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-03 21:25:42,188 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-03 21:25:42,188 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-03 21:25:42,188 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-03 21:25:42,193 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:25:42" (1/1) ... [2024-06-03 21:25:42,239 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:25:42" (1/1) ... [2024-06-03 21:25:42,334 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 149 [2024-06-03 21:25:42,335 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-03 21:25:42,335 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-03 21:25:42,336 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-03 21:25:42,336 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-03 21:25:42,344 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:25:42" (1/1) ... [2024-06-03 21:25:42,345 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:25:42" (1/1) ... [2024-06-03 21:25:42,370 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:25:42" (1/1) ... [2024-06-03 21:25:42,425 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:25:42,425 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:25:42" (1/1) ... [2024-06-03 21:25:42,426 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:25:42" (1/1) ... [2024-06-03 21:25:42,465 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:25:42" (1/1) ... [2024-06-03 21:25:42,467 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:25:42" (1/1) ... [2024-06-03 21:25:42,486 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:25:42" (1/1) ... [2024-06-03 21:25:42,491 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:25:42" (1/1) ... [2024-06-03 21:25:42,521 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-03 21:25:42,522 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-03 21:25:42,522 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-03 21:25:42,522 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-03 21:25:42,523 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:25:42" (1/1) ... [2024-06-03 21:25:42,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 21:25:42,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-03 21:25:42,547 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:25:42,554 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:25:42,576 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-03 21:25:42,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-03 21:25:42,576 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-03 21:25:42,576 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-03 21:25:42,577 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-03 21:25:42,577 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-03 21:25:42,577 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-03 21:25:42,577 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-03 21:25:42,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-03 21:25:42,577 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-03 21:25:42,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-03 21:25:42,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-03 21:25:42,579 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:25:42,681 INFO L244 CfgBuilder]: Building ICFG [2024-06-03 21:25:42,683 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-03 21:25:43,709 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-03 21:25:43,711 INFO L293 CfgBuilder]: Performing block encoding [2024-06-03 21:25:43,975 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-03 21:25:43,976 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-03 21:25:43,976 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 09:25:43 BoogieIcfgContainer [2024-06-03 21:25:43,977 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-03 21:25:43,979 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-03 21:25:43,979 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-03 21:25:43,982 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-03 21:25:43,982 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 09:25:40" (1/4) ... [2024-06-03 21:25:43,982 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cbb9322 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 09:25:43, skipping insertion in model container [2024-06-03 21:25:43,982 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.06 09:25:41" (2/4) ... [2024-06-03 21:25:43,983 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cbb9322 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 09:25:43, skipping insertion in model container [2024-06-03 21:25:43,983 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:25:42" (3/4) ... [2024-06-03 21:25:43,983 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cbb9322 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 09:25:43, skipping insertion in model container [2024-06-03 21:25:43,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 09:25:43" (4/4) ... [2024-06-03 21:25:43,984 INFO L112 eAbstractionObserver]: Analyzing ICFG mix016_pso.opt_tso.opt.i [2024-06-03 21:25:43,997 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-03 21:25:43,997 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-03 21:25:43,997 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-03 21:25:44,088 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-03 21:25:44,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 42 transitions, 96 flow [2024-06-03 21:25:44,161 INFO L124 PetriNetUnfolderBase]: 0/39 cut-off events. [2024-06-03 21:25:44,161 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 21:25:44,163 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 67 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:25:44,164 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 42 transitions, 96 flow [2024-06-03 21:25:44,166 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 33 transitions, 75 flow [2024-06-03 21:25:44,176 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-03 21:25:44,182 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;@67af90a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-03 21:25:44,183 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-03 21:25:44,189 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-03 21:25:44,189 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-03 21:25:44,189 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 21:25:44,190 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:25:44,190 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-03 21:25:44,190 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:25:44,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:25:44,195 INFO L85 PathProgramCache]: Analyzing trace with hash -575597131, now seen corresponding path program 1 times [2024-06-03 21:25:44,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:25:44,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556263780] [2024-06-03 21:25:44,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:25:44,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:25:44,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:25:49,380 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:49,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:25:49,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556263780] [2024-06-03 21:25:49,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556263780] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:25:49,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:25:49,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-03 21:25:49,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671664881] [2024-06-03 21:25:49,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:25:49,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-03 21:25:49,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:25:49,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-03 21:25:49,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-03 21:25:49,472 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 42 [2024-06-03 21:25:49,475 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:25:49,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:25:49,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 42 [2024-06-03 21:25:49,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:25:50,088 INFO L124 PetriNetUnfolderBase]: 869/1399 cut-off events. [2024-06-03 21:25:50,088 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2024-06-03 21:25:50,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2779 conditions, 1399 events. 869/1399 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 7048 event pairs, 566 based on Foata normal form. 1/1345 useless extension candidates. Maximal degree in co-relation 2764. Up to 1315 conditions per place. [2024-06-03 21:25:50,100 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 32 selfloop transitions, 4 changer transitions 0/43 dead transitions. [2024-06-03 21:25:50,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 43 transitions, 173 flow [2024-06-03 21:25:50,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-03 21:25:50,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-03 21:25:50,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2024-06-03 21:25:50,108 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191 [2024-06-03 21:25:50,109 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:25:50,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 43 transitions, 173 flow [2024-06-03 21:25:50,112 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:25:50,113 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 102 flow [2024-06-03 21:25:50,114 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:25:50,117 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 0 predicate places. [2024-06-03 21:25:50,117 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 102 flow [2024-06-03 21:25:50,117 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:25:50,117 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:25:50,117 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:25:50,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-03 21:25:50,118 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:25:50,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:25:50,118 INFO L85 PathProgramCache]: Analyzing trace with hash 901968084, now seen corresponding path program 1 times [2024-06-03 21:25:50,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:25:50,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763845856] [2024-06-03 21:25:50,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:25:50,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:25:50,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:25:53,761 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:53,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:25:53,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763845856] [2024-06-03 21:25:53,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763845856] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:25:53,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:25:53,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-03 21:25:53,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83083540] [2024-06-03 21:25:53,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:25:53,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-03 21:25:53,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:25:53,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-03 21:25:53,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-03 21:25:53,863 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42 [2024-06-03 21:25:53,863 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:25:53,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:25:53,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42 [2024-06-03 21:25:53,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:25:54,523 INFO L124 PetriNetUnfolderBase]: 996/1550 cut-off events. [2024-06-03 21:25:54,523 INFO L125 PetriNetUnfolderBase]: For 331/331 co-relation queries the response was YES. [2024-06-03 21:25:54,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3567 conditions, 1550 events. 996/1550 cut-off events. For 331/331 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7617 event pairs, 519 based on Foata normal form. 3/1549 useless extension candidates. Maximal degree in co-relation 3552. Up to 1484 conditions per place. [2024-06-03 21:25:54,533 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 40 selfloop transitions, 7 changer transitions 0/53 dead transitions. [2024-06-03 21:25:54,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 53 transitions, 242 flow [2024-06-03 21:25:54,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-03 21:25:54,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-03 21:25:54,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 98 transitions. [2024-06-03 21:25:54,536 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2024-06-03 21:25:54,536 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:25:54,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 53 transitions, 242 flow [2024-06-03 21:25:54,537 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:25:54,539 INFO L231 Difference]: Finished difference. Result has 46 places, 39 transitions, 138 flow [2024-06-03 21:25:54,540 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:25:54,540 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 3 predicate places. [2024-06-03 21:25:54,541 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 138 flow [2024-06-03 21:25:54,541 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:25:54,541 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:25:54,541 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:25:54,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-03 21:25:54,544 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:25:54,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:25:54,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1216772747, now seen corresponding path program 1 times [2024-06-03 21:25:54,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:25:54,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107916517] [2024-06-03 21:25:54,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:25:54,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:25:54,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:25:58,536 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:58,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:25:58,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107916517] [2024-06-03 21:25:58,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107916517] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:25:58,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:25:58,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 21:25:58,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145707191] [2024-06-03 21:25:58,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:25:58,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 21:25:58,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:25:58,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 21:25:58,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-03 21:25:58,632 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-03 21:25:58,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 138 flow. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:25:58,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:25:58,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-03 21:25:58,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:25:59,450 INFO L124 PetriNetUnfolderBase]: 1265/1934 cut-off events. [2024-06-03 21:25:59,450 INFO L125 PetriNetUnfolderBase]: For 1101/1101 co-relation queries the response was YES. [2024-06-03 21:25:59,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4933 conditions, 1934 events. 1265/1934 cut-off events. For 1101/1101 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 9233 event pairs, 445 based on Foata normal form. 6/1933 useless extension candidates. Maximal degree in co-relation 4916. Up to 1828 conditions per place. [2024-06-03 21:25:59,460 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 52 selfloop transitions, 12 changer transitions 0/69 dead transitions. [2024-06-03 21:25:59,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 69 transitions, 354 flow [2024-06-03 21:25:59,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 21:25:59,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 21:25:59,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 133 transitions. [2024-06-03 21:25:59,465 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2024-06-03 21:25:59,465 INFO L175 Difference]: Start difference. First operand has 46 places, 39 transitions, 138 flow. Second operand 6 states and 133 transitions. [2024-06-03 21:25:59,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 69 transitions, 354 flow [2024-06-03 21:25:59,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 69 transitions, 334 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-06-03 21:25:59,468 INFO L231 Difference]: Finished difference. Result has 50 places, 43 transitions, 181 flow [2024-06-03 21:25:59,468 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=181, PETRI_PLACES=50, PETRI_TRANSITIONS=43} [2024-06-03 21:25:59,469 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 7 predicate places. [2024-06-03 21:25:59,469 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 43 transitions, 181 flow [2024-06-03 21:25:59,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:25:59,469 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:25:59,469 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:25:59,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-03 21:25:59,470 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 21:25:59,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:25:59,470 INFO L85 PathProgramCache]: Analyzing trace with hash 746852484, now seen corresponding path program 1 times [2024-06-03 21:25:59,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:25:59,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228720307] [2024-06-03 21:25:59,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:25:59,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:25:59,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:26:07,687 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:07,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:26:07,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228720307] [2024-06-03 21:26:07,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228720307] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:26:07,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:26:07,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 21:26:07,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206221270] [2024-06-03 21:26:07,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:26:07,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 21:26:07,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:26:07,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 21:26:07,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-03 21:26:07,811 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-03 21:26:07,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 43 transitions, 181 flow. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:26:07,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:26:07,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-03 21:26:07,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:26:08,642 INFO L124 PetriNetUnfolderBase]: 1085/1743 cut-off events. [2024-06-03 21:26:08,642 INFO L125 PetriNetUnfolderBase]: For 1768/1768 co-relation queries the response was YES. [2024-06-03 21:26:08,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4801 conditions, 1743 events. 1085/1743 cut-off events. For 1768/1768 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 8605 event pairs, 442 based on Foata normal form. 4/1738 useless extension candidates. Maximal degree in co-relation 4782. Up to 1611 conditions per place. [2024-06-03 21:26:08,651 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 44 selfloop transitions, 8 changer transitions 0/58 dead transitions. [2024-06-03 21:26:08,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 58 transitions, 329 flow [2024-06-03 21:26:08,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 21:26:08,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 21:26:08,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2024-06-03 21:26:08,652 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48095238095238096 [2024-06-03 21:26:08,652 INFO L175 Difference]: Start difference. First operand has 50 places, 43 transitions, 181 flow. Second operand 5 states and 101 transitions. [2024-06-03 21:26:08,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 58 transitions, 329 flow [2024-06-03 21:26:08,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 58 transitions, 302 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-03 21:26:08,654 INFO L231 Difference]: Finished difference. Result has 52 places, 46 transitions, 198 flow [2024-06-03 21:26:08,655 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=154, 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=198, PETRI_PLACES=52, PETRI_TRANSITIONS=46} [2024-06-03 21:26:08,655 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 9 predicate places. [2024-06-03 21:26:08,655 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 46 transitions, 198 flow [2024-06-03 21:26:08,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:26:08,656 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:26:08,656 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:26:08,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-03 21:26:08,656 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:26:08,656 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:26:08,656 INFO L85 PathProgramCache]: Analyzing trace with hash 460019363, now seen corresponding path program 1 times [2024-06-03 21:26:08,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:26:08,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81667073] [2024-06-03 21:26:08,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:26:08,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:26:08,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:26:17,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:26:17,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:26:17,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81667073] [2024-06-03 21:26:17,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81667073] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:26:17,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:26:17,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 21:26:17,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325789214] [2024-06-03 21:26:17,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:26:17,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 21:26:17,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:26:17,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 21:26:17,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-03 21:26:18,015 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:26:18,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 46 transitions, 198 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:26:18,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:26:18,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:26:18,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:26:18,906 INFO L124 PetriNetUnfolderBase]: 1277/1952 cut-off events. [2024-06-03 21:26:18,906 INFO L125 PetriNetUnfolderBase]: For 3080/3080 co-relation queries the response was YES. [2024-06-03 21:26:18,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5933 conditions, 1952 events. 1277/1952 cut-off events. For 3080/3080 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 9250 event pairs, 487 based on Foata normal form. 4/1951 useless extension candidates. Maximal degree in co-relation 5912. Up to 1826 conditions per place. [2024-06-03 21:26:18,917 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 54 selfloop transitions, 16 changer transitions 0/75 dead transitions. [2024-06-03 21:26:18,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 75 transitions, 446 flow [2024-06-03 21:26:18,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 21:26:18,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 21:26:18,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 123 transitions. [2024-06-03 21:26:18,918 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4880952380952381 [2024-06-03 21:26:18,918 INFO L175 Difference]: Start difference. First operand has 52 places, 46 transitions, 198 flow. Second operand 6 states and 123 transitions. [2024-06-03 21:26:18,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 75 transitions, 446 flow [2024-06-03 21:26:18,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 75 transitions, 426 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-03 21:26:18,921 INFO L231 Difference]: Finished difference. Result has 55 places, 52 transitions, 260 flow [2024-06-03 21:26:18,921 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=260, PETRI_PLACES=55, PETRI_TRANSITIONS=52} [2024-06-03 21:26:18,921 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 12 predicate places. [2024-06-03 21:26:18,922 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 52 transitions, 260 flow [2024-06-03 21:26:18,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:26:18,922 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:26:18,922 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:26:18,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-03 21:26:18,922 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:26:18,923 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:26:18,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1324607813, now seen corresponding path program 2 times [2024-06-03 21:26:18,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:26:18,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877986560] [2024-06-03 21:26:18,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:26:18,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:26:18,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:26:27,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:26:27,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:26:27,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877986560] [2024-06-03 21:26:27,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877986560] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:26:27,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:26:27,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 21:26:27,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092674615] [2024-06-03 21:26:27,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:26:27,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 21:26:27,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:26:27,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 21:26:27,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-03 21:26:27,707 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:26:27,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 52 transitions, 260 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:26:27,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:26:27,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:26:27,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:26:28,770 INFO L124 PetriNetUnfolderBase]: 1267/1940 cut-off events. [2024-06-03 21:26:28,770 INFO L125 PetriNetUnfolderBase]: For 4431/4436 co-relation queries the response was YES. [2024-06-03 21:26:28,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6373 conditions, 1940 events. 1267/1940 cut-off events. For 4431/4436 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 9186 event pairs, 486 based on Foata normal form. 8/1945 useless extension candidates. Maximal degree in co-relation 6351. Up to 1818 conditions per place. [2024-06-03 21:26:28,781 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 48 selfloop transitions, 16 changer transitions 0/69 dead transitions. [2024-06-03 21:26:28,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 69 transitions, 430 flow [2024-06-03 21:26:28,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 21:26:28,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 21:26:28,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions. [2024-06-03 21:26:28,782 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2024-06-03 21:26:28,782 INFO L175 Difference]: Start difference. First operand has 55 places, 52 transitions, 260 flow. Second operand 6 states and 117 transitions. [2024-06-03 21:26:28,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 69 transitions, 430 flow [2024-06-03 21:26:28,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 69 transitions, 400 flow, removed 11 selfloop flow, removed 2 redundant places. [2024-06-03 21:26:28,788 INFO L231 Difference]: Finished difference. Result has 59 places, 52 transitions, 270 flow [2024-06-03 21:26:28,788 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=270, PETRI_PLACES=59, PETRI_TRANSITIONS=52} [2024-06-03 21:26:28,790 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 16 predicate places. [2024-06-03 21:26:28,791 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 52 transitions, 270 flow [2024-06-03 21:26:28,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:26:28,791 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:26:28,791 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:26:28,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-03 21:26:28,791 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:26:28,792 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:26:28,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1293075025, now seen corresponding path program 1 times [2024-06-03 21:26:28,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:26:28,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539922480] [2024-06-03 21:26:28,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:26:28,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:26:28,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:26:38,365 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:38,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:26:38,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539922480] [2024-06-03 21:26:38,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539922480] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:26:38,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:26:38,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 21:26:38,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456907072] [2024-06-03 21:26:38,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:26:38,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 21:26:38,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:26:38,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 21:26:38,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 21:26:38,511 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:26:38,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 52 transitions, 270 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:26:38,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:26:38,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:26:38,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:26:39,469 INFO L124 PetriNetUnfolderBase]: 1325/2039 cut-off events. [2024-06-03 21:26:39,469 INFO L125 PetriNetUnfolderBase]: For 5424/5426 co-relation queries the response was YES. [2024-06-03 21:26:39,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6834 conditions, 2039 events. 1325/2039 cut-off events. For 5424/5426 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 9762 event pairs, 520 based on Foata normal form. 6/2043 useless extension candidates. Maximal degree in co-relation 6810. Up to 1909 conditions per place. [2024-06-03 21:26:39,480 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 64 selfloop transitions, 24 changer transitions 0/93 dead transitions. [2024-06-03 21:26:39,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 93 transitions, 600 flow [2024-06-03 21:26:39,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:26:39,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:26:39,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions. [2024-06-03 21:26:39,482 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46130952380952384 [2024-06-03 21:26:39,482 INFO L175 Difference]: Start difference. First operand has 59 places, 52 transitions, 270 flow. Second operand 8 states and 155 transitions. [2024-06-03 21:26:39,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 93 transitions, 600 flow [2024-06-03 21:26:39,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 93 transitions, 544 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-03 21:26:39,486 INFO L231 Difference]: Finished difference. Result has 63 places, 66 transitions, 380 flow [2024-06-03 21:26:39,486 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=380, PETRI_PLACES=63, PETRI_TRANSITIONS=66} [2024-06-03 21:26:39,487 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 20 predicate places. [2024-06-03 21:26:39,487 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 66 transitions, 380 flow [2024-06-03 21:26:39,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:26:39,487 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:26:39,487 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:26:39,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-03 21:26:39,487 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:26:39,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:26:39,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1375694857, now seen corresponding path program 2 times [2024-06-03 21:26:39,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:26:39,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585874984] [2024-06-03 21:26:39,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:26:39,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:26:39,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:26:47,717 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:47,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:26:47,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585874984] [2024-06-03 21:26:47,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585874984] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:26:47,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:26:47,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 21:26:47,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061436456] [2024-06-03 21:26:47,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:26:47,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 21:26:47,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:26:47,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 21:26:47,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-03 21:26:47,874 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:26:47,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 66 transitions, 380 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:26:47,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:26:47,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:26:47,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:26:48,968 INFO L124 PetriNetUnfolderBase]: 1347/2088 cut-off events. [2024-06-03 21:26:48,968 INFO L125 PetriNetUnfolderBase]: For 7368/7372 co-relation queries the response was YES. [2024-06-03 21:26:48,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7510 conditions, 2088 events. 1347/2088 cut-off events. For 7368/7372 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 10164 event pairs, 513 based on Foata normal form. 8/2094 useless extension candidates. Maximal degree in co-relation 7484. Up to 1918 conditions per place. [2024-06-03 21:26:48,984 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 64 selfloop transitions, 26 changer transitions 0/95 dead transitions. [2024-06-03 21:26:48,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 95 transitions, 672 flow [2024-06-03 21:26:48,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 21:26:48,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 21:26:48,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 137 transitions. [2024-06-03 21:26:48,987 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46598639455782315 [2024-06-03 21:26:48,987 INFO L175 Difference]: Start difference. First operand has 63 places, 66 transitions, 380 flow. Second operand 7 states and 137 transitions. [2024-06-03 21:26:48,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 95 transitions, 672 flow [2024-06-03 21:26:48,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 95 transitions, 632 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-06-03 21:26:48,993 INFO L231 Difference]: Finished difference. Result has 67 places, 69 transitions, 439 flow [2024-06-03 21:26:48,993 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=439, PETRI_PLACES=67, PETRI_TRANSITIONS=69} [2024-06-03 21:26:48,995 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 24 predicate places. [2024-06-03 21:26:48,995 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 69 transitions, 439 flow [2024-06-03 21:26:48,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:26:48,996 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:26:48,996 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:26:48,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-03 21:26:48,996 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:26:48,996 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:26:48,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1542834061, now seen corresponding path program 3 times [2024-06-03 21:26:48,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:26:48,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166863874] [2024-06-03 21:26:48,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:26:48,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:26:49,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:26:58,593 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:58,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:26:58,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166863874] [2024-06-03 21:26:58,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166863874] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:26:58,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:26:58,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 21:26:58,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339249228] [2024-06-03 21:26:58,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:26:58,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 21:26:58,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:26:58,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 21:26:58,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-03 21:26:58,695 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:26:58,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 69 transitions, 439 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:26:58,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:26:58,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:26:58,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:26:59,711 INFO L124 PetriNetUnfolderBase]: 1369/2125 cut-off events. [2024-06-03 21:26:59,711 INFO L125 PetriNetUnfolderBase]: For 9873/9875 co-relation queries the response was YES. [2024-06-03 21:26:59,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8167 conditions, 2125 events. 1369/2125 cut-off events. For 9873/9875 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 10331 event pairs, 441 based on Foata normal form. 4/2127 useless extension candidates. Maximal degree in co-relation 8140. Up to 1834 conditions per place. [2024-06-03 21:26:59,722 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 63 selfloop transitions, 38 changer transitions 0/106 dead transitions. [2024-06-03 21:26:59,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 106 transitions, 829 flow [2024-06-03 21:26:59,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:26:59,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:26:59,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 159 transitions. [2024-06-03 21:26:59,723 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4732142857142857 [2024-06-03 21:26:59,723 INFO L175 Difference]: Start difference. First operand has 67 places, 69 transitions, 439 flow. Second operand 8 states and 159 transitions. [2024-06-03 21:26:59,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 106 transitions, 829 flow [2024-06-03 21:26:59,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 106 transitions, 744 flow, removed 21 selfloop flow, removed 5 redundant places. [2024-06-03 21:26:59,730 INFO L231 Difference]: Finished difference. Result has 70 places, 75 transitions, 516 flow [2024-06-03 21:26:59,730 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=516, PETRI_PLACES=70, PETRI_TRANSITIONS=75} [2024-06-03 21:26:59,731 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 27 predicate places. [2024-06-03 21:26:59,731 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 75 transitions, 516 flow [2024-06-03 21:26:59,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:26:59,731 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:26:59,731 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:26:59,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-03 21:26:59,732 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:26:59,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:26:59,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1549263151, now seen corresponding path program 4 times [2024-06-03 21:26:59,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:26:59,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880427985] [2024-06-03 21:26:59,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:26:59,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:26:59,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:27:09,169 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:09,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:27:09,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880427985] [2024-06-03 21:27:09,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880427985] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:27:09,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:27:09,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 21:27:09,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300905209] [2024-06-03 21:27:09,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:27:09,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 21:27:09,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:27:09,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 21:27:09,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-03 21:27:09,309 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:27:09,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 75 transitions, 516 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:27:09,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:27:09,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:27:09,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:27:10,286 INFO L124 PetriNetUnfolderBase]: 1359/2111 cut-off events. [2024-06-03 21:27:10,287 INFO L125 PetriNetUnfolderBase]: For 9918/9920 co-relation queries the response was YES. [2024-06-03 21:27:10,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8101 conditions, 2111 events. 1359/2111 cut-off events. For 9918/9920 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 10222 event pairs, 446 based on Foata normal form. 4/2113 useless extension candidates. Maximal degree in co-relation 8073. Up to 1826 conditions per place. [2024-06-03 21:27:10,297 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 60 selfloop transitions, 38 changer transitions 0/103 dead transitions. [2024-06-03 21:27:10,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 103 transitions, 794 flow [2024-06-03 21:27:10,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:27:10,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:27:10,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 156 transitions. [2024-06-03 21:27:10,298 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2024-06-03 21:27:10,299 INFO L175 Difference]: Start difference. First operand has 70 places, 75 transitions, 516 flow. Second operand 8 states and 156 transitions. [2024-06-03 21:27:10,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 103 transitions, 794 flow [2024-06-03 21:27:10,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 103 transitions, 734 flow, removed 18 selfloop flow, removed 4 redundant places. [2024-06-03 21:27:10,307 INFO L231 Difference]: Finished difference. Result has 74 places, 75 transitions, 540 flow [2024-06-03 21:27:10,307 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=540, PETRI_PLACES=74, PETRI_TRANSITIONS=75} [2024-06-03 21:27:10,308 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 31 predicate places. [2024-06-03 21:27:10,308 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 75 transitions, 540 flow [2024-06-03 21:27:10,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:27:10,308 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:27:10,308 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:27:10,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-03 21:27:10,308 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 21:27:10,309 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:27:10,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1553077291, now seen corresponding path program 1 times [2024-06-03 21:27:10,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:27:10,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486798214] [2024-06-03 21:27:10,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:27:10,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:27:10,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:27:18,831 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:18,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:27:18,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486798214] [2024-06-03 21:27:18,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486798214] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:27:18,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:27:18,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 21:27:18,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590595901] [2024-06-03 21:27:18,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:27:18,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 21:27:18,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:27:18,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 21:27:18,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-03 21:27:18,953 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-03 21:27:18,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 75 transitions, 540 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:27:18,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:27:18,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-03 21:27:18,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:27:19,930 INFO L124 PetriNetUnfolderBase]: 1181/1917 cut-off events. [2024-06-03 21:27:19,930 INFO L125 PetriNetUnfolderBase]: For 9787/9789 co-relation queries the response was YES. [2024-06-03 21:27:19,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7439 conditions, 1917 events. 1181/1917 cut-off events. For 9787/9789 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 9607 event pairs, 401 based on Foata normal form. 4/1906 useless extension candidates. Maximal degree in co-relation 7409. Up to 1735 conditions per place. [2024-06-03 21:27:19,940 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 81 selfloop transitions, 13 changer transitions 0/100 dead transitions. [2024-06-03 21:27:19,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 100 transitions, 829 flow [2024-06-03 21:27:19,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 21:27:19,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 21:27:19,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 136 transitions. [2024-06-03 21:27:19,941 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46258503401360546 [2024-06-03 21:27:19,942 INFO L175 Difference]: Start difference. First operand has 74 places, 75 transitions, 540 flow. Second operand 7 states and 136 transitions. [2024-06-03 21:27:19,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 100 transitions, 829 flow [2024-06-03 21:27:19,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 100 transitions, 724 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-03 21:27:19,949 INFO L231 Difference]: Finished difference. Result has 75 places, 80 transitions, 519 flow [2024-06-03 21:27:19,950 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=519, PETRI_PLACES=75, PETRI_TRANSITIONS=80} [2024-06-03 21:27:19,950 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 32 predicate places. [2024-06-03 21:27:19,950 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 80 transitions, 519 flow [2024-06-03 21:27:19,951 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:27:19,951 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:27:19,951 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:27:19,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-03 21:27:19,951 INFO L420 AbstractCegarLoop]: === Iteration 12 === 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:19,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:27:19,952 INFO L85 PathProgramCache]: Analyzing trace with hash 766776627, now seen corresponding path program 1 times [2024-06-03 21:27:19,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:27:19,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946958191] [2024-06-03 21:27:19,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:27:19,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:27:19,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:27:29,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:27:29,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:27:29,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946958191] [2024-06-03 21:27:29,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946958191] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:27:29,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:27:29,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 21:27:29,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47952859] [2024-06-03 21:27:29,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:27:29,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 21:27:29,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:27:29,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 21:27:29,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-03 21:27:29,540 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42 [2024-06-03 21:27:29,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 80 transitions, 519 flow. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:27:29,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:27:29,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42 [2024-06-03 21:27:29,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:27:30,192 INFO L124 PetriNetUnfolderBase]: 1070/1779 cut-off events. [2024-06-03 21:27:30,193 INFO L125 PetriNetUnfolderBase]: For 10606/10618 co-relation queries the response was YES. [2024-06-03 21:27:30,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7209 conditions, 1779 events. 1070/1779 cut-off events. For 10606/10618 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 9174 event pairs, 401 based on Foata normal form. 11/1774 useless extension candidates. Maximal degree in co-relation 7177. Up to 1605 conditions per place. [2024-06-03 21:27:30,203 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 72 selfloop transitions, 8 changer transitions 0/91 dead transitions. [2024-06-03 21:27:30,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 91 transitions, 721 flow [2024-06-03 21:27:30,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 21:27:30,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 21:27:30,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 100 transitions. [2024-06-03 21:27:30,204 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2024-06-03 21:27:30,205 INFO L175 Difference]: Start difference. First operand has 75 places, 80 transitions, 519 flow. Second operand 5 states and 100 transitions. [2024-06-03 21:27:30,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 91 transitions, 721 flow [2024-06-03 21:27:30,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 91 transitions, 682 flow, removed 9 selfloop flow, removed 4 redundant places. [2024-06-03 21:27:30,213 INFO L231 Difference]: Finished difference. Result has 76 places, 83 transitions, 526 flow [2024-06-03 21:27:30,213 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=526, PETRI_PLACES=76, PETRI_TRANSITIONS=83} [2024-06-03 21:27:30,214 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 33 predicate places. [2024-06-03 21:27:30,214 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 83 transitions, 526 flow [2024-06-03 21:27:30,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:27:30,214 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:27:30,214 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:27:30,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-03 21:27:30,214 INFO L420 AbstractCegarLoop]: === Iteration 13 === 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:30,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:27:30,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1999727245, now seen corresponding path program 1 times [2024-06-03 21:27:30,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:27:30,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168080835] [2024-06-03 21:27:30,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:27:30,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:27:30,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:27:41,270 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:41,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:27:41,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168080835] [2024-06-03 21:27:41,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168080835] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:27:41,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:27:41,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 21:27:41,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665439195] [2024-06-03 21:27:41,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:27:41,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 21:27:41,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:27:41,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 21:27:41,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-03 21:27:41,433 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42 [2024-06-03 21:27:41,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 83 transitions, 526 flow. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:27:41,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:27:41,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42 [2024-06-03 21:27:41,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:27:42,105 INFO L124 PetriNetUnfolderBase]: 1067/1775 cut-off events. [2024-06-03 21:27:42,106 INFO L125 PetriNetUnfolderBase]: For 12004/12016 co-relation queries the response was YES. [2024-06-03 21:27:42,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7471 conditions, 1775 events. 1067/1775 cut-off events. For 12004/12016 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 9109 event pairs, 400 based on Foata normal form. 11/1770 useless extension candidates. Maximal degree in co-relation 7438. Up to 1598 conditions per place. [2024-06-03 21:27:42,127 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 73 selfloop transitions, 11 changer transitions 0/95 dead transitions. [2024-06-03 21:27:42,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 95 transitions, 742 flow [2024-06-03 21:27:42,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 21:27:42,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 21:27:42,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 116 transitions. [2024-06-03 21:27:42,128 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4603174603174603 [2024-06-03 21:27:42,128 INFO L175 Difference]: Start difference. First operand has 76 places, 83 transitions, 526 flow. Second operand 6 states and 116 transitions. [2024-06-03 21:27:42,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 95 transitions, 742 flow [2024-06-03 21:27:42,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 95 transitions, 718 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-06-03 21:27:42,138 INFO L231 Difference]: Finished difference. Result has 79 places, 86 transitions, 558 flow [2024-06-03 21:27:42,138 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=558, PETRI_PLACES=79, PETRI_TRANSITIONS=86} [2024-06-03 21:27:42,138 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 36 predicate places. [2024-06-03 21:27:42,138 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 86 transitions, 558 flow [2024-06-03 21:27:42,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:27:42,139 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:27:42,139 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:42,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-03 21:27:42,139 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:27:42,139 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:27:42,139 INFO L85 PathProgramCache]: Analyzing trace with hash -920811504, now seen corresponding path program 1 times [2024-06-03 21:27:42,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:27:42,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278101823] [2024-06-03 21:27:42,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:27:42,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:27:42,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:27:52,602 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:52,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:27:52,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278101823] [2024-06-03 21:27:52,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278101823] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:27:52,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:27:52,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:27:52,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379945584] [2024-06-03 21:27:52,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:27:52,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:27:52,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:27:52,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:27:52,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:27:52,750 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:27:52,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 86 transitions, 558 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:27:52,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:27:52,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:27:52,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:27:54,066 INFO L124 PetriNetUnfolderBase]: 1536/2410 cut-off events. [2024-06-03 21:27:54,066 INFO L125 PetriNetUnfolderBase]: For 20318/20320 co-relation queries the response was YES. [2024-06-03 21:27:54,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10804 conditions, 2410 events. 1536/2410 cut-off events. For 20318/20320 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 12162 event pairs, 337 based on Foata normal form. 16/2424 useless extension candidates. Maximal degree in co-relation 10770. Up to 1868 conditions per place. [2024-06-03 21:27:54,080 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 89 selfloop transitions, 32 changer transitions 0/126 dead transitions. [2024-06-03 21:27:54,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 126 transitions, 1012 flow [2024-06-03 21:27:54,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:27:54,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:27:54,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 162 transitions. [2024-06-03 21:27:54,083 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48214285714285715 [2024-06-03 21:27:54,083 INFO L175 Difference]: Start difference. First operand has 79 places, 86 transitions, 558 flow. Second operand 8 states and 162 transitions. [2024-06-03 21:27:54,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 126 transitions, 1012 flow [2024-06-03 21:27:54,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 126 transitions, 978 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-06-03 21:27:54,096 INFO L231 Difference]: Finished difference. Result has 84 places, 89 transitions, 650 flow [2024-06-03 21:27:54,096 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=524, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=650, PETRI_PLACES=84, PETRI_TRANSITIONS=89} [2024-06-03 21:27:54,098 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 41 predicate places. [2024-06-03 21:27:54,098 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 89 transitions, 650 flow [2024-06-03 21:27:54,098 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:27:54,098 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:27:54,098 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:54,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-03 21:27:54,098 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:27:54,099 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:27:54,099 INFO L85 PathProgramCache]: Analyzing trace with hash 35416550, now seen corresponding path program 2 times [2024-06-03 21:27:54,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:27:54,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776377556] [2024-06-03 21:27:54,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:27:54,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:27:54,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:28:04,717 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:04,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:28:04,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776377556] [2024-06-03 21:28:04,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776377556] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:28:04,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:28:04,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:28:04,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352047597] [2024-06-03 21:28:04,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:28:04,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:28:04,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:28:04,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:28:04,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:28:04,818 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:28:04,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 89 transitions, 650 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:28:04,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:28:04,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:28:04,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:28:06,073 INFO L124 PetriNetUnfolderBase]: 1500/2364 cut-off events. [2024-06-03 21:28:06,074 INFO L125 PetriNetUnfolderBase]: For 22391/22395 co-relation queries the response was YES. [2024-06-03 21:28:06,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10893 conditions, 2364 events. 1500/2364 cut-off events. For 22391/22395 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 11907 event pairs, 510 based on Foata normal form. 24/2386 useless extension candidates. Maximal degree in co-relation 10857. Up to 2039 conditions per place. [2024-06-03 21:28:06,086 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 93 selfloop transitions, 27 changer transitions 0/125 dead transitions. [2024-06-03 21:28:06,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 125 transitions, 1035 flow [2024-06-03 21:28:06,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:28:06,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:28:06,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 157 transitions. [2024-06-03 21:28:06,098 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46726190476190477 [2024-06-03 21:28:06,098 INFO L175 Difference]: Start difference. First operand has 84 places, 89 transitions, 650 flow. Second operand 8 states and 157 transitions. [2024-06-03 21:28:06,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 125 transitions, 1035 flow [2024-06-03 21:28:06,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 125 transitions, 993 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-03 21:28:06,116 INFO L231 Difference]: Finished difference. Result has 88 places, 90 transitions, 694 flow [2024-06-03 21:28:06,117 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=608, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=694, PETRI_PLACES=88, PETRI_TRANSITIONS=90} [2024-06-03 21:28:06,118 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 45 predicate places. [2024-06-03 21:28:06,118 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 90 transitions, 694 flow [2024-06-03 21:28:06,118 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:28:06,118 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:28:06,118 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:06,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-03 21:28:06,119 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 21:28:06,119 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:28:06,119 INFO L85 PathProgramCache]: Analyzing trace with hash -802663374, now seen corresponding path program 3 times [2024-06-03 21:28:06,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:28:06,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059871316] [2024-06-03 21:28:06,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:28:06,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:28:06,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:28:17,121 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:17,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:28:17,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059871316] [2024-06-03 21:28:17,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059871316] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:28:17,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:28:17,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:28:17,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322897682] [2024-06-03 21:28:17,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:28:17,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:28:17,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:28:17,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:28:17,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:28:17,252 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:28:17,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 90 transitions, 694 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:28:17,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:28:17,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:28:17,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:28:18,420 INFO L124 PetriNetUnfolderBase]: 1575/2485 cut-off events. [2024-06-03 21:28:18,420 INFO L125 PetriNetUnfolderBase]: For 25756/25758 co-relation queries the response was YES. [2024-06-03 21:28:18,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11677 conditions, 2485 events. 1575/2485 cut-off events. For 25756/25758 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 12684 event pairs, 466 based on Foata normal form. 20/2503 useless extension candidates. Maximal degree in co-relation 11639. Up to 2069 conditions per place. [2024-06-03 21:28:18,435 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 82 selfloop transitions, 41 changer transitions 0/128 dead transitions. [2024-06-03 21:28:18,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 128 transitions, 1086 flow [2024-06-03 21:28:18,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:28:18,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:28:18,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 177 transitions. [2024-06-03 21:28:18,453 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46825396825396826 [2024-06-03 21:28:18,453 INFO L175 Difference]: Start difference. First operand has 88 places, 90 transitions, 694 flow. Second operand 9 states and 177 transitions. [2024-06-03 21:28:18,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 128 transitions, 1086 flow [2024-06-03 21:28:18,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 128 transitions, 1031 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-03 21:28:18,470 INFO L231 Difference]: Finished difference. Result has 91 places, 91 transitions, 750 flow [2024-06-03 21:28:18,470 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=639, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=750, PETRI_PLACES=91, PETRI_TRANSITIONS=91} [2024-06-03 21:28:18,471 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 48 predicate places. [2024-06-03 21:28:18,471 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 91 transitions, 750 flow [2024-06-03 21:28:18,471 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:28:18,471 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:28:18,471 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:18,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-03 21:28:18,472 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:28:18,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:28:18,472 INFO L85 PathProgramCache]: Analyzing trace with hash 150892418, now seen corresponding path program 1 times [2024-06-03 21:28:18,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:28:18,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910524591] [2024-06-03 21:28:18,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:28:18,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:28:18,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:28:27,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:28:27,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:28:27,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910524591] [2024-06-03 21:28:27,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910524591] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:28:27,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:28:27,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:28:27,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111092588] [2024-06-03 21:28:27,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:28:27,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:28:27,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:28:27,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:28:27,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:28:27,287 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:28:27,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 91 transitions, 750 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:28:27,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:28:27,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:28:27,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:28:28,516 INFO L124 PetriNetUnfolderBase]: 1567/2490 cut-off events. [2024-06-03 21:28:28,517 INFO L125 PetriNetUnfolderBase]: For 27090/27094 co-relation queries the response was YES. [2024-06-03 21:28:28,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11853 conditions, 2490 events. 1567/2490 cut-off events. For 27090/27094 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 12914 event pairs, 488 based on Foata normal form. 8/2493 useless extension candidates. Maximal degree in co-relation 11814. Up to 2277 conditions per place. [2024-06-03 21:28:28,530 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 92 selfloop transitions, 26 changer transitions 0/123 dead transitions. [2024-06-03 21:28:28,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 123 transitions, 1103 flow [2024-06-03 21:28:28,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:28:28,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:28:28,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions. [2024-06-03 21:28:28,534 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2024-06-03 21:28:28,534 INFO L175 Difference]: Start difference. First operand has 91 places, 91 transitions, 750 flow. Second operand 8 states and 154 transitions. [2024-06-03 21:28:28,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 123 transitions, 1103 flow [2024-06-03 21:28:28,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 123 transitions, 1008 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-03 21:28:28,593 INFO L231 Difference]: Finished difference. Result has 93 places, 94 transitions, 744 flow [2024-06-03 21:28:28,594 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=659, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=744, PETRI_PLACES=93, PETRI_TRANSITIONS=94} [2024-06-03 21:28:28,594 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 50 predicate places. [2024-06-03 21:28:28,594 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 94 transitions, 744 flow [2024-06-03 21:28:28,594 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:28:28,594 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:28:28,594 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:28,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-03 21:28:28,595 INFO L420 AbstractCegarLoop]: === Iteration 18 === 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:28,595 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:28:28,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1391405454, now seen corresponding path program 1 times [2024-06-03 21:28:28,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:28:28,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059040680] [2024-06-03 21:28:28,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:28:28,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:28:28,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:28:38,255 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:38,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:28:38,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059040680] [2024-06-03 21:28:38,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059040680] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:28:38,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:28:38,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 21:28:38,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306260189] [2024-06-03 21:28:38,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:28:38,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 21:28:38,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:28:38,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 21:28:38,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-03 21:28:38,383 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-03 21:28:38,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 94 transitions, 744 flow. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:28:38,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:28:38,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-03 21:28:38,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:28:39,249 INFO L124 PetriNetUnfolderBase]: 1437/2332 cut-off events. [2024-06-03 21:28:39,249 INFO L125 PetriNetUnfolderBase]: For 28662/28678 co-relation queries the response was YES. [2024-06-03 21:28:39,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11413 conditions, 2332 events. 1437/2332 cut-off events. For 28662/28678 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 12330 event pairs, 484 based on Foata normal form. 12/2325 useless extension candidates. Maximal degree in co-relation 11372. Up to 2152 conditions per place. [2024-06-03 21:28:39,265 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 78 selfloop transitions, 21 changer transitions 0/111 dead transitions. [2024-06-03 21:28:39,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 111 transitions, 1008 flow [2024-06-03 21:28:39,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 21:28:39,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 21:28:39,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions. [2024-06-03 21:28:39,266 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2024-06-03 21:28:39,266 INFO L175 Difference]: Start difference. First operand has 93 places, 94 transitions, 744 flow. Second operand 6 states and 117 transitions. [2024-06-03 21:28:39,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 111 transitions, 1008 flow [2024-06-03 21:28:39,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 111 transitions, 930 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-06-03 21:28:39,286 INFO L231 Difference]: Finished difference. Result has 93 places, 97 transitions, 748 flow [2024-06-03 21:28:39,286 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=666, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=748, PETRI_PLACES=93, PETRI_TRANSITIONS=97} [2024-06-03 21:28:39,287 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 50 predicate places. [2024-06-03 21:28:39,287 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 97 transitions, 748 flow [2024-06-03 21:28:39,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:28:39,287 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:28:39,287 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:39,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-03 21:28:39,287 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:28:39,288 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:28:39,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1511726034, now seen corresponding path program 4 times [2024-06-03 21:28:39,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:28:39,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085894050] [2024-06-03 21:28:39,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:28:39,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:28:39,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:28:49,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:28:49,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:28:49,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085894050] [2024-06-03 21:28:49,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085894050] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:28:49,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:28:49,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:28:49,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891305059] [2024-06-03 21:28:49,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:28:49,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:28:49,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:28:49,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:28:49,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:28:50,167 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:28:50,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 97 transitions, 748 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:28:50,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:28:50,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:28:50,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:28:51,347 INFO L124 PetriNetUnfolderBase]: 1602/2536 cut-off events. [2024-06-03 21:28:51,347 INFO L125 PetriNetUnfolderBase]: For 33221/33223 co-relation queries the response was YES. [2024-06-03 21:28:51,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12495 conditions, 2536 events. 1602/2536 cut-off events. For 33221/33223 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 13037 event pairs, 458 based on Foata normal form. 20/2554 useless extension candidates. Maximal degree in co-relation 12453. Up to 2118 conditions per place. [2024-06-03 21:28:51,360 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 88 selfloop transitions, 42 changer transitions 0/135 dead transitions. [2024-06-03 21:28:51,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 135 transitions, 1166 flow [2024-06-03 21:28:51,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:28:51,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:28:51,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 176 transitions. [2024-06-03 21:28:51,363 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4656084656084656 [2024-06-03 21:28:51,363 INFO L175 Difference]: Start difference. First operand has 93 places, 97 transitions, 748 flow. Second operand 9 states and 176 transitions. [2024-06-03 21:28:51,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 135 transitions, 1166 flow [2024-06-03 21:28:51,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 135 transitions, 1114 flow, removed 9 selfloop flow, removed 4 redundant places. [2024-06-03 21:28:51,382 INFO L231 Difference]: Finished difference. Result has 98 places, 98 transitions, 811 flow [2024-06-03 21:28:51,382 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=696, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=811, PETRI_PLACES=98, PETRI_TRANSITIONS=98} [2024-06-03 21:28:51,383 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 55 predicate places. [2024-06-03 21:28:51,383 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 98 transitions, 811 flow [2024-06-03 21:28:51,383 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:28:51,383 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:28:51,383 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:51,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-03 21:28:51,383 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:28:51,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:28:51,384 INFO L85 PathProgramCache]: Analyzing trace with hash 205927396, now seen corresponding path program 2 times [2024-06-03 21:28:51,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:28:51,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844180693] [2024-06-03 21:28:51,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:28:51,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:28:51,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:28:59,791 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:59,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:28:59,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844180693] [2024-06-03 21:28:59,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844180693] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:28:59,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:28:59,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:28:59,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557068308] [2024-06-03 21:28:59,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:28:59,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:28:59,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:28:59,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:28:59,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:28:59,958 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:28:59,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 98 transitions, 811 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:28:59,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:28:59,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:28:59,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:29:01,114 INFO L124 PetriNetUnfolderBase]: 1630/2583 cut-off events. [2024-06-03 21:29:01,114 INFO L125 PetriNetUnfolderBase]: For 35061/35072 co-relation queries the response was YES. [2024-06-03 21:29:01,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13027 conditions, 2583 events. 1630/2583 cut-off events. For 35061/35072 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 13309 event pairs, 487 based on Foata normal form. 12/2591 useless extension candidates. Maximal degree in co-relation 12984. Up to 2377 conditions per place. [2024-06-03 21:29:01,129 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 96 selfloop transitions, 29 changer transitions 0/130 dead transitions. [2024-06-03 21:29:01,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 130 transitions, 1206 flow [2024-06-03 21:29:01,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:29:01,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:29:01,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions. [2024-06-03 21:29:01,132 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4494047619047619 [2024-06-03 21:29:01,132 INFO L175 Difference]: Start difference. First operand has 98 places, 98 transitions, 811 flow. Second operand 8 states and 151 transitions. [2024-06-03 21:29:01,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 130 transitions, 1206 flow [2024-06-03 21:29:01,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 130 transitions, 1109 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-03 21:29:01,153 INFO L231 Difference]: Finished difference. Result has 100 places, 104 transitions, 852 flow [2024-06-03 21:29:01,153 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=720, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=852, PETRI_PLACES=100, PETRI_TRANSITIONS=104} [2024-06-03 21:29:01,153 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 57 predicate places. [2024-06-03 21:29:01,153 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 104 transitions, 852 flow [2024-06-03 21:29:01,154 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:29:01,154 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:29:01,154 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,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-03 21:29:01,154 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:29:01,154 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:29:01,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1283640186, now seen corresponding path program 3 times [2024-06-03 21:29:01,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:29:01,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122276001] [2024-06-03 21:29:01,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:29:01,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:29:01,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:29:09,963 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:09,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:29:09,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122276001] [2024-06-03 21:29:09,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122276001] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:29:09,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:29:09,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:29:09,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875778328] [2024-06-03 21:29:09,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:29:09,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:29:09,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:29:09,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:29:09,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:29:10,108 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:29:10,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 104 transitions, 852 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:29:10,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:29:10,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:29:10,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:29:11,398 INFO L124 PetriNetUnfolderBase]: 1647/2630 cut-off events. [2024-06-03 21:29:11,398 INFO L125 PetriNetUnfolderBase]: For 38215/38226 co-relation queries the response was YES. [2024-06-03 21:29:11,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13481 conditions, 2630 events. 1647/2630 cut-off events. For 38215/38226 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 13771 event pairs, 502 based on Foata normal form. 12/2638 useless extension candidates. Maximal degree in co-relation 13436. Up to 2404 conditions per place. [2024-06-03 21:29:11,428 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 97 selfloop transitions, 32 changer transitions 0/134 dead transitions. [2024-06-03 21:29:11,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 134 transitions, 1247 flow [2024-06-03 21:29:11,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:29:11,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:29:11,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2024-06-03 21:29:11,433 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44642857142857145 [2024-06-03 21:29:11,433 INFO L175 Difference]: Start difference. First operand has 100 places, 104 transitions, 852 flow. Second operand 8 states and 150 transitions. [2024-06-03 21:29:11,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 134 transitions, 1247 flow [2024-06-03 21:29:11,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 134 transitions, 1160 flow, removed 15 selfloop flow, removed 5 redundant places. [2024-06-03 21:29:11,466 INFO L231 Difference]: Finished difference. Result has 103 places, 108 transitions, 893 flow [2024-06-03 21:29:11,467 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=769, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=893, PETRI_PLACES=103, PETRI_TRANSITIONS=108} [2024-06-03 21:29:11,467 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 60 predicate places. [2024-06-03 21:29:11,467 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 108 transitions, 893 flow [2024-06-03 21:29:11,467 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:29:11,468 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:29:11,468 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:11,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-03 21:29:11,468 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:29:11,469 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:29:11,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1275069306, now seen corresponding path program 4 times [2024-06-03 21:29:11,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:29:11,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650258800] [2024-06-03 21:29:11,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:29:11,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:29:11,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:29:20,617 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:20,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:29:20,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650258800] [2024-06-03 21:29:20,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650258800] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:29:20,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:29:20,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:29:20,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709054924] [2024-06-03 21:29:20,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:29:20,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:29:20,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:29:20,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:29:20,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:29:20,823 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:29:20,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 108 transitions, 893 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:29:20,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:29:20,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:29:20,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:29:22,033 INFO L124 PetriNetUnfolderBase]: 1680/2686 cut-off events. [2024-06-03 21:29:22,033 INFO L125 PetriNetUnfolderBase]: For 41175/41179 co-relation queries the response was YES. [2024-06-03 21:29:22,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13883 conditions, 2686 events. 1680/2686 cut-off events. For 41175/41179 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 14124 event pairs, 416 based on Foata normal form. 4/2682 useless extension candidates. Maximal degree in co-relation 13837. Up to 2212 conditions per place. [2024-06-03 21:29:22,049 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 81 selfloop transitions, 58 changer transitions 0/144 dead transitions. [2024-06-03 21:29:22,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 144 transitions, 1365 flow [2024-06-03 21:29:22,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:29:22,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:29:22,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 157 transitions. [2024-06-03 21:29:22,052 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46726190476190477 [2024-06-03 21:29:22,052 INFO L175 Difference]: Start difference. First operand has 103 places, 108 transitions, 893 flow. Second operand 8 states and 157 transitions. [2024-06-03 21:29:22,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 144 transitions, 1365 flow [2024-06-03 21:29:22,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 144 transitions, 1289 flow, removed 15 selfloop flow, removed 4 redundant places. [2024-06-03 21:29:22,082 INFO L231 Difference]: Finished difference. Result has 109 places, 116 transitions, 1082 flow [2024-06-03 21:29:22,082 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=817, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1082, PETRI_PLACES=109, PETRI_TRANSITIONS=116} [2024-06-03 21:29:22,082 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 66 predicate places. [2024-06-03 21:29:22,083 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 116 transitions, 1082 flow [2024-06-03 21:29:22,083 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:29:22,083 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:29:22,083 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:22,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-03 21:29:22,083 INFO L420 AbstractCegarLoop]: === Iteration 23 === 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:22,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:29:22,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1862015214, now seen corresponding path program 2 times [2024-06-03 21:29:22,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:29:22,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009482715] [2024-06-03 21:29:22,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:29:22,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:29:22,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:29:32,604 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:32,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:29:32,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009482715] [2024-06-03 21:29:32,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009482715] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:29:32,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:29:32,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 21:29:32,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417878211] [2024-06-03 21:29:32,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:29:32,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 21:29:32,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:29:32,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 21:29:32,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-03 21:29:32,747 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-03 21:29:32,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 116 transitions, 1082 flow. Second operand has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:29:32,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:29:32,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-03 21:29:32,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:29:33,644 INFO L124 PetriNetUnfolderBase]: 1563/2560 cut-off events. [2024-06-03 21:29:33,645 INFO L125 PetriNetUnfolderBase]: For 45036/45046 co-relation queries the response was YES. [2024-06-03 21:29:33,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13790 conditions, 2560 events. 1563/2560 cut-off events. For 45036/45046 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 13905 event pairs, 476 based on Foata normal form. 10/2557 useless extension candidates. Maximal degree in co-relation 13741. Up to 2315 conditions per place. [2024-06-03 21:29:33,661 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 90 selfloop transitions, 27 changer transitions 0/134 dead transitions. [2024-06-03 21:29:33,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 134 transitions, 1390 flow [2024-06-03 21:29:33,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 21:29:33,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 21:29:33,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions. [2024-06-03 21:29:33,663 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2024-06-03 21:29:33,663 INFO L175 Difference]: Start difference. First operand has 109 places, 116 transitions, 1082 flow. Second operand 7 states and 133 transitions. [2024-06-03 21:29:33,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 134 transitions, 1390 flow [2024-06-03 21:29:33,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 134 transitions, 1296 flow, removed 19 selfloop flow, removed 3 redundant places. [2024-06-03 21:29:33,699 INFO L231 Difference]: Finished difference. Result has 113 places, 119 transitions, 1084 flow [2024-06-03 21:29:33,699 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=988, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1084, PETRI_PLACES=113, PETRI_TRANSITIONS=119} [2024-06-03 21:29:33,699 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 70 predicate places. [2024-06-03 21:29:33,699 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 119 transitions, 1084 flow [2024-06-03 21:29:33,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:29:33,700 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:29:33,700 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:33,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-03 21:29:33,700 INFO L420 AbstractCegarLoop]: === Iteration 24 === 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:33,700 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:29:33,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1381389912, now seen corresponding path program 1 times [2024-06-03 21:29:33,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:29:33,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641306052] [2024-06-03 21:29:33,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:29:33,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:29:33,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:29:43,503 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:43,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:29:43,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641306052] [2024-06-03 21:29:43,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641306052] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:29:43,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:29:43,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 21:29:43,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345084833] [2024-06-03 21:29:43,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:29:43,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 21:29:43,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:29:43,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 21:29:43,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-03 21:29:43,616 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-03 21:29:43,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 119 transitions, 1084 flow. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:29:43,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:29:43,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-03 21:29:43,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:29:44,514 INFO L124 PetriNetUnfolderBase]: 1517/2502 cut-off events. [2024-06-03 21:29:44,514 INFO L125 PetriNetUnfolderBase]: For 40651/40653 co-relation queries the response was YES. [2024-06-03 21:29:44,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13176 conditions, 2502 events. 1517/2502 cut-off events. For 40651/40653 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 13496 event pairs, 424 based on Foata normal form. 2/2502 useless extension candidates. Maximal degree in co-relation 13126. Up to 2319 conditions per place. [2024-06-03 21:29:44,530 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 118 selfloop transitions, 11 changer transitions 0/135 dead transitions. [2024-06-03 21:29:44,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 135 transitions, 1414 flow [2024-06-03 21:29:44,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 21:29:44,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 21:29:44,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 115 transitions. [2024-06-03 21:29:44,532 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45634920634920634 [2024-06-03 21:29:44,532 INFO L175 Difference]: Start difference. First operand has 113 places, 119 transitions, 1084 flow. Second operand 6 states and 115 transitions. [2024-06-03 21:29:44,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 135 transitions, 1414 flow [2024-06-03 21:29:44,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 135 transitions, 1340 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-06-03 21:29:44,566 INFO L231 Difference]: Finished difference. Result has 114 places, 122 transitions, 1074 flow [2024-06-03 21:29:44,566 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1010, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1074, PETRI_PLACES=114, PETRI_TRANSITIONS=122} [2024-06-03 21:29:44,567 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 71 predicate places. [2024-06-03 21:29:44,567 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 122 transitions, 1074 flow [2024-06-03 21:29:44,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:29:44,567 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:29:44,567 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:44,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-03 21:29:44,567 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:29:44,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:29:44,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1862009262, now seen corresponding path program 2 times [2024-06-03 21:29:44,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:29:44,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679684446] [2024-06-03 21:29:44,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:29:44,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:29:44,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:29:54,409 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:54,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:29:54,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679684446] [2024-06-03 21:29:54,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679684446] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:29:54,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:29:54,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 21:29:54,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660011381] [2024-06-03 21:29:54,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:29:54,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 21:29:54,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:29:54,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 21:29:54,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-03 21:29:54,529 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-03 21:29:54,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 122 transitions, 1074 flow. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:29:54,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:29:54,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-03 21:29:54,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:29:55,378 INFO L124 PetriNetUnfolderBase]: 1519/2518 cut-off events. [2024-06-03 21:29:55,379 INFO L125 PetriNetUnfolderBase]: For 43121/43126 co-relation queries the response was YES. [2024-06-03 21:29:55,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13491 conditions, 2518 events. 1519/2518 cut-off events. For 43121/43126 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 13728 event pairs, 438 based on Foata normal form. 4/2519 useless extension candidates. Maximal degree in co-relation 13440. Up to 2313 conditions per place. [2024-06-03 21:29:55,393 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 114 selfloop transitions, 16 changer transitions 0/136 dead transitions. [2024-06-03 21:29:55,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 136 transitions, 1408 flow [2024-06-03 21:29:55,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 21:29:55,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 21:29:55,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 115 transitions. [2024-06-03 21:29:55,394 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45634920634920634 [2024-06-03 21:29:55,394 INFO L175 Difference]: Start difference. First operand has 114 places, 122 transitions, 1074 flow. Second operand 6 states and 115 transitions. [2024-06-03 21:29:55,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 136 transitions, 1408 flow [2024-06-03 21:29:55,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 136 transitions, 1366 flow, removed 12 selfloop flow, removed 4 redundant places. [2024-06-03 21:29:55,430 INFO L231 Difference]: Finished difference. Result has 116 places, 125 transitions, 1112 flow [2024-06-03 21:29:55,431 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1032, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1112, PETRI_PLACES=116, PETRI_TRANSITIONS=125} [2024-06-03 21:29:55,431 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 73 predicate places. [2024-06-03 21:29:55,431 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 125 transitions, 1112 flow [2024-06-03 21:29:55,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:29:55,431 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:29:55,432 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:55,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-03 21:29:55,432 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:29:55,432 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:29:55,432 INFO L85 PathProgramCache]: Analyzing trace with hash 892965962, now seen corresponding path program 1 times [2024-06-03 21:29:55,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:29:55,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377372370] [2024-06-03 21:29:55,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:29:55,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:29:55,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:30:05,957 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:05,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:30:05,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377372370] [2024-06-03 21:30:05,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377372370] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:30:05,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:30:05,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:30:05,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646530930] [2024-06-03 21:30:05,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:30:05,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:30:05,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:30:05,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:30:05,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:30:06,152 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:30:06,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 125 transitions, 1112 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:30:06,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:30:06,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:30:06,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:30:07,514 INFO L124 PetriNetUnfolderBase]: 1768/2850 cut-off events. [2024-06-03 21:30:07,515 INFO L125 PetriNetUnfolderBase]: For 59040/59042 co-relation queries the response was YES. [2024-06-03 21:30:07,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15974 conditions, 2850 events. 1768/2850 cut-off events. For 59040/59042 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 15416 event pairs, 485 based on Foata normal form. 12/2860 useless extension candidates. Maximal degree in co-relation 15922. Up to 2228 conditions per place. [2024-06-03 21:30:07,533 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 113 selfloop transitions, 57 changer transitions 0/175 dead transitions. [2024-06-03 21:30:07,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 175 transitions, 1678 flow [2024-06-03 21:30:07,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 21:30:07,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 21:30:07,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 211 transitions. [2024-06-03 21:30:07,544 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45670995670995673 [2024-06-03 21:30:07,544 INFO L175 Difference]: Start difference. First operand has 116 places, 125 transitions, 1112 flow. Second operand 11 states and 211 transitions. [2024-06-03 21:30:07,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 175 transitions, 1678 flow [2024-06-03 21:30:07,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 175 transitions, 1620 flow, removed 15 selfloop flow, removed 4 redundant places. [2024-06-03 21:30:07,581 INFO L231 Difference]: Finished difference. Result has 125 places, 130 transitions, 1268 flow [2024-06-03 21:30:07,581 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1054, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1268, PETRI_PLACES=125, PETRI_TRANSITIONS=130} [2024-06-03 21:30:07,582 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 82 predicate places. [2024-06-03 21:30:07,582 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 130 transitions, 1268 flow [2024-06-03 21:30:07,582 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:30:07,582 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:30:07,583 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:07,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-03 21:30:07,583 INFO L420 AbstractCegarLoop]: === Iteration 27 === 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:07,583 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:30:07,583 INFO L85 PathProgramCache]: Analyzing trace with hash 2052808564, now seen corresponding path program 1 times [2024-06-03 21:30:07,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:30:07,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893234488] [2024-06-03 21:30:07,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:30:07,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:30:07,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:30:19,128 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:19,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:30:19,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893234488] [2024-06-03 21:30:19,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893234488] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:30:19,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:30:19,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 21:30:19,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715010880] [2024-06-03 21:30:19,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:30:19,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 21:30:19,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:30:19,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 21:30:19,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-03 21:30:19,230 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-03 21:30:19,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 130 transitions, 1268 flow. Second operand has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 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:30:19,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:30:19,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-03 21:30:19,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:30:20,228 INFO L124 PetriNetUnfolderBase]: 1664/2736 cut-off events. [2024-06-03 21:30:20,228 INFO L125 PetriNetUnfolderBase]: For 62106/62116 co-relation queries the response was YES. [2024-06-03 21:30:20,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16013 conditions, 2736 events. 1664/2736 cut-off events. For 62106/62116 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 15175 event pairs, 489 based on Foata normal form. 10/2726 useless extension candidates. Maximal degree in co-relation 15958. Up to 2468 conditions per place. [2024-06-03 21:30:20,247 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 107 selfloop transitions, 24 changer transitions 0/148 dead transitions. [2024-06-03 21:30:20,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 148 transitions, 1604 flow [2024-06-03 21:30:20,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 21:30:20,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 21:30:20,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions. [2024-06-03 21:30:20,248 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4489795918367347 [2024-06-03 21:30:20,249 INFO L175 Difference]: Start difference. First operand has 125 places, 130 transitions, 1268 flow. Second operand 7 states and 132 transitions. [2024-06-03 21:30:20,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 148 transitions, 1604 flow [2024-06-03 21:30:20,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 148 transitions, 1500 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-03 21:30:20,290 INFO L231 Difference]: Finished difference. Result has 125 places, 133 transitions, 1254 flow [2024-06-03 21:30:20,290 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1164, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1254, PETRI_PLACES=125, PETRI_TRANSITIONS=133} [2024-06-03 21:30:20,291 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 82 predicate places. [2024-06-03 21:30:20,291 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 133 transitions, 1254 flow [2024-06-03 21:30:20,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 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:30:20,291 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:30:20,291 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:20,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-03 21:30:20,292 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:30:20,292 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:30:20,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1965226934, now seen corresponding path program 2 times [2024-06-03 21:30:20,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:30:20,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572488178] [2024-06-03 21:30:20,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:30:20,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:30:20,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:30:30,769 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:30,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:30:30,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572488178] [2024-06-03 21:30:30,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572488178] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:30:30,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:30:30,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:30:30,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404300332] [2024-06-03 21:30:30,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:30:30,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:30:30,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:30:30,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:30:30,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:30:30,967 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:30:30,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 133 transitions, 1254 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:30:30,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:30:30,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:30:30,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:30:32,237 INFO L124 PetriNetUnfolderBase]: 1888/3067 cut-off events. [2024-06-03 21:30:32,237 INFO L125 PetriNetUnfolderBase]: For 68607/68611 co-relation queries the response was YES. [2024-06-03 21:30:32,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17768 conditions, 3067 events. 1888/3067 cut-off events. For 68607/68611 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 17042 event pairs, 523 based on Foata normal form. 12/3071 useless extension candidates. Maximal degree in co-relation 17713. Up to 2525 conditions per place. [2024-06-03 21:30:32,258 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 108 selfloop transitions, 62 changer transitions 0/175 dead transitions. [2024-06-03 21:30:32,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 175 transitions, 1811 flow [2024-06-03 21:30:32,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:30:32,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:30:32,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 175 transitions. [2024-06-03 21:30:32,261 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46296296296296297 [2024-06-03 21:30:32,261 INFO L175 Difference]: Start difference. First operand has 125 places, 133 transitions, 1254 flow. Second operand 9 states and 175 transitions. [2024-06-03 21:30:32,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 175 transitions, 1811 flow [2024-06-03 21:30:32,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 175 transitions, 1743 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-06-03 21:30:32,316 INFO L231 Difference]: Finished difference. Result has 131 places, 141 transitions, 1436 flow [2024-06-03 21:30:32,317 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1186, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1436, PETRI_PLACES=131, PETRI_TRANSITIONS=141} [2024-06-03 21:30:32,317 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 88 predicate places. [2024-06-03 21:30:32,317 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 141 transitions, 1436 flow [2024-06-03 21:30:32,317 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:30:32,317 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:30:32,317 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:32,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-03 21:30:32,318 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:30:32,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:30:32,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1956030164, now seen corresponding path program 3 times [2024-06-03 21:30:32,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:30:32,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001504783] [2024-06-03 21:30:32,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:30:32,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:30:32,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:30:42,017 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:42,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:30:42,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001504783] [2024-06-03 21:30:42,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001504783] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:30:42,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:30:42,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:30:42,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704141733] [2024-06-03 21:30:42,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:30:42,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:30:42,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:30:42,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:30:42,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:30:42,272 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:30:42,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 141 transitions, 1436 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:30:42,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:30:42,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:30:42,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:30:43,528 INFO L124 PetriNetUnfolderBase]: 1970/3229 cut-off events. [2024-06-03 21:30:43,528 INFO L125 PetriNetUnfolderBase]: For 76890/76894 co-relation queries the response was YES. [2024-06-03 21:30:43,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19085 conditions, 3229 events. 1970/3229 cut-off events. For 76890/76894 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 18341 event pairs, 494 based on Foata normal form. 12/3233 useless extension candidates. Maximal degree in co-relation 19027. Up to 2071 conditions per place. [2024-06-03 21:30:43,549 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 102 selfloop transitions, 72 changer transitions 0/179 dead transitions. [2024-06-03 21:30:43,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 179 transitions, 2024 flow [2024-06-03 21:30:43,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:30:43,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:30:43,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 176 transitions. [2024-06-03 21:30:43,552 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4656084656084656 [2024-06-03 21:30:43,552 INFO L175 Difference]: Start difference. First operand has 131 places, 141 transitions, 1436 flow. Second operand 9 states and 176 transitions. [2024-06-03 21:30:43,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 179 transitions, 2024 flow [2024-06-03 21:30:43,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 179 transitions, 1934 flow, removed 14 selfloop flow, removed 3 redundant places. [2024-06-03 21:30:43,635 INFO L231 Difference]: Finished difference. Result has 138 places, 143 transitions, 1574 flow [2024-06-03 21:30:43,635 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1346, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1574, PETRI_PLACES=138, PETRI_TRANSITIONS=143} [2024-06-03 21:30:43,636 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 95 predicate places. [2024-06-03 21:30:43,636 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 143 transitions, 1574 flow [2024-06-03 21:30:43,636 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:30:43,636 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:30:43,637 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:43,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-03 21:30:43,637 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:30:43,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:30:43,637 INFO L85 PathProgramCache]: Analyzing trace with hash 386859982, now seen corresponding path program 4 times [2024-06-03 21:30:43,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:30:43,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690354411] [2024-06-03 21:30:43,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:30:43,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:30:43,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:30:53,397 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:53,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:30:53,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690354411] [2024-06-03 21:30:53,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690354411] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:30:53,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:30:53,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:30:53,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612825608] [2024-06-03 21:30:53,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:30:53,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:30:53,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:30:53,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:30:53,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:30:53,628 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:30:53,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 143 transitions, 1574 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:30:53,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:30:53,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:30:53,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:30:54,966 INFO L124 PetriNetUnfolderBase]: 1950/3197 cut-off events. [2024-06-03 21:30:54,967 INFO L125 PetriNetUnfolderBase]: For 77105/77109 co-relation queries the response was YES. [2024-06-03 21:30:54,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18713 conditions, 3197 events. 1950/3197 cut-off events. For 77105/77109 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 18203 event pairs, 539 based on Foata normal form. 12/3201 useless extension candidates. Maximal degree in co-relation 18653. Up to 2635 conditions per place. [2024-06-03 21:30:54,990 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 112 selfloop transitions, 59 changer transitions 0/176 dead transitions. [2024-06-03 21:30:54,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 176 transitions, 2004 flow [2024-06-03 21:30:54,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:30:54,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:30:54,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 175 transitions. [2024-06-03 21:30:54,993 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46296296296296297 [2024-06-03 21:30:54,993 INFO L175 Difference]: Start difference. First operand has 138 places, 143 transitions, 1574 flow. Second operand 9 states and 175 transitions. [2024-06-03 21:30:54,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 176 transitions, 2004 flow [2024-06-03 21:30:55,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 176 transitions, 1854 flow, removed 17 selfloop flow, removed 6 redundant places. [2024-06-03 21:30:55,076 INFO L231 Difference]: Finished difference. Result has 140 places, 142 transitions, 1502 flow [2024-06-03 21:30:55,077 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1380, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1502, PETRI_PLACES=140, PETRI_TRANSITIONS=142} [2024-06-03 21:30:55,077 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 97 predicate places. [2024-06-03 21:30:55,077 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 142 transitions, 1502 flow [2024-06-03 21:30:55,078 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:30:55,078 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:30:55,078 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:55,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-03 21:30:55,078 INFO L420 AbstractCegarLoop]: === Iteration 31 === 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:55,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:30:55,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1887479982, now seen corresponding path program 2 times [2024-06-03 21:30:55,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:30:55,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804708214] [2024-06-03 21:30:55,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:30:55,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:30:55,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:31:06,550 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:06,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:31:06,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804708214] [2024-06-03 21:31:06,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804708214] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:31:06,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:31:06,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 21:31:06,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134397411] [2024-06-03 21:31:06,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:31:06,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 21:31:06,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:31:06,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 21:31:06,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-03 21:31:06,696 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-03 21:31:06,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 142 transitions, 1502 flow. Second operand has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 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:31:06,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:31:06,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-03 21:31:06,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:31:07,787 INFO L124 PetriNetUnfolderBase]: 1814/3019 cut-off events. [2024-06-03 21:31:07,789 INFO L125 PetriNetUnfolderBase]: For 76093/76109 co-relation queries the response was YES. [2024-06-03 21:31:07,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17774 conditions, 3019 events. 1814/3019 cut-off events. For 76093/76109 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 17518 event pairs, 525 based on Foata normal form. 12/2994 useless extension candidates. Maximal degree in co-relation 17713. Up to 2716 conditions per place. [2024-06-03 21:31:07,811 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 108 selfloop transitions, 36 changer transitions 0/161 dead transitions. [2024-06-03 21:31:07,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 161 transitions, 1958 flow [2024-06-03 21:31:07,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 21:31:07,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 21:31:07,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2024-06-03 21:31:07,813 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4387755102040816 [2024-06-03 21:31:07,813 INFO L175 Difference]: Start difference. First operand has 140 places, 142 transitions, 1502 flow. Second operand 7 states and 129 transitions. [2024-06-03 21:31:07,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 161 transitions, 1958 flow [2024-06-03 21:31:07,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 161 transitions, 1749 flow, removed 12 selfloop flow, removed 9 redundant places. [2024-06-03 21:31:07,886 INFO L231 Difference]: Finished difference. Result has 139 places, 150 transitions, 1472 flow [2024-06-03 21:31:07,886 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1293, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1472, PETRI_PLACES=139, PETRI_TRANSITIONS=150} [2024-06-03 21:31:07,886 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 96 predicate places. [2024-06-03 21:31:07,886 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 150 transitions, 1472 flow [2024-06-03 21:31:07,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 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:31:07,887 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:31:07,887 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:07,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-03 21:31:07,887 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 21:31:07,888 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:31:07,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1887895692, now seen corresponding path program 3 times [2024-06-03 21:31:07,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:31:07,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492452284] [2024-06-03 21:31:07,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:31:07,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:31:07,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:31:19,026 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:19,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:31:19,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492452284] [2024-06-03 21:31:19,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492452284] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:31:19,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:31:19,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 21:31:19,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541969313] [2024-06-03 21:31:19,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:31:19,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 21:31:19,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:31:19,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 21:31:19,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-03 21:31:19,188 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-03 21:31:19,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 150 transitions, 1472 flow. Second operand has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 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:31:19,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:31:19,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-03 21:31:19,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:31:20,192 INFO L124 PetriNetUnfolderBase]: 1810/3012 cut-off events. [2024-06-03 21:31:20,192 INFO L125 PetriNetUnfolderBase]: For 78023/78039 co-relation queries the response was YES. [2024-06-03 21:31:20,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17651 conditions, 3012 events. 1810/3012 cut-off events. For 78023/78039 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 17452 event pairs, 524 based on Foata normal form. 11/2987 useless extension candidates. Maximal degree in co-relation 17591. Up to 2725 conditions per place. [2024-06-03 21:31:20,265 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 115 selfloop transitions, 29 changer transitions 0/161 dead transitions. [2024-06-03 21:31:20,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 161 transitions, 1795 flow [2024-06-03 21:31:20,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 21:31:20,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 21:31:20,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions. [2024-06-03 21:31:20,266 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43197278911564624 [2024-06-03 21:31:20,266 INFO L175 Difference]: Start difference. First operand has 139 places, 150 transitions, 1472 flow. Second operand 7 states and 127 transitions. [2024-06-03 21:31:20,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 161 transitions, 1795 flow [2024-06-03 21:31:20,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 161 transitions, 1711 flow, removed 26 selfloop flow, removed 3 redundant places. [2024-06-03 21:31:20,326 INFO L231 Difference]: Finished difference. Result has 143 places, 151 transitions, 1461 flow [2024-06-03 21:31:20,326 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1388, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1461, PETRI_PLACES=143, PETRI_TRANSITIONS=151} [2024-06-03 21:31:20,326 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 100 predicate places. [2024-06-03 21:31:20,326 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 151 transitions, 1461 flow [2024-06-03 21:31:20,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 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:31:20,327 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:31:20,327 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:20,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-03 21:31:20,327 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 21:31:20,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:31:20,328 INFO L85 PathProgramCache]: Analyzing trace with hash -2064962856, now seen corresponding path program 1 times [2024-06-03 21:31:20,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:31:20,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338849517] [2024-06-03 21:31:20,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:31:20,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:31:20,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:31:30,622 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:30,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:31:30,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338849517] [2024-06-03 21:31:30,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338849517] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:31:30,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:31:30,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 21:31:30,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976988205] [2024-06-03 21:31:30,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:31:30,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 21:31:30,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:31:30,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 21:31:30,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 21:31:30,744 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-03 21:31:30,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 151 transitions, 1461 flow. Second operand has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 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:31:30,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:31:30,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-03 21:31:30,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:31:31,825 INFO L124 PetriNetUnfolderBase]: 1866/3113 cut-off events. [2024-06-03 21:31:31,826 INFO L125 PetriNetUnfolderBase]: For 82318/82320 co-relation queries the response was YES. [2024-06-03 21:31:31,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18241 conditions, 3113 events. 1866/3113 cut-off events. For 82318/82320 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 18076 event pairs, 522 based on Foata normal form. 1/3112 useless extension candidates. Maximal degree in co-relation 18179. Up to 2847 conditions per place. [2024-06-03 21:31:31,848 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 146 selfloop transitions, 14 changer transitions 0/170 dead transitions. [2024-06-03 21:31:31,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 170 transitions, 1871 flow [2024-06-03 21:31:31,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 21:31:31,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 21:31:31,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions. [2024-06-03 21:31:31,849 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.445578231292517 [2024-06-03 21:31:31,850 INFO L175 Difference]: Start difference. First operand has 143 places, 151 transitions, 1461 flow. Second operand 7 states and 131 transitions. [2024-06-03 21:31:31,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 170 transitions, 1871 flow [2024-06-03 21:31:31,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 170 transitions, 1809 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-03 21:31:31,934 INFO L231 Difference]: Finished difference. Result has 145 places, 154 transitions, 1481 flow [2024-06-03 21:31:31,935 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1399, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1481, PETRI_PLACES=145, PETRI_TRANSITIONS=154} [2024-06-03 21:31:31,935 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 102 predicate places. [2024-06-03 21:31:31,935 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 154 transitions, 1481 flow [2024-06-03 21:31:31,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 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:31:31,935 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:31:31,935 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:31:31,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-03 21:31:31,936 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:31:31,936 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:31:31,936 INFO L85 PathProgramCache]: Analyzing trace with hash -2064842700, now seen corresponding path program 1 times [2024-06-03 21:31:31,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:31:31,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41228750] [2024-06-03 21:31:31,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:31:31,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:31:31,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:31:45,213 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:45,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:31:45,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41228750] [2024-06-03 21:31:45,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41228750] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:31:45,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:31:45,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 21:31:45,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524313152] [2024-06-03 21:31:45,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:31:45,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 21:31:45,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:31:45,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 21:31:45,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-03 21:31:45,336 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-03 21:31:45,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 154 transitions, 1481 flow. Second operand has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 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:31:45,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:31:45,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-03 21:31:45,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:31:46,442 INFO L124 PetriNetUnfolderBase]: 1876/3131 cut-off events. [2024-06-03 21:31:46,442 INFO L125 PetriNetUnfolderBase]: For 88916/88918 co-relation queries the response was YES. [2024-06-03 21:31:46,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18704 conditions, 3131 events. 1876/3131 cut-off events. For 88916/88918 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 18187 event pairs, 521 based on Foata normal form. 4/3133 useless extension candidates. Maximal degree in co-relation 18641. Up to 2861 conditions per place. [2024-06-03 21:31:46,467 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 147 selfloop transitions, 15 changer transitions 0/172 dead transitions. [2024-06-03 21:31:46,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 172 transitions, 1893 flow [2024-06-03 21:31:46,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 21:31:46,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 21:31:46,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 130 transitions. [2024-06-03 21:31:46,469 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4421768707482993 [2024-06-03 21:31:46,469 INFO L175 Difference]: Start difference. First operand has 145 places, 154 transitions, 1481 flow. Second operand 7 states and 130 transitions. [2024-06-03 21:31:46,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 172 transitions, 1893 flow [2024-06-03 21:31:46,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 172 transitions, 1833 flow, removed 18 selfloop flow, removed 5 redundant places. [2024-06-03 21:31:46,542 INFO L231 Difference]: Finished difference. Result has 147 places, 158 transitions, 1510 flow [2024-06-03 21:31:46,542 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1421, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1510, PETRI_PLACES=147, PETRI_TRANSITIONS=158} [2024-06-03 21:31:46,543 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 104 predicate places. [2024-06-03 21:31:46,543 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 158 transitions, 1510 flow [2024-06-03 21:31:46,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 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:31:46,543 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:31:46,543 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:46,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-03 21:31:46,543 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:31:46,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:31:46,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1887711180, now seen corresponding path program 2 times [2024-06-03 21:31:46,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:31:46,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880089158] [2024-06-03 21:31:46,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:31:46,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:31:46,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:31:57,958 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:57,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:31:57,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880089158] [2024-06-03 21:31:57,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880089158] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:31:57,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:31:57,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 21:31:57,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593938757] [2024-06-03 21:31:57,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:31:57,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 21:31:57,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:31:57,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 21:31:57,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-03 21:31:58,109 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-03 21:31:58,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 158 transitions, 1510 flow. Second operand has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 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:31:58,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:31:58,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-03 21:31:58,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:31:59,155 INFO L124 PetriNetUnfolderBase]: 1901/3169 cut-off events. [2024-06-03 21:31:59,156 INFO L125 PetriNetUnfolderBase]: For 95980/95985 co-relation queries the response was YES. [2024-06-03 21:31:59,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19472 conditions, 3169 events. 1901/3169 cut-off events. For 95980/95985 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 18430 event pairs, 524 based on Foata normal form. 8/3174 useless extension candidates. Maximal degree in co-relation 19408. Up to 2879 conditions per place. [2024-06-03 21:31:59,178 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 144 selfloop transitions, 22 changer transitions 0/176 dead transitions. [2024-06-03 21:31:59,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 176 transitions, 1950 flow [2024-06-03 21:31:59,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:31:59,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:31:59,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions. [2024-06-03 21:31:59,180 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4255952380952381 [2024-06-03 21:31:59,180 INFO L175 Difference]: Start difference. First operand has 147 places, 158 transitions, 1510 flow. Second operand 8 states and 143 transitions. [2024-06-03 21:31:59,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 176 transitions, 1950 flow [2024-06-03 21:31:59,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 176 transitions, 1887 flow, removed 18 selfloop flow, removed 5 redundant places. [2024-06-03 21:31:59,256 INFO L231 Difference]: Finished difference. Result has 151 places, 164 transitions, 1573 flow [2024-06-03 21:31:59,256 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1449, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1573, PETRI_PLACES=151, PETRI_TRANSITIONS=164} [2024-06-03 21:31:59,256 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 108 predicate places. [2024-06-03 21:31:59,256 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 164 transitions, 1573 flow [2024-06-03 21:31:59,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 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:31:59,257 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:31:59,257 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:59,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-03 21:31:59,257 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:31:59,257 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:31:59,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1042262038, now seen corresponding path program 3 times [2024-06-03 21:31:59,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:31:59,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061247675] [2024-06-03 21:31:59,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:31:59,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:31:59,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:32:11,476 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:11,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:32:11,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061247675] [2024-06-03 21:32:11,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061247675] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:32:11,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:32:11,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 21:32:11,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687033273] [2024-06-03 21:32:11,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:32:11,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 21:32:11,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:32:11,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 21:32:11,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-03 21:32:11,653 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42 [2024-06-03 21:32:11,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 164 transitions, 1573 flow. Second operand has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:32:11,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:32:11,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42 [2024-06-03 21:32:11,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:32:12,715 INFO L124 PetriNetUnfolderBase]: 1895/3161 cut-off events. [2024-06-03 21:32:12,716 INFO L125 PetriNetUnfolderBase]: For 98140/98145 co-relation queries the response was YES. [2024-06-03 21:32:12,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19919 conditions, 3161 events. 1895/3161 cut-off events. For 98140/98145 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 18375 event pairs, 524 based on Foata normal form. 4/3162 useless extension candidates. Maximal degree in co-relation 19853. Up to 2863 conditions per place. [2024-06-03 21:32:12,742 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 139 selfloop transitions, 32 changer transitions 0/181 dead transitions. [2024-06-03 21:32:12,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 181 transitions, 2048 flow [2024-06-03 21:32:12,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 21:32:12,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 21:32:12,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 137 transitions. [2024-06-03 21:32:12,747 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46598639455782315 [2024-06-03 21:32:12,747 INFO L175 Difference]: Start difference. First operand has 151 places, 164 transitions, 1573 flow. Second operand 7 states and 137 transitions. [2024-06-03 21:32:12,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 181 transitions, 2048 flow [2024-06-03 21:32:12,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 181 transitions, 1949 flow, removed 33 selfloop flow, removed 4 redundant places. [2024-06-03 21:32:12,827 INFO L231 Difference]: Finished difference. Result has 155 places, 171 transitions, 1672 flow [2024-06-03 21:32:12,828 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1509, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1672, PETRI_PLACES=155, PETRI_TRANSITIONS=171} [2024-06-03 21:32:12,828 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 112 predicate places. [2024-06-03 21:32:12,828 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 171 transitions, 1672 flow [2024-06-03 21:32:12,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:32:12,829 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:32:12,829 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:12,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-03 21:32:12,829 INFO L420 AbstractCegarLoop]: === Iteration 37 === 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:12,829 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:32:12,829 INFO L85 PathProgramCache]: Analyzing trace with hash -171499980, now seen corresponding path program 1 times [2024-06-03 21:32:12,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:32:12,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105823353] [2024-06-03 21:32:12,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:32:12,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:32:12,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:32:24,721 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:24,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:32:24,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105823353] [2024-06-03 21:32:24,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105823353] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:32:24,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:32:24,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:32:24,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137418177] [2024-06-03 21:32:24,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:32:24,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:32:24,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:32:24,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:32:24,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:32:24,930 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-03 21:32:24,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 171 transitions, 1672 flow. Second operand has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:32:24,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:32:24,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-03 21:32:24,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:32:26,022 INFO L124 PetriNetUnfolderBase]: 1843/3069 cut-off events. [2024-06-03 21:32:26,022 INFO L125 PetriNetUnfolderBase]: For 102236/102250 co-relation queries the response was YES. [2024-06-03 21:32:26,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19923 conditions, 3069 events. 1843/3069 cut-off events. For 102236/102250 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 17871 event pairs, 521 based on Foata normal form. 9/3053 useless extension candidates. Maximal degree in co-relation 19854. Up to 2815 conditions per place. [2024-06-03 21:32:26,047 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 149 selfloop transitions, 18 changer transitions 0/184 dead transitions. [2024-06-03 21:32:26,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 184 transitions, 2080 flow [2024-06-03 21:32:26,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:32:26,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:32:26,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions. [2024-06-03 21:32:26,048 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2024-06-03 21:32:26,048 INFO L175 Difference]: Start difference. First operand has 155 places, 171 transitions, 1672 flow. Second operand 8 states and 140 transitions. [2024-06-03 21:32:26,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 184 transitions, 2080 flow [2024-06-03 21:32:26,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 184 transitions, 2029 flow, removed 16 selfloop flow, removed 3 redundant places. [2024-06-03 21:32:26,116 INFO L231 Difference]: Finished difference. Result has 160 places, 174 transitions, 1717 flow [2024-06-03 21:32:26,116 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1621, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1717, PETRI_PLACES=160, PETRI_TRANSITIONS=174} [2024-06-03 21:32:26,117 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 117 predicate places. [2024-06-03 21:32:26,117 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 174 transitions, 1717 flow [2024-06-03 21:32:26,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:32:26,117 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:32:26,117 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:32:26,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-03 21:32:26,118 INFO L420 AbstractCegarLoop]: === Iteration 38 === 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:26,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:32:26,118 INFO L85 PathProgramCache]: Analyzing trace with hash -793164687, now seen corresponding path program 1 times [2024-06-03 21:32:26,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:32:26,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124727037] [2024-06-03 21:32:26,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:32:26,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:32:26,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:32:36,438 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:36,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:32:36,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124727037] [2024-06-03 21:32:36,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124727037] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:32:36,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:32:36,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:32:36,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705954613] [2024-06-03 21:32:36,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:32:36,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:32:36,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:32:36,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:32:36,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:32:36,619 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:32:36,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 174 transitions, 1717 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:32:36,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:32:36,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:32:36,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:32:37,842 INFO L124 PetriNetUnfolderBase]: 2002/3275 cut-off events. [2024-06-03 21:32:37,843 INFO L125 PetriNetUnfolderBase]: For 108257/108264 co-relation queries the response was YES. [2024-06-03 21:32:37,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21255 conditions, 3275 events. 2002/3275 cut-off events. For 108257/108264 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 18629 event pairs, 540 based on Foata normal form. 8/3280 useless extension candidates. Maximal degree in co-relation 21184. Up to 3045 conditions per place. [2024-06-03 21:32:37,873 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 169 selfloop transitions, 23 changer transitions 0/197 dead transitions. [2024-06-03 21:32:37,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 197 transitions, 2221 flow [2024-06-03 21:32:37,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 21:32:37,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 21:32:37,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions. [2024-06-03 21:32:37,874 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.445578231292517 [2024-06-03 21:32:37,875 INFO L175 Difference]: Start difference. First operand has 160 places, 174 transitions, 1717 flow. Second operand 7 states and 131 transitions. [2024-06-03 21:32:37,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 197 transitions, 2221 flow [2024-06-03 21:32:37,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 197 transitions, 2117 flow, removed 25 selfloop flow, removed 7 redundant places. [2024-06-03 21:32:37,981 INFO L231 Difference]: Finished difference. Result has 160 places, 177 transitions, 1717 flow [2024-06-03 21:32:37,981 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1613, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1717, PETRI_PLACES=160, PETRI_TRANSITIONS=177} [2024-06-03 21:32:37,982 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 117 predicate places. [2024-06-03 21:32:37,982 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 177 transitions, 1717 flow [2024-06-03 21:32:37,982 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:32:37,982 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:32:37,982 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:32:37,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-03 21:32:37,982 INFO L420 AbstractCegarLoop]: === Iteration 39 === 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:37,983 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:32:37,983 INFO L85 PathProgramCache]: Analyzing trace with hash -787450767, now seen corresponding path program 2 times [2024-06-03 21:32:37,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:32:37,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321269306] [2024-06-03 21:32:37,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:32:37,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:32:38,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:32:48,841 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:48,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:32:48,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321269306] [2024-06-03 21:32:48,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321269306] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:32:48,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:32:48,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:32:48,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453779935] [2024-06-03 21:32:48,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:32:48,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:32:48,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:32:48,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:32:48,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:32:49,007 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:32:49,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 177 transitions, 1717 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:32:49,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:32:49,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:32:49,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:32:50,279 INFO L124 PetriNetUnfolderBase]: 2028/3317 cut-off events. [2024-06-03 21:32:50,279 INFO L125 PetriNetUnfolderBase]: For 116389/116396 co-relation queries the response was YES. [2024-06-03 21:32:50,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22044 conditions, 3317 events. 2028/3317 cut-off events. For 116389/116396 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 18990 event pairs, 541 based on Foata normal form. 8/3322 useless extension candidates. Maximal degree in co-relation 21973. Up to 3061 conditions per place. [2024-06-03 21:32:50,308 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 170 selfloop transitions, 29 changer transitions 0/204 dead transitions. [2024-06-03 21:32:50,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 204 transitions, 2382 flow [2024-06-03 21:32:50,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 21:32:50,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 21:32:50,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions. [2024-06-03 21:32:50,309 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.445578231292517 [2024-06-03 21:32:50,309 INFO L175 Difference]: Start difference. First operand has 160 places, 177 transitions, 1717 flow. Second operand 7 states and 131 transitions. [2024-06-03 21:32:50,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 204 transitions, 2382 flow [2024-06-03 21:32:50,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 204 transitions, 2316 flow, removed 18 selfloop flow, removed 4 redundant places. [2024-06-03 21:32:50,397 INFO L231 Difference]: Finished difference. Result has 164 places, 185 transitions, 1852 flow [2024-06-03 21:32:50,397 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1651, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1852, PETRI_PLACES=164, PETRI_TRANSITIONS=185} [2024-06-03 21:32:50,398 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 121 predicate places. [2024-06-03 21:32:50,398 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 185 transitions, 1852 flow [2024-06-03 21:32:50,398 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:32:50,398 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:32:50,398 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:32:50,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-03 21:32:50,398 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 21:32:50,399 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:32:50,399 INFO L85 PathProgramCache]: Analyzing trace with hash 943682369, now seen corresponding path program 1 times [2024-06-03 21:32:50,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:32:50,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691356865] [2024-06-03 21:32:50,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:32:50,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:32:50,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:33:02,346 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:02,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:33:02,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691356865] [2024-06-03 21:33:02,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691356865] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:33:02,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:33:02,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:33:02,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455550643] [2024-06-03 21:33:02,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:33:02,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:33:02,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:33:02,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:33:02,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:33:02,534 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-03 21:33:02,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 185 transitions, 1852 flow. Second operand has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:33:02,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:33:02,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-03 21:33:02,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:33:03,751 INFO L124 PetriNetUnfolderBase]: 1883/3135 cut-off events. [2024-06-03 21:33:03,752 INFO L125 PetriNetUnfolderBase]: For 123941/123971 co-relation queries the response was YES. [2024-06-03 21:33:03,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21590 conditions, 3135 events. 1883/3135 cut-off events. For 123941/123971 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 18339 event pairs, 514 based on Foata normal form. 12/3120 useless extension candidates. Maximal degree in co-relation 21517. Up to 2808 conditions per place. [2024-06-03 21:33:03,777 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 154 selfloop transitions, 30 changer transitions 0/204 dead transitions. [2024-06-03 21:33:03,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 204 transitions, 2314 flow [2024-06-03 21:33:03,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:33:03,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:33:03,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2024-06-03 21:33:03,778 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4375 [2024-06-03 21:33:03,779 INFO L175 Difference]: Start difference. First operand has 164 places, 185 transitions, 1852 flow. Second operand 8 states and 147 transitions. [2024-06-03 21:33:03,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 204 transitions, 2314 flow [2024-06-03 21:33:03,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 204 transitions, 2242 flow, removed 25 selfloop flow, removed 3 redundant places. [2024-06-03 21:33:03,874 INFO L231 Difference]: Finished difference. Result has 169 places, 188 transitions, 1896 flow [2024-06-03 21:33:03,875 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1780, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1896, PETRI_PLACES=169, PETRI_TRANSITIONS=188} [2024-06-03 21:33:03,875 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 126 predicate places. [2024-06-03 21:33:03,875 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 188 transitions, 1896 flow [2024-06-03 21:33:03,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:33:03,876 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:33:03,876 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:33:03,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-03 21:33:03,876 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 21:33:03,876 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:33:03,876 INFO L85 PathProgramCache]: Analyzing trace with hash 402945137, now seen corresponding path program 3 times [2024-06-03 21:33:03,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:33:03,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094596389] [2024-06-03 21:33:03,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:33:03,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:33:03,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:33:13,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:33:13,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:33:13,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094596389] [2024-06-03 21:33:13,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094596389] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:33:13,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:33:13,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:33:13,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489159729] [2024-06-03 21:33:13,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:33:13,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:33:13,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:33:13,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:33:13,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:33:14,043 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:33:14,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 188 transitions, 1896 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:14,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:33:14,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:33:14,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:33:15,283 INFO L124 PetriNetUnfolderBase]: 2042/3334 cut-off events. [2024-06-03 21:33:15,284 INFO L125 PetriNetUnfolderBase]: For 128285/128289 co-relation queries the response was YES. [2024-06-03 21:33:15,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23061 conditions, 3334 events. 2042/3334 cut-off events. For 128285/128289 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 18997 event pairs, 540 based on Foata normal form. 6/3338 useless extension candidates. Maximal degree in co-relation 22986. Up to 3101 conditions per place. [2024-06-03 21:33:15,312 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 188 selfloop transitions, 24 changer transitions 0/217 dead transitions. [2024-06-03 21:33:15,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 217 transitions, 2431 flow [2024-06-03 21:33:15,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:33:15,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:33:15,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 163 transitions. [2024-06-03 21:33:15,313 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4312169312169312 [2024-06-03 21:33:15,313 INFO L175 Difference]: Start difference. First operand has 169 places, 188 transitions, 1896 flow. Second operand 9 states and 163 transitions. [2024-06-03 21:33:15,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 217 transitions, 2431 flow [2024-06-03 21:33:15,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 217 transitions, 2307 flow, removed 34 selfloop flow, removed 6 redundant places. [2024-06-03 21:33:15,423 INFO L231 Difference]: Finished difference. Result has 172 places, 189 transitions, 1841 flow [2024-06-03 21:33:15,423 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1778, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1841, PETRI_PLACES=172, PETRI_TRANSITIONS=189} [2024-06-03 21:33:15,424 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 129 predicate places. [2024-06-03 21:33:15,424 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 189 transitions, 1841 flow [2024-06-03 21:33:15,424 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:15,424 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:33:15,424 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:33:15,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-03 21:33:15,424 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:33:15,425 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:33:15,425 INFO L85 PathProgramCache]: Analyzing trace with hash 414372977, now seen corresponding path program 4 times [2024-06-03 21:33:15,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:33:15,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938220411] [2024-06-03 21:33:15,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:33:15,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:33:15,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:33:24,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:33:24,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:33:24,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938220411] [2024-06-03 21:33:24,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938220411] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:33:24,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:33:24,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 21:33:24,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075245189] [2024-06-03 21:33:24,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:33:24,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 21:33:24,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:33:24,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 21:33:24,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 21:33:25,066 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:33:25,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 189 transitions, 1841 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:25,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:33:25,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:33:25,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:33:26,228 INFO L124 PetriNetUnfolderBase]: 2052/3349 cut-off events. [2024-06-03 21:33:26,228 INFO L125 PetriNetUnfolderBase]: For 133488/133497 co-relation queries the response was YES. [2024-06-03 21:33:26,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23164 conditions, 3349 events. 2052/3349 cut-off events. For 133488/133497 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 19116 event pairs, 545 based on Foata normal form. 8/3353 useless extension candidates. Maximal degree in co-relation 23088. Up to 3095 conditions per place. [2024-06-03 21:33:26,257 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 173 selfloop transitions, 30 changer transitions 0/208 dead transitions. [2024-06-03 21:33:26,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 208 transitions, 2375 flow [2024-06-03 21:33:26,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 21:33:26,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 21:33:26,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions. [2024-06-03 21:33:26,260 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43197278911564624 [2024-06-03 21:33:26,260 INFO L175 Difference]: Start difference. First operand has 172 places, 189 transitions, 1841 flow. Second operand 7 states and 127 transitions. [2024-06-03 21:33:26,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 208 transitions, 2375 flow [2024-06-03 21:33:26,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 208 transitions, 2296 flow, removed 4 selfloop flow, removed 9 redundant places. [2024-06-03 21:33:26,365 INFO L231 Difference]: Finished difference. Result has 170 places, 192 transitions, 1892 flow [2024-06-03 21:33:26,365 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1762, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1892, PETRI_PLACES=170, PETRI_TRANSITIONS=192} [2024-06-03 21:33:26,365 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 127 predicate places. [2024-06-03 21:33:26,366 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 192 transitions, 1892 flow [2024-06-03 21:33:26,366 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:26,366 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:33:26,366 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:33:26,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-03 21:33:26,366 INFO L420 AbstractCegarLoop]: === Iteration 43 === 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:26,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:33:26,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1610482801, now seen corresponding path program 5 times [2024-06-03 21:33:26,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:33:26,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786638405] [2024-06-03 21:33:26,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:33:26,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:33:26,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:33:36,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:33:36,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:33:36,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786638405] [2024-06-03 21:33:36,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786638405] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:33:36,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:33:36,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 21:33:36,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139273638] [2024-06-03 21:33:36,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:33:36,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 21:33:36,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:33:36,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 21:33:36,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 21:33:36,806 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:33:36,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 192 transitions, 1892 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:36,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:33:36,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:33:36,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:33:37,975 INFO L124 PetriNetUnfolderBase]: 2070/3383 cut-off events. [2024-06-03 21:33:37,975 INFO L125 PetriNetUnfolderBase]: For 142537/142549 co-relation queries the response was YES. [2024-06-03 21:33:37,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23897 conditions, 3383 events. 2070/3383 cut-off events. For 142537/142549 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 19437 event pairs, 558 based on Foata normal form. 10/3386 useless extension candidates. Maximal degree in co-relation 23820. Up to 3080 conditions per place. [2024-06-03 21:33:38,005 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 165 selfloop transitions, 46 changer transitions 0/216 dead transitions. [2024-06-03 21:33:38,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 216 transitions, 2627 flow [2024-06-03 21:33:38,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 21:33:38,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 21:33:38,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 128 transitions. [2024-06-03 21:33:38,006 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43537414965986393 [2024-06-03 21:33:38,006 INFO L175 Difference]: Start difference. First operand has 170 places, 192 transitions, 1892 flow. Second operand 7 states and 128 transitions. [2024-06-03 21:33:38,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 216 transitions, 2627 flow [2024-06-03 21:33:38,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 216 transitions, 2523 flow, removed 24 selfloop flow, removed 5 redundant places. [2024-06-03 21:33:38,124 INFO L231 Difference]: Finished difference. Result has 173 places, 201 transitions, 2078 flow [2024-06-03 21:33:38,124 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1788, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2078, PETRI_PLACES=173, PETRI_TRANSITIONS=201} [2024-06-03 21:33:38,125 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 130 predicate places. [2024-06-03 21:33:38,125 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 201 transitions, 2078 flow [2024-06-03 21:33:38,125 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:38,125 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:33:38,125 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:33:38,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-03 21:33:38,126 INFO L420 AbstractCegarLoop]: === Iteration 44 === 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:38,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:33:38,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1604768881, now seen corresponding path program 6 times [2024-06-03 21:33:38,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:33:38,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654254053] [2024-06-03 21:33:38,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:33:38,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:33:38,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:33:49,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:33:49,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:33:49,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654254053] [2024-06-03 21:33:49,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654254053] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:33:49,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:33:49,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 21:33:49,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777708316] [2024-06-03 21:33:49,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:33:49,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 21:33:49,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:33:49,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 21:33:49,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 21:33:49,303 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:33:49,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 201 transitions, 2078 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:49,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:33:49,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:33:49,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:33:50,440 INFO L124 PetriNetUnfolderBase]: 2064/3373 cut-off events. [2024-06-03 21:33:50,440 INFO L125 PetriNetUnfolderBase]: For 148879/148891 co-relation queries the response was YES. [2024-06-03 21:33:50,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24229 conditions, 3373 events. 2064/3373 cut-off events. For 148879/148891 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 19332 event pairs, 555 based on Foata normal form. 10/3376 useless extension candidates. Maximal degree in co-relation 24150. Up to 3075 conditions per place. [2024-06-03 21:33:50,472 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 164 selfloop transitions, 46 changer transitions 0/215 dead transitions. [2024-06-03 21:33:50,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 215 transitions, 2570 flow [2024-06-03 21:33:50,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 21:33:50,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 21:33:50,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions. [2024-06-03 21:33:50,473 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43197278911564624 [2024-06-03 21:33:50,473 INFO L175 Difference]: Start difference. First operand has 173 places, 201 transitions, 2078 flow. Second operand 7 states and 127 transitions. [2024-06-03 21:33:50,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 215 transitions, 2570 flow [2024-06-03 21:33:50,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 215 transitions, 2440 flow, removed 57 selfloop flow, removed 2 redundant places. [2024-06-03 21:33:50,612 INFO L231 Difference]: Finished difference. Result has 178 places, 201 transitions, 2046 flow [2024-06-03 21:33:50,612 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1948, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2046, PETRI_PLACES=178, PETRI_TRANSITIONS=201} [2024-06-03 21:33:50,613 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 135 predicate places. [2024-06-03 21:33:50,613 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 201 transitions, 2046 flow [2024-06-03 21:33:50,613 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:50,613 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:33:50,613 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:33:50,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-03 21:33:50,614 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 21:33:50,614 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:33:50,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1319458325, now seen corresponding path program 2 times [2024-06-03 21:33:50,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:33:50,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018771084] [2024-06-03 21:33:50,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:33:50,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:33:50,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:34:02,264 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:02,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:34:02,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018771084] [2024-06-03 21:34:02,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018771084] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:34:02,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:34:02,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:34:02,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026755313] [2024-06-03 21:34:02,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:34:02,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:34:02,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:34:02,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:34:02,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:34:02,480 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-03 21:34:02,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 201 transitions, 2046 flow. Second operand has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:34:02,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:34:02,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-03 21:34:02,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:34:03,543 INFO L124 PetriNetUnfolderBase]: 1913/3181 cut-off events. [2024-06-03 21:34:03,543 INFO L125 PetriNetUnfolderBase]: For 151660/151700 co-relation queries the response was YES. [2024-06-03 21:34:03,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23053 conditions, 3181 events. 1913/3181 cut-off events. For 151660/151700 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 18696 event pairs, 522 based on Foata normal form. 11/3155 useless extension candidates. Maximal degree in co-relation 22972. Up to 2822 conditions per place. [2024-06-03 21:34:03,571 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 147 selfloop transitions, 52 changer transitions 0/224 dead transitions. [2024-06-03 21:34:03,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 224 transitions, 2806 flow [2024-06-03 21:34:03,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:34:03,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:34:03,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2024-06-03 21:34:03,574 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4375 [2024-06-03 21:34:03,574 INFO L175 Difference]: Start difference. First operand has 178 places, 201 transitions, 2046 flow. Second operand 8 states and 147 transitions. [2024-06-03 21:34:03,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 224 transitions, 2806 flow [2024-06-03 21:34:03,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 224 transitions, 2683 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-03 21:34:03,687 INFO L231 Difference]: Finished difference. Result has 181 places, 212 transitions, 2222 flow [2024-06-03 21:34:03,687 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1923, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2222, PETRI_PLACES=181, PETRI_TRANSITIONS=212} [2024-06-03 21:34:03,687 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 138 predicate places. [2024-06-03 21:34:03,687 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 212 transitions, 2222 flow [2024-06-03 21:34:03,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:34:03,688 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:34:03,688 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:03,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-03 21:34:03,688 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 21:34:03,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:34:03,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1618109297, now seen corresponding path program 3 times [2024-06-03 21:34:03,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:34:03,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060715538] [2024-06-03 21:34:03,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:34:03,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:34:03,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:34:15,438 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:15,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:34:15,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060715538] [2024-06-03 21:34:15,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060715538] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:34:15,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:34:15,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:34:15,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216356616] [2024-06-03 21:34:15,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:34:15,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:34:15,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:34:15,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:34:15,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:34:15,670 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-03 21:34:15,670 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 212 transitions, 2222 flow. Second operand has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:34:15,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:34:15,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-03 21:34:15,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:34:16,835 INFO L124 PetriNetUnfolderBase]: 1916/3191 cut-off events. [2024-06-03 21:34:16,835 INFO L125 PetriNetUnfolderBase]: For 159779/159829 co-relation queries the response was YES. [2024-06-03 21:34:16,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23413 conditions, 3191 events. 1916/3191 cut-off events. For 159779/159829 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 18726 event pairs, 522 based on Foata normal form. 13/3177 useless extension candidates. Maximal degree in co-relation 23331. Up to 2890 conditions per place. [2024-06-03 21:34:16,864 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 178 selfloop transitions, 22 changer transitions 0/225 dead transitions. [2024-06-03 21:34:16,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 225 transitions, 2702 flow [2024-06-03 21:34:16,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:34:16,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:34:16,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions. [2024-06-03 21:34:16,865 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4226190476190476 [2024-06-03 21:34:16,865 INFO L175 Difference]: Start difference. First operand has 181 places, 212 transitions, 2222 flow. Second operand 8 states and 142 transitions. [2024-06-03 21:34:16,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 225 transitions, 2702 flow [2024-06-03 21:34:16,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 225 transitions, 2580 flow, removed 43 selfloop flow, removed 3 redundant places. [2024-06-03 21:34:16,995 INFO L231 Difference]: Finished difference. Result has 186 places, 215 transitions, 2213 flow [2024-06-03 21:34:16,996 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2100, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2213, PETRI_PLACES=186, PETRI_TRANSITIONS=215} [2024-06-03 21:34:16,996 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 143 predicate places. [2024-06-03 21:34:16,996 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 215 transitions, 2213 flow [2024-06-03 21:34:16,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:34:16,996 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:34:16,997 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:16,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-03 21:34:16,997 INFO L420 AbstractCegarLoop]: === Iteration 47 === 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:16,997 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:34:16,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1604776817, now seen corresponding path program 4 times [2024-06-03 21:34:16,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:34:16,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918163642] [2024-06-03 21:34:16,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:34:16,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:34:17,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:34:28,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:34:28,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:34:28,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918163642] [2024-06-03 21:34:28,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918163642] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:34:28,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:34:28,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:34:28,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036310191] [2024-06-03 21:34:28,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:34:28,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:34:28,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:34:28,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:34:28,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:34:28,526 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42 [2024-06-03 21:34:28,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 215 transitions, 2213 flow. Second operand has 9 states, 9 states have (on average 13.777777777777779) internal successors, (124), 9 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:34:28,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:34:28,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42 [2024-06-03 21:34:28,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:34:29,607 INFO L124 PetriNetUnfolderBase]: 1917/3183 cut-off events. [2024-06-03 21:34:29,607 INFO L125 PetriNetUnfolderBase]: For 164345/164389 co-relation queries the response was YES. [2024-06-03 21:34:29,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23700 conditions, 3183 events. 1917/3183 cut-off events. For 164345/164389 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 18693 event pairs, 520 based on Foata normal form. 12/3158 useless extension candidates. Maximal degree in co-relation 23616. Up to 2856 conditions per place. [2024-06-03 21:34:29,640 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 166 selfloop transitions, 38 changer transitions 0/229 dead transitions. [2024-06-03 21:34:29,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 229 transitions, 2718 flow [2024-06-03 21:34:29,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:34:29,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:34:29,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions. [2024-06-03 21:34:29,642 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4494047619047619 [2024-06-03 21:34:29,642 INFO L175 Difference]: Start difference. First operand has 186 places, 215 transitions, 2213 flow. Second operand 8 states and 151 transitions. [2024-06-03 21:34:29,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 229 transitions, 2718 flow [2024-06-03 21:34:29,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 229 transitions, 2607 flow, removed 37 selfloop flow, removed 6 redundant places. [2024-06-03 21:34:29,794 INFO L231 Difference]: Finished difference. Result has 188 places, 218 transitions, 2254 flow [2024-06-03 21:34:29,794 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2104, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2254, PETRI_PLACES=188, PETRI_TRANSITIONS=218} [2024-06-03 21:34:29,794 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 145 predicate places. [2024-06-03 21:34:29,794 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 218 transitions, 2254 flow [2024-06-03 21:34:29,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.777777777777779) internal successors, (124), 9 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:34:29,795 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:34:29,795 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:29,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-03 21:34:29,795 INFO L420 AbstractCegarLoop]: === Iteration 48 === 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:29,795 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:34:29,795 INFO L85 PathProgramCache]: Analyzing trace with hash 410661998, now seen corresponding path program 1 times [2024-06-03 21:34:29,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:34:29,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030541793] [2024-06-03 21:34:29,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:34:29,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:34:29,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:34:42,081 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:42,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:34:42,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030541793] [2024-06-03 21:34:42,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030541793] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:34:42,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:34:42,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:34:42,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345286350] [2024-06-03 21:34:42,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:34:42,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:34:42,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:34:42,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:34:42,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:34:42,329 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-03 21:34:42,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 218 transitions, 2254 flow. Second operand has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:34:42,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:34:42,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-03 21:34:42,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:34:43,475 INFO L124 PetriNetUnfolderBase]: 1995/3320 cut-off events. [2024-06-03 21:34:43,476 INFO L125 PetriNetUnfolderBase]: For 169420/169422 co-relation queries the response was YES. [2024-06-03 21:34:43,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24892 conditions, 3320 events. 1995/3320 cut-off events. For 169420/169422 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 19436 event pairs, 524 based on Foata normal form. 3/3312 useless extension candidates. Maximal degree in co-relation 24807. Up to 3025 conditions per place. [2024-06-03 21:34:43,506 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 210 selfloop transitions, 18 changer transitions 0/238 dead transitions. [2024-06-03 21:34:43,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 238 transitions, 2830 flow [2024-06-03 21:34:43,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:34:43,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:34:43,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2024-06-03 21:34:43,508 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4375 [2024-06-03 21:34:43,508 INFO L175 Difference]: Start difference. First operand has 188 places, 218 transitions, 2254 flow. Second operand 8 states and 147 transitions. [2024-06-03 21:34:43,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 238 transitions, 2830 flow [2024-06-03 21:34:43,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 238 transitions, 2700 flow, removed 30 selfloop flow, removed 6 redundant places. [2024-06-03 21:34:43,682 INFO L231 Difference]: Finished difference. Result has 190 places, 221 transitions, 2236 flow [2024-06-03 21:34:43,682 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2124, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2236, PETRI_PLACES=190, PETRI_TRANSITIONS=221} [2024-06-03 21:34:43,683 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 147 predicate places. [2024-06-03 21:34:43,683 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 221 transitions, 2236 flow [2024-06-03 21:34:43,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:34:43,683 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:34:43,683 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:43,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-03 21:34:43,684 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 21:34:43,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:34:43,684 INFO L85 PathProgramCache]: Analyzing trace with hash 414386648, now seen corresponding path program 2 times [2024-06-03 21:34:43,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:34:43,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604348678] [2024-06-03 21:34:43,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:34:43,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:34:43,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:34:57,432 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:57,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:34:57,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604348678] [2024-06-03 21:34:57,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604348678] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:34:57,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:34:57,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:34:57,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475641364] [2024-06-03 21:34:57,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:34:57,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:34:57,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:34:57,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:34:57,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:34:57,591 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-03 21:34:57,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 221 transitions, 2236 flow. Second operand has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:34:57,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:34:57,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-03 21:34:57,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:34:58,898 INFO L124 PetriNetUnfolderBase]: 2023/3366 cut-off events. [2024-06-03 21:34:58,898 INFO L125 PetriNetUnfolderBase]: For 178954/178956 co-relation queries the response was YES. [2024-06-03 21:34:58,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25677 conditions, 3366 events. 2023/3366 cut-off events. For 178954/178956 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 19790 event pairs, 519 based on Foata normal form. 2/3357 useless extension candidates. Maximal degree in co-relation 25591. Up to 3053 conditions per place. [2024-06-03 21:34:58,931 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 211 selfloop transitions, 23 changer transitions 0/244 dead transitions. [2024-06-03 21:34:58,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 244 transitions, 3010 flow [2024-06-03 21:34:58,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:34:58,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:34:58,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions. [2024-06-03 21:34:58,934 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44047619047619047 [2024-06-03 21:34:58,934 INFO L175 Difference]: Start difference. First operand has 190 places, 221 transitions, 2236 flow. Second operand 8 states and 148 transitions. [2024-06-03 21:34:58,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 244 transitions, 3010 flow [2024-06-03 21:34:59,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 244 transitions, 2926 flow, removed 26 selfloop flow, removed 6 redundant places. [2024-06-03 21:34:59,137 INFO L231 Difference]: Finished difference. Result has 193 places, 229 transitions, 2387 flow [2024-06-03 21:34:59,138 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2152, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2387, PETRI_PLACES=193, PETRI_TRANSITIONS=229} [2024-06-03 21:34:59,138 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 150 predicate places. [2024-06-03 21:34:59,138 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 229 transitions, 2387 flow [2024-06-03 21:34:59,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:34:59,138 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:34:59,138 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:59,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-03 21:34:59,139 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 21:34:59,139 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:34:59,139 INFO L85 PathProgramCache]: Analyzing trace with hash -333850970, now seen corresponding path program 3 times [2024-06-03 21:34:59,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:34:59,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868555824] [2024-06-03 21:34:59,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:34:59,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:34:59,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:35:12,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:35:12,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:35:12,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868555824] [2024-06-03 21:35:12,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868555824] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:35:12,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:35:12,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:35:12,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641064359] [2024-06-03 21:35:12,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:35:12,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:35:12,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:35:12,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:35:12,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:35:13,027 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-03 21:35:13,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 229 transitions, 2387 flow. Second operand has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:35:13,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:35:13,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-03 21:35:13,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:35:14,272 INFO L124 PetriNetUnfolderBase]: 2041/3400 cut-off events. [2024-06-03 21:35:14,272 INFO L125 PetriNetUnfolderBase]: For 189144/189149 co-relation queries the response was YES. [2024-06-03 21:35:14,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26614 conditions, 3400 events. 2041/3400 cut-off events. For 189144/189149 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 20077 event pairs, 522 based on Foata normal form. 4/3392 useless extension candidates. Maximal degree in co-relation 26526. Up to 3070 conditions per place. [2024-06-03 21:35:14,303 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 208 selfloop transitions, 31 changer transitions 0/249 dead transitions. [2024-06-03 21:35:14,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 249 transitions, 3181 flow [2024-06-03 21:35:14,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:35:14,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:35:14,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions. [2024-06-03 21:35:14,305 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44047619047619047 [2024-06-03 21:35:14,305 INFO L175 Difference]: Start difference. First operand has 193 places, 229 transitions, 2387 flow. Second operand 8 states and 148 transitions. [2024-06-03 21:35:14,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 249 transitions, 3181 flow [2024-06-03 21:35:14,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 249 transitions, 3084 flow, removed 41 selfloop flow, removed 4 redundant places. [2024-06-03 21:35:14,487 INFO L231 Difference]: Finished difference. Result has 197 places, 236 transitions, 2532 flow [2024-06-03 21:35:14,487 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2290, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2532, PETRI_PLACES=197, PETRI_TRANSITIONS=236} [2024-06-03 21:35:14,491 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 154 predicate places. [2024-06-03 21:35:14,491 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 236 transitions, 2532 flow [2024-06-03 21:35:14,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:35:14,491 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:35:14,491 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:14,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-03 21:35:14,491 INFO L420 AbstractCegarLoop]: === Iteration 51 === 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:14,492 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:35:14,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1617848122, now seen corresponding path program 4 times [2024-06-03 21:35:14,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:35:14,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251018516] [2024-06-03 21:35:14,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:35:14,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:35:14,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:35:26,817 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:26,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:35:26,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251018516] [2024-06-03 21:35:26,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251018516] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:35:26,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:35:26,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:35:26,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412499822] [2024-06-03 21:35:26,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:35:26,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:35:26,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:35:26,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:35:26,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:35:27,022 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-03 21:35:27,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 236 transitions, 2532 flow. Second operand has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:35:27,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:35:27,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-03 21:35:27,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:35:28,280 INFO L124 PetriNetUnfolderBase]: 2044/3405 cut-off events. [2024-06-03 21:35:28,280 INFO L125 PetriNetUnfolderBase]: For 195715/195720 co-relation queries the response was YES. [2024-06-03 21:35:28,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27017 conditions, 3405 events. 2044/3405 cut-off events. For 195715/195720 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 20116 event pairs, 519 based on Foata normal form. 4/3398 useless extension candidates. Maximal degree in co-relation 26927. Up to 3024 conditions per place. [2024-06-03 21:35:28,311 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 195 selfloop transitions, 52 changer transitions 0/257 dead transitions. [2024-06-03 21:35:28,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 257 transitions, 3458 flow [2024-06-03 21:35:28,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:35:28,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:35:28,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions. [2024-06-03 21:35:28,312 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4494047619047619 [2024-06-03 21:35:28,312 INFO L175 Difference]: Start difference. First operand has 197 places, 236 transitions, 2532 flow. Second operand 8 states and 151 transitions. [2024-06-03 21:35:28,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 257 transitions, 3458 flow [2024-06-03 21:35:28,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 257 transitions, 3345 flow, removed 46 selfloop flow, removed 4 redundant places. [2024-06-03 21:35:28,490 INFO L231 Difference]: Finished difference. Result has 202 places, 244 transitions, 2743 flow [2024-06-03 21:35:28,490 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2419, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2743, PETRI_PLACES=202, PETRI_TRANSITIONS=244} [2024-06-03 21:35:28,491 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 159 predicate places. [2024-06-03 21:35:28,491 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 244 transitions, 2743 flow [2024-06-03 21:35:28,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:35:28,491 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:35:28,491 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:28,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-03 21:35:28,491 INFO L420 AbstractCegarLoop]: === Iteration 52 === 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:28,492 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:35:28,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1618125169, now seen corresponding path program 1 times [2024-06-03 21:35:28,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:35:28,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097598802] [2024-06-03 21:35:28,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:35:28,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:35:28,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:35:40,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:35:40,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:35:40,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097598802] [2024-06-03 21:35:40,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097598802] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:35:40,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:35:40,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:35:40,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611861413] [2024-06-03 21:35:40,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:35:40,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:35:40,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:35:40,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:35:40,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:35:40,755 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-03 21:35:40,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 244 transitions, 2743 flow. Second operand has 10 states, 10 states have (on average 12.7) internal successors, (127), 10 states have internal predecessors, (127), 0 states have call successors, (0), 0 states 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:40,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:35:40,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-03 21:35:40,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:35:41,988 INFO L124 PetriNetUnfolderBase]: 1991/3312 cut-off events. [2024-06-03 21:35:41,989 INFO L125 PetriNetUnfolderBase]: For 203337/203367 co-relation queries the response was YES. [2024-06-03 21:35:42,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27157 conditions, 3312 events. 1991/3312 cut-off events. For 203337/203367 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 19451 event pairs, 523 based on Foata normal form. 10/3296 useless extension candidates. Maximal degree in co-relation 27064. Up to 2988 conditions per place. [2024-06-03 21:35:42,021 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 213 selfloop transitions, 20 changer transitions 0/258 dead transitions. [2024-06-03 21:35:42,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 258 transitions, 3303 flow [2024-06-03 21:35:42,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:35:42,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:35:42,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 155 transitions. [2024-06-03 21:35:42,022 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41005291005291006 [2024-06-03 21:35:42,022 INFO L175 Difference]: Start difference. First operand has 202 places, 244 transitions, 2743 flow. Second operand 9 states and 155 transitions. [2024-06-03 21:35:42,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 258 transitions, 3303 flow [2024-06-03 21:35:42,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 258 transitions, 3088 flow, removed 64 selfloop flow, removed 6 redundant places. [2024-06-03 21:35:42,249 INFO L231 Difference]: Finished difference. Result has 205 places, 246 transitions, 2641 flow [2024-06-03 21:35:42,250 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2532, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2641, PETRI_PLACES=205, PETRI_TRANSITIONS=246} [2024-06-03 21:35:42,250 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 162 predicate places. [2024-06-03 21:35:42,250 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 246 transitions, 2641 flow [2024-06-03 21:35:42,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.7) internal successors, (127), 10 states have internal predecessors, (127), 0 states have call successors, (0), 0 states 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:42,250 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:35:42,250 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:35:42,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-03 21:35:42,251 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:35:42,251 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:35:42,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1176932021, now seen corresponding path program 1 times [2024-06-03 21:35:42,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:35:42,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182618184] [2024-06-03 21:35:42,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:35:42,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:35:42,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:35:53,057 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:53,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:35:53,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182618184] [2024-06-03 21:35:53,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182618184] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:35:53,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:35:53,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:35:53,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260901582] [2024-06-03 21:35:53,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:35:53,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:35:53,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:35:53,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:35:53,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:35:53,242 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:35:53,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 246 transitions, 2641 flow. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:35:53,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:35:53,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:35:53,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:35:54,635 INFO L124 PetriNetUnfolderBase]: 2175/3547 cut-off events. [2024-06-03 21:35:54,636 INFO L125 PetriNetUnfolderBase]: For 203287/203289 co-relation queries the response was YES. [2024-06-03 21:35:54,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27855 conditions, 3547 events. 2175/3547 cut-off events. For 203287/203289 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 20383 event pairs, 548 based on Foata normal form. 2/3547 useless extension candidates. Maximal degree in co-relation 27762. Up to 3244 conditions per place. [2024-06-03 21:35:54,669 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 229 selfloop transitions, 33 changer transitions 0/267 dead transitions. [2024-06-03 21:35:54,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 267 transitions, 3305 flow [2024-06-03 21:35:54,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 21:35:54,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 21:35:54,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions. [2024-06-03 21:35:54,670 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4489795918367347 [2024-06-03 21:35:54,670 INFO L175 Difference]: Start difference. First operand has 205 places, 246 transitions, 2641 flow. Second operand 7 states and 132 transitions. [2024-06-03 21:35:54,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 267 transitions, 3305 flow [2024-06-03 21:35:54,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 267 transitions, 3212 flow, removed 28 selfloop flow, removed 7 redundant places. [2024-06-03 21:35:54,870 INFO L231 Difference]: Finished difference. Result has 205 places, 249 transitions, 2705 flow [2024-06-03 21:35:54,870 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2548, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2705, PETRI_PLACES=205, PETRI_TRANSITIONS=249} [2024-06-03 21:35:54,871 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 162 predicate places. [2024-06-03 21:35:54,871 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 249 transitions, 2705 flow [2024-06-03 21:35:54,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:35:54,871 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:35:54,871 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:35:54,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-03 21:35:54,872 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:35:54,872 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:35:54,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1528120309, now seen corresponding path program 2 times [2024-06-03 21:35:54,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:35:54,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356268141] [2024-06-03 21:35:54,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:35:54,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:35:54,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:36:05,816 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:05,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:36:05,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356268141] [2024-06-03 21:36:05,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356268141] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:36:05,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:36:05,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:36:05,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623238162] [2024-06-03 21:36:05,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:36:05,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:36:05,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:36:05,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:36:05,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:36:05,950 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:36:05,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 249 transitions, 2705 flow. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:36:05,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:36:05,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:36:05,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:36:07,359 INFO L124 PetriNetUnfolderBase]: 2190/3572 cut-off events. [2024-06-03 21:36:07,359 INFO L125 PetriNetUnfolderBase]: For 212912/212914 co-relation queries the response was YES. [2024-06-03 21:36:07,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28555 conditions, 3572 events. 2190/3572 cut-off events. For 212912/212914 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 20522 event pairs, 550 based on Foata normal form. 2/3572 useless extension candidates. Maximal degree in co-relation 28461. Up to 3241 conditions per place. [2024-06-03 21:36:07,396 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 225 selfloop transitions, 45 changer transitions 0/275 dead transitions. [2024-06-03 21:36:07,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 275 transitions, 3433 flow [2024-06-03 21:36:07,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:36:07,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:36:07,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-06-03 21:36:07,406 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44345238095238093 [2024-06-03 21:36:07,407 INFO L175 Difference]: Start difference. First operand has 205 places, 249 transitions, 2705 flow. Second operand 8 states and 149 transitions. [2024-06-03 21:36:07,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 275 transitions, 3433 flow [2024-06-03 21:36:07,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 275 transitions, 3314 flow, removed 28 selfloop flow, removed 5 redundant places. [2024-06-03 21:36:07,658 INFO L231 Difference]: Finished difference. Result has 209 places, 255 transitions, 2822 flow [2024-06-03 21:36:07,658 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2586, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2822, PETRI_PLACES=209, PETRI_TRANSITIONS=255} [2024-06-03 21:36:07,659 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 166 predicate places. [2024-06-03 21:36:07,659 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 255 transitions, 2822 flow [2024-06-03 21:36:07,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:36:07,659 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:36:07,659 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:36:07,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-03 21:36:07,659 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:36:07,660 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:36:07,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1106444083, now seen corresponding path program 1 times [2024-06-03 21:36:07,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:36:07,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374149345] [2024-06-03 21:36:07,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:36:07,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:36:07,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:36:19,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:36:19,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:36:19,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374149345] [2024-06-03 21:36:19,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374149345] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:36:19,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:36:19,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:36:19,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325035756] [2024-06-03 21:36:19,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:36:19,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:36:19,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:36:19,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:36:19,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:36:19,510 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:36:19,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 255 transitions, 2822 flow. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:36:19,510 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:36:19,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:36:19,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:36:20,836 INFO L124 PetriNetUnfolderBase]: 2198/3586 cut-off events. [2024-06-03 21:36:20,836 INFO L125 PetriNetUnfolderBase]: For 223406/223410 co-relation queries the response was YES. [2024-06-03 21:36:20,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29196 conditions, 3586 events. 2198/3586 cut-off events. For 223406/223410 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 20617 event pairs, 435 based on Foata normal form. 6/3590 useless extension candidates. Maximal degree in co-relation 29100. Up to 3278 conditions per place. [2024-06-03 21:36:20,869 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 254 selfloop transitions, 25 changer transitions 0/284 dead transitions. [2024-06-03 21:36:20,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 284 transitions, 3520 flow [2024-06-03 21:36:20,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:36:20,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:36:20,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions. [2024-06-03 21:36:20,870 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44047619047619047 [2024-06-03 21:36:20,871 INFO L175 Difference]: Start difference. First operand has 209 places, 255 transitions, 2822 flow. Second operand 8 states and 148 transitions. [2024-06-03 21:36:20,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 284 transitions, 3520 flow [2024-06-03 21:36:21,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 284 transitions, 3384 flow, removed 35 selfloop flow, removed 6 redundant places. [2024-06-03 21:36:21,114 INFO L231 Difference]: Finished difference. Result has 211 places, 257 transitions, 2801 flow [2024-06-03 21:36:21,115 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2686, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2801, PETRI_PLACES=211, PETRI_TRANSITIONS=257} [2024-06-03 21:36:21,115 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 168 predicate places. [2024-06-03 21:36:21,115 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 257 transitions, 2801 flow [2024-06-03 21:36:21,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:36:21,115 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:36:21,115 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:36:21,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-03 21:36:21,116 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:36:21,116 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:36:21,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1097873203, now seen corresponding path program 2 times [2024-06-03 21:36:21,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:36:21,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623928445] [2024-06-03 21:36:21,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:36:21,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:36:21,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:36:31,949 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,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:36:31,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623928445] [2024-06-03 21:36:31,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623928445] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:36:31,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:36:31,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:36:31,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606416888] [2024-06-03 21:36:31,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:36:31,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:36:31,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:36:31,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:36:31,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:36:32,171 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:36:32,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 257 transitions, 2801 flow. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:36:32,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:36:32,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:36:32,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:36:33,464 INFO L124 PetriNetUnfolderBase]: 2206/3598 cut-off events. [2024-06-03 21:36:33,465 INFO L125 PetriNetUnfolderBase]: For 223532/223536 co-relation queries the response was YES. [2024-06-03 21:36:33,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29299 conditions, 3598 events. 2206/3598 cut-off events. For 223532/223536 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 20743 event pairs, 544 based on Foata normal form. 6/3602 useless extension candidates. Maximal degree in co-relation 29203. Up to 3327 conditions per place. [2024-06-03 21:36:33,499 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 251 selfloop transitions, 26 changer transitions 0/282 dead transitions. [2024-06-03 21:36:33,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 282 transitions, 3487 flow [2024-06-03 21:36:33,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:36:33,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:36:33,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions. [2024-06-03 21:36:33,501 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43154761904761907 [2024-06-03 21:36:33,501 INFO L175 Difference]: Start difference. First operand has 211 places, 257 transitions, 2801 flow. Second operand 8 states and 145 transitions. [2024-06-03 21:36:33,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 282 transitions, 3487 flow [2024-06-03 21:36:33,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 282 transitions, 3388 flow, removed 26 selfloop flow, removed 6 redundant places. [2024-06-03 21:36:33,723 INFO L231 Difference]: Finished difference. Result has 213 places, 259 transitions, 2823 flow [2024-06-03 21:36:33,723 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2702, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2823, PETRI_PLACES=213, PETRI_TRANSITIONS=259} [2024-06-03 21:36:33,724 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 170 predicate places. [2024-06-03 21:36:33,724 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 259 transitions, 2823 flow [2024-06-03 21:36:33,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:36:33,724 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:36:33,724 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:36:33,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-03 21:36:33,725 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:36:33,725 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:36:33,725 INFO L85 PathProgramCache]: Analyzing trace with hash -988004677, now seen corresponding path program 3 times [2024-06-03 21:36:33,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:36:33,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913761444] [2024-06-03 21:36:33,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:36:33,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:36:33,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:36:44,123 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:44,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:36:44,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913761444] [2024-06-03 21:36:44,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913761444] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:36:44,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:36:44,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:36:44,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700654370] [2024-06-03 21:36:44,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:36:44,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:36:44,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:36:44,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:36:44,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:36:44,261 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:36:44,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 259 transitions, 2823 flow. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:36:44,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:36:44,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:36:44,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:36:45,593 INFO L124 PetriNetUnfolderBase]: 2216/3615 cut-off events. [2024-06-03 21:36:45,593 INFO L125 PetriNetUnfolderBase]: For 232162/232167 co-relation queries the response was YES. [2024-06-03 21:36:45,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29626 conditions, 3615 events. 2216/3615 cut-off events. For 232162/232167 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 20912 event pairs, 552 based on Foata normal form. 4/3616 useless extension candidates. Maximal degree in co-relation 29529. Up to 3275 conditions per place. [2024-06-03 21:36:45,629 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 239 selfloop transitions, 40 changer transitions 0/284 dead transitions. [2024-06-03 21:36:45,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 284 transitions, 3549 flow [2024-06-03 21:36:45,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:36:45,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:36:45,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2024-06-03 21:36:45,631 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44642857142857145 [2024-06-03 21:36:45,631 INFO L175 Difference]: Start difference. First operand has 213 places, 259 transitions, 2823 flow. Second operand 8 states and 150 transitions. [2024-06-03 21:36:45,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 284 transitions, 3549 flow [2024-06-03 21:36:45,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 284 transitions, 3446 flow, removed 30 selfloop flow, removed 5 redundant places. [2024-06-03 21:36:45,865 INFO L231 Difference]: Finished difference. Result has 216 places, 262 transitions, 2902 flow [2024-06-03 21:36:45,865 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2720, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2902, PETRI_PLACES=216, PETRI_TRANSITIONS=262} [2024-06-03 21:36:45,865 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 173 predicate places. [2024-06-03 21:36:45,865 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 262 transitions, 2902 flow [2024-06-03 21:36:45,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:36:45,866 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:36:45,866 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:36:45,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-03 21:36:45,866 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:36:45,866 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:36:45,866 INFO L85 PathProgramCache]: Analyzing trace with hash -909887561, now seen corresponding path program 1 times [2024-06-03 21:36:45,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:36:45,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856626441] [2024-06-03 21:36:45,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:36:45,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:36:45,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:36:56,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:36:56,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:36:56,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856626441] [2024-06-03 21:36:56,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856626441] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:36:56,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:36:56,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:36:56,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770101838] [2024-06-03 21:36:56,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:36:56,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:36:56,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:36:56,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:36:56,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:36:56,778 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:36:56,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 262 transitions, 2902 flow. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states 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:56,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:36:56,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:36:56,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:36:58,209 INFO L124 PetriNetUnfolderBase]: 2221/3623 cut-off events. [2024-06-03 21:36:58,210 INFO L125 PetriNetUnfolderBase]: For 241153/241157 co-relation queries the response was YES. [2024-06-03 21:36:58,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30188 conditions, 3623 events. 2221/3623 cut-off events. For 241153/241157 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 20920 event pairs, 551 based on Foata normal form. 5/3623 useless extension candidates. Maximal degree in co-relation 30090. Up to 3321 conditions per place. [2024-06-03 21:36:58,247 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 250 selfloop transitions, 33 changer transitions 0/288 dead transitions. [2024-06-03 21:36:58,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 288 transitions, 3626 flow [2024-06-03 21:36:58,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:36:58,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:36:58,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-06-03 21:36:58,249 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44345238095238093 [2024-06-03 21:36:58,249 INFO L175 Difference]: Start difference. First operand has 216 places, 262 transitions, 2902 flow. Second operand 8 states and 149 transitions. [2024-06-03 21:36:58,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 288 transitions, 3626 flow [2024-06-03 21:36:58,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 288 transitions, 3478 flow, removed 41 selfloop flow, removed 5 redundant places. [2024-06-03 21:36:58,497 INFO L231 Difference]: Finished difference. Result has 219 places, 265 transitions, 2916 flow [2024-06-03 21:36:58,497 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2754, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2916, PETRI_PLACES=219, PETRI_TRANSITIONS=265} [2024-06-03 21:36:58,497 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 176 predicate places. [2024-06-03 21:36:58,497 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 265 transitions, 2916 flow [2024-06-03 21:36:58,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states 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:58,498 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:36:58,498 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:36:58,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-03 21:36:58,498 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:36:58,498 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:36:58,498 INFO L85 PathProgramCache]: Analyzing trace with hash 2060039643, now seen corresponding path program 4 times [2024-06-03 21:36:58,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:36:58,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595485254] [2024-06-03 21:36:58,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:36:58,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:36:58,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:37:09,488 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:37:09,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:37:09,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595485254] [2024-06-03 21:37:09,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595485254] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:37:09,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:37:09,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:37:09,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991838077] [2024-06-03 21:37:09,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:37:09,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:37:09,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:37:09,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:37:09,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:37:09,619 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:37:09,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 265 transitions, 2916 flow. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:37:09,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:37:09,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:37:09,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:37:10,967 INFO L124 PetriNetUnfolderBase]: 2231/3638 cut-off events. [2024-06-03 21:37:10,968 INFO L125 PetriNetUnfolderBase]: For 252427/252432 co-relation queries the response was YES. [2024-06-03 21:37:10,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30659 conditions, 3638 events. 2231/3638 cut-off events. For 252427/252432 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 21075 event pairs, 551 based on Foata normal form. 4/3639 useless extension candidates. Maximal degree in co-relation 30560. Up to 3274 conditions per place. [2024-06-03 21:37:11,010 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 235 selfloop transitions, 48 changer transitions 0/288 dead transitions. [2024-06-03 21:37:11,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 288 transitions, 3666 flow [2024-06-03 21:37:11,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:37:11,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:37:11,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-06-03 21:37:11,012 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44345238095238093 [2024-06-03 21:37:11,012 INFO L175 Difference]: Start difference. First operand has 219 places, 265 transitions, 2916 flow. Second operand 8 states and 149 transitions. [2024-06-03 21:37:11,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 288 transitions, 3666 flow [2024-06-03 21:37:11,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 288 transitions, 3526 flow, removed 39 selfloop flow, removed 6 redundant places. [2024-06-03 21:37:11,257 INFO L231 Difference]: Finished difference. Result has 221 places, 268 transitions, 2984 flow [2024-06-03 21:37:11,257 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2776, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2984, PETRI_PLACES=221, PETRI_TRANSITIONS=268} [2024-06-03 21:37:11,257 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 178 predicate places. [2024-06-03 21:37:11,257 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 268 transitions, 2984 flow [2024-06-03 21:37:11,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:37:11,258 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:37:11,258 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:37:11,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-03 21:37:11,258 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:37:11,258 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:37:11,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1181699573, now seen corresponding path program 1 times [2024-06-03 21:37:11,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:37:11,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705311977] [2024-06-03 21:37:11,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:37:11,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:37:11,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:37:23,298 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:37:23,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:37:23,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705311977] [2024-06-03 21:37:23,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705311977] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:37:23,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:37:23,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:37:23,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553963764] [2024-06-03 21:37:23,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:37:23,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:37:23,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:37:23,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:37:23,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:37:23,484 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:37:23,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 268 transitions, 2984 flow. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states 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:37:23,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:37:23,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:37:23,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:37:24,859 INFO L124 PetriNetUnfolderBase]: 2241/3654 cut-off events. [2024-06-03 21:37:24,859 INFO L125 PetriNetUnfolderBase]: For 265228/265235 co-relation queries the response was YES. [2024-06-03 21:37:24,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31291 conditions, 3654 events. 2241/3654 cut-off events. For 265228/265235 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 21151 event pairs, 546 based on Foata normal form. 8/3659 useless extension candidates. Maximal degree in co-relation 31191. Up to 3376 conditions per place. [2024-06-03 21:37:24,894 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 261 selfloop transitions, 27 changer transitions 0/293 dead transitions. [2024-06-03 21:37:24,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 293 transitions, 3722 flow [2024-06-03 21:37:24,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:37:24,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:37:24,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions. [2024-06-03 21:37:24,896 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43452380952380953 [2024-06-03 21:37:24,896 INFO L175 Difference]: Start difference. First operand has 221 places, 268 transitions, 2984 flow. Second operand 8 states and 146 transitions. [2024-06-03 21:37:24,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 293 transitions, 3722 flow [2024-06-03 21:37:25,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 293 transitions, 3540 flow, removed 45 selfloop flow, removed 6 redundant places. [2024-06-03 21:37:25,160 INFO L231 Difference]: Finished difference. Result has 223 places, 272 transitions, 2953 flow [2024-06-03 21:37:25,161 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2802, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2953, PETRI_PLACES=223, PETRI_TRANSITIONS=272} [2024-06-03 21:37:25,161 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 180 predicate places. [2024-06-03 21:37:25,161 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 272 transitions, 2953 flow [2024-06-03 21:37:25,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states 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:37:25,161 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:37:25,162 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:37:25,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-03 21:37:25,162 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 21:37:25,162 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:37:25,162 INFO L85 PathProgramCache]: Analyzing trace with hash -810867577, now seen corresponding path program 5 times [2024-06-03 21:37:25,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:37:25,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726098371] [2024-06-03 21:37:25,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:37:25,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:37:25,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:37:36,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:37:36,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:37:36,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726098371] [2024-06-03 21:37:36,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726098371] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:37:36,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:37:36,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:37:36,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17788662] [2024-06-03 21:37:36,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:37:36,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:37:36,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:37:36,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:37:36,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:37:37,160 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:37:37,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 272 transitions, 2953 flow. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:37:37,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:37:37,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:37:37,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:37:38,583 INFO L124 PetriNetUnfolderBase]: 2251/3669 cut-off events. [2024-06-03 21:37:38,584 INFO L125 PetriNetUnfolderBase]: For 275009/275011 co-relation queries the response was YES. [2024-06-03 21:37:38,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31893 conditions, 3669 events. 2251/3669 cut-off events. For 275009/275011 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 21280 event pairs, 548 based on Foata normal form. 2/3669 useless extension candidates. Maximal degree in co-relation 31792. Up to 3382 conditions per place. [2024-06-03 21:37:38,621 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 255 selfloop transitions, 31 changer transitions 0/291 dead transitions. [2024-06-03 21:37:38,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 291 transitions, 3693 flow [2024-06-03 21:37:38,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:37:38,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:37:38,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions. [2024-06-03 21:37:38,622 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4226190476190476 [2024-06-03 21:37:38,622 INFO L175 Difference]: Start difference. First operand has 223 places, 272 transitions, 2953 flow. Second operand 8 states and 142 transitions. [2024-06-03 21:37:38,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 291 transitions, 3693 flow [2024-06-03 21:37:38,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 291 transitions, 3570 flow, removed 37 selfloop flow, removed 6 redundant places. [2024-06-03 21:37:38,936 INFO L231 Difference]: Finished difference. Result has 225 places, 275 transitions, 3012 flow [2024-06-03 21:37:38,936 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2830, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3012, PETRI_PLACES=225, PETRI_TRANSITIONS=275} [2024-06-03 21:37:38,937 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 182 predicate places. [2024-06-03 21:37:38,937 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 275 transitions, 3012 flow [2024-06-03 21:37:38,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:37:38,938 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:37:38,938 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:37:38,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-03 21:37:38,938 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 21:37:38,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:37:38,939 INFO L85 PathProgramCache]: Analyzing trace with hash -810862555, now seen corresponding path program 2 times [2024-06-03 21:37:38,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:37:38,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874256670] [2024-06-03 21:37:38,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:37:38,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:37:38,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:37:50,696 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:37:50,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:37:50,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874256670] [2024-06-03 21:37:50,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874256670] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:37:50,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:37:50,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:37:50,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556107775] [2024-06-03 21:37:50,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:37:50,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:37:50,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:37:50,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:37:50,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:37:50,910 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:37:50,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 275 transitions, 3012 flow. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states 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:37:50,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:37:50,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:37:50,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:37:52,242 INFO L124 PetriNetUnfolderBase]: 2261/3686 cut-off events. [2024-06-03 21:37:52,242 INFO L125 PetriNetUnfolderBase]: For 287655/287662 co-relation queries the response was YES. [2024-06-03 21:37:52,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32465 conditions, 3686 events. 2261/3686 cut-off events. For 287655/287662 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 21333 event pairs, 546 based on Foata normal form. 8/3691 useless extension candidates. Maximal degree in co-relation 32363. Up to 3387 conditions per place. [2024-06-03 21:37:52,279 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 259 selfloop transitions, 34 changer transitions 0/298 dead transitions. [2024-06-03 21:37:52,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 298 transitions, 3780 flow [2024-06-03 21:37:52,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:37:52,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:37:52,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions. [2024-06-03 21:37:52,280 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43154761904761907 [2024-06-03 21:37:52,281 INFO L175 Difference]: Start difference. First operand has 225 places, 275 transitions, 3012 flow. Second operand 8 states and 145 transitions. [2024-06-03 21:37:52,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 298 transitions, 3780 flow [2024-06-03 21:37:52,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 298 transitions, 3563 flow, removed 54 selfloop flow, removed 8 redundant places. [2024-06-03 21:37:52,548 INFO L231 Difference]: Finished difference. Result has 225 places, 279 transitions, 2970 flow [2024-06-03 21:37:52,549 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2795, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2970, PETRI_PLACES=225, PETRI_TRANSITIONS=279} [2024-06-03 21:37:52,549 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 182 predicate places. [2024-06-03 21:37:52,549 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 279 transitions, 2970 flow [2024-06-03 21:37:52,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states 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:37:52,549 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:37:52,549 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:37:52,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-03 21:37:52,550 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 21:37:52,550 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:37:52,550 INFO L85 PathProgramCache]: Analyzing trace with hash -810862927, now seen corresponding path program 6 times [2024-06-03 21:37:52,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:37:52,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901541611] [2024-06-03 21:37:52,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:37:52,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:37:52,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:38:03,340 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:38:03,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:38:03,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901541611] [2024-06-03 21:38:03,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901541611] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:38:03,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:38:03,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:38:03,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830191053] [2024-06-03 21:38:03,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:38:03,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:38:03,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:38:03,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:38:03,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:38:03,522 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:38:03,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 279 transitions, 2970 flow. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:38:03,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:38:03,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:38:03,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:38:04,851 INFO L124 PetriNetUnfolderBase]: 2287/3727 cut-off events. [2024-06-03 21:38:04,852 INFO L125 PetriNetUnfolderBase]: For 303480/303485 co-relation queries the response was YES. [2024-06-03 21:38:04,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33541 conditions, 3727 events. 2287/3727 cut-off events. For 303480/303485 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 21674 event pairs, 556 based on Foata normal form. 4/3728 useless extension candidates. Maximal degree in co-relation 33440. Up to 3292 conditions per place. [2024-06-03 21:38:04,893 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 232 selfloop transitions, 67 changer transitions 0/304 dead transitions. [2024-06-03 21:38:04,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 304 transitions, 4024 flow [2024-06-03 21:38:04,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:38:04,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:38:04,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-06-03 21:38:04,894 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44345238095238093 [2024-06-03 21:38:04,894 INFO L175 Difference]: Start difference. First operand has 225 places, 279 transitions, 2970 flow. Second operand 8 states and 149 transitions. [2024-06-03 21:38:04,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 304 transitions, 4024 flow [2024-06-03 21:38:05,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 304 transitions, 3877 flow, removed 42 selfloop flow, removed 6 redundant places. [2024-06-03 21:38:05,240 INFO L231 Difference]: Finished difference. Result has 227 places, 285 transitions, 3201 flow [2024-06-03 21:38:05,240 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2823, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3201, PETRI_PLACES=227, PETRI_TRANSITIONS=285} [2024-06-03 21:38:05,240 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 184 predicate places. [2024-06-03 21:38:05,240 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 285 transitions, 3201 flow [2024-06-03 21:38:05,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:38:05,241 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:38:05,241 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:38:05,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-03 21:38:05,241 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 21:38:05,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:38:05,241 INFO L85 PathProgramCache]: Analyzing trace with hash -647862007, now seen corresponding path program 3 times [2024-06-03 21:38:05,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:38:05,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726777817] [2024-06-03 21:38:05,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:38:05,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:38:05,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:38:16,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:38:16,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:38:16,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726777817] [2024-06-03 21:38:16,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726777817] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:38:16,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:38:16,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:38:16,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020207882] [2024-06-03 21:38:16,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:38:16,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:38:16,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:38:16,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:38:16,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:38:17,141 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:38:17,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 285 transitions, 3201 flow. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states 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:38:17,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:38:17,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:38:17,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:38:18,450 INFO L124 PetriNetUnfolderBase]: 2308/3759 cut-off events. [2024-06-03 21:38:18,451 INFO L125 PetriNetUnfolderBase]: For 319924/319931 co-relation queries the response was YES. [2024-06-03 21:38:18,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34490 conditions, 3759 events. 2308/3759 cut-off events. For 319924/319931 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 21922 event pairs, 547 based on Foata normal form. 7/3763 useless extension candidates. Maximal degree in co-relation 34388. Up to 3432 conditions per place. [2024-06-03 21:38:18,492 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 262 selfloop transitions, 46 changer transitions 0/313 dead transitions. [2024-06-03 21:38:18,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 313 transitions, 4186 flow [2024-06-03 21:38:18,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:38:18,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:38:18,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions. [2024-06-03 21:38:18,494 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43452380952380953 [2024-06-03 21:38:18,494 INFO L175 Difference]: Start difference. First operand has 227 places, 285 transitions, 3201 flow. Second operand 8 states and 146 transitions. [2024-06-03 21:38:18,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 313 transitions, 4186 flow [2024-06-03 21:38:18,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 313 transitions, 4029 flow, removed 55 selfloop flow, removed 4 redundant places. [2024-06-03 21:38:18,924 INFO L231 Difference]: Finished difference. Result has 232 places, 294 transitions, 3345 flow [2024-06-03 21:38:18,924 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3044, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3345, PETRI_PLACES=232, PETRI_TRANSITIONS=294} [2024-06-03 21:38:18,925 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 189 predicate places. [2024-06-03 21:38:18,925 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 294 transitions, 3345 flow [2024-06-03 21:38:18,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states 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:38:18,925 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:38:18,925 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:38:18,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-03 21:38:18,925 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 21:38:18,926 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:38:18,926 INFO L85 PathProgramCache]: Analyzing trace with hash -810985873, now seen corresponding path program 3 times [2024-06-03 21:38:18,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:38:18,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287539064] [2024-06-03 21:38:18,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:38:18,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:38:18,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:38:30,074 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:38:30,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:38:30,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287539064] [2024-06-03 21:38:30,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287539064] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:38:30,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:38:30,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:38:30,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465867346] [2024-06-03 21:38:30,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:38:30,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:38:30,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:38:30,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:38:30,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:38:30,201 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:38:30,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 294 transitions, 3345 flow. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:38:30,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:38:30,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:38:30,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:38:31,651 INFO L124 PetriNetUnfolderBase]: 2316/3768 cut-off events. [2024-06-03 21:38:31,651 INFO L125 PetriNetUnfolderBase]: For 335575/335577 co-relation queries the response was YES. [2024-06-03 21:38:31,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35424 conditions, 3768 events. 2316/3768 cut-off events. For 335575/335577 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 21902 event pairs, 551 based on Foata normal form. 2/3768 useless extension candidates. Maximal degree in co-relation 35319. Up to 3473 conditions per place. [2024-06-03 21:38:31,692 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 277 selfloop transitions, 30 changer transitions 0/312 dead transitions. [2024-06-03 21:38:31,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 312 transitions, 4077 flow [2024-06-03 21:38:31,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:38:31,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:38:31,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2024-06-03 21:38:31,695 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41964285714285715 [2024-06-03 21:38:31,695 INFO L175 Difference]: Start difference. First operand has 232 places, 294 transitions, 3345 flow. Second operand 8 states and 141 transitions. [2024-06-03 21:38:31,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 312 transitions, 4077 flow [2024-06-03 21:38:32,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 312 transitions, 3968 flow, removed 36 selfloop flow, removed 4 redundant places. [2024-06-03 21:38:32,068 INFO L231 Difference]: Finished difference. Result has 236 places, 296 transitions, 3379 flow [2024-06-03 21:38:32,069 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3236, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3379, PETRI_PLACES=236, PETRI_TRANSITIONS=296} [2024-06-03 21:38:32,069 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 193 predicate places. [2024-06-03 21:38:32,069 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 296 transitions, 3379 flow [2024-06-03 21:38:32,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:38:32,070 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:38:32,070 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:38:32,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-03 21:38:32,070 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:38:32,070 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:38:32,070 INFO L85 PathProgramCache]: Analyzing trace with hash 870655039, now seen corresponding path program 2 times [2024-06-03 21:38:32,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:38:32,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136296424] [2024-06-03 21:38:32,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:38:32,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:38:32,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:38:43,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:38:43,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:38:43,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136296424] [2024-06-03 21:38:43,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136296424] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:38:43,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:38:43,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:38:43,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742358138] [2024-06-03 21:38:43,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:38:43,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:38:43,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:38:43,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:38:43,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:38:43,306 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:38:43,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 296 transitions, 3379 flow. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states 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:38:43,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:38:43,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:38:43,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:38:44,824 INFO L124 PetriNetUnfolderBase]: 2321/3778 cut-off events. [2024-06-03 21:38:44,825 INFO L125 PetriNetUnfolderBase]: For 343062/343071 co-relation queries the response was YES. [2024-06-03 21:38:44,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35786 conditions, 3778 events. 2321/3778 cut-off events. For 343062/343071 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 21988 event pairs, 552 based on Foata normal form. 7/3781 useless extension candidates. Maximal degree in co-relation 35679. Up to 3461 conditions per place. [2024-06-03 21:38:44,864 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 282 selfloop transitions, 33 changer transitions 0/320 dead transitions. [2024-06-03 21:38:44,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 320 transitions, 4193 flow [2024-06-03 21:38:44,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:38:44,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:38:44,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions. [2024-06-03 21:38:44,877 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43154761904761907 [2024-06-03 21:38:44,877 INFO L175 Difference]: Start difference. First operand has 236 places, 296 transitions, 3379 flow. Second operand 8 states and 145 transitions. [2024-06-03 21:38:44,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 320 transitions, 4193 flow [2024-06-03 21:38:45,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 320 transitions, 4066 flow, removed 35 selfloop flow, removed 6 redundant places. [2024-06-03 21:38:45,209 INFO L231 Difference]: Finished difference. Result has 238 places, 299 transitions, 3446 flow [2024-06-03 21:38:45,209 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3252, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3446, PETRI_PLACES=238, PETRI_TRANSITIONS=299} [2024-06-03 21:38:45,210 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 195 predicate places. [2024-06-03 21:38:45,210 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 299 transitions, 3446 flow [2024-06-03 21:38:45,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states 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:38:45,210 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:38:45,210 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:38:45,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-03 21:38:45,211 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:38:45,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:38:45,211 INFO L85 PathProgramCache]: Analyzing trace with hash 359586805, now seen corresponding path program 7 times [2024-06-03 21:38:45,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:38:45,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735340915] [2024-06-03 21:38:45,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:38:45,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:38:45,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:38:55,089 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:38:55,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:38:55,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735340915] [2024-06-03 21:38:55,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735340915] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:38:55,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:38:55,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:38:55,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853191252] [2024-06-03 21:38:55,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:38:55,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:38:55,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:38:55,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:38:55,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:38:55,328 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:38:55,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 299 transitions, 3446 flow. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:38:55,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:38:55,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:38:55,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:38:56,819 INFO L124 PetriNetUnfolderBase]: 2331/3796 cut-off events. [2024-06-03 21:38:56,819 INFO L125 PetriNetUnfolderBase]: For 357661/357670 co-relation queries the response was YES. [2024-06-03 21:38:56,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36358 conditions, 3796 events. 2331/3796 cut-off events. For 357661/357670 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 22133 event pairs, 554 based on Foata normal form. 8/3800 useless extension candidates. Maximal degree in co-relation 36250. Up to 3436 conditions per place. [2024-06-03 21:38:56,864 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 287 selfloop transitions, 42 changer transitions 0/334 dead transitions. [2024-06-03 21:38:56,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 334 transitions, 4340 flow [2024-06-03 21:38:56,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:38:56,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:38:56,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 182 transitions. [2024-06-03 21:38:56,865 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2024-06-03 21:38:56,865 INFO L175 Difference]: Start difference. First operand has 238 places, 299 transitions, 3446 flow. Second operand 10 states and 182 transitions. [2024-06-03 21:38:56,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 334 transitions, 4340 flow [2024-06-03 21:38:57,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 334 transitions, 4168 flow, removed 55 selfloop flow, removed 6 redundant places. [2024-06-03 21:38:57,301 INFO L231 Difference]: Finished difference. Result has 242 places, 302 transitions, 3484 flow [2024-06-03 21:38:57,301 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3274, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3484, PETRI_PLACES=242, PETRI_TRANSITIONS=302} [2024-06-03 21:38:57,302 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 199 predicate places. [2024-06-03 21:38:57,302 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 302 transitions, 3484 flow [2024-06-03 21:38:57,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:38:57,302 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:38:57,302 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:38:57,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-03 21:38:57,302 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:38:57,303 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:38:57,303 INFO L85 PathProgramCache]: Analyzing trace with hash 567748367, now seen corresponding path program 3 times [2024-06-03 21:38:57,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:38:57,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386562848] [2024-06-03 21:38:57,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:38:57,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:38:57,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:39:08,652 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:39:08,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:39:08,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386562848] [2024-06-03 21:39:08,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386562848] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:39:08,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:39:08,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:39:08,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571985502] [2024-06-03 21:39:08,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:39:08,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:39:08,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:39:08,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:39:08,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:39:08,821 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:39:08,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 302 transitions, 3484 flow. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states 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:39:08,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:39:08,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:39:08,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:39:10,230 INFO L124 PetriNetUnfolderBase]: 2336/3803 cut-off events. [2024-06-03 21:39:10,231 INFO L125 PetriNetUnfolderBase]: For 364890/364899 co-relation queries the response was YES. [2024-06-03 21:39:10,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36594 conditions, 3803 events. 2336/3803 cut-off events. For 364890/364899 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 22205 event pairs, 554 based on Foata normal form. 7/3806 useless extension candidates. Maximal degree in co-relation 36485. Up to 3469 conditions per place. [2024-06-03 21:39:10,277 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 278 selfloop transitions, 44 changer transitions 0/327 dead transitions. [2024-06-03 21:39:10,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 327 transitions, 4562 flow [2024-06-03 21:39:10,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:39:10,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:39:10,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2024-06-03 21:39:10,278 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-03 21:39:10,278 INFO L175 Difference]: Start difference. First operand has 242 places, 302 transitions, 3484 flow. Second operand 8 states and 144 transitions. [2024-06-03 21:39:10,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 327 transitions, 4562 flow [2024-06-03 21:39:10,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 327 transitions, 4318 flow, removed 50 selfloop flow, removed 11 redundant places. [2024-06-03 21:39:10,655 INFO L231 Difference]: Finished difference. Result has 239 places, 308 transitions, 3584 flow [2024-06-03 21:39:10,656 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3240, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3584, PETRI_PLACES=239, PETRI_TRANSITIONS=308} [2024-06-03 21:39:10,656 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 196 predicate places. [2024-06-03 21:39:10,656 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 308 transitions, 3584 flow [2024-06-03 21:39:10,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states 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:39:10,656 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:39:10,657 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:39:10,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-03 21:39:10,657 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 21:39:10,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:39:10,657 INFO L85 PathProgramCache]: Analyzing trace with hash 359765551, now seen corresponding path program 4 times [2024-06-03 21:39:10,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:39:10,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798124294] [2024-06-03 21:39:10,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:39:10,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:39:10,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:39:21,014 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:39:21,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:39:21,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798124294] [2024-06-03 21:39:21,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798124294] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:39:21,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:39:21,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:39:21,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033788401] [2024-06-03 21:39:21,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:39:21,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:39:21,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:39:21,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:39:21,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:39:21,199 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:39:21,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 308 transitions, 3584 flow. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states 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:39:21,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:39:21,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:39:21,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:39:22,693 INFO L124 PetriNetUnfolderBase]: 2333/3799 cut-off events. [2024-06-03 21:39:22,693 INFO L125 PetriNetUnfolderBase]: For 373913/373922 co-relation queries the response was YES. [2024-06-03 21:39:22,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36605 conditions, 3799 events. 2333/3799 cut-off events. For 373913/373922 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 22180 event pairs, 554 based on Foata normal form. 7/3802 useless extension candidates. Maximal degree in co-relation 36497. Up to 3478 conditions per place. [2024-06-03 21:39:22,741 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 292 selfloop transitions, 32 changer transitions 0/329 dead transitions. [2024-06-03 21:39:22,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 329 transitions, 4300 flow [2024-06-03 21:39:22,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:39:22,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:39:22,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions. [2024-06-03 21:39:22,743 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43452380952380953 [2024-06-03 21:39:22,743 INFO L175 Difference]: Start difference. First operand has 239 places, 308 transitions, 3584 flow. Second operand 8 states and 146 transitions. [2024-06-03 21:39:22,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 329 transitions, 4300 flow [2024-06-03 21:39:23,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 329 transitions, 4048 flow, removed 108 selfloop flow, removed 4 redundant places. [2024-06-03 21:39:23,195 INFO L231 Difference]: Finished difference. Result has 243 places, 308 transitions, 3402 flow [2024-06-03 21:39:23,196 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3332, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3402, PETRI_PLACES=243, PETRI_TRANSITIONS=308} [2024-06-03 21:39:23,196 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 200 predicate places. [2024-06-03 21:39:23,196 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 308 transitions, 3402 flow [2024-06-03 21:39:23,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states 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:39:23,196 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:39:23,197 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:39:23,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-03 21:39:23,197 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 21:39:23,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:39:23,197 INFO L85 PathProgramCache]: Analyzing trace with hash -51302957, now seen corresponding path program 4 times [2024-06-03 21:39:23,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:39:23,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937861776] [2024-06-03 21:39:23,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:39:23,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:39:23,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:39:35,213 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:39:35,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:39:35,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937861776] [2024-06-03 21:39:35,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937861776] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:39:35,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:39:35,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:39:35,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832183535] [2024-06-03 21:39:35,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:39:35,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:39:35,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:39:35,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:39:35,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:39:35,350 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 21:39:35,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 308 transitions, 3402 flow. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states 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:39:35,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:39:35,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 21:39:35,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:39:36,716 INFO L124 PetriNetUnfolderBase]: 2327/3791 cut-off events. [2024-06-03 21:39:36,717 INFO L125 PetriNetUnfolderBase]: For 377862/377871 co-relation queries the response was YES. [2024-06-03 21:39:36,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36410 conditions, 3791 events. 2327/3791 cut-off events. For 377862/377871 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 22118 event pairs, 552 based on Foata normal form. 8/3795 useless extension candidates. Maximal degree in co-relation 36300. Up to 3497 conditions per place. [2024-06-03 21:39:36,757 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 297 selfloop transitions, 26 changer transitions 0/328 dead transitions. [2024-06-03 21:39:36,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 328 transitions, 4151 flow [2024-06-03 21:39:36,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:39:36,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:39:36,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions. [2024-06-03 21:39:36,758 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4255952380952381 [2024-06-03 21:39:36,758 INFO L175 Difference]: Start difference. First operand has 243 places, 308 transitions, 3402 flow. Second operand 8 states and 143 transitions. [2024-06-03 21:39:36,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 328 transitions, 4151 flow [2024-06-03 21:39:37,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 328 transitions, 3997 flow, removed 39 selfloop flow, removed 7 redundant places. [2024-06-03 21:39:37,036 INFO L231 Difference]: Finished difference. Result has 244 places, 309 transitions, 3330 flow [2024-06-03 21:39:37,036 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3260, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3330, PETRI_PLACES=244, PETRI_TRANSITIONS=309} [2024-06-03 21:39:37,036 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 201 predicate places. [2024-06-03 21:39:37,036 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 309 transitions, 3330 flow [2024-06-03 21:39:37,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states 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:39:37,037 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:39:37,037 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:39:37,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-03 21:39:37,037 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 21:39:37,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:39:37,037 INFO L85 PathProgramCache]: Analyzing trace with hash -822355313, now seen corresponding path program 8 times [2024-06-03 21:39:37,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:39:37,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755145803] [2024-06-03 21:39:37,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:39:37,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:39:37,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:39:47,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:39:47,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:39:47,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755145803] [2024-06-03 21:39:47,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755145803] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:39:47,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:39:47,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:39:47,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757910280] [2024-06-03 21:39:47,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:39:47,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:39:47,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:39:47,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:39:47,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 Killed by 15