./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 cde23df1 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-cde23df-m [2024-06-14 14:40:02,474 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-14 14:40:02,536 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-14 14:40:02,542 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-14 14:40:02,543 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-14 14:40:02,570 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-14 14:40:02,572 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-14 14:40:02,572 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-14 14:40:02,573 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-14 14:40:02,576 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-14 14:40:02,577 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-14 14:40:02,577 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-14 14:40:02,578 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-14 14:40:02,580 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-14 14:40:02,580 INFO L153 SettingsManager]: * Use SBE=true [2024-06-14 14:40:02,580 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-14 14:40:02,580 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-14 14:40:02,581 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-14 14:40:02,581 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-14 14:40:02,581 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-14 14:40:02,582 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-14 14:40:02,582 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-14 14:40:02,582 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-14 14:40:02,583 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-14 14:40:02,583 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-14 14:40:02,583 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-14 14:40:02,584 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-14 14:40:02,584 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-14 14:40:02,584 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-14 14:40:02,585 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-14 14:40:02,586 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-14 14:40:02,586 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-14 14:40:02,586 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 14:40:02,586 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-14 14:40:02,587 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-14 14:40:02,587 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-14 14:40:02,587 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-14 14:40:02,587 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-14 14:40:02,588 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-14 14:40:02,588 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-14 14:40:02,588 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-14 14:40:02,589 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-14 14:40:02,589 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-14 14:40:02,589 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-14 14:40:02,850 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-14 14:40:02,876 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-14 14:40:02,878 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-14 14:40:02,879 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-14 14:40:02,879 INFO L274 PluginConnector]: CDTParser initialized [2024-06-14 14:40:02,880 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-14 14:40:04,023 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-14 14:40:04,246 INFO L384 CDTParser]: Found 1 translation units. [2024-06-14 14:40:04,247 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix016_pso.opt_tso.opt.i [2024-06-14 14:40:04,266 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab3a10ada/33deb82fd23e435abe84de5f2f1f1035/FLAG297bf9e1d [2024-06-14 14:40:04,284 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab3a10ada/33deb82fd23e435abe84de5f2f1f1035 [2024-06-14 14:40:04,287 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-14 14:40:04,292 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-14 14:40:04,294 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-14 14:40:04,529 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-14 14:40:04,530 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-14 14:40:04,533 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-14 14:40:04,533 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-14 14:40:04,538 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-14 14:40:04,539 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 02:40:04" (1/2) ... [2024-06-14 14:40:04,540 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@106b4ed3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:40:04, skipping insertion in model container [2024-06-14 14:40:04,540 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 02:40:04" (1/2) ... [2024-06-14 14:40:04,542 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2ea7b340 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:40:04, skipping insertion in model container [2024-06-14 14:40:04,543 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 02:40:04" (2/2) ... [2024-06-14 14:40:04,543 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@106b4ed3 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:40:04, skipping insertion in model container [2024-06-14 14:40:04,543 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 02:40:04" (2/2) ... [2024-06-14 14:40:04,543 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-14 14:40:04,654 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-14 14:40:04,655 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-14 14:40:04,656 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-14 14:40:04,657 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-14 14:40:04,658 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-14 14:40:04,658 INFO L106 edCorrectnessWitness]: ghost_update [L844-L844] multithreaded = 1; [2024-06-14 14:40:04,706 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-14 14:40:05,065 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 14:40:05,077 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-14 14:40:05,488 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 14:40:05,531 INFO L206 MainTranslator]: Completed translation [2024-06-14 14:40:05,531 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:40:05 WrapperNode [2024-06-14 14:40:05,532 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-14 14:40:05,533 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-14 14:40:05,533 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-14 14:40:05,533 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-14 14:40:05,540 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:40:05" (1/1) ... [2024-06-14 14:40:05,590 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:40:05" (1/1) ... [2024-06-14 14:40:05,800 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 149 [2024-06-14 14:40:05,801 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-14 14:40:05,801 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-14 14:40:05,802 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-14 14:40:05,802 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-14 14:40:05,812 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:40:05" (1/1) ... [2024-06-14 14:40:05,812 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:40:05" (1/1) ... [2024-06-14 14:40:05,831 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:40:05" (1/1) ... [2024-06-14 14:40:05,865 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-14 14:40:05,865 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:40:05" (1/1) ... [2024-06-14 14:40:05,866 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:40:05" (1/1) ... [2024-06-14 14:40:05,908 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:40:05" (1/1) ... [2024-06-14 14:40:05,911 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:40:05" (1/1) ... [2024-06-14 14:40:05,926 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:40:05" (1/1) ... [2024-06-14 14:40:05,932 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:40:05" (1/1) ... [2024-06-14 14:40:05,952 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-14 14:40:05,953 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-14 14:40:05,953 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-14 14:40:05,953 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-14 14:40:05,954 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:40:05" (1/1) ... [2024-06-14 14:40:05,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 14:40:05,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 14:40:05,983 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-14 14:40:06,001 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-14 14:40:06,028 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-14 14:40:06,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-14 14:40:06,029 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-14 14:40:06,029 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-14 14:40:06,029 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-14 14:40:06,029 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-14 14:40:06,029 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-14 14:40:06,029 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-14 14:40:06,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-14 14:40:06,029 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-14 14:40:06,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-14 14:40:06,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-14 14:40:06,030 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-14 14:40:06,203 INFO L244 CfgBuilder]: Building ICFG [2024-06-14 14:40:06,206 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-14 14:40:07,718 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-14 14:40:07,718 INFO L293 CfgBuilder]: Performing block encoding [2024-06-14 14:40:08,087 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-14 14:40:08,088 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-14 14:40:08,088 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 02:40:08 BoogieIcfgContainer [2024-06-14 14:40:08,089 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-14 14:40:08,092 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-14 14:40:08,092 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-14 14:40:08,095 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-14 14:40:08,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.06 02:40:04" (1/4) ... [2024-06-14 14:40:08,096 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a4913c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 02:40:08, skipping insertion in model container [2024-06-14 14:40:08,096 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 02:40:04" (2/4) ... [2024-06-14 14:40:08,096 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a4913c1 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 02:40:08, skipping insertion in model container [2024-06-14 14:40:08,096 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:40:05" (3/4) ... [2024-06-14 14:40:08,097 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a4913c1 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 02:40:08, skipping insertion in model container [2024-06-14 14:40:08,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 02:40:08" (4/4) ... [2024-06-14 14:40:08,098 INFO L112 eAbstractionObserver]: Analyzing ICFG mix016_pso.opt_tso.opt.i [2024-06-14 14:40:08,114 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-14 14:40:08,114 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-14 14:40:08,115 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-14 14:40:08,273 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-14 14:40:08,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 42 transitions, 96 flow [2024-06-14 14:40:08,376 INFO L124 PetriNetUnfolderBase]: 0/39 cut-off events. [2024-06-14 14:40:08,377 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 14:40:08,380 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-14 14:40:08,380 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 42 transitions, 96 flow [2024-06-14 14:40:08,384 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 33 transitions, 75 flow [2024-06-14 14:40:08,398 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-14 14:40:08,406 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;@17f50ed8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-14 14:40:08,406 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-14 14:40:08,416 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-14 14:40:08,417 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-14 14:40:08,417 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 14:40:08,417 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:40:08,418 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-14 14:40:08,418 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-14 14:40:08,424 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:40:08,424 INFO L85 PathProgramCache]: Analyzing trace with hash -575597131, now seen corresponding path program 1 times [2024-06-14 14:40:08,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:40:08,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834064624] [2024-06-14 14:40:08,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:40:08,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:40:08,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:40:16,022 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-14 14:40:16,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:40:16,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834064624] [2024-06-14 14:40:16,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834064624] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:40:16,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:40:16,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-14 14:40:16,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370470530] [2024-06-14 14:40:16,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:40:16,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-14 14:40:16,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:40:16,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-14 14:40:16,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-14 14:40:16,145 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 42 [2024-06-14 14:40:16,148 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-14 14:40:16,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:40:16,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 42 [2024-06-14 14:40:16,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:40:17,120 INFO L124 PetriNetUnfolderBase]: 869/1399 cut-off events. [2024-06-14 14:40:17,120 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2024-06-14 14:40:17,130 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-14 14:40:17,143 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 32 selfloop transitions, 4 changer transitions 0/43 dead transitions. [2024-06-14 14:40:17,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 43 transitions, 173 flow [2024-06-14 14:40:17,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-14 14:40:17,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-14 14:40:17,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2024-06-14 14:40:17,156 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191 [2024-06-14 14:40:17,158 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 75 flow. Second operand 3 states and 78 transitions. [2024-06-14 14:40:17,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 43 transitions, 173 flow [2024-06-14 14:40:17,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 43 transitions, 168 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-14 14:40:17,163 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 102 flow [2024-06-14 14:40:17,165 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-14 14:40:17,168 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 0 predicate places. [2024-06-14 14:40:17,169 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 102 flow [2024-06-14 14:40:17,169 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-14 14:40:17,169 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:40:17,169 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:40:17,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-14 14:40:17,170 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-14 14:40:17,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:40:17,172 INFO L85 PathProgramCache]: Analyzing trace with hash 901968084, now seen corresponding path program 1 times [2024-06-14 14:40:17,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:40:17,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963931616] [2024-06-14 14:40:17,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:40:17,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:40:17,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:40:23,078 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-14 14:40:23,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:40:23,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963931616] [2024-06-14 14:40:23,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963931616] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:40:23,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:40:23,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-14 14:40:23,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136953344] [2024-06-14 14:40:23,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:40:23,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 14:40:23,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:40:23,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 14:40:23,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-14 14:40:23,218 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42 [2024-06-14 14:40:23,218 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-14 14:40:23,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:40:23,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42 [2024-06-14 14:40:23,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:40:24,080 INFO L124 PetriNetUnfolderBase]: 996/1550 cut-off events. [2024-06-14 14:40:24,081 INFO L125 PetriNetUnfolderBase]: For 331/331 co-relation queries the response was YES. [2024-06-14 14:40:24,084 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-14 14:40:24,094 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 40 selfloop transitions, 7 changer transitions 0/53 dead transitions. [2024-06-14 14:40:24,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 53 transitions, 242 flow [2024-06-14 14:40:24,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-14 14:40:24,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-14 14:40:24,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 98 transitions. [2024-06-14 14:40:24,098 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2024-06-14 14:40:24,098 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 102 flow. Second operand 4 states and 98 transitions. [2024-06-14 14:40:24,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 53 transitions, 242 flow [2024-06-14 14:40:24,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 53 transitions, 238 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-14 14:40:24,102 INFO L231 Difference]: Finished difference. Result has 46 places, 39 transitions, 138 flow [2024-06-14 14:40:24,102 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-14 14:40:24,103 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 3 predicate places. [2024-06-14 14:40:24,103 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 138 flow [2024-06-14 14:40:24,103 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-14 14:40:24,103 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:40:24,104 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:40:24,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-14 14:40:24,106 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-14 14:40:24,107 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:40:24,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1216772747, now seen corresponding path program 1 times [2024-06-14 14:40:24,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:40:24,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740856663] [2024-06-14 14:40:24,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:40:24,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:40:24,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:40:29,905 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-14 14:40:29,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:40:29,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740856663] [2024-06-14 14:40:29,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740856663] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:40:29,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:40:29,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 14:40:29,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955218952] [2024-06-14 14:40:29,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:40:29,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 14:40:29,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:40:29,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 14:40:29,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-14 14:40:29,992 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-14 14:40:29,993 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-14 14:40:29,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:40:29,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-14 14:40:29,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:40:31,163 INFO L124 PetriNetUnfolderBase]: 1265/1934 cut-off events. [2024-06-14 14:40:31,163 INFO L125 PetriNetUnfolderBase]: For 1101/1101 co-relation queries the response was YES. [2024-06-14 14:40:31,168 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-14 14:40:31,179 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 52 selfloop transitions, 12 changer transitions 0/69 dead transitions. [2024-06-14 14:40:31,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 69 transitions, 354 flow [2024-06-14 14:40:31,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 14:40:31,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 14:40:31,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 133 transitions. [2024-06-14 14:40:31,182 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2024-06-14 14:40:31,182 INFO L175 Difference]: Start difference. First operand has 46 places, 39 transitions, 138 flow. Second operand 6 states and 133 transitions. [2024-06-14 14:40:31,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 69 transitions, 354 flow [2024-06-14 14:40:31,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 69 transitions, 334 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-06-14 14:40:31,186 INFO L231 Difference]: Finished difference. Result has 50 places, 43 transitions, 181 flow [2024-06-14 14:40:31,186 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-14 14:40:31,187 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 7 predicate places. [2024-06-14 14:40:31,187 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 43 transitions, 181 flow [2024-06-14 14:40:31,187 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-14 14:40:31,187 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:40:31,188 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:40:31,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-14 14:40:31,188 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-14 14:40:31,188 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:40:31,189 INFO L85 PathProgramCache]: Analyzing trace with hash 746852484, now seen corresponding path program 1 times [2024-06-14 14:40:31,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:40:31,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342371390] [2024-06-14 14:40:31,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:40:31,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:40:31,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:40:40,828 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-14 14:40:40,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:40:40,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342371390] [2024-06-14 14:40:40,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342371390] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:40:40,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:40:40,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 14:40:40,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954935500] [2024-06-14 14:40:40,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:40:40,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 14:40:40,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:40:40,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 14:40:40,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-14 14:40:40,947 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-14 14:40:40,947 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-14 14:40:40,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:40:40,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-14 14:40:40,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:40:41,925 INFO L124 PetriNetUnfolderBase]: 1085/1743 cut-off events. [2024-06-14 14:40:41,925 INFO L125 PetriNetUnfolderBase]: For 1768/1768 co-relation queries the response was YES. [2024-06-14 14:40:41,929 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-14 14:40:41,938 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 44 selfloop transitions, 8 changer transitions 0/58 dead transitions. [2024-06-14 14:40:41,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 58 transitions, 329 flow [2024-06-14 14:40:41,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 14:40:41,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 14:40:41,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2024-06-14 14:40:41,940 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48095238095238096 [2024-06-14 14:40:41,940 INFO L175 Difference]: Start difference. First operand has 50 places, 43 transitions, 181 flow. Second operand 5 states and 101 transitions. [2024-06-14 14:40:41,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 58 transitions, 329 flow [2024-06-14 14:40:41,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 58 transitions, 302 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-14 14:40:41,945 INFO L231 Difference]: Finished difference. Result has 52 places, 46 transitions, 198 flow [2024-06-14 14:40:41,945 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-14 14:40:41,946 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 9 predicate places. [2024-06-14 14:40:41,947 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 46 transitions, 198 flow [2024-06-14 14:40:41,947 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-14 14:40:41,947 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:40:41,947 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:40:41,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-14 14:40:41,948 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-14 14:40:41,948 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:40:41,948 INFO L85 PathProgramCache]: Analyzing trace with hash 460019363, now seen corresponding path program 1 times [2024-06-14 14:40:41,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:40:41,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135790583] [2024-06-14 14:40:41,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:40:41,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:40:42,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:40:52,599 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-14 14:40:52,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:40:52,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135790583] [2024-06-14 14:40:52,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135790583] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:40:52,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:40:52,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 14:40:52,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180315305] [2024-06-14 14:40:52,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:40:52,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 14:40:52,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:40:52,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 14:40:52,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-14 14:40:52,793 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 14:40:52,793 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-14 14:40:52,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:40:52,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 14:40:52,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:40:53,981 INFO L124 PetriNetUnfolderBase]: 1277/1952 cut-off events. [2024-06-14 14:40:53,982 INFO L125 PetriNetUnfolderBase]: For 3080/3080 co-relation queries the response was YES. [2024-06-14 14:40:53,986 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-14 14:40:53,996 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 54 selfloop transitions, 16 changer transitions 0/75 dead transitions. [2024-06-14 14:40:53,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 75 transitions, 446 flow [2024-06-14 14:40:53,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 14:40:53,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 14:40:53,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 123 transitions. [2024-06-14 14:40:53,998 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4880952380952381 [2024-06-14 14:40:53,998 INFO L175 Difference]: Start difference. First operand has 52 places, 46 transitions, 198 flow. Second operand 6 states and 123 transitions. [2024-06-14 14:40:53,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 75 transitions, 446 flow [2024-06-14 14:40:54,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 75 transitions, 426 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-14 14:40:54,003 INFO L231 Difference]: Finished difference. Result has 55 places, 52 transitions, 260 flow [2024-06-14 14:40:54,003 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-14 14:40:54,006 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 12 predicate places. [2024-06-14 14:40:54,006 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 52 transitions, 260 flow [2024-06-14 14:40:54,008 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-14 14:40:54,008 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:40:54,008 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:40:54,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-14 14:40:54,009 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-14 14:40:54,009 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:40:54,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1324607813, now seen corresponding path program 2 times [2024-06-14 14:40:54,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:40:54,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730146984] [2024-06-14 14:40:54,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:40:54,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:40:54,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:41:03,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:41:03,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:41:03,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730146984] [2024-06-14 14:41:03,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730146984] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:41:03,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:41:03,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 14:41:03,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826294872] [2024-06-14 14:41:03,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:41:03,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 14:41:03,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:41:03,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 14:41:03,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-14 14:41:03,705 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 14:41:03,706 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-14 14:41:03,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:41:03,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 14:41:03,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:41:04,848 INFO L124 PetriNetUnfolderBase]: 1267/1940 cut-off events. [2024-06-14 14:41:04,848 INFO L125 PetriNetUnfolderBase]: For 4431/4436 co-relation queries the response was YES. [2024-06-14 14:41:04,850 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-14 14:41:04,857 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 48 selfloop transitions, 16 changer transitions 0/69 dead transitions. [2024-06-14 14:41:04,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 69 transitions, 430 flow [2024-06-14 14:41:04,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 14:41:04,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 14:41:04,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions. [2024-06-14 14:41:04,858 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2024-06-14 14:41:04,859 INFO L175 Difference]: Start difference. First operand has 55 places, 52 transitions, 260 flow. Second operand 6 states and 117 transitions. [2024-06-14 14:41:04,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 69 transitions, 430 flow [2024-06-14 14:41:04,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 69 transitions, 400 flow, removed 11 selfloop flow, removed 2 redundant places. [2024-06-14 14:41:04,864 INFO L231 Difference]: Finished difference. Result has 59 places, 52 transitions, 270 flow [2024-06-14 14:41:04,865 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-14 14:41:04,865 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 16 predicate places. [2024-06-14 14:41:04,866 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 52 transitions, 270 flow [2024-06-14 14:41:04,866 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-14 14:41:04,866 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:41:04,866 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:41:04,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-14 14:41:04,867 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-14 14:41:04,867 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:41:04,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1293075025, now seen corresponding path program 1 times [2024-06-14 14:41:04,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:41:04,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46545400] [2024-06-14 14:41:04,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:41:04,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:41:04,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:41:14,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-14 14:41:14,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:41:14,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46545400] [2024-06-14 14:41:15,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46545400] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:41:15,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:41:15,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:41:15,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026159298] [2024-06-14 14:41:15,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:41:15,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:41:15,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:41:15,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:41:15,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:41:15,164 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 14:41:15,165 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-14 14:41:15,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:41:15,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 14:41:15,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:41:16,216 INFO L124 PetriNetUnfolderBase]: 1325/2039 cut-off events. [2024-06-14 14:41:16,216 INFO L125 PetriNetUnfolderBase]: For 5424/5426 co-relation queries the response was YES. [2024-06-14 14:41:16,220 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-14 14:41:16,228 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 64 selfloop transitions, 24 changer transitions 0/93 dead transitions. [2024-06-14 14:41:16,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 93 transitions, 600 flow [2024-06-14 14:41:16,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:41:16,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:41:16,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions. [2024-06-14 14:41:16,231 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46130952380952384 [2024-06-14 14:41:16,231 INFO L175 Difference]: Start difference. First operand has 59 places, 52 transitions, 270 flow. Second operand 8 states and 155 transitions. [2024-06-14 14:41:16,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 93 transitions, 600 flow [2024-06-14 14:41:16,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 93 transitions, 544 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-14 14:41:16,237 INFO L231 Difference]: Finished difference. Result has 63 places, 66 transitions, 380 flow [2024-06-14 14:41:16,237 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-14 14:41:16,238 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 20 predicate places. [2024-06-14 14:41:16,238 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 66 transitions, 380 flow [2024-06-14 14:41:16,239 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-14 14:41:16,239 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:41:16,239 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:41:16,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-14 14:41:16,239 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-14 14:41:16,239 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:41:16,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1375694857, now seen corresponding path program 2 times [2024-06-14 14:41:16,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:41:16,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240973421] [2024-06-14 14:41:16,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:41:16,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:41:16,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:41:25,263 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-14 14:41:25,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:41:25,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240973421] [2024-06-14 14:41:25,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240973421] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:41:25,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:41:25,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:41:25,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904842930] [2024-06-14 14:41:25,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:41:25,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:41:25,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:41:25,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:41:25,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:41:25,464 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 14:41:25,464 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-14 14:41:25,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:41:25,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 14:41:25,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:41:26,634 INFO L124 PetriNetUnfolderBase]: 1347/2088 cut-off events. [2024-06-14 14:41:26,634 INFO L125 PetriNetUnfolderBase]: For 7368/7372 co-relation queries the response was YES. [2024-06-14 14:41:26,637 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-14 14:41:26,647 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 64 selfloop transitions, 26 changer transitions 0/95 dead transitions. [2024-06-14 14:41:26,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 95 transitions, 672 flow [2024-06-14 14:41:26,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:41:26,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:41:26,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 137 transitions. [2024-06-14 14:41:26,648 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46598639455782315 [2024-06-14 14:41:26,648 INFO L175 Difference]: Start difference. First operand has 63 places, 66 transitions, 380 flow. Second operand 7 states and 137 transitions. [2024-06-14 14:41:26,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 95 transitions, 672 flow [2024-06-14 14:41:26,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 95 transitions, 632 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-06-14 14:41:26,655 INFO L231 Difference]: Finished difference. Result has 67 places, 69 transitions, 439 flow [2024-06-14 14:41:26,655 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-14 14:41:26,655 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 24 predicate places. [2024-06-14 14:41:26,656 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 69 transitions, 439 flow [2024-06-14 14:41:26,656 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-14 14:41:26,656 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:41:26,656 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:41:26,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-14 14:41:26,656 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-14 14:41:26,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:41:26,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1542834061, now seen corresponding path program 3 times [2024-06-14 14:41:26,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:41:26,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569087328] [2024-06-14 14:41:26,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:41:26,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:41:26,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:41:36,744 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-14 14:41:36,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:41:36,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569087328] [2024-06-14 14:41:36,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569087328] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:41:36,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:41:36,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:41:36,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531576288] [2024-06-14 14:41:36,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:41:36,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:41:36,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:41:36,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:41:36,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:41:36,845 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 14:41:36,845 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-14 14:41:36,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:41:36,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 14:41:36,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:41:37,859 INFO L124 PetriNetUnfolderBase]: 1369/2125 cut-off events. [2024-06-14 14:41:37,859 INFO L125 PetriNetUnfolderBase]: For 9873/9875 co-relation queries the response was YES. [2024-06-14 14:41:37,862 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-14 14:41:37,869 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 63 selfloop transitions, 38 changer transitions 0/106 dead transitions. [2024-06-14 14:41:37,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 106 transitions, 829 flow [2024-06-14 14:41:37,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:41:37,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:41:37,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 159 transitions. [2024-06-14 14:41:37,871 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4732142857142857 [2024-06-14 14:41:37,871 INFO L175 Difference]: Start difference. First operand has 67 places, 69 transitions, 439 flow. Second operand 8 states and 159 transitions. [2024-06-14 14:41:37,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 106 transitions, 829 flow [2024-06-14 14:41:37,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 106 transitions, 744 flow, removed 21 selfloop flow, removed 5 redundant places. [2024-06-14 14:41:37,881 INFO L231 Difference]: Finished difference. Result has 70 places, 75 transitions, 516 flow [2024-06-14 14:41:37,881 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-14 14:41:37,882 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 27 predicate places. [2024-06-14 14:41:37,882 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 75 transitions, 516 flow [2024-06-14 14:41:37,883 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-14 14:41:37,883 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:41:37,883 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:41:37,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-14 14:41:37,883 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-14 14:41:37,884 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:41:37,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1549263151, now seen corresponding path program 4 times [2024-06-14 14:41:37,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:41:37,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837231924] [2024-06-14 14:41:37,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:41:37,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:41:37,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:41:48,236 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-14 14:41:48,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:41:48,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837231924] [2024-06-14 14:41:48,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837231924] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:41:48,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:41:48,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:41:48,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825974035] [2024-06-14 14:41:48,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:41:48,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:41:48,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:41:48,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:41:48,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:41:48,380 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 14:41:48,380 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-14 14:41:48,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:41:48,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 14:41:48,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:41:49,291 INFO L124 PetriNetUnfolderBase]: 1359/2111 cut-off events. [2024-06-14 14:41:49,291 INFO L125 PetriNetUnfolderBase]: For 9918/9920 co-relation queries the response was YES. [2024-06-14 14:41:49,294 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-14 14:41:49,300 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 60 selfloop transitions, 38 changer transitions 0/103 dead transitions. [2024-06-14 14:41:49,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 103 transitions, 794 flow [2024-06-14 14:41:49,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:41:49,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:41:49,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 156 transitions. [2024-06-14 14:41:49,301 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2024-06-14 14:41:49,301 INFO L175 Difference]: Start difference. First operand has 70 places, 75 transitions, 516 flow. Second operand 8 states and 156 transitions. [2024-06-14 14:41:49,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 103 transitions, 794 flow [2024-06-14 14:41:49,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 103 transitions, 734 flow, removed 18 selfloop flow, removed 4 redundant places. [2024-06-14 14:41:49,310 INFO L231 Difference]: Finished difference. Result has 74 places, 75 transitions, 540 flow [2024-06-14 14:41:49,311 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-14 14:41:49,311 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 31 predicate places. [2024-06-14 14:41:49,311 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 75 transitions, 540 flow [2024-06-14 14:41:49,312 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-14 14:41:49,312 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:41:49,312 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:41:49,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-14 14:41:49,312 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-14 14:41:49,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:41:49,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1553077291, now seen corresponding path program 1 times [2024-06-14 14:41:49,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:41:49,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659931771] [2024-06-14 14:41:49,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:41:49,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:41:49,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:41:58,757 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-14 14:41:58,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:41:58,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659931771] [2024-06-14 14:41:58,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659931771] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:41:58,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:41:58,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:41:58,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123234361] [2024-06-14 14:41:58,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:41:58,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:41:58,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:41:58,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:41:58,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:41:58,873 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-14 14:41:58,873 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-14 14:41:58,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:41:58,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-14 14:41:58,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:41:59,818 INFO L124 PetriNetUnfolderBase]: 1181/1917 cut-off events. [2024-06-14 14:41:59,818 INFO L125 PetriNetUnfolderBase]: For 9787/9789 co-relation queries the response was YES. [2024-06-14 14:41:59,821 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-14 14:41:59,826 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 81 selfloop transitions, 13 changer transitions 0/100 dead transitions. [2024-06-14 14:41:59,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 100 transitions, 829 flow [2024-06-14 14:41:59,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:41:59,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:41:59,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 136 transitions. [2024-06-14 14:41:59,829 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46258503401360546 [2024-06-14 14:41:59,829 INFO L175 Difference]: Start difference. First operand has 74 places, 75 transitions, 540 flow. Second operand 7 states and 136 transitions. [2024-06-14 14:41:59,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 100 transitions, 829 flow [2024-06-14 14:41:59,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 100 transitions, 724 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-14 14:41:59,842 INFO L231 Difference]: Finished difference. Result has 75 places, 80 transitions, 519 flow [2024-06-14 14:41:59,842 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-14 14:41:59,842 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 32 predicate places. [2024-06-14 14:41:59,843 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 80 transitions, 519 flow [2024-06-14 14:41:59,843 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-14 14:41:59,843 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:41:59,843 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:41:59,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-14 14:41:59,843 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-14 14:41:59,844 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:41:59,844 INFO L85 PathProgramCache]: Analyzing trace with hash 766776627, now seen corresponding path program 1 times [2024-06-14 14:41:59,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:41:59,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528049695] [2024-06-14 14:41:59,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:41:59,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:41:59,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:42:10,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:42:10,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:42:10,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528049695] [2024-06-14 14:42:10,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528049695] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:42:10,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:42:10,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 14:42:10,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380962887] [2024-06-14 14:42:10,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:42:10,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 14:42:10,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:42:10,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 14:42:10,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-14 14:42:10,225 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42 [2024-06-14 14:42:10,225 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-14 14:42:10,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:42:10,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42 [2024-06-14 14:42:10,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:42:10,867 INFO L124 PetriNetUnfolderBase]: 1070/1779 cut-off events. [2024-06-14 14:42:10,867 INFO L125 PetriNetUnfolderBase]: For 10606/10618 co-relation queries the response was YES. [2024-06-14 14:42:10,871 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-14 14:42:10,878 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 72 selfloop transitions, 8 changer transitions 0/91 dead transitions. [2024-06-14 14:42:10,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 91 transitions, 721 flow [2024-06-14 14:42:10,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 14:42:10,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 14:42:10,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 100 transitions. [2024-06-14 14:42:10,880 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2024-06-14 14:42:10,880 INFO L175 Difference]: Start difference. First operand has 75 places, 80 transitions, 519 flow. Second operand 5 states and 100 transitions. [2024-06-14 14:42:10,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 91 transitions, 721 flow [2024-06-14 14:42:10,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 91 transitions, 682 flow, removed 9 selfloop flow, removed 4 redundant places. [2024-06-14 14:42:10,892 INFO L231 Difference]: Finished difference. Result has 76 places, 83 transitions, 526 flow [2024-06-14 14:42:10,892 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-14 14:42:10,894 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 33 predicate places. [2024-06-14 14:42:10,894 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 83 transitions, 526 flow [2024-06-14 14:42:10,894 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-14 14:42:10,895 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:42:10,895 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:42:10,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-14 14:42:10,895 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-14 14:42:10,895 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:42:10,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1999727245, now seen corresponding path program 1 times [2024-06-14 14:42:10,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:42:10,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505318154] [2024-06-14 14:42:10,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:42:10,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:42:10,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:42:23,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:42:23,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:42:23,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505318154] [2024-06-14 14:42:23,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505318154] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:42:23,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:42:23,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 14:42:23,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745955039] [2024-06-14 14:42:23,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:42:23,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 14:42:23,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:42:23,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 14:42:23,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-14 14:42:23,375 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42 [2024-06-14 14:42:23,376 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-14 14:42:23,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:42:23,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42 [2024-06-14 14:42:23,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:42:24,048 INFO L124 PetriNetUnfolderBase]: 1067/1775 cut-off events. [2024-06-14 14:42:24,048 INFO L125 PetriNetUnfolderBase]: For 12004/12016 co-relation queries the response was YES. [2024-06-14 14:42:24,052 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-14 14:42:24,059 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 73 selfloop transitions, 11 changer transitions 0/95 dead transitions. [2024-06-14 14:42:24,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 95 transitions, 742 flow [2024-06-14 14:42:24,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 14:42:24,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 14:42:24,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 116 transitions. [2024-06-14 14:42:24,061 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4603174603174603 [2024-06-14 14:42:24,061 INFO L175 Difference]: Start difference. First operand has 76 places, 83 transitions, 526 flow. Second operand 6 states and 116 transitions. [2024-06-14 14:42:24,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 95 transitions, 742 flow [2024-06-14 14:42:24,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 95 transitions, 718 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-06-14 14:42:24,075 INFO L231 Difference]: Finished difference. Result has 79 places, 86 transitions, 558 flow [2024-06-14 14:42:24,075 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-14 14:42:24,076 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 36 predicate places. [2024-06-14 14:42:24,076 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 86 transitions, 558 flow [2024-06-14 14:42:24,077 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-14 14:42:24,077 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:42:24,077 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:42:24,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-14 14:42:24,078 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-14 14:42:24,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:42:24,078 INFO L85 PathProgramCache]: Analyzing trace with hash -920811504, now seen corresponding path program 1 times [2024-06-14 14:42:24,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:42:24,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102049325] [2024-06-14 14:42:24,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:42:24,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:42:24,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:42:35,328 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-14 14:42:35,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:42:35,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102049325] [2024-06-14 14:42:35,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102049325] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:42:35,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:42:35,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:42:35,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417193268] [2024-06-14 14:42:35,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:42:35,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:42:35,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:42:35,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:42:35,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:42:35,483 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 14:42:35,483 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-14 14:42:35,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:42:35,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 14:42:35,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:42:36,901 INFO L124 PetriNetUnfolderBase]: 1536/2410 cut-off events. [2024-06-14 14:42:36,902 INFO L125 PetriNetUnfolderBase]: For 20318/20320 co-relation queries the response was YES. [2024-06-14 14:42:36,905 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-14 14:42:36,911 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 89 selfloop transitions, 32 changer transitions 0/126 dead transitions. [2024-06-14 14:42:36,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 126 transitions, 1012 flow [2024-06-14 14:42:36,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:42:36,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:42:36,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 162 transitions. [2024-06-14 14:42:36,914 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48214285714285715 [2024-06-14 14:42:36,914 INFO L175 Difference]: Start difference. First operand has 79 places, 86 transitions, 558 flow. Second operand 8 states and 162 transitions. [2024-06-14 14:42:36,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 126 transitions, 1012 flow [2024-06-14 14:42:36,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 126 transitions, 978 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-06-14 14:42:36,928 INFO L231 Difference]: Finished difference. Result has 84 places, 89 transitions, 650 flow [2024-06-14 14:42:36,928 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-14 14:42:36,929 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 41 predicate places. [2024-06-14 14:42:36,929 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 89 transitions, 650 flow [2024-06-14 14:42:36,929 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-14 14:42:36,930 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:42:36,930 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:42:36,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-14 14:42:36,930 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-14 14:42:36,930 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:42:36,931 INFO L85 PathProgramCache]: Analyzing trace with hash 35416550, now seen corresponding path program 2 times [2024-06-14 14:42:36,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:42:36,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538950646] [2024-06-14 14:42:36,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:42:36,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:42:36,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:42:48,402 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-14 14:42:48,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:42:48,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538950646] [2024-06-14 14:42:48,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538950646] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:42:48,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:42:48,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:42:48,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456363710] [2024-06-14 14:42:48,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:42:48,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:42:48,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:42:48,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:42:48,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:42:48,507 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 14:42:48,507 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-14 14:42:48,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:42:48,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 14:42:48,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:42:49,795 INFO L124 PetriNetUnfolderBase]: 1500/2364 cut-off events. [2024-06-14 14:42:49,796 INFO L125 PetriNetUnfolderBase]: For 22391/22395 co-relation queries the response was YES. [2024-06-14 14:42:49,801 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-14 14:42:49,808 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 93 selfloop transitions, 27 changer transitions 0/125 dead transitions. [2024-06-14 14:42:49,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 125 transitions, 1035 flow [2024-06-14 14:42:49,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:42:49,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:42:49,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 157 transitions. [2024-06-14 14:42:49,813 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46726190476190477 [2024-06-14 14:42:49,813 INFO L175 Difference]: Start difference. First operand has 84 places, 89 transitions, 650 flow. Second operand 8 states and 157 transitions. [2024-06-14 14:42:49,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 125 transitions, 1035 flow [2024-06-14 14:42:49,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 125 transitions, 993 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-14 14:42:49,835 INFO L231 Difference]: Finished difference. Result has 88 places, 90 transitions, 694 flow [2024-06-14 14:42:49,836 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-14 14:42:49,836 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 45 predicate places. [2024-06-14 14:42:49,836 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 90 transitions, 694 flow [2024-06-14 14:42:49,837 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-14 14:42:49,837 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:42:49,837 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:42:49,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-14 14:42:49,837 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-14 14:42:49,838 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:42:49,838 INFO L85 PathProgramCache]: Analyzing trace with hash -802663374, now seen corresponding path program 3 times [2024-06-14 14:42:49,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:42:49,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992513407] [2024-06-14 14:42:49,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:42:49,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:42:49,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:43:01,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:43:01,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:43:01,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992513407] [2024-06-14 14:43:01,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992513407] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:43:01,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:43:01,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:43:01,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345763238] [2024-06-14 14:43:01,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:43:01,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:43:01,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:43:01,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:43:01,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:43:01,485 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 14:43:01,485 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-14 14:43:01,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:43:01,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 14:43:01,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:43:02,712 INFO L124 PetriNetUnfolderBase]: 1575/2485 cut-off events. [2024-06-14 14:43:02,712 INFO L125 PetriNetUnfolderBase]: For 25756/25758 co-relation queries the response was YES. [2024-06-14 14:43:02,717 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-14 14:43:02,723 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 82 selfloop transitions, 41 changer transitions 0/128 dead transitions. [2024-06-14 14:43:02,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 128 transitions, 1086 flow [2024-06-14 14:43:02,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:43:02,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:43:02,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 177 transitions. [2024-06-14 14:43:02,726 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46825396825396826 [2024-06-14 14:43:02,726 INFO L175 Difference]: Start difference. First operand has 88 places, 90 transitions, 694 flow. Second operand 9 states and 177 transitions. [2024-06-14 14:43:02,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 128 transitions, 1086 flow [2024-06-14 14:43:02,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 128 transitions, 1031 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-14 14:43:02,742 INFO L231 Difference]: Finished difference. Result has 91 places, 91 transitions, 750 flow [2024-06-14 14:43:02,742 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-14 14:43:02,742 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 48 predicate places. [2024-06-14 14:43:02,742 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 91 transitions, 750 flow [2024-06-14 14:43:02,742 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-14 14:43:02,743 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:43:02,743 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:43:02,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-14 14:43:02,743 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-14 14:43:02,743 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:43:02,743 INFO L85 PathProgramCache]: Analyzing trace with hash 150892418, now seen corresponding path program 1 times [2024-06-14 14:43:02,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:43:02,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072729830] [2024-06-14 14:43:02,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:43:02,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:43:02,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:43:11,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-14 14:43:11,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:43:11,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072729830] [2024-06-14 14:43:11,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072729830] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:43:11,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:43:11,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:43:11,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675151232] [2024-06-14 14:43:11,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:43:11,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:43:11,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:43:11,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:43:11,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:43:12,126 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 14:43:12,126 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-14 14:43:12,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:43:12,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 14:43:12,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:43:13,370 INFO L124 PetriNetUnfolderBase]: 1567/2490 cut-off events. [2024-06-14 14:43:13,371 INFO L125 PetriNetUnfolderBase]: For 27090/27094 co-relation queries the response was YES. [2024-06-14 14:43:13,376 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-14 14:43:13,383 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 92 selfloop transitions, 26 changer transitions 0/123 dead transitions. [2024-06-14 14:43:13,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 123 transitions, 1103 flow [2024-06-14 14:43:13,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:43:13,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:43:13,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions. [2024-06-14 14:43:13,386 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2024-06-14 14:43:13,386 INFO L175 Difference]: Start difference. First operand has 91 places, 91 transitions, 750 flow. Second operand 8 states and 154 transitions. [2024-06-14 14:43:13,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 123 transitions, 1103 flow [2024-06-14 14:43:13,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 123 transitions, 1008 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-14 14:43:13,411 INFO L231 Difference]: Finished difference. Result has 93 places, 94 transitions, 744 flow [2024-06-14 14:43:13,411 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-14 14:43:13,412 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 50 predicate places. [2024-06-14 14:43:13,412 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 94 transitions, 744 flow [2024-06-14 14:43:13,412 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-14 14:43:13,412 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:43:13,413 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:43:13,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-14 14:43:13,413 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-14 14:43:13,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:43:13,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1391405454, now seen corresponding path program 1 times [2024-06-14 14:43:13,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:43:13,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052714174] [2024-06-14 14:43:13,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:43:13,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:43:13,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:43:24,165 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-14 14:43:24,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:43:24,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052714174] [2024-06-14 14:43:24,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052714174] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:43:24,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:43:24,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 14:43:24,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675374202] [2024-06-14 14:43:24,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:43:24,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 14:43:24,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:43:24,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 14:43:24,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-14 14:43:24,303 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-14 14:43:24,303 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-14 14:43:24,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:43:24,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-14 14:43:24,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:43:25,195 INFO L124 PetriNetUnfolderBase]: 1437/2332 cut-off events. [2024-06-14 14:43:25,195 INFO L125 PetriNetUnfolderBase]: For 28662/28678 co-relation queries the response was YES. [2024-06-14 14:43:25,200 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-14 14:43:25,207 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 78 selfloop transitions, 21 changer transitions 0/111 dead transitions. [2024-06-14 14:43:25,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 111 transitions, 1008 flow [2024-06-14 14:43:25,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 14:43:25,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 14:43:25,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions. [2024-06-14 14:43:25,208 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2024-06-14 14:43:25,208 INFO L175 Difference]: Start difference. First operand has 93 places, 94 transitions, 744 flow. Second operand 6 states and 117 transitions. [2024-06-14 14:43:25,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 111 transitions, 1008 flow [2024-06-14 14:43:25,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 111 transitions, 930 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-06-14 14:43:25,227 INFO L231 Difference]: Finished difference. Result has 93 places, 97 transitions, 748 flow [2024-06-14 14:43:25,228 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-14 14:43:25,228 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 50 predicate places. [2024-06-14 14:43:25,228 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 97 transitions, 748 flow [2024-06-14 14:43:25,228 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-14 14:43:25,229 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:43:25,229 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:43:25,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-14 14:43:25,229 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-14 14:43:25,229 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:43:25,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1511726034, now seen corresponding path program 4 times [2024-06-14 14:43:25,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:43:25,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652465122] [2024-06-14 14:43:25,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:43:25,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:43:25,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:43:37,070 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-14 14:43:37,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:43:37,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652465122] [2024-06-14 14:43:37,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652465122] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:43:37,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:43:37,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:43:37,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270694422] [2024-06-14 14:43:37,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:43:37,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:43:37,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:43:37,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:43:37,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:43:37,250 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 14:43:37,250 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-14 14:43:37,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:43:37,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 14:43:37,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:43:38,366 INFO L124 PetriNetUnfolderBase]: 1602/2536 cut-off events. [2024-06-14 14:43:38,366 INFO L125 PetriNetUnfolderBase]: For 33221/33223 co-relation queries the response was YES. [2024-06-14 14:43:38,371 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-14 14:43:38,378 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 88 selfloop transitions, 42 changer transitions 0/135 dead transitions. [2024-06-14 14:43:38,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 135 transitions, 1166 flow [2024-06-14 14:43:38,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:43:38,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:43:38,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 176 transitions. [2024-06-14 14:43:38,384 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4656084656084656 [2024-06-14 14:43:38,384 INFO L175 Difference]: Start difference. First operand has 93 places, 97 transitions, 748 flow. Second operand 9 states and 176 transitions. [2024-06-14 14:43:38,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 135 transitions, 1166 flow [2024-06-14 14:43:38,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 135 transitions, 1114 flow, removed 9 selfloop flow, removed 4 redundant places. [2024-06-14 14:43:38,406 INFO L231 Difference]: Finished difference. Result has 98 places, 98 transitions, 811 flow [2024-06-14 14:43:38,406 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-14 14:43:38,407 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 55 predicate places. [2024-06-14 14:43:38,407 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 98 transitions, 811 flow [2024-06-14 14:43:38,407 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-14 14:43:38,407 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:43:38,408 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:43:38,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-14 14:43:38,408 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-14 14:43:38,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:43:38,409 INFO L85 PathProgramCache]: Analyzing trace with hash 205927396, now seen corresponding path program 2 times [2024-06-14 14:43:38,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:43:38,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57940124] [2024-06-14 14:43:38,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:43:38,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:43:38,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:43:47,795 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-14 14:43:47,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:43:47,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57940124] [2024-06-14 14:43:47,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57940124] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:43:47,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:43:47,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:43:47,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134513405] [2024-06-14 14:43:47,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:43:47,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:43:47,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:43:47,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:43:47,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:43:47,965 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 14:43:47,966 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-14 14:43:47,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:43:47,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 14:43:47,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:43:49,163 INFO L124 PetriNetUnfolderBase]: 1630/2583 cut-off events. [2024-06-14 14:43:49,163 INFO L125 PetriNetUnfolderBase]: For 35061/35072 co-relation queries the response was YES. [2024-06-14 14:43:49,171 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-14 14:43:49,182 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 96 selfloop transitions, 29 changer transitions 0/130 dead transitions. [2024-06-14 14:43:49,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 130 transitions, 1206 flow [2024-06-14 14:43:49,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:43:49,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:43:49,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions. [2024-06-14 14:43:49,186 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4494047619047619 [2024-06-14 14:43:49,186 INFO L175 Difference]: Start difference. First operand has 98 places, 98 transitions, 811 flow. Second operand 8 states and 151 transitions. [2024-06-14 14:43:49,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 130 transitions, 1206 flow [2024-06-14 14:43:49,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 130 transitions, 1109 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-14 14:43:49,211 INFO L231 Difference]: Finished difference. Result has 100 places, 104 transitions, 852 flow [2024-06-14 14:43:49,211 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-14 14:43:49,212 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 57 predicate places. [2024-06-14 14:43:49,212 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 104 transitions, 852 flow [2024-06-14 14:43:49,212 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-14 14:43:49,212 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:43:49,213 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:43:49,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-14 14:43:49,213 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-14 14:43:49,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:43:49,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1283640186, now seen corresponding path program 3 times [2024-06-14 14:43:49,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:43:49,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74732502] [2024-06-14 14:43:49,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:43:49,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:43:49,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:43:58,998 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-14 14:43:58,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:43:58,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74732502] [2024-06-14 14:43:58,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74732502] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:43:58,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:43:58,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:43:58,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681601118] [2024-06-14 14:43:59,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:43:59,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:43:59,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:43:59,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:43:59,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:43:59,134 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 14:43:59,134 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-14 14:43:59,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:43:59,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 14:43:59,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:44:00,423 INFO L124 PetriNetUnfolderBase]: 1647/2630 cut-off events. [2024-06-14 14:44:00,424 INFO L125 PetriNetUnfolderBase]: For 38215/38226 co-relation queries the response was YES. [2024-06-14 14:44:00,430 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-14 14:44:00,440 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 97 selfloop transitions, 32 changer transitions 0/134 dead transitions. [2024-06-14 14:44:00,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 134 transitions, 1247 flow [2024-06-14 14:44:00,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:44:00,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:44:00,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2024-06-14 14:44:00,448 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44642857142857145 [2024-06-14 14:44:00,448 INFO L175 Difference]: Start difference. First operand has 100 places, 104 transitions, 852 flow. Second operand 8 states and 150 transitions. [2024-06-14 14:44:00,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 134 transitions, 1247 flow [2024-06-14 14:44:00,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 134 transitions, 1160 flow, removed 15 selfloop flow, removed 5 redundant places. [2024-06-14 14:44:00,482 INFO L231 Difference]: Finished difference. Result has 103 places, 108 transitions, 893 flow [2024-06-14 14:44:00,482 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-14 14:44:00,482 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 60 predicate places. [2024-06-14 14:44:00,482 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 108 transitions, 893 flow [2024-06-14 14:44:00,483 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-14 14:44:00,483 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:44:00,483 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:44:00,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-14 14:44:00,483 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-14 14:44:00,483 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:44:00,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1275069306, now seen corresponding path program 4 times [2024-06-14 14:44:00,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:44:00,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446336489] [2024-06-14 14:44:00,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:44:00,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:44:00,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:44:10,820 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-14 14:44:10,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:44:10,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446336489] [2024-06-14 14:44:10,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446336489] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:44:10,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:44:10,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:44:10,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946411781] [2024-06-14 14:44:10,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:44:10,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:44:10,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:44:10,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:44:10,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:44:11,098 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 14:44:11,099 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-14 14:44:11,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:44:11,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 14:44:11,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:44:12,335 INFO L124 PetriNetUnfolderBase]: 1680/2686 cut-off events. [2024-06-14 14:44:12,335 INFO L125 PetriNetUnfolderBase]: For 41175/41179 co-relation queries the response was YES. [2024-06-14 14:44:12,341 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-14 14:44:12,348 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 81 selfloop transitions, 58 changer transitions 0/144 dead transitions. [2024-06-14 14:44:12,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 144 transitions, 1365 flow [2024-06-14 14:44:12,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:44:12,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:44:12,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 157 transitions. [2024-06-14 14:44:12,352 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46726190476190477 [2024-06-14 14:44:12,352 INFO L175 Difference]: Start difference. First operand has 103 places, 108 transitions, 893 flow. Second operand 8 states and 157 transitions. [2024-06-14 14:44:12,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 144 transitions, 1365 flow [2024-06-14 14:44:12,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 144 transitions, 1289 flow, removed 15 selfloop flow, removed 4 redundant places. [2024-06-14 14:44:12,380 INFO L231 Difference]: Finished difference. Result has 109 places, 116 transitions, 1082 flow [2024-06-14 14:44:12,381 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-14 14:44:12,381 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 66 predicate places. [2024-06-14 14:44:12,381 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 116 transitions, 1082 flow [2024-06-14 14:44:12,381 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-14 14:44:12,382 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:44:12,382 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:44:12,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-14 14:44:12,382 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-14 14:44:12,382 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:44:12,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1862015214, now seen corresponding path program 2 times [2024-06-14 14:44:12,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:44:12,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489540811] [2024-06-14 14:44:12,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:44:12,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:44:12,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:44:24,078 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-14 14:44:24,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:44:24,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489540811] [2024-06-14 14:44:24,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489540811] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:44:24,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:44:24,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:44:24,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484451644] [2024-06-14 14:44:24,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:44:24,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:44:24,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:44:24,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:44:24,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:44:24,224 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-14 14:44:24,224 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-14 14:44:24,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:44:24,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-14 14:44:24,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:44:25,184 INFO L124 PetriNetUnfolderBase]: 1563/2560 cut-off events. [2024-06-14 14:44:25,184 INFO L125 PetriNetUnfolderBase]: For 45036/45046 co-relation queries the response was YES. [2024-06-14 14:44:25,192 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-14 14:44:25,201 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 90 selfloop transitions, 27 changer transitions 0/134 dead transitions. [2024-06-14 14:44:25,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 134 transitions, 1390 flow [2024-06-14 14:44:25,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:44:25,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:44:25,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions. [2024-06-14 14:44:25,202 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2024-06-14 14:44:25,202 INFO L175 Difference]: Start difference. First operand has 109 places, 116 transitions, 1082 flow. Second operand 7 states and 133 transitions. [2024-06-14 14:44:25,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 134 transitions, 1390 flow [2024-06-14 14:44:25,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 134 transitions, 1296 flow, removed 19 selfloop flow, removed 3 redundant places. [2024-06-14 14:44:25,239 INFO L231 Difference]: Finished difference. Result has 113 places, 119 transitions, 1084 flow [2024-06-14 14:44:25,240 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-14 14:44:25,240 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 70 predicate places. [2024-06-14 14:44:25,240 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 119 transitions, 1084 flow [2024-06-14 14:44:25,240 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-14 14:44:25,240 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:44:25,241 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:44:25,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-14 14:44:25,241 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-14 14:44:25,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:44:25,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1381389912, now seen corresponding path program 1 times [2024-06-14 14:44:25,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:44:25,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098456515] [2024-06-14 14:44:25,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:44:25,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:44:25,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:44:36,135 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-14 14:44:36,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:44:36,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098456515] [2024-06-14 14:44:36,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098456515] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:44:36,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:44:36,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 14:44:36,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252045761] [2024-06-14 14:44:36,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:44:36,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 14:44:36,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:44:36,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 14:44:36,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-14 14:44:36,268 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-14 14:44:36,268 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-14 14:44:36,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:44:36,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-14 14:44:36,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:44:37,265 INFO L124 PetriNetUnfolderBase]: 1517/2502 cut-off events. [2024-06-14 14:44:37,265 INFO L125 PetriNetUnfolderBase]: For 40651/40653 co-relation queries the response was YES. [2024-06-14 14:44:37,272 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-14 14:44:37,282 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 118 selfloop transitions, 11 changer transitions 0/135 dead transitions. [2024-06-14 14:44:37,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 135 transitions, 1414 flow [2024-06-14 14:44:37,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 14:44:37,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 14:44:37,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 115 transitions. [2024-06-14 14:44:37,283 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45634920634920634 [2024-06-14 14:44:37,283 INFO L175 Difference]: Start difference. First operand has 113 places, 119 transitions, 1084 flow. Second operand 6 states and 115 transitions. [2024-06-14 14:44:37,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 135 transitions, 1414 flow [2024-06-14 14:44:37,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 135 transitions, 1340 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-06-14 14:44:37,317 INFO L231 Difference]: Finished difference. Result has 114 places, 122 transitions, 1074 flow [2024-06-14 14:44:37,318 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-14 14:44:37,318 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 71 predicate places. [2024-06-14 14:44:37,318 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 122 transitions, 1074 flow [2024-06-14 14:44:37,318 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-14 14:44:37,318 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:44:37,318 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:44:37,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-14 14:44:37,318 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-14 14:44:37,319 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:44:37,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1862009262, now seen corresponding path program 2 times [2024-06-14 14:44:37,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:44:37,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859502973] [2024-06-14 14:44:37,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:44:37,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:44:37,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:44:48,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:44:48,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:44:48,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859502973] [2024-06-14 14:44:48,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859502973] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:44:48,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:44:48,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 14:44:48,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087215717] [2024-06-14 14:44:48,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:44:48,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 14:44:48,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:44:48,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 14:44:48,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-14 14:44:48,795 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-14 14:44:48,796 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-14 14:44:48,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:44:48,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-14 14:44:48,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:44:49,664 INFO L124 PetriNetUnfolderBase]: 1519/2518 cut-off events. [2024-06-14 14:44:49,664 INFO L125 PetriNetUnfolderBase]: For 43121/43126 co-relation queries the response was YES. [2024-06-14 14:44:49,672 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-14 14:44:49,681 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 114 selfloop transitions, 16 changer transitions 0/136 dead transitions. [2024-06-14 14:44:49,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 136 transitions, 1408 flow [2024-06-14 14:44:49,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 14:44:49,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 14:44:49,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 115 transitions. [2024-06-14 14:44:49,682 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45634920634920634 [2024-06-14 14:44:49,682 INFO L175 Difference]: Start difference. First operand has 114 places, 122 transitions, 1074 flow. Second operand 6 states and 115 transitions. [2024-06-14 14:44:49,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 136 transitions, 1408 flow [2024-06-14 14:44:49,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 136 transitions, 1366 flow, removed 12 selfloop flow, removed 4 redundant places. [2024-06-14 14:44:49,723 INFO L231 Difference]: Finished difference. Result has 116 places, 125 transitions, 1112 flow [2024-06-14 14:44:49,724 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-14 14:44:49,724 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 73 predicate places. [2024-06-14 14:44:49,724 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 125 transitions, 1112 flow [2024-06-14 14:44:49,725 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-14 14:44:49,725 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:44:49,725 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:44:49,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-14 14:44:49,725 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-14 14:44:49,725 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:44:49,725 INFO L85 PathProgramCache]: Analyzing trace with hash 892965962, now seen corresponding path program 1 times [2024-06-14 14:44:49,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:44:49,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479518369] [2024-06-14 14:44:49,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:44:49,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:44:49,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:45:01,193 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-14 14:45:01,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:45:01,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479518369] [2024-06-14 14:45:01,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479518369] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:45:01,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:45:01,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:45:01,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023272024] [2024-06-14 14:45:01,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:45:01,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:45:01,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:45:01,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:45:01,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:45:01,409 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 14:45:01,410 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-14 14:45:01,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:45:01,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 14:45:01,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:45:02,905 INFO L124 PetriNetUnfolderBase]: 1768/2850 cut-off events. [2024-06-14 14:45:02,905 INFO L125 PetriNetUnfolderBase]: For 59040/59042 co-relation queries the response was YES. [2024-06-14 14:45:02,913 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-14 14:45:02,924 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 113 selfloop transitions, 57 changer transitions 0/175 dead transitions. [2024-06-14 14:45:02,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 175 transitions, 1678 flow [2024-06-14 14:45:02,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:45:02,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:45:02,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 211 transitions. [2024-06-14 14:45:02,927 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45670995670995673 [2024-06-14 14:45:02,927 INFO L175 Difference]: Start difference. First operand has 116 places, 125 transitions, 1112 flow. Second operand 11 states and 211 transitions. [2024-06-14 14:45:02,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 175 transitions, 1678 flow [2024-06-14 14:45:02,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 175 transitions, 1620 flow, removed 15 selfloop flow, removed 4 redundant places. [2024-06-14 14:45:02,962 INFO L231 Difference]: Finished difference. Result has 125 places, 130 transitions, 1268 flow [2024-06-14 14:45:02,963 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-14 14:45:02,963 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 82 predicate places. [2024-06-14 14:45:02,963 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 130 transitions, 1268 flow [2024-06-14 14:45:02,963 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-14 14:45:02,963 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:45:02,963 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:45:02,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-14 14:45:02,964 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-14 14:45:02,964 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:45:02,964 INFO L85 PathProgramCache]: Analyzing trace with hash 2052808564, now seen corresponding path program 1 times [2024-06-14 14:45:02,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:45:02,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6884409] [2024-06-14 14:45:02,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:45:02,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:45:03,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:45:15,863 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-14 14:45:15,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:45:15,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6884409] [2024-06-14 14:45:15,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6884409] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:45:15,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:45:15,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:45:15,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869398564] [2024-06-14 14:45:15,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:45:15,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:45:15,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:45:15,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:45:15,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:45:15,988 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-14 14:45:15,989 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-14 14:45:15,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:45:15,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-14 14:45:15,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:45:17,022 INFO L124 PetriNetUnfolderBase]: 1664/2736 cut-off events. [2024-06-14 14:45:17,022 INFO L125 PetriNetUnfolderBase]: For 62106/62116 co-relation queries the response was YES. [2024-06-14 14:45:17,032 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-14 14:45:17,041 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 107 selfloop transitions, 24 changer transitions 0/148 dead transitions. [2024-06-14 14:45:17,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 148 transitions, 1604 flow [2024-06-14 14:45:17,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:45:17,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:45:17,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions. [2024-06-14 14:45:17,042 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4489795918367347 [2024-06-14 14:45:17,042 INFO L175 Difference]: Start difference. First operand has 125 places, 130 transitions, 1268 flow. Second operand 7 states and 132 transitions. [2024-06-14 14:45:17,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 148 transitions, 1604 flow [2024-06-14 14:45:17,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 148 transitions, 1500 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-14 14:45:17,086 INFO L231 Difference]: Finished difference. Result has 125 places, 133 transitions, 1254 flow [2024-06-14 14:45:17,086 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-14 14:45:17,086 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 82 predicate places. [2024-06-14 14:45:17,086 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 133 transitions, 1254 flow [2024-06-14 14:45:17,086 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-14 14:45:17,087 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:45:17,087 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:45:17,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-14 14:45:17,087 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-14 14:45:17,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:45:17,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1965226934, now seen corresponding path program 2 times [2024-06-14 14:45:17,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:45:17,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307873126] [2024-06-14 14:45:17,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:45:17,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:45:17,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:45:28,325 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-14 14:45:28,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:45:28,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307873126] [2024-06-14 14:45:28,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307873126] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:45:28,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:45:28,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:45:28,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083151110] [2024-06-14 14:45:28,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:45:28,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:45:28,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:45:28,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:45:28,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:45:28,546 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 14:45:28,546 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-14 14:45:28,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:45:28,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 14:45:28,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:45:29,920 INFO L124 PetriNetUnfolderBase]: 1888/3067 cut-off events. [2024-06-14 14:45:29,921 INFO L125 PetriNetUnfolderBase]: For 68607/68611 co-relation queries the response was YES. [2024-06-14 14:45:29,929 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-14 14:45:29,938 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 108 selfloop transitions, 62 changer transitions 0/175 dead transitions. [2024-06-14 14:45:29,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 175 transitions, 1811 flow [2024-06-14 14:45:29,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:45:29,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:45:29,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 175 transitions. [2024-06-14 14:45:29,940 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46296296296296297 [2024-06-14 14:45:29,940 INFO L175 Difference]: Start difference. First operand has 125 places, 133 transitions, 1254 flow. Second operand 9 states and 175 transitions. [2024-06-14 14:45:29,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 175 transitions, 1811 flow [2024-06-14 14:45:29,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 175 transitions, 1743 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-06-14 14:45:29,996 INFO L231 Difference]: Finished difference. Result has 131 places, 141 transitions, 1436 flow [2024-06-14 14:45:29,996 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-14 14:45:29,996 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 88 predicate places. [2024-06-14 14:45:29,996 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 141 transitions, 1436 flow [2024-06-14 14:45:29,997 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-14 14:45:29,997 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:45:29,997 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:45:29,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-14 14:45:29,997 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-14 14:45:29,998 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:45:29,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1956030164, now seen corresponding path program 3 times [2024-06-14 14:45:29,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:45:29,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838467841] [2024-06-14 14:45:29,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:45:29,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:45:30,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:45:40,938 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-14 14:45:40,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:45:40,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838467841] [2024-06-14 14:45:40,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838467841] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:45:40,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:45:40,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:45:40,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885107308] [2024-06-14 14:45:40,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:45:40,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:45:40,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:45:40,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:45:40,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:45:41,153 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 14:45:41,153 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-14 14:45:41,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:45:41,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 14:45:41,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:45:42,469 INFO L124 PetriNetUnfolderBase]: 1970/3229 cut-off events. [2024-06-14 14:45:42,469 INFO L125 PetriNetUnfolderBase]: For 76890/76894 co-relation queries the response was YES. [2024-06-14 14:45:42,478 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-14 14:45:42,487 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 102 selfloop transitions, 72 changer transitions 0/179 dead transitions. [2024-06-14 14:45:42,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 179 transitions, 2024 flow [2024-06-14 14:45:42,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:45:42,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:45:42,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 176 transitions. [2024-06-14 14:45:42,490 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4656084656084656 [2024-06-14 14:45:42,490 INFO L175 Difference]: Start difference. First operand has 131 places, 141 transitions, 1436 flow. Second operand 9 states and 176 transitions. [2024-06-14 14:45:42,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 179 transitions, 2024 flow [2024-06-14 14:45:42,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 179 transitions, 1934 flow, removed 14 selfloop flow, removed 3 redundant places. [2024-06-14 14:45:42,576 INFO L231 Difference]: Finished difference. Result has 138 places, 143 transitions, 1574 flow [2024-06-14 14:45:42,576 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-14 14:45:42,577 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 95 predicate places. [2024-06-14 14:45:42,577 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 143 transitions, 1574 flow [2024-06-14 14:45:42,577 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-14 14:45:42,577 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:45:42,577 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:45:42,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-14 14:45:42,578 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-14 14:45:42,578 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:45:42,578 INFO L85 PathProgramCache]: Analyzing trace with hash 386859982, now seen corresponding path program 4 times [2024-06-14 14:45:42,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:45:42,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584586523] [2024-06-14 14:45:42,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:45:42,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:45:42,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:45:53,592 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-14 14:45:53,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:45:53,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584586523] [2024-06-14 14:45:53,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584586523] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:45:53,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:45:53,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:45:53,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624738703] [2024-06-14 14:45:53,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:45:53,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:45:53,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:45:53,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:45:53,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:45:53,844 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 14:45:53,845 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-14 14:45:53,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:45:53,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 14:45:53,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:45:55,257 INFO L124 PetriNetUnfolderBase]: 1950/3197 cut-off events. [2024-06-14 14:45:55,257 INFO L125 PetriNetUnfolderBase]: For 77105/77109 co-relation queries the response was YES. [2024-06-14 14:45:55,267 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-14 14:45:55,276 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 112 selfloop transitions, 59 changer transitions 0/176 dead transitions. [2024-06-14 14:45:55,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 176 transitions, 2004 flow [2024-06-14 14:45:55,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:45:55,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:45:55,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 175 transitions. [2024-06-14 14:45:55,278 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46296296296296297 [2024-06-14 14:45:55,278 INFO L175 Difference]: Start difference. First operand has 138 places, 143 transitions, 1574 flow. Second operand 9 states and 175 transitions. [2024-06-14 14:45:55,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 176 transitions, 2004 flow [2024-06-14 14:45:55,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 176 transitions, 1854 flow, removed 17 selfloop flow, removed 6 redundant places. [2024-06-14 14:45:55,352 INFO L231 Difference]: Finished difference. Result has 140 places, 142 transitions, 1502 flow [2024-06-14 14:45:55,352 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-14 14:45:55,352 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 97 predicate places. [2024-06-14 14:45:55,352 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 142 transitions, 1502 flow [2024-06-14 14:45:55,352 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-14 14:45:55,353 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:45:55,353 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:45:55,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-14 14:45:55,353 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-14 14:45:55,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:45:55,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1887479982, now seen corresponding path program 2 times [2024-06-14 14:45:55,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:45:55,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142763182] [2024-06-14 14:45:55,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:45:55,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:45:55,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:46:08,356 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-14 14:46:08,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:46:08,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142763182] [2024-06-14 14:46:08,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142763182] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:46:08,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:46:08,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:46:08,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224616570] [2024-06-14 14:46:08,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:46:08,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:46:08,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:46:08,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:46:08,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:46:08,501 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-14 14:46:08,501 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-14 14:46:08,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:46:08,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-14 14:46:08,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:46:09,577 INFO L124 PetriNetUnfolderBase]: 1814/3019 cut-off events. [2024-06-14 14:46:09,577 INFO L125 PetriNetUnfolderBase]: For 76093/76109 co-relation queries the response was YES. [2024-06-14 14:46:09,587 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-14 14:46:09,595 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 108 selfloop transitions, 36 changer transitions 0/161 dead transitions. [2024-06-14 14:46:09,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 161 transitions, 1958 flow [2024-06-14 14:46:09,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:46:09,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:46:09,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2024-06-14 14:46:09,596 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4387755102040816 [2024-06-14 14:46:09,596 INFO L175 Difference]: Start difference. First operand has 140 places, 142 transitions, 1502 flow. Second operand 7 states and 129 transitions. [2024-06-14 14:46:09,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 161 transitions, 1958 flow [2024-06-14 14:46:09,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 161 transitions, 1749 flow, removed 12 selfloop flow, removed 9 redundant places. [2024-06-14 14:46:09,664 INFO L231 Difference]: Finished difference. Result has 139 places, 150 transitions, 1472 flow [2024-06-14 14:46:09,664 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-14 14:46:09,664 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 96 predicate places. [2024-06-14 14:46:09,664 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 150 transitions, 1472 flow [2024-06-14 14:46:09,665 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-14 14:46:09,665 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:46:09,665 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:46:09,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-14 14:46:09,665 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-14 14:46:09,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:46:09,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1887895692, now seen corresponding path program 3 times [2024-06-14 14:46:09,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:46:09,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965484532] [2024-06-14 14:46:09,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:46:09,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:46:09,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:46:21,768 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-14 14:46:21,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:46:21,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965484532] [2024-06-14 14:46:21,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965484532] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:46:21,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:46:21,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:46:21,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573734617] [2024-06-14 14:46:21,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:46:21,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:46:21,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:46:21,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:46:21,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:46:21,938 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-14 14:46:21,938 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-14 14:46:21,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:46:21,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-14 14:46:21,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:46:23,059 INFO L124 PetriNetUnfolderBase]: 1810/3012 cut-off events. [2024-06-14 14:46:23,059 INFO L125 PetriNetUnfolderBase]: For 78023/78039 co-relation queries the response was YES. [2024-06-14 14:46:23,070 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-14 14:46:23,080 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 115 selfloop transitions, 29 changer transitions 0/161 dead transitions. [2024-06-14 14:46:23,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 161 transitions, 1795 flow [2024-06-14 14:46:23,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:46:23,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:46:23,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions. [2024-06-14 14:46:23,082 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43197278911564624 [2024-06-14 14:46:23,082 INFO L175 Difference]: Start difference. First operand has 139 places, 150 transitions, 1472 flow. Second operand 7 states and 127 transitions. [2024-06-14 14:46:23,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 161 transitions, 1795 flow [2024-06-14 14:46:23,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 161 transitions, 1711 flow, removed 26 selfloop flow, removed 3 redundant places. [2024-06-14 14:46:23,146 INFO L231 Difference]: Finished difference. Result has 143 places, 151 transitions, 1461 flow [2024-06-14 14:46:23,146 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-14 14:46:23,146 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 100 predicate places. [2024-06-14 14:46:23,146 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 151 transitions, 1461 flow [2024-06-14 14:46:23,147 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-14 14:46:23,147 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:46:23,147 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:46:23,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-14 14:46:23,147 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-14 14:46:23,147 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:46:23,147 INFO L85 PathProgramCache]: Analyzing trace with hash -2064962856, now seen corresponding path program 1 times [2024-06-14 14:46:23,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:46:23,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409996782] [2024-06-14 14:46:23,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:46:23,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:46:23,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:46:34,609 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-14 14:46:34,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:46:34,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409996782] [2024-06-14 14:46:34,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409996782] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:46:34,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:46:34,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:46:34,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278733335] [2024-06-14 14:46:34,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:46:34,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:46:34,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:46:34,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:46:34,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:46:34,757 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-14 14:46:34,758 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-14 14:46:34,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:46:34,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-14 14:46:34,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:46:36,024 INFO L124 PetriNetUnfolderBase]: 1866/3113 cut-off events. [2024-06-14 14:46:36,025 INFO L125 PetriNetUnfolderBase]: For 82318/82320 co-relation queries the response was YES. [2024-06-14 14:46:36,034 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-14 14:46:36,046 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 146 selfloop transitions, 14 changer transitions 0/170 dead transitions. [2024-06-14 14:46:36,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 170 transitions, 1871 flow [2024-06-14 14:46:36,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:46:36,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:46:36,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions. [2024-06-14 14:46:36,047 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.445578231292517 [2024-06-14 14:46:36,047 INFO L175 Difference]: Start difference. First operand has 143 places, 151 transitions, 1461 flow. Second operand 7 states and 131 transitions. [2024-06-14 14:46:36,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 170 transitions, 1871 flow [2024-06-14 14:46:36,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 170 transitions, 1809 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-14 14:46:36,132 INFO L231 Difference]: Finished difference. Result has 145 places, 154 transitions, 1481 flow [2024-06-14 14:46:36,133 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-14 14:46:36,133 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 102 predicate places. [2024-06-14 14:46:36,133 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 154 transitions, 1481 flow [2024-06-14 14:46:36,134 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-14 14:46:36,134 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:46:36,134 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:46:36,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-14 14:46:36,134 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-14 14:46:36,135 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:46:36,135 INFO L85 PathProgramCache]: Analyzing trace with hash -2064842700, now seen corresponding path program 1 times [2024-06-14 14:46:36,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:46:36,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460262706] [2024-06-14 14:46:36,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:46:36,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:46:36,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:46:51,337 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-14 14:46:51,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:46:51,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460262706] [2024-06-14 14:46:51,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460262706] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:46:51,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:46:51,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:46:51,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927639196] [2024-06-14 14:46:51,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:46:51,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:46:51,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:46:51,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:46:51,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:46:51,480 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-14 14:46:51,482 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-14 14:46:51,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:46:51,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-14 14:46:51,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:46:52,658 INFO L124 PetriNetUnfolderBase]: 1876/3131 cut-off events. [2024-06-14 14:46:52,658 INFO L125 PetriNetUnfolderBase]: For 88916/88918 co-relation queries the response was YES. [2024-06-14 14:46:52,667 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-14 14:46:52,676 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 147 selfloop transitions, 15 changer transitions 0/172 dead transitions. [2024-06-14 14:46:52,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 172 transitions, 1893 flow [2024-06-14 14:46:52,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:46:52,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:46:52,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 130 transitions. [2024-06-14 14:46:52,677 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4421768707482993 [2024-06-14 14:46:52,677 INFO L175 Difference]: Start difference. First operand has 145 places, 154 transitions, 1481 flow. Second operand 7 states and 130 transitions. [2024-06-14 14:46:52,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 172 transitions, 1893 flow [2024-06-14 14:46:52,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 172 transitions, 1833 flow, removed 18 selfloop flow, removed 5 redundant places. [2024-06-14 14:46:52,759 INFO L231 Difference]: Finished difference. Result has 147 places, 158 transitions, 1510 flow [2024-06-14 14:46:52,759 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-14 14:46:52,759 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 104 predicate places. [2024-06-14 14:46:52,759 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 158 transitions, 1510 flow [2024-06-14 14:46:52,760 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-14 14:46:52,760 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:46:52,760 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:46:52,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-14 14:46:52,760 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-14 14:46:52,760 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:46:52,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1887711180, now seen corresponding path program 2 times [2024-06-14 14:46:52,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:46:52,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607296805] [2024-06-14 14:46:52,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:46:52,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:46:52,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:47:05,560 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-14 14:47:05,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:47:05,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607296805] [2024-06-14 14:47:05,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607296805] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:47:05,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:47:05,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:47:05,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379365145] [2024-06-14 14:47:05,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:47:05,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:47:05,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:47:05,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:47:05,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:47:05,736 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-14 14:47:05,736 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-14 14:47:05,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:47:05,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-14 14:47:05,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:47:06,861 INFO L124 PetriNetUnfolderBase]: 1901/3169 cut-off events. [2024-06-14 14:47:06,861 INFO L125 PetriNetUnfolderBase]: For 95980/95985 co-relation queries the response was YES. [2024-06-14 14:47:06,871 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-14 14:47:06,880 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 144 selfloop transitions, 22 changer transitions 0/176 dead transitions. [2024-06-14 14:47:06,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 176 transitions, 1950 flow [2024-06-14 14:47:06,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:47:06,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:47:06,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions. [2024-06-14 14:47:06,881 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4255952380952381 [2024-06-14 14:47:06,881 INFO L175 Difference]: Start difference. First operand has 147 places, 158 transitions, 1510 flow. Second operand 8 states and 143 transitions. [2024-06-14 14:47:06,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 176 transitions, 1950 flow [2024-06-14 14:47:06,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 176 transitions, 1887 flow, removed 18 selfloop flow, removed 5 redundant places. [2024-06-14 14:47:06,953 INFO L231 Difference]: Finished difference. Result has 151 places, 164 transitions, 1573 flow [2024-06-14 14:47:06,953 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-14 14:47:06,953 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 108 predicate places. [2024-06-14 14:47:06,953 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 164 transitions, 1573 flow [2024-06-14 14:47:06,953 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-14 14:47:06,953 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:47:06,953 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:47:06,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-14 14:47:06,954 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-14 14:47:06,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:47:06,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1042262038, now seen corresponding path program 3 times [2024-06-14 14:47:06,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:47:06,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52318450] [2024-06-14 14:47:06,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:47:06,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:47:07,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:47:20,131 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-14 14:47:20,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:47:20,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52318450] [2024-06-14 14:47:20,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52318450] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:47:20,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:47:20,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 14:47:20,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801702648] [2024-06-14 14:47:20,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:47:20,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 14:47:20,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:47:20,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 14:47:20,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-14 14:47:20,301 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42 [2024-06-14 14:47:20,301 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-14 14:47:20,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:47:20,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42 [2024-06-14 14:47:20,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:47:21,322 INFO L124 PetriNetUnfolderBase]: 1895/3161 cut-off events. [2024-06-14 14:47:21,322 INFO L125 PetriNetUnfolderBase]: For 98140/98145 co-relation queries the response was YES. [2024-06-14 14:47:21,334 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-14 14:47:21,345 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 139 selfloop transitions, 32 changer transitions 0/181 dead transitions. [2024-06-14 14:47:21,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 181 transitions, 2048 flow [2024-06-14 14:47:21,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:47:21,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:47:21,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 137 transitions. [2024-06-14 14:47:21,346 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46598639455782315 [2024-06-14 14:47:21,346 INFO L175 Difference]: Start difference. First operand has 151 places, 164 transitions, 1573 flow. Second operand 7 states and 137 transitions. [2024-06-14 14:47:21,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 181 transitions, 2048 flow [2024-06-14 14:47:21,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 181 transitions, 1949 flow, removed 33 selfloop flow, removed 4 redundant places. [2024-06-14 14:47:21,421 INFO L231 Difference]: Finished difference. Result has 155 places, 171 transitions, 1672 flow [2024-06-14 14:47:21,422 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-14 14:47:21,422 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 112 predicate places. [2024-06-14 14:47:21,422 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 171 transitions, 1672 flow [2024-06-14 14:47:21,422 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-14 14:47:21,422 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:47:21,423 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:47:21,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-14 14:47:21,423 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-14 14:47:21,423 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:47:21,423 INFO L85 PathProgramCache]: Analyzing trace with hash -171499980, now seen corresponding path program 1 times [2024-06-14 14:47:21,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:47:21,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600635262] [2024-06-14 14:47:21,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:47:21,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:47:21,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:47:33,810 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-14 14:47:33,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:47:33,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600635262] [2024-06-14 14:47:33,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600635262] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:47:33,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:47:33,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:47:33,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218139263] [2024-06-14 14:47:33,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:47:33,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:47:33,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:47:33,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:47:33,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:47:34,045 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-14 14:47:34,045 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-14 14:47:34,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:47:34,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-14 14:47:34,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:47:35,139 INFO L124 PetriNetUnfolderBase]: 1843/3069 cut-off events. [2024-06-14 14:47:35,140 INFO L125 PetriNetUnfolderBase]: For 102236/102250 co-relation queries the response was YES. [2024-06-14 14:47:35,150 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-14 14:47:35,160 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 149 selfloop transitions, 18 changer transitions 0/184 dead transitions. [2024-06-14 14:47:35,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 184 transitions, 2080 flow [2024-06-14 14:47:35,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:47:35,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:47:35,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions. [2024-06-14 14:47:35,161 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2024-06-14 14:47:35,162 INFO L175 Difference]: Start difference. First operand has 155 places, 171 transitions, 1672 flow. Second operand 8 states and 140 transitions. [2024-06-14 14:47:35,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 184 transitions, 2080 flow [2024-06-14 14:47:35,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 184 transitions, 2029 flow, removed 16 selfloop flow, removed 3 redundant places. [2024-06-14 14:47:35,230 INFO L231 Difference]: Finished difference. Result has 160 places, 174 transitions, 1717 flow [2024-06-14 14:47:35,231 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-14 14:47:35,231 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 117 predicate places. [2024-06-14 14:47:35,231 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 174 transitions, 1717 flow [2024-06-14 14:47:35,231 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-14 14:47:35,232 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:47:35,232 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-14 14:47:35,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-14 14:47:35,232 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-14 14:47:35,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:47:35,233 INFO L85 PathProgramCache]: Analyzing trace with hash -793164687, now seen corresponding path program 1 times [2024-06-14 14:47:35,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:47:35,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90733182] [2024-06-14 14:47:35,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:47:35,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:47:35,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:47:46,513 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-14 14:47:46,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:47:46,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90733182] [2024-06-14 14:47:46,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90733182] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:47:46,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:47:46,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:47:46,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643093223] [2024-06-14 14:47:46,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:47:46,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:47:46,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:47:46,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:47:46,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:47:46,704 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 14:47:46,705 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-14 14:47:46,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:47:46,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 14:47:46,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:47:47,907 INFO L124 PetriNetUnfolderBase]: 2002/3275 cut-off events. [2024-06-14 14:47:47,907 INFO L125 PetriNetUnfolderBase]: For 108257/108264 co-relation queries the response was YES. [2024-06-14 14:47:47,919 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-14 14:47:47,932 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 169 selfloop transitions, 23 changer transitions 0/197 dead transitions. [2024-06-14 14:47:47,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 197 transitions, 2221 flow [2024-06-14 14:47:47,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:47:47,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:47:47,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions. [2024-06-14 14:47:47,933 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.445578231292517 [2024-06-14 14:47:47,933 INFO L175 Difference]: Start difference. First operand has 160 places, 174 transitions, 1717 flow. Second operand 7 states and 131 transitions. [2024-06-14 14:47:47,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 197 transitions, 2221 flow [2024-06-14 14:47:48,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 197 transitions, 2117 flow, removed 25 selfloop flow, removed 7 redundant places. [2024-06-14 14:47:48,036 INFO L231 Difference]: Finished difference. Result has 160 places, 177 transitions, 1717 flow [2024-06-14 14:47:48,037 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-14 14:47:48,037 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 117 predicate places. [2024-06-14 14:47:48,037 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 177 transitions, 1717 flow [2024-06-14 14:47:48,037 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-14 14:47:48,037 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:47:48,037 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-14 14:47:48,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-14 14:47:48,037 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-14 14:47:48,038 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:47:48,038 INFO L85 PathProgramCache]: Analyzing trace with hash -787450767, now seen corresponding path program 2 times [2024-06-14 14:47:48,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:47:48,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096416419] [2024-06-14 14:47:48,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:47:48,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:47:48,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:47:59,406 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-14 14:47:59,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:47:59,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096416419] [2024-06-14 14:47:59,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096416419] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:47:59,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:47:59,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:47:59,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049592468] [2024-06-14 14:47:59,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:47:59,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:47:59,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:47:59,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:47:59,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:47:59,587 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 14:47:59,587 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-14 14:47:59,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:47:59,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 14:47:59,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:48:00,889 INFO L124 PetriNetUnfolderBase]: 2028/3317 cut-off events. [2024-06-14 14:48:00,889 INFO L125 PetriNetUnfolderBase]: For 116389/116396 co-relation queries the response was YES. [2024-06-14 14:48:00,900 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-14 14:48:00,911 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 170 selfloop transitions, 29 changer transitions 0/204 dead transitions. [2024-06-14 14:48:00,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 204 transitions, 2382 flow [2024-06-14 14:48:00,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:48:00,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:48:00,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions. [2024-06-14 14:48:00,912 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.445578231292517 [2024-06-14 14:48:00,912 INFO L175 Difference]: Start difference. First operand has 160 places, 177 transitions, 1717 flow. Second operand 7 states and 131 transitions. [2024-06-14 14:48:00,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 204 transitions, 2382 flow [2024-06-14 14:48:00,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 204 transitions, 2316 flow, removed 18 selfloop flow, removed 4 redundant places. [2024-06-14 14:48:00,994 INFO L231 Difference]: Finished difference. Result has 164 places, 185 transitions, 1852 flow [2024-06-14 14:48:00,994 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-14 14:48:00,995 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 121 predicate places. [2024-06-14 14:48:00,995 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 185 transitions, 1852 flow [2024-06-14 14:48:00,995 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-14 14:48:00,995 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:48:00,995 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-14 14:48:00,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-14 14:48:00,996 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-14 14:48:00,996 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:48:00,996 INFO L85 PathProgramCache]: Analyzing trace with hash 943682369, now seen corresponding path program 1 times [2024-06-14 14:48:00,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:48:00,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347592893] [2024-06-14 14:48:00,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:48:00,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:48:01,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:48:13,274 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-14 14:48:13,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:48:13,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347592893] [2024-06-14 14:48:13,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347592893] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:48:13,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:48:13,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:48:13,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757734156] [2024-06-14 14:48:13,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:48:13,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:48:13,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:48:13,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:48:13,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:48:13,482 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-14 14:48:13,482 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-14 14:48:13,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:48:13,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-14 14:48:13,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:48:14,618 INFO L124 PetriNetUnfolderBase]: 1883/3135 cut-off events. [2024-06-14 14:48:14,618 INFO L125 PetriNetUnfolderBase]: For 123941/123971 co-relation queries the response was YES. [2024-06-14 14:48:14,631 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-14 14:48:14,645 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 154 selfloop transitions, 30 changer transitions 0/204 dead transitions. [2024-06-14 14:48:14,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 204 transitions, 2314 flow [2024-06-14 14:48:14,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:48:14,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:48:14,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2024-06-14 14:48:14,646 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4375 [2024-06-14 14:48:14,646 INFO L175 Difference]: Start difference. First operand has 164 places, 185 transitions, 1852 flow. Second operand 8 states and 147 transitions. [2024-06-14 14:48:14,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 204 transitions, 2314 flow [2024-06-14 14:48:14,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 204 transitions, 2242 flow, removed 25 selfloop flow, removed 3 redundant places. [2024-06-14 14:48:14,762 INFO L231 Difference]: Finished difference. Result has 169 places, 188 transitions, 1896 flow [2024-06-14 14:48:14,762 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-14 14:48:14,762 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 126 predicate places. [2024-06-14 14:48:14,762 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 188 transitions, 1896 flow [2024-06-14 14:48:14,763 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-14 14:48:14,763 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:48:14,763 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-14 14:48:14,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-14 14:48:14,763 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-14 14:48:14,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:48:14,764 INFO L85 PathProgramCache]: Analyzing trace with hash 402945137, now seen corresponding path program 3 times [2024-06-14 14:48:14,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:48:14,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050368922] [2024-06-14 14:48:14,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:48:14,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:48:14,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:48:25,608 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-14 14:48:25,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:48:25,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050368922] [2024-06-14 14:48:25,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050368922] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:48:25,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:48:25,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:48:25,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128914913] [2024-06-14 14:48:25,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:48:25,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:48:25,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:48:25,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:48:25,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:48:25,758 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 14:48:25,758 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-14 14:48:25,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:48:25,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 14:48:25,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:48:26,980 INFO L124 PetriNetUnfolderBase]: 2042/3334 cut-off events. [2024-06-14 14:48:26,980 INFO L125 PetriNetUnfolderBase]: For 128285/128289 co-relation queries the response was YES. [2024-06-14 14:48:26,994 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-14 14:48:27,006 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 188 selfloop transitions, 24 changer transitions 0/217 dead transitions. [2024-06-14 14:48:27,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 217 transitions, 2431 flow [2024-06-14 14:48:27,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:48:27,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:48:27,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 163 transitions. [2024-06-14 14:48:27,007 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4312169312169312 [2024-06-14 14:48:27,007 INFO L175 Difference]: Start difference. First operand has 169 places, 188 transitions, 1896 flow. Second operand 9 states and 163 transitions. [2024-06-14 14:48:27,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 217 transitions, 2431 flow [2024-06-14 14:48:27,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 217 transitions, 2307 flow, removed 34 selfloop flow, removed 6 redundant places. [2024-06-14 14:48:27,110 INFO L231 Difference]: Finished difference. Result has 172 places, 189 transitions, 1841 flow [2024-06-14 14:48:27,110 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-14 14:48:27,111 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 129 predicate places. [2024-06-14 14:48:27,111 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 189 transitions, 1841 flow [2024-06-14 14:48:27,111 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-14 14:48:27,111 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:48:27,111 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-14 14:48:27,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-14 14:48:27,111 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-14 14:48:27,112 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:48:27,112 INFO L85 PathProgramCache]: Analyzing trace with hash 414372977, now seen corresponding path program 4 times [2024-06-14 14:48:27,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:48:27,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110518061] [2024-06-14 14:48:27,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:48:27,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:48:27,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:48:36,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:48:36,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:48:36,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110518061] [2024-06-14 14:48:36,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110518061] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:48:36,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:48:36,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:48:36,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630885049] [2024-06-14 14:48:36,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:48:36,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:48:36,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:48:36,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:48:36,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:48:37,072 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 14:48:37,072 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-14 14:48:37,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:48:37,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 14:48:37,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:48:38,258 INFO L124 PetriNetUnfolderBase]: 2052/3349 cut-off events. [2024-06-14 14:48:38,258 INFO L125 PetriNetUnfolderBase]: For 133488/133497 co-relation queries the response was YES. [2024-06-14 14:48:38,271 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-14 14:48:38,284 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 173 selfloop transitions, 30 changer transitions 0/208 dead transitions. [2024-06-14 14:48:38,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 208 transitions, 2375 flow [2024-06-14 14:48:38,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:48:38,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:48:38,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions. [2024-06-14 14:48:38,286 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43197278911564624 [2024-06-14 14:48:38,286 INFO L175 Difference]: Start difference. First operand has 172 places, 189 transitions, 1841 flow. Second operand 7 states and 127 transitions. [2024-06-14 14:48:38,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 208 transitions, 2375 flow [2024-06-14 14:48:38,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 208 transitions, 2296 flow, removed 4 selfloop flow, removed 9 redundant places. [2024-06-14 14:48:38,387 INFO L231 Difference]: Finished difference. Result has 170 places, 192 transitions, 1892 flow [2024-06-14 14:48:38,387 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-14 14:48:38,388 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 127 predicate places. [2024-06-14 14:48:38,388 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 192 transitions, 1892 flow [2024-06-14 14:48:38,390 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-14 14:48:38,391 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:48:38,391 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-14 14:48:38,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-14 14:48:38,391 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-14 14:48:38,391 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:48:38,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1610482801, now seen corresponding path program 5 times [2024-06-14 14:48:38,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:48:38,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878765350] [2024-06-14 14:48:38,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:48:38,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:48:38,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:48:49,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:48:49,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:48:49,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878765350] [2024-06-14 14:48:49,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878765350] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:48:49,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:48:49,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:48:49,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918190011] [2024-06-14 14:48:49,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:48:49,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:48:49,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:48:49,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:48:49,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:48:49,773 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 14:48:49,773 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-14 14:48:49,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:48:49,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 14:48:49,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:48:50,963 INFO L124 PetriNetUnfolderBase]: 2070/3383 cut-off events. [2024-06-14 14:48:50,963 INFO L125 PetriNetUnfolderBase]: For 142537/142549 co-relation queries the response was YES. [2024-06-14 14:48:50,977 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-14 14:48:50,991 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 165 selfloop transitions, 46 changer transitions 0/216 dead transitions. [2024-06-14 14:48:50,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 216 transitions, 2627 flow [2024-06-14 14:48:50,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:48:50,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:48:50,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 128 transitions. [2024-06-14 14:48:50,993 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43537414965986393 [2024-06-14 14:48:50,993 INFO L175 Difference]: Start difference. First operand has 170 places, 192 transitions, 1892 flow. Second operand 7 states and 128 transitions. [2024-06-14 14:48:50,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 216 transitions, 2627 flow [2024-06-14 14:48:51,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 216 transitions, 2523 flow, removed 24 selfloop flow, removed 5 redundant places. [2024-06-14 14:48:51,118 INFO L231 Difference]: Finished difference. Result has 173 places, 201 transitions, 2078 flow [2024-06-14 14:48:51,118 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-14 14:48:51,118 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 130 predicate places. [2024-06-14 14:48:51,118 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 201 transitions, 2078 flow [2024-06-14 14:48:51,119 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-14 14:48:51,119 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:48:51,119 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-14 14:48:51,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-14 14:48:51,119 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-14 14:48:51,119 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:48:51,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1604768881, now seen corresponding path program 6 times [2024-06-14 14:48:51,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:48:51,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890869965] [2024-06-14 14:48:51,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:48:51,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:48:51,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:49:02,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:49:02,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:49:02,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890869965] [2024-06-14 14:49:02,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890869965] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:49:02,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:49:02,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:49:02,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337944812] [2024-06-14 14:49:02,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:49:02,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:49:02,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:49:02,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:49:02,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:49:02,852 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 14:49:02,852 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-14 14:49:02,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:49:02,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 14:49:02,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:49:03,968 INFO L124 PetriNetUnfolderBase]: 2064/3373 cut-off events. [2024-06-14 14:49:03,968 INFO L125 PetriNetUnfolderBase]: For 148879/148891 co-relation queries the response was YES. [2024-06-14 14:49:03,982 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-14 14:49:03,994 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 164 selfloop transitions, 46 changer transitions 0/215 dead transitions. [2024-06-14 14:49:03,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 215 transitions, 2570 flow [2024-06-14 14:49:03,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:49:03,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:49:03,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions. [2024-06-14 14:49:03,995 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43197278911564624 [2024-06-14 14:49:03,995 INFO L175 Difference]: Start difference. First operand has 173 places, 201 transitions, 2078 flow. Second operand 7 states and 127 transitions. [2024-06-14 14:49:03,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 215 transitions, 2570 flow [2024-06-14 14:49:04,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 215 transitions, 2440 flow, removed 57 selfloop flow, removed 2 redundant places. [2024-06-14 14:49:04,125 INFO L231 Difference]: Finished difference. Result has 178 places, 201 transitions, 2046 flow [2024-06-14 14:49:04,125 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-14 14:49:04,125 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 135 predicate places. [2024-06-14 14:49:04,125 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 201 transitions, 2046 flow [2024-06-14 14:49:04,126 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-14 14:49:04,126 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:49:04,126 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-14 14:49:04,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-14 14:49:04,126 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-14 14:49:04,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:49:04,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1319458325, now seen corresponding path program 2 times [2024-06-14 14:49:04,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:49:04,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335478534] [2024-06-14 14:49:04,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:49:04,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:49:04,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:49:16,243 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-14 14:49:16,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:49:16,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335478534] [2024-06-14 14:49:16,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335478534] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:49:16,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:49:16,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:49:16,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956508948] [2024-06-14 14:49:16,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:49:16,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:49:16,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:49:16,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:49:16,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:49:16,471 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-14 14:49:16,471 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-14 14:49:16,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:49:16,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-14 14:49:16,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:49:17,583 INFO L124 PetriNetUnfolderBase]: 1913/3181 cut-off events. [2024-06-14 14:49:17,583 INFO L125 PetriNetUnfolderBase]: For 151660/151700 co-relation queries the response was YES. [2024-06-14 14:49:17,595 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-14 14:49:17,608 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 147 selfloop transitions, 52 changer transitions 0/224 dead transitions. [2024-06-14 14:49:17,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 224 transitions, 2806 flow [2024-06-14 14:49:17,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:49:17,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:49:17,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2024-06-14 14:49:17,610 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4375 [2024-06-14 14:49:17,610 INFO L175 Difference]: Start difference. First operand has 178 places, 201 transitions, 2046 flow. Second operand 8 states and 147 transitions. [2024-06-14 14:49:17,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 224 transitions, 2806 flow [2024-06-14 14:49:17,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 224 transitions, 2683 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-14 14:49:17,728 INFO L231 Difference]: Finished difference. Result has 181 places, 212 transitions, 2222 flow [2024-06-14 14:49:17,728 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-14 14:49:17,728 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 138 predicate places. [2024-06-14 14:49:17,728 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 212 transitions, 2222 flow [2024-06-14 14:49:17,729 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-14 14:49:17,729 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:49:17,729 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-14 14:49:17,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-14 14:49:17,729 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-14 14:49:17,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:49:17,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1618109297, now seen corresponding path program 3 times [2024-06-14 14:49:17,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:49:17,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732316619] [2024-06-14 14:49:17,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:49:17,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:49:17,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:49:29,894 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-14 14:49:29,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:49:29,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732316619] [2024-06-14 14:49:29,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732316619] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:49:29,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:49:29,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:49:29,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285510454] [2024-06-14 14:49:29,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:49:29,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:49:29,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:49:29,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:49:29,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:49:30,116 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-14 14:49:30,117 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-14 14:49:30,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:49:30,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-14 14:49:30,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:49:31,279 INFO L124 PetriNetUnfolderBase]: 1916/3191 cut-off events. [2024-06-14 14:49:31,279 INFO L125 PetriNetUnfolderBase]: For 159779/159829 co-relation queries the response was YES. [2024-06-14 14:49:31,291 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-14 14:49:31,303 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 178 selfloop transitions, 22 changer transitions 0/225 dead transitions. [2024-06-14 14:49:31,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 225 transitions, 2702 flow [2024-06-14 14:49:31,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:49:31,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:49:31,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions. [2024-06-14 14:49:31,304 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4226190476190476 [2024-06-14 14:49:31,304 INFO L175 Difference]: Start difference. First operand has 181 places, 212 transitions, 2222 flow. Second operand 8 states and 142 transitions. [2024-06-14 14:49:31,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 225 transitions, 2702 flow [2024-06-14 14:49:31,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 225 transitions, 2580 flow, removed 43 selfloop flow, removed 3 redundant places. [2024-06-14 14:49:31,425 INFO L231 Difference]: Finished difference. Result has 186 places, 215 transitions, 2213 flow [2024-06-14 14:49:31,425 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-14 14:49:31,426 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 143 predicate places. [2024-06-14 14:49:31,426 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 215 transitions, 2213 flow [2024-06-14 14:49:31,426 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-14 14:49:31,426 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:49:31,426 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-14 14:49:31,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-14 14:49:31,427 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-14 14:49:31,427 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:49:31,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1604776817, now seen corresponding path program 4 times [2024-06-14 14:49:31,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:49:31,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805818138] [2024-06-14 14:49:31,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:49:31,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:49:31,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:49:43,343 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-14 14:49:43,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:49:43,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805818138] [2024-06-14 14:49:43,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805818138] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:49:43,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:49:43,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:49:43,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691152403] [2024-06-14 14:49:43,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:49:43,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:49:43,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:49:43,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:49:43,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:49:43,497 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42 [2024-06-14 14:49:43,497 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-14 14:49:43,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:49:43,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42 [2024-06-14 14:49:43,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:49:44,599 INFO L124 PetriNetUnfolderBase]: 1917/3183 cut-off events. [2024-06-14 14:49:44,599 INFO L125 PetriNetUnfolderBase]: For 164345/164389 co-relation queries the response was YES. [2024-06-14 14:49:44,614 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-14 14:49:44,626 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 166 selfloop transitions, 38 changer transitions 0/229 dead transitions. [2024-06-14 14:49:44,626 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 229 transitions, 2718 flow [2024-06-14 14:49:44,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:49:44,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:49:44,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions. [2024-06-14 14:49:44,628 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4494047619047619 [2024-06-14 14:49:44,628 INFO L175 Difference]: Start difference. First operand has 186 places, 215 transitions, 2213 flow. Second operand 8 states and 151 transitions. [2024-06-14 14:49:44,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 229 transitions, 2718 flow [2024-06-14 14:49:44,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 229 transitions, 2607 flow, removed 37 selfloop flow, removed 6 redundant places. [2024-06-14 14:49:44,772 INFO L231 Difference]: Finished difference. Result has 188 places, 218 transitions, 2254 flow [2024-06-14 14:49:44,773 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-14 14:49:44,773 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 145 predicate places. [2024-06-14 14:49:44,773 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 218 transitions, 2254 flow [2024-06-14 14:49:44,773 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-14 14:49:44,773 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:49:44,773 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-14 14:49:44,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-14 14:49:44,774 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-14 14:49:44,774 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:49:44,774 INFO L85 PathProgramCache]: Analyzing trace with hash 410661998, now seen corresponding path program 1 times [2024-06-14 14:49:44,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:49:44,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415128967] [2024-06-14 14:49:44,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:49:44,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:49:44,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:49:57,978 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-14 14:49:57,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:49:57,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415128967] [2024-06-14 14:49:57,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415128967] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:49:57,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:49:57,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:49:57,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468469152] [2024-06-14 14:49:57,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:49:57,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:49:57,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:49:57,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:49:57,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:49:58,218 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-14 14:49:58,219 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-14 14:49:58,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:49:58,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-14 14:49:58,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:49:59,430 INFO L124 PetriNetUnfolderBase]: 1995/3320 cut-off events. [2024-06-14 14:49:59,431 INFO L125 PetriNetUnfolderBase]: For 169420/169422 co-relation queries the response was YES. [2024-06-14 14:49:59,446 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-14 14:49:59,457 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 210 selfloop transitions, 18 changer transitions 0/238 dead transitions. [2024-06-14 14:49:59,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 238 transitions, 2830 flow [2024-06-14 14:49:59,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:49:59,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:49:59,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2024-06-14 14:49:59,458 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4375 [2024-06-14 14:49:59,458 INFO L175 Difference]: Start difference. First operand has 188 places, 218 transitions, 2254 flow. Second operand 8 states and 147 transitions. [2024-06-14 14:49:59,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 238 transitions, 2830 flow [2024-06-14 14:49:59,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 238 transitions, 2700 flow, removed 30 selfloop flow, removed 6 redundant places. [2024-06-14 14:49:59,623 INFO L231 Difference]: Finished difference. Result has 190 places, 221 transitions, 2236 flow [2024-06-14 14:49:59,623 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-14 14:49:59,624 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 147 predicate places. [2024-06-14 14:49:59,624 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 221 transitions, 2236 flow [2024-06-14 14:49:59,624 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-14 14:49:59,624 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:49:59,624 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-14 14:49:59,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-14 14:49:59,624 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-14 14:49:59,624 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:49:59,624 INFO L85 PathProgramCache]: Analyzing trace with hash 414386648, now seen corresponding path program 2 times [2024-06-14 14:49:59,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:49:59,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360677131] [2024-06-14 14:49:59,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:49:59,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:49:59,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:50:14,244 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-14 14:50:14,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:50:14,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360677131] [2024-06-14 14:50:14,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360677131] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:50:14,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:50:14,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:50:14,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322508253] [2024-06-14 14:50:14,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:50:14,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:50:14,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:50:14,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:50:14,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:50:14,405 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-14 14:50:14,405 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-14 14:50:14,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:50:14,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-14 14:50:14,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:50:15,786 INFO L124 PetriNetUnfolderBase]: 2023/3366 cut-off events. [2024-06-14 14:50:15,787 INFO L125 PetriNetUnfolderBase]: For 178954/178956 co-relation queries the response was YES. [2024-06-14 14:50:15,801 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-14 14:50:15,815 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 211 selfloop transitions, 23 changer transitions 0/244 dead transitions. [2024-06-14 14:50:15,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 244 transitions, 3010 flow [2024-06-14 14:50:15,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:50:15,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:50:15,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions. [2024-06-14 14:50:15,816 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44047619047619047 [2024-06-14 14:50:15,816 INFO L175 Difference]: Start difference. First operand has 190 places, 221 transitions, 2236 flow. Second operand 8 states and 148 transitions. [2024-06-14 14:50:15,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 244 transitions, 3010 flow [2024-06-14 14:50:16,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 244 transitions, 2926 flow, removed 26 selfloop flow, removed 6 redundant places. [2024-06-14 14:50:16,008 INFO L231 Difference]: Finished difference. Result has 193 places, 229 transitions, 2387 flow [2024-06-14 14:50:16,008 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-14 14:50:16,009 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 150 predicate places. [2024-06-14 14:50:16,009 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 229 transitions, 2387 flow [2024-06-14 14:50:16,009 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-14 14:50:16,009 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:50:16,009 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-14 14:50:16,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-14 14:50:16,010 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-14 14:50:16,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:50:16,010 INFO L85 PathProgramCache]: Analyzing trace with hash -333850970, now seen corresponding path program 3 times [2024-06-14 14:50:16,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:50:16,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663626416] [2024-06-14 14:50:16,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:50:16,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:50:16,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:50:30,852 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-14 14:50:30,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:50:30,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663626416] [2024-06-14 14:50:30,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663626416] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:50:30,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:50:30,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:50:30,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987807734] [2024-06-14 14:50:30,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:50:30,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:50:30,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:50:30,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:50:30,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:50:31,027 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-14 14:50:31,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-14 14:50:31,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:50:31,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-14 14:50:31,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:50:32,200 INFO L124 PetriNetUnfolderBase]: 2041/3400 cut-off events. [2024-06-14 14:50:32,201 INFO L125 PetriNetUnfolderBase]: For 189144/189149 co-relation queries the response was YES. [2024-06-14 14:50:32,216 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-14 14:50:32,229 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 208 selfloop transitions, 31 changer transitions 0/249 dead transitions. [2024-06-14 14:50:32,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 249 transitions, 3181 flow [2024-06-14 14:50:32,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:50:32,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:50:32,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions. [2024-06-14 14:50:32,233 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44047619047619047 [2024-06-14 14:50:32,233 INFO L175 Difference]: Start difference. First operand has 193 places, 229 transitions, 2387 flow. Second operand 8 states and 148 transitions. [2024-06-14 14:50:32,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 249 transitions, 3181 flow [2024-06-14 14:50:32,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 249 transitions, 3084 flow, removed 41 selfloop flow, removed 4 redundant places. [2024-06-14 14:50:32,429 INFO L231 Difference]: Finished difference. Result has 197 places, 236 transitions, 2532 flow [2024-06-14 14:50:32,430 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-14 14:50:32,430 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 154 predicate places. [2024-06-14 14:50:32,430 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 236 transitions, 2532 flow [2024-06-14 14:50:32,430 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-14 14:50:32,430 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:50:32,431 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-14 14:50:32,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-14 14:50:32,431 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-14 14:50:32,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:50:32,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1617848122, now seen corresponding path program 4 times [2024-06-14 14:50:32,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:50:32,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982634234] [2024-06-14 14:50:32,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:50:32,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:50:32,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:50:45,723 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-14 14:50:45,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:50:45,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982634234] [2024-06-14 14:50:45,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982634234] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:50:45,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:50:45,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:50:45,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507086094] [2024-06-14 14:50:45,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:50:45,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:50:45,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:50:45,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:50:45,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:50:45,942 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-14 14:50:45,943 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-14 14:50:45,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:50:45,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-14 14:50:45,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:50:47,153 INFO L124 PetriNetUnfolderBase]: 2044/3405 cut-off events. [2024-06-14 14:50:47,153 INFO L125 PetriNetUnfolderBase]: For 195715/195720 co-relation queries the response was YES. [2024-06-14 14:50:47,167 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-14 14:50:47,178 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 195 selfloop transitions, 52 changer transitions 0/257 dead transitions. [2024-06-14 14:50:47,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 257 transitions, 3458 flow [2024-06-14 14:50:47,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:50:47,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:50:47,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions. [2024-06-14 14:50:47,179 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4494047619047619 [2024-06-14 14:50:47,179 INFO L175 Difference]: Start difference. First operand has 197 places, 236 transitions, 2532 flow. Second operand 8 states and 151 transitions. [2024-06-14 14:50:47,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 257 transitions, 3458 flow [2024-06-14 14:50:47,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 257 transitions, 3345 flow, removed 46 selfloop flow, removed 4 redundant places. [2024-06-14 14:50:47,354 INFO L231 Difference]: Finished difference. Result has 202 places, 244 transitions, 2743 flow [2024-06-14 14:50:47,354 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-14 14:50:47,354 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 159 predicate places. [2024-06-14 14:50:47,354 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 244 transitions, 2743 flow [2024-06-14 14:50:47,355 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-14 14:50:47,355 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:50:47,355 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-14 14:50:47,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-14 14:50:47,355 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-14 14:50:47,356 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:50:47,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1618125169, now seen corresponding path program 1 times [2024-06-14 14:50:47,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:50:47,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501410746] [2024-06-14 14:50:47,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:50:47,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:50:47,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:51:00,375 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-14 14:51:00,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:51:00,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501410746] [2024-06-14 14:51:00,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501410746] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:51:00,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:51:00,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:51:00,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559115323] [2024-06-14 14:51:00,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:51:00,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:51:00,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:51:00,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:51:00,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:51:00,614 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-14 14:51:00,615 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-14 14:51:00,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:51:00,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-14 14:51:00,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:51:01,815 INFO L124 PetriNetUnfolderBase]: 1991/3312 cut-off events. [2024-06-14 14:51:01,815 INFO L125 PetriNetUnfolderBase]: For 203337/203367 co-relation queries the response was YES. [2024-06-14 14:51:01,831 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-14 14:51:01,845 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 213 selfloop transitions, 20 changer transitions 0/258 dead transitions. [2024-06-14 14:51:01,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 258 transitions, 3303 flow [2024-06-14 14:51:01,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:51:01,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:51:01,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 155 transitions. [2024-06-14 14:51:01,846 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41005291005291006 [2024-06-14 14:51:01,846 INFO L175 Difference]: Start difference. First operand has 202 places, 244 transitions, 2743 flow. Second operand 9 states and 155 transitions. [2024-06-14 14:51:01,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 258 transitions, 3303 flow [2024-06-14 14:51:02,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 258 transitions, 3088 flow, removed 64 selfloop flow, removed 6 redundant places. [2024-06-14 14:51:02,084 INFO L231 Difference]: Finished difference. Result has 205 places, 246 transitions, 2641 flow [2024-06-14 14:51:02,084 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-14 14:51:02,084 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 162 predicate places. [2024-06-14 14:51:02,084 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 246 transitions, 2641 flow [2024-06-14 14:51:02,084 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-14 14:51:02,084 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:51:02,084 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-14 14:51:02,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-14 14:51:02,085 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-14 14:51:02,085 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:51:02,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1176932021, now seen corresponding path program 1 times [2024-06-14 14:51:02,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:51:02,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100123992] [2024-06-14 14:51:02,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:51:02,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:51:02,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:51:13,510 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-14 14:51:13,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:51:13,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100123992] [2024-06-14 14:51:13,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100123992] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:51:13,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:51:13,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:51:13,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658544453] [2024-06-14 14:51:13,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:51:13,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:51:13,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:51:13,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:51:13,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:51:13,712 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 14:51:13,712 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-14 14:51:13,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:51:13,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 14:51:13,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:51:15,076 INFO L124 PetriNetUnfolderBase]: 2175/3547 cut-off events. [2024-06-14 14:51:15,076 INFO L125 PetriNetUnfolderBase]: For 203287/203289 co-relation queries the response was YES. [2024-06-14 14:51:15,093 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-14 14:51:15,106 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 229 selfloop transitions, 33 changer transitions 0/267 dead transitions. [2024-06-14 14:51:15,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 267 transitions, 3305 flow [2024-06-14 14:51:15,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:51:15,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:51:15,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions. [2024-06-14 14:51:15,108 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4489795918367347 [2024-06-14 14:51:15,108 INFO L175 Difference]: Start difference. First operand has 205 places, 246 transitions, 2641 flow. Second operand 7 states and 132 transitions. [2024-06-14 14:51:15,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 267 transitions, 3305 flow [2024-06-14 14:51:15,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 267 transitions, 3212 flow, removed 28 selfloop flow, removed 7 redundant places. [2024-06-14 14:51:15,309 INFO L231 Difference]: Finished difference. Result has 205 places, 249 transitions, 2705 flow [2024-06-14 14:51:15,309 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-14 14:51:15,309 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 162 predicate places. [2024-06-14 14:51:15,309 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 249 transitions, 2705 flow [2024-06-14 14:51:15,310 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-14 14:51:15,310 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:51:15,310 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-14 14:51:15,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-14 14:51:15,310 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-14 14:51:15,311 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:51:15,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1528120309, now seen corresponding path program 2 times [2024-06-14 14:51:15,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:51:15,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174194911] [2024-06-14 14:51:15,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:51:15,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:51:15,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:51:27,363 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-14 14:51:27,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:51:27,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174194911] [2024-06-14 14:51:27,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174194911] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:51:27,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:51:27,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:51:27,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158577434] [2024-06-14 14:51:27,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:51:27,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:51:27,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:51:27,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:51:27,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:51:27,510 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 14:51:27,510 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-14 14:51:27,510 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:51:27,510 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 14:51:27,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:51:29,025 INFO L124 PetriNetUnfolderBase]: 2190/3572 cut-off events. [2024-06-14 14:51:29,025 INFO L125 PetriNetUnfolderBase]: For 212912/212914 co-relation queries the response was YES. [2024-06-14 14:51:29,044 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-14 14:51:29,060 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 225 selfloop transitions, 45 changer transitions 0/275 dead transitions. [2024-06-14 14:51:29,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 275 transitions, 3433 flow [2024-06-14 14:51:29,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:51:29,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:51:29,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-06-14 14:51:29,061 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44345238095238093 [2024-06-14 14:51:29,061 INFO L175 Difference]: Start difference. First operand has 205 places, 249 transitions, 2705 flow. Second operand 8 states and 149 transitions. [2024-06-14 14:51:29,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 275 transitions, 3433 flow [2024-06-14 14:51:29,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 275 transitions, 3314 flow, removed 28 selfloop flow, removed 5 redundant places. [2024-06-14 14:51:29,314 INFO L231 Difference]: Finished difference. Result has 209 places, 255 transitions, 2822 flow [2024-06-14 14:51:29,314 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-14 14:51:29,315 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 166 predicate places. [2024-06-14 14:51:29,315 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 255 transitions, 2822 flow [2024-06-14 14:51:29,315 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-14 14:51:29,315 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:51:29,315 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-14 14:51:29,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-14 14:51:29,315 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-14 14:51:29,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:51:29,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1106444083, now seen corresponding path program 1 times [2024-06-14 14:51:29,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:51:29,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622299493] [2024-06-14 14:51:29,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:51:29,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:51:29,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:51:41,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:51:41,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:51:41,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622299493] [2024-06-14 14:51:41,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622299493] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:51:41,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:51:41,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:51:41,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580011229] [2024-06-14 14:51:41,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:51:41,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:51:41,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:51:41,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:51:41,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:51:42,191 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 14:51:42,191 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-14 14:51:42,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:51:42,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 14:51:42,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:51:43,648 INFO L124 PetriNetUnfolderBase]: 2198/3586 cut-off events. [2024-06-14 14:51:43,649 INFO L125 PetriNetUnfolderBase]: For 223406/223410 co-relation queries the response was YES. [2024-06-14 14:51:43,665 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-14 14:51:43,679 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 254 selfloop transitions, 25 changer transitions 0/284 dead transitions. [2024-06-14 14:51:43,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 284 transitions, 3520 flow [2024-06-14 14:51:43,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:51:43,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:51:43,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions. [2024-06-14 14:51:43,680 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44047619047619047 [2024-06-14 14:51:43,680 INFO L175 Difference]: Start difference. First operand has 209 places, 255 transitions, 2822 flow. Second operand 8 states and 148 transitions. [2024-06-14 14:51:43,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 284 transitions, 3520 flow [2024-06-14 14:51:43,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 284 transitions, 3384 flow, removed 35 selfloop flow, removed 6 redundant places. [2024-06-14 14:51:43,926 INFO L231 Difference]: Finished difference. Result has 211 places, 257 transitions, 2801 flow [2024-06-14 14:51:43,926 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-14 14:51:43,927 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 168 predicate places. [2024-06-14 14:51:43,927 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 257 transitions, 2801 flow [2024-06-14 14:51:43,927 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-14 14:51:43,927 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:51:43,927 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-14 14:51:43,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-14 14:51:43,927 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-14 14:51:43,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:51:43,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1097873203, now seen corresponding path program 2 times [2024-06-14 14:51:43,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:51:43,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651036268] [2024-06-14 14:51:43,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:51:43,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:51:43,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:51:55,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:51:55,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:51:55,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651036268] [2024-06-14 14:51:55,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651036268] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:51:55,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:51:55,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:51:55,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332985135] [2024-06-14 14:51:55,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:51:55,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:51:55,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:51:55,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:51:55,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:51:56,037 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 14:51:56,037 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-14 14:51:56,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:51:56,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 14:51:56,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:51:57,398 INFO L124 PetriNetUnfolderBase]: 2206/3598 cut-off events. [2024-06-14 14:51:57,398 INFO L125 PetriNetUnfolderBase]: For 223532/223536 co-relation queries the response was YES. [2024-06-14 14:51:57,415 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-14 14:51:57,428 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 251 selfloop transitions, 26 changer transitions 0/282 dead transitions. [2024-06-14 14:51:57,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 282 transitions, 3487 flow [2024-06-14 14:51:57,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:51:57,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:51:57,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions. [2024-06-14 14:51:57,430 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43154761904761907 [2024-06-14 14:51:57,430 INFO L175 Difference]: Start difference. First operand has 211 places, 257 transitions, 2801 flow. Second operand 8 states and 145 transitions. [2024-06-14 14:51:57,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 282 transitions, 3487 flow [2024-06-14 14:51:57,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 282 transitions, 3388 flow, removed 26 selfloop flow, removed 6 redundant places. [2024-06-14 14:51:57,656 INFO L231 Difference]: Finished difference. Result has 213 places, 259 transitions, 2823 flow [2024-06-14 14:51:57,656 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-14 14:51:57,657 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 170 predicate places. [2024-06-14 14:51:57,657 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 259 transitions, 2823 flow [2024-06-14 14:51:57,657 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-14 14:51:57,657 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:51:57,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-14 14:51:57,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-14 14:51:57,657 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-14 14:51:57,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:51:57,658 INFO L85 PathProgramCache]: Analyzing trace with hash -988004677, now seen corresponding path program 3 times [2024-06-14 14:51:57,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:51:57,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790515401] [2024-06-14 14:51:57,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:51:57,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:51:57,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:52:09,491 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-14 14:52:09,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:52:09,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790515401] [2024-06-14 14:52:09,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790515401] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:52:09,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:52:09,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:52:09,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444401496] [2024-06-14 14:52:09,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:52:09,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:52:09,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:52:09,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:52:09,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:52:09,642 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 14:52:09,642 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-14 14:52:09,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:52:09,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 14:52:09,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:52:11,073 INFO L124 PetriNetUnfolderBase]: 2216/3615 cut-off events. [2024-06-14 14:52:11,074 INFO L125 PetriNetUnfolderBase]: For 232162/232167 co-relation queries the response was YES. [2024-06-14 14:52:11,092 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-14 14:52:11,106 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 239 selfloop transitions, 40 changer transitions 0/284 dead transitions. [2024-06-14 14:52:11,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 284 transitions, 3549 flow [2024-06-14 14:52:11,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:52:11,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:52:11,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2024-06-14 14:52:11,108 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44642857142857145 [2024-06-14 14:52:11,108 INFO L175 Difference]: Start difference. First operand has 213 places, 259 transitions, 2823 flow. Second operand 8 states and 150 transitions. [2024-06-14 14:52:11,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 284 transitions, 3549 flow [2024-06-14 14:52:11,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 284 transitions, 3446 flow, removed 30 selfloop flow, removed 5 redundant places. [2024-06-14 14:52:11,356 INFO L231 Difference]: Finished difference. Result has 216 places, 262 transitions, 2902 flow [2024-06-14 14:52:11,357 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-14 14:52:11,357 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 173 predicate places. [2024-06-14 14:52:11,357 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 262 transitions, 2902 flow [2024-06-14 14:52:11,357 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-14 14:52:11,357 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:52:11,357 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-14 14:52:11,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-14 14:52:11,357 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-14 14:52:11,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:52:11,358 INFO L85 PathProgramCache]: Analyzing trace with hash -909887561, now seen corresponding path program 1 times [2024-06-14 14:52:11,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:52:11,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973504004] [2024-06-14 14:52:11,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:52:11,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:52:11,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:52:22,543 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-14 14:52:22,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:52:22,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973504004] [2024-06-14 14:52:22,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973504004] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:52:22,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:52:22,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:52:22,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336946170] [2024-06-14 14:52:22,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:52:22,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:52:22,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:52:22,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:52:22,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:52:22,701 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 14:52:22,702 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-14 14:52:22,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:52:22,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 14:52:22,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:52:24,118 INFO L124 PetriNetUnfolderBase]: 2221/3623 cut-off events. [2024-06-14 14:52:24,118 INFO L125 PetriNetUnfolderBase]: For 241153/241157 co-relation queries the response was YES. [2024-06-14 14:52:24,136 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-14 14:52:24,150 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 250 selfloop transitions, 33 changer transitions 0/288 dead transitions. [2024-06-14 14:52:24,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 288 transitions, 3626 flow [2024-06-14 14:52:24,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:52:24,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:52:24,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-06-14 14:52:24,152 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44345238095238093 [2024-06-14 14:52:24,152 INFO L175 Difference]: Start difference. First operand has 216 places, 262 transitions, 2902 flow. Second operand 8 states and 149 transitions. [2024-06-14 14:52:24,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 288 transitions, 3626 flow [2024-06-14 14:52:24,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 288 transitions, 3478 flow, removed 41 selfloop flow, removed 5 redundant places. [2024-06-14 14:52:24,391 INFO L231 Difference]: Finished difference. Result has 219 places, 265 transitions, 2916 flow [2024-06-14 14:52:24,391 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-14 14:52:24,392 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 176 predicate places. [2024-06-14 14:52:24,392 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 265 transitions, 2916 flow [2024-06-14 14:52:24,392 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-14 14:52:24,392 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:52:24,392 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-14 14:52:24,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-14 14:52:24,392 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-14 14:52:24,393 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:52:24,393 INFO L85 PathProgramCache]: Analyzing trace with hash 2060039643, now seen corresponding path program 4 times [2024-06-14 14:52:24,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:52:24,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147190580] [2024-06-14 14:52:24,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:52:24,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:52:24,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:52:35,913 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-14 14:52:35,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:52:35,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147190580] [2024-06-14 14:52:35,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147190580] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:52:35,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:52:35,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:52:35,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079638300] [2024-06-14 14:52:35,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:52:35,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:52:35,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:52:35,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:52:35,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:52:36,044 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 14:52:36,045 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-14 14:52:36,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:52:36,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 14:52:36,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:52:37,397 INFO L124 PetriNetUnfolderBase]: 2231/3638 cut-off events. [2024-06-14 14:52:37,397 INFO L125 PetriNetUnfolderBase]: For 252427/252432 co-relation queries the response was YES. [2024-06-14 14:52:37,416 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-14 14:52:37,431 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 235 selfloop transitions, 48 changer transitions 0/288 dead transitions. [2024-06-14 14:52:37,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 288 transitions, 3666 flow [2024-06-14 14:52:37,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:52:37,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:52:37,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-06-14 14:52:37,432 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44345238095238093 [2024-06-14 14:52:37,432 INFO L175 Difference]: Start difference. First operand has 219 places, 265 transitions, 2916 flow. Second operand 8 states and 149 transitions. [2024-06-14 14:52:37,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 288 transitions, 3666 flow [2024-06-14 14:52:37,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 288 transitions, 3526 flow, removed 39 selfloop flow, removed 6 redundant places. [2024-06-14 14:52:37,678 INFO L231 Difference]: Finished difference. Result has 221 places, 268 transitions, 2984 flow [2024-06-14 14:52:37,679 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-14 14:52:37,679 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 178 predicate places. [2024-06-14 14:52:37,679 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 268 transitions, 2984 flow [2024-06-14 14:52:37,679 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-14 14:52:37,679 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:52:37,680 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-14 14:52:37,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-14 14:52:37,680 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-14 14:52:37,680 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:52:37,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1181699573, now seen corresponding path program 1 times [2024-06-14 14:52:37,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:52:37,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399483848] [2024-06-14 14:52:37,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:52:37,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:52:37,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:52:51,337 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-14 14:52:51,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:52:51,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399483848] [2024-06-14 14:52:51,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399483848] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:52:51,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:52:51,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:52:51,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808913344] [2024-06-14 14:52:51,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:52:51,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:52:51,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:52:51,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:52:51,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:52:51,544 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 14:52:51,545 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-14 14:52:51,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:52:51,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 14:52:51,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:52:52,975 INFO L124 PetriNetUnfolderBase]: 2241/3654 cut-off events. [2024-06-14 14:52:52,975 INFO L125 PetriNetUnfolderBase]: For 265228/265235 co-relation queries the response was YES. [2024-06-14 14:52:52,994 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-14 14:52:53,008 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 261 selfloop transitions, 27 changer transitions 0/293 dead transitions. [2024-06-14 14:52:53,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 293 transitions, 3722 flow [2024-06-14 14:52:53,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:52:53,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:52:53,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions. [2024-06-14 14:52:53,010 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43452380952380953 [2024-06-14 14:52:53,010 INFO L175 Difference]: Start difference. First operand has 221 places, 268 transitions, 2984 flow. Second operand 8 states and 146 transitions. [2024-06-14 14:52:53,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 293 transitions, 3722 flow [2024-06-14 14:52:53,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 293 transitions, 3540 flow, removed 45 selfloop flow, removed 6 redundant places. [2024-06-14 14:52:53,299 INFO L231 Difference]: Finished difference. Result has 223 places, 272 transitions, 2953 flow [2024-06-14 14:52:53,300 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-14 14:52:53,300 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 180 predicate places. [2024-06-14 14:52:53,300 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 272 transitions, 2953 flow [2024-06-14 14:52:53,300 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-14 14:52:53,300 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:52:53,301 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-14 14:52:53,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-14 14:52:53,301 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-14 14:52:53,301 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:52:53,301 INFO L85 PathProgramCache]: Analyzing trace with hash -810867577, now seen corresponding path program 5 times [2024-06-14 14:52:53,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:52:53,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202663322] [2024-06-14 14:52:53,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:52:53,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:52:53,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:53:06,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:53:06,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:53:06,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202663322] [2024-06-14 14:53:06,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202663322] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:53:06,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:53:06,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:53:06,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455174708] [2024-06-14 14:53:06,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:53:06,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:53:06,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:53:06,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:53:06,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:53:06,314 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 14:53:06,314 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-14 14:53:06,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:53:06,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 14:53:06,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:53:07,724 INFO L124 PetriNetUnfolderBase]: 2251/3669 cut-off events. [2024-06-14 14:53:07,724 INFO L125 PetriNetUnfolderBase]: For 275009/275011 co-relation queries the response was YES. [2024-06-14 14:53:07,743 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-14 14:53:07,756 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 255 selfloop transitions, 31 changer transitions 0/291 dead transitions. [2024-06-14 14:53:07,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 291 transitions, 3693 flow [2024-06-14 14:53:07,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:53:07,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:53:07,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions. [2024-06-14 14:53:07,758 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4226190476190476 [2024-06-14 14:53:07,758 INFO L175 Difference]: Start difference. First operand has 223 places, 272 transitions, 2953 flow. Second operand 8 states and 142 transitions. [2024-06-14 14:53:07,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 291 transitions, 3693 flow [2024-06-14 14:53:08,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 291 transitions, 3570 flow, removed 37 selfloop flow, removed 6 redundant places. [2024-06-14 14:53:08,071 INFO L231 Difference]: Finished difference. Result has 225 places, 275 transitions, 3012 flow [2024-06-14 14:53:08,071 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-14 14:53:08,072 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 182 predicate places. [2024-06-14 14:53:08,072 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 275 transitions, 3012 flow [2024-06-14 14:53:08,072 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-14 14:53:08,072 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:53:08,072 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-14 14:53:08,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-14 14:53:08,073 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-14 14:53:08,073 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:53:08,073 INFO L85 PathProgramCache]: Analyzing trace with hash -810862555, now seen corresponding path program 2 times [2024-06-14 14:53:08,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:53:08,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115247435] [2024-06-14 14:53:08,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:53:08,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:53:08,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:53:20,793 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-14 14:53:20,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:53:20,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115247435] [2024-06-14 14:53:20,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115247435] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:53:20,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:53:20,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:53:20,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118767207] [2024-06-14 14:53:20,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:53:20,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:53:20,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:53:20,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:53:20,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:53:21,012 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 14:53:21,012 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-14 14:53:21,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:53:21,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 14:53:21,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:53:22,433 INFO L124 PetriNetUnfolderBase]: 2261/3686 cut-off events. [2024-06-14 14:53:22,433 INFO L125 PetriNetUnfolderBase]: For 287655/287662 co-relation queries the response was YES. [2024-06-14 14:53:22,455 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-14 14:53:22,472 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 259 selfloop transitions, 34 changer transitions 0/298 dead transitions. [2024-06-14 14:53:22,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 298 transitions, 3780 flow [2024-06-14 14:53:22,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:53:22,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:53:22,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions. [2024-06-14 14:53:22,473 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43154761904761907 [2024-06-14 14:53:22,473 INFO L175 Difference]: Start difference. First operand has 225 places, 275 transitions, 3012 flow. Second operand 8 states and 145 transitions. [2024-06-14 14:53:22,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 298 transitions, 3780 flow [2024-06-14 14:53:22,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 298 transitions, 3563 flow, removed 54 selfloop flow, removed 8 redundant places. [2024-06-14 14:53:22,773 INFO L231 Difference]: Finished difference. Result has 225 places, 279 transitions, 2970 flow [2024-06-14 14:53:22,773 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-14 14:53:22,774 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 182 predicate places. [2024-06-14 14:53:22,774 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 279 transitions, 2970 flow [2024-06-14 14:53:22,774 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-14 14:53:22,774 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:53:22,774 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-14 14:53:22,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-14 14:53:22,774 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-14 14:53:22,774 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:53:22,775 INFO L85 PathProgramCache]: Analyzing trace with hash -810862927, now seen corresponding path program 6 times [2024-06-14 14:53:22,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:53:22,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546509304] [2024-06-14 14:53:22,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:53:22,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:53:22,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:53:34,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-14 14:53:34,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:53:34,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546509304] [2024-06-14 14:53:34,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546509304] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:53:34,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:53:34,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:53:34,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316613152] [2024-06-14 14:53:34,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:53:34,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:53:34,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:53:34,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:53:34,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:53:35,037 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 14:53:35,037 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-14 14:53:35,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:53:35,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 14:53:35,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:53:36,410 INFO L124 PetriNetUnfolderBase]: 2287/3727 cut-off events. [2024-06-14 14:53:36,410 INFO L125 PetriNetUnfolderBase]: For 303480/303485 co-relation queries the response was YES. [2024-06-14 14:53:36,432 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-14 14:53:36,450 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 232 selfloop transitions, 67 changer transitions 0/304 dead transitions. [2024-06-14 14:53:36,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 304 transitions, 4024 flow [2024-06-14 14:53:36,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:53:36,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:53:36,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-06-14 14:53:36,451 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44345238095238093 [2024-06-14 14:53:36,451 INFO L175 Difference]: Start difference. First operand has 225 places, 279 transitions, 2970 flow. Second operand 8 states and 149 transitions. [2024-06-14 14:53:36,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 304 transitions, 4024 flow [2024-06-14 14:53:36,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 304 transitions, 3877 flow, removed 42 selfloop flow, removed 6 redundant places. [2024-06-14 14:53:36,895 INFO L231 Difference]: Finished difference. Result has 227 places, 285 transitions, 3201 flow [2024-06-14 14:53:36,895 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-14 14:53:36,895 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 184 predicate places. [2024-06-14 14:53:36,896 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 285 transitions, 3201 flow [2024-06-14 14:53:36,896 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-14 14:53:36,896 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:53:36,896 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-14 14:53:36,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-14 14:53:36,896 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-14 14:53:36,897 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:53:36,897 INFO L85 PathProgramCache]: Analyzing trace with hash -647862007, now seen corresponding path program 3 times [2024-06-14 14:53:36,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:53:36,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280546139] [2024-06-14 14:53:36,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:53:36,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:53:36,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15