./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix052_tso.oepc.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix052_tso.oepc.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version bcb38a6f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix052_tso.oepc.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix052_tso.oepc.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-bcb38a6-m [2024-06-03 22:03:20,664 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-03 22:03:20,733 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-03 22:03:20,738 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-03 22:03:20,738 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-03 22:03:20,762 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-03 22:03:20,763 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-03 22:03:20,763 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-03 22:03:20,764 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-03 22:03:20,767 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-03 22:03:20,768 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-03 22:03:20,768 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-03 22:03:20,769 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-03 22:03:20,770 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-03 22:03:20,770 INFO L153 SettingsManager]: * Use SBE=true [2024-06-03 22:03:20,770 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-03 22:03:20,770 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-03 22:03:20,771 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-03 22:03:20,771 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-03 22:03:20,771 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-03 22:03:20,771 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-03 22:03:20,772 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-03 22:03:20,772 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-03 22:03:20,772 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-03 22:03:20,772 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-03 22:03:20,773 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-03 22:03:20,773 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-03 22:03:20,773 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-03 22:03:20,774 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-03 22:03:20,774 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-03 22:03:20,775 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-03 22:03:20,775 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-03 22:03:20,775 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 22:03:20,775 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-03 22:03:20,776 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-03 22:03:20,776 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-03 22:03:20,776 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-03 22:03:20,776 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-03 22:03:20,776 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-03 22:03:20,777 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-03 22:03:20,777 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-03 22:03:20,777 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-03 22:03:20,777 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-03 22:03:20,777 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-03 22:03:20,982 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-03 22:03:20,999 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-03 22:03:21,001 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-03 22:03:21,002 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-03 22:03:21,012 INFO L274 PluginConnector]: CDTParser initialized [2024-06-03 22:03:21,013 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix052_tso.oepc.i [2024-06-03 22:03:22,064 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-03 22:03:22,253 INFO L384 CDTParser]: Found 1 translation units. [2024-06-03 22:03:22,255 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix052_tso.oepc.i [2024-06-03 22:03:22,266 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92486f991/5841fad3650f4e75af537eccd31a2c7b/FLAGd47d0283f [2024-06-03 22:03:22,279 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92486f991/5841fad3650f4e75af537eccd31a2c7b [2024-06-03 22:03:22,281 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-03 22:03:22,281 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-03 22:03:22,283 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/mix052_tso.oepc.yml/witness.yml [2024-06-03 22:03:22,461 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-03 22:03:22,462 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-03 22:03:22,464 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-03 22:03:22,465 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-03 22:03:22,469 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-03 22:03:22,470 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 10:03:22" (1/2) ... [2024-06-03 22:03:22,471 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@623a37f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:03:22, skipping insertion in model container [2024-06-03 22:03:22,471 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 10:03:22" (1/2) ... [2024-06-03 22:03:22,473 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6b1f2ecd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:03:22, skipping insertion in model container [2024-06-03 22:03:22,473 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 10:03:22" (2/2) ... [2024-06-03 22:03:22,473 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@623a37f4 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:03:22, skipping insertion in model container [2024-06-03 22:03:22,473 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 10:03:22" (2/2) ... [2024-06-03 22:03:22,473 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-03 22:03:22,572 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-03 22:03:22,573 INFO L97 edCorrectnessWitness]: Location invariant before [L825-L825] ((((((((((((((((((! multithreaded || x$r_buff1_thd3 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EAX) + (long long )z >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )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 )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )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 )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )z >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )z >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )z >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )z >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )z >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )z >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )z >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )z >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )z >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )z >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )z >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )z >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )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 )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EAX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EAX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (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 )x$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff1) - (long long )z >= 0LL) && (1LL + (long long )y) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$read_delayed) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p1_EAX <= 1) && __unbuffered_p2_EAX <= 1) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && y <= 1) && z <= 1) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && x$w_buff0 % 2 == 0) && x$w_buff1 % 2 == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1))) [2024-06-03 22:03:22,574 INFO L97 edCorrectnessWitness]: Location invariant before [L826-L826] ((((((((((((((((((! multithreaded || x$r_buff1_thd3 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EAX) + (long long )z >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )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 )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )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 )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )z >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )z >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )z >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )z >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )z >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )z >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )z >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )z >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )z >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )z >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )z >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )z >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )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 )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EAX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EAX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (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 )x$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff1) - (long long )z >= 0LL) && (1LL + (long long )y) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$read_delayed) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p1_EAX <= 1) && __unbuffered_p2_EAX <= 1) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && y <= 1) && z <= 1) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && x$w_buff0 % 2 == 0) && x$w_buff1 % 2 == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1))) [2024-06-03 22:03:22,574 INFO L97 edCorrectnessWitness]: Location invariant before [L823-L823] ((((((((((((((((((! multithreaded || x$r_buff1_thd3 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EAX) + (long long )z >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )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 )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )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 )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )z >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )z >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )z >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )z >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )z >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )z >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )z >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )z >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )z >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )z >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )z >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )z >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )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 )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EAX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EAX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (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 )x$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff1) - (long long )z >= 0LL) && (1LL + (long long )y) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$read_delayed) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p1_EAX <= 1) && __unbuffered_p2_EAX <= 1) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && y <= 1) && z <= 1) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && x$w_buff0 % 2 == 0) && x$w_buff1 % 2 == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1))) [2024-06-03 22:03:22,575 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-03 22:03:22,575 INFO L106 edCorrectnessWitness]: ghost_update [L821-L821] multithreaded = 1; [2024-06-03 22:03:22,638 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-03 22:03:22,918 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 22:03:22,926 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-03 22:03:23,268 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 22:03:23,306 INFO L206 MainTranslator]: Completed translation [2024-06-03 22:03:23,307 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:03:23 WrapperNode [2024-06-03 22:03:23,307 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-03 22:03:23,308 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-03 22:03:23,308 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-03 22:03:23,308 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-03 22:03:23,313 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:03:23" (1/1) ... [2024-06-03 22:03:23,375 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:03:23" (1/1) ... [2024-06-03 22:03:23,491 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 144 [2024-06-03 22:03:23,492 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-03 22:03:23,493 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-03 22:03:23,493 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-03 22:03:23,493 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-03 22:03:23,502 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:03:23" (1/1) ... [2024-06-03 22:03:23,502 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:03:23" (1/1) ... [2024-06-03 22:03:23,527 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:03:23" (1/1) ... [2024-06-03 22:03:23,584 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-03 22:03:23,584 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:03:23" (1/1) ... [2024-06-03 22:03:23,584 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:03:23" (1/1) ... [2024-06-03 22:03:23,632 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:03:23" (1/1) ... [2024-06-03 22:03:23,634 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:03:23" (1/1) ... [2024-06-03 22:03:23,646 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:03:23" (1/1) ... [2024-06-03 22:03:23,652 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:03:23" (1/1) ... [2024-06-03 22:03:23,675 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-03 22:03:23,676 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-03 22:03:23,676 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-03 22:03:23,676 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-03 22:03:23,677 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:03:23" (1/1) ... [2024-06-03 22:03:23,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 22:03:23,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-03 22:03:23,701 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-03 22:03:23,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-03 22:03:23,732 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-03 22:03:23,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-03 22:03:23,732 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-03 22:03:23,732 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-03 22:03:23,733 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-03 22:03:23,733 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-03 22:03:23,733 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-03 22:03:23,733 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-03 22:03:23,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-03 22:03:23,734 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-03 22:03:23,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-03 22:03:23,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-03 22:03:23,735 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-03 22:03:23,833 INFO L244 CfgBuilder]: Building ICFG [2024-06-03 22:03:23,835 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-03 22:03:24,897 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-03 22:03:24,899 INFO L293 CfgBuilder]: Performing block encoding [2024-06-03 22:03:25,213 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-03 22:03:25,213 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-03 22:03:25,214 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 10:03:25 BoogieIcfgContainer [2024-06-03 22:03:25,214 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-03 22:03:25,216 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-03 22:03:25,216 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-03 22:03:25,219 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-03 22:03:25,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.06 10:03:22" (1/4) ... [2024-06-03 22:03:25,220 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36ff76e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 10:03:25, skipping insertion in model container [2024-06-03 22:03:25,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 10:03:22" (2/4) ... [2024-06-03 22:03:25,221 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36ff76e3 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 10:03:25, skipping insertion in model container [2024-06-03 22:03:25,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:03:23" (3/4) ... [2024-06-03 22:03:25,221 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36ff76e3 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 10:03:25, skipping insertion in model container [2024-06-03 22:03:25,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 10:03:25" (4/4) ... [2024-06-03 22:03:25,223 INFO L112 eAbstractionObserver]: Analyzing ICFG mix052_tso.oepc.i [2024-06-03 22:03:25,239 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-03 22:03:25,240 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-03 22:03:25,240 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-03 22:03:25,354 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-03 22:03:25,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 41 transitions, 94 flow [2024-06-03 22:03:25,461 INFO L124 PetriNetUnfolderBase]: 0/38 cut-off events. [2024-06-03 22:03:25,462 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 22:03:25,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 38 events. 0/38 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 64 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-03 22:03:25,465 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 41 transitions, 94 flow [2024-06-03 22:03:25,468 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 32 transitions, 73 flow [2024-06-03 22:03:25,479 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-03 22:03:25,486 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;@252e2ee6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-03 22:03:25,486 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-03 22:03:25,494 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-03 22:03:25,495 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-03 22:03:25,495 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 22:03:25,495 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:03:25,496 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-03 22:03:25,496 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:03:25,501 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:03:25,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1322398027, now seen corresponding path program 1 times [2024-06-03 22:03:25,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:03:25,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383102526] [2024-06-03 22:03:25,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:03:25,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:03:25,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:03:30,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:03:30,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:03:30,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383102526] [2024-06-03 22:03:30,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383102526] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:03:30,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:03:30,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-03 22:03:30,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026042003] [2024-06-03 22:03:30,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:03:30,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-03 22:03:30,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:03:30,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-03 22:03:30,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-03 22:03:30,717 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 22:03:30,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 73 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:03:30,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:03:30,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 22:03:30,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:03:31,595 INFO L124 PetriNetUnfolderBase]: 1156/1826 cut-off events. [2024-06-03 22:03:31,596 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-06-03 22:03:31,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3655 conditions, 1826 events. 1156/1826 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 8844 event pairs, 805 based on Foata normal form. 1/1790 useless extension candidates. Maximal degree in co-relation 3640. Up to 1740 conditions per place. [2024-06-03 22:03:31,608 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 33 selfloop transitions, 4 changer transitions 0/42 dead transitions. [2024-06-03 22:03:31,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 42 transitions, 173 flow [2024-06-03 22:03:31,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-03 22:03:31,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-03 22:03:31,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2024-06-03 22:03:31,617 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5691056910569106 [2024-06-03 22:03:31,618 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 73 flow. Second operand 3 states and 70 transitions. [2024-06-03 22:03:31,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 42 transitions, 173 flow [2024-06-03 22:03:31,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 42 transitions, 168 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-03 22:03:31,622 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 100 flow [2024-06-03 22:03:31,623 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2024-06-03 22:03:31,625 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2024-06-03 22:03:31,626 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 100 flow [2024-06-03 22:03:31,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:03:31,626 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:03:31,626 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:03:31,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-03 22:03:31,626 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:03:31,627 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:03:31,627 INFO L85 PathProgramCache]: Analyzing trace with hash 485861844, now seen corresponding path program 1 times [2024-06-03 22:03:31,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:03:31,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545023506] [2024-06-03 22:03:31,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:03:31,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:03:31,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:03:35,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:03:35,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:03:35,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545023506] [2024-06-03 22:03:35,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545023506] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:03:35,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:03:35,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-03 22:03:35,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906180563] [2024-06-03 22:03:35,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:03:35,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-03 22:03:35,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:03:35,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-03 22:03:35,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-03 22:03:35,153 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-03 22:03:35,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:03:35,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:03:35,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-03 22:03:35,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:03:35,887 INFO L124 PetriNetUnfolderBase]: 1357/2071 cut-off events. [2024-06-03 22:03:35,888 INFO L125 PetriNetUnfolderBase]: For 393/393 co-relation queries the response was YES. [2024-06-03 22:03:35,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4740 conditions, 2071 events. 1357/2071 cut-off events. For 393/393 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9673 event pairs, 840 based on Foata normal form. 3/2071 useless extension candidates. Maximal degree in co-relation 4725. Up to 2013 conditions per place. [2024-06-03 22:03:35,898 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 41 selfloop transitions, 7 changer transitions 0/52 dead transitions. [2024-06-03 22:03:35,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 52 transitions, 242 flow [2024-06-03 22:03:35,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-03 22:03:35,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-03 22:03:35,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2024-06-03 22:03:35,900 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5304878048780488 [2024-06-03 22:03:35,900 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 100 flow. Second operand 4 states and 87 transitions. [2024-06-03 22:03:35,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 52 transitions, 242 flow [2024-06-03 22:03:35,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 52 transitions, 238 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-03 22:03:35,902 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 136 flow [2024-06-03 22:03:35,902 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=136, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2024-06-03 22:03:35,903 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 3 predicate places. [2024-06-03 22:03:35,903 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 136 flow [2024-06-03 22:03:35,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:03:35,904 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:03:35,904 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:03:35,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-03 22:03:35,904 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:03:35,904 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:03:35,905 INFO L85 PathProgramCache]: Analyzing trace with hash -2118150516, now seen corresponding path program 1 times [2024-06-03 22:03:35,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:03:35,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153253641] [2024-06-03 22:03:35,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:03:35,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:03:35,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:03:39,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:03:39,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:03:39,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153253641] [2024-06-03 22:03:39,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153253641] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:03:39,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:03:39,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-03 22:03:39,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998536359] [2024-06-03 22:03:39,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:03:39,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-03 22:03:39,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:03:39,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-03 22:03:39,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-03 22:03:39,572 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-03 22:03:39,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 136 flow. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:03:39,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:03:39,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-03 22:03:39,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:03:40,364 INFO L124 PetriNetUnfolderBase]: 1345/2055 cut-off events. [2024-06-03 22:03:40,365 INFO L125 PetriNetUnfolderBase]: For 1116/1116 co-relation queries the response was YES. [2024-06-03 22:03:40,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5229 conditions, 2055 events. 1345/2055 cut-off events. For 1116/1116 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9597 event pairs, 592 based on Foata normal form. 6/2058 useless extension candidates. Maximal degree in co-relation 5212. Up to 1965 conditions per place. [2024-06-03 22:03:40,375 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 49 selfloop transitions, 10 changer transitions 0/63 dead transitions. [2024-06-03 22:03:40,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 63 transitions, 324 flow [2024-06-03 22:03:40,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 22:03:40,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 22:03:40,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions. [2024-06-03 22:03:40,378 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5219512195121951 [2024-06-03 22:03:40,378 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 136 flow. Second operand 5 states and 107 transitions. [2024-06-03 22:03:40,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 63 transitions, 324 flow [2024-06-03 22:03:40,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 63 transitions, 310 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-03 22:03:40,381 INFO L231 Difference]: Finished difference. Result has 48 places, 41 transitions, 172 flow [2024-06-03 22:03:40,381 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=122, 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=5, PETRI_FLOW=172, PETRI_PLACES=48, PETRI_TRANSITIONS=41} [2024-06-03 22:03:40,381 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 6 predicate places. [2024-06-03 22:03:40,382 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 41 transitions, 172 flow [2024-06-03 22:03:40,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:03:40,382 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:03:40,382 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:03:40,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-03 22:03:40,382 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:03:40,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:03:40,383 INFO L85 PathProgramCache]: Analyzing trace with hash 271901579, now seen corresponding path program 1 times [2024-06-03 22:03:40,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:03:40,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250796852] [2024-06-03 22:03:40,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:03:40,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:03:40,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:03:44,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:03:44,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:03:44,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250796852] [2024-06-03 22:03:44,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250796852] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:03:44,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:03:44,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 22:03:44,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090099980] [2024-06-03 22:03:44,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:03:44,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 22:03:44,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:03:44,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 22:03:44,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-03 22:03:44,887 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-03 22:03:44,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 41 transitions, 172 flow. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:03:44,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:03:44,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-03 22:03:44,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:03:45,781 INFO L124 PetriNetUnfolderBase]: 1336/2038 cut-off events. [2024-06-03 22:03:45,782 INFO L125 PetriNetUnfolderBase]: For 2056/2056 co-relation queries the response was YES. [2024-06-03 22:03:45,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5696 conditions, 2038 events. 1336/2038 cut-off events. For 2056/2056 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9456 event pairs, 450 based on Foata normal form. 6/2041 useless extension candidates. Maximal degree in co-relation 5678. Up to 1920 conditions per place. [2024-06-03 22:03:45,792 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 53 selfloop transitions, 12 changer transitions 0/69 dead transitions. [2024-06-03 22:03:45,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 69 transitions, 378 flow [2024-06-03 22:03:45,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:03:45,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:03:45,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 122 transitions. [2024-06-03 22:03:45,795 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4959349593495935 [2024-06-03 22:03:45,795 INFO L175 Difference]: Start difference. First operand has 48 places, 41 transitions, 172 flow. Second operand 6 states and 122 transitions. [2024-06-03 22:03:45,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 69 transitions, 378 flow [2024-06-03 22:03:45,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 69 transitions, 354 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-03 22:03:45,798 INFO L231 Difference]: Finished difference. Result has 50 places, 42 transitions, 191 flow [2024-06-03 22:03:45,798 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=191, PETRI_PLACES=50, PETRI_TRANSITIONS=42} [2024-06-03 22:03:45,798 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 8 predicate places. [2024-06-03 22:03:45,799 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 191 flow [2024-06-03 22:03:45,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:03:45,799 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:03:45,799 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:03:45,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-03 22:03:45,799 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:03:45,800 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:03:45,800 INFO L85 PathProgramCache]: Analyzing trace with hash -714505217, now seen corresponding path program 1 times [2024-06-03 22:03:45,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:03:45,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285135065] [2024-06-03 22:03:45,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:03:45,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:03:45,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:03:53,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:03:53,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:03:53,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285135065] [2024-06-03 22:03:53,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285135065] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:03:53,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:03:53,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 22:03:53,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169196795] [2024-06-03 22:03:53,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:03:53,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 22:03:53,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:03:53,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 22:03:53,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-03 22:03:53,382 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-03 22:03:53,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 191 flow. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:03:53,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:03:53,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-03 22:03:53,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:03:54,119 INFO L124 PetriNetUnfolderBase]: 1124/1817 cut-off events. [2024-06-03 22:03:54,119 INFO L125 PetriNetUnfolderBase]: For 2652/2652 co-relation queries the response was YES. [2024-06-03 22:03:54,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5289 conditions, 1817 events. 1124/1817 cut-off events. For 2652/2652 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 8842 event pairs, 527 based on Foata normal form. 2/1816 useless extension candidates. Maximal degree in co-relation 5270. Up to 1682 conditions per place. [2024-06-03 22:03:54,128 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 43 selfloop transitions, 8 changer transitions 0/56 dead transitions. [2024-06-03 22:03:54,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 56 transitions, 337 flow [2024-06-03 22:03:54,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 22:03:54,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 22:03:54,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2024-06-03 22:03:54,129 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2024-06-03 22:03:54,130 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 191 flow. Second operand 5 states and 90 transitions. [2024-06-03 22:03:54,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 56 transitions, 337 flow [2024-06-03 22:03:54,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 56 transitions, 304 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-03 22:03:54,136 INFO L231 Difference]: Finished difference. Result has 51 places, 45 transitions, 204 flow [2024-06-03 22:03:54,137 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=204, PETRI_PLACES=51, PETRI_TRANSITIONS=45} [2024-06-03 22:03:54,139 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 9 predicate places. [2024-06-03 22:03:54,139 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 204 flow [2024-06-03 22:03:54,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:03:54,144 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:03:54,145 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:03:54,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-03 22:03:54,145 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:03:54,145 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:03:54,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1636478068, now seen corresponding path program 1 times [2024-06-03 22:03:54,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:03:54,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413597497] [2024-06-03 22:03:54,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:03:54,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:03:54,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:04:01,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:04:01,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:04:01,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413597497] [2024-06-03 22:04:01,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413597497] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:04:01,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:04:01,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 22:04:01,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010865619] [2024-06-03 22:04:01,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:04:01,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 22:04:01,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:04:01,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 22:04:01,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-03 22:04:01,464 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:04:01,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 204 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:04:01,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:04:01,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:04:01,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:04:02,300 INFO L124 PetriNetUnfolderBase]: 1342/2047 cut-off events. [2024-06-03 22:04:02,301 INFO L125 PetriNetUnfolderBase]: For 4400/4400 co-relation queries the response was YES. [2024-06-03 22:04:02,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6518 conditions, 2047 events. 1342/2047 cut-off events. For 4400/4400 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9486 event pairs, 626 based on Foata normal form. 2/2046 useless extension candidates. Maximal degree in co-relation 6497. Up to 1980 conditions per place. [2024-06-03 22:04:02,322 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 51 selfloop transitions, 11 changer transitions 0/66 dead transitions. [2024-06-03 22:04:02,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 66 transitions, 394 flow [2024-06-03 22:04:02,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:04:02,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:04:02,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 104 transitions. [2024-06-03 22:04:02,324 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42276422764227645 [2024-06-03 22:04:02,324 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 204 flow. Second operand 6 states and 104 transitions. [2024-06-03 22:04:02,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 66 transitions, 394 flow [2024-06-03 22:04:02,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 66 transitions, 372 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-03 22:04:02,333 INFO L231 Difference]: Finished difference. Result has 54 places, 48 transitions, 238 flow [2024-06-03 22:04:02,333 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=238, PETRI_PLACES=54, PETRI_TRANSITIONS=48} [2024-06-03 22:04:02,334 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 12 predicate places. [2024-06-03 22:04:02,334 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 48 transitions, 238 flow [2024-06-03 22:04:02,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:04:02,334 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:04:02,335 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:04:02,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-03 22:04:02,335 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:04:02,335 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:04:02,335 INFO L85 PathProgramCache]: Analyzing trace with hash 436388652, now seen corresponding path program 2 times [2024-06-03 22:04:02,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:04:02,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375264580] [2024-06-03 22:04:02,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:04:02,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:04:02,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:04:10,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:04:10,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:04:10,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375264580] [2024-06-03 22:04:10,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375264580] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:04:10,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:04:10,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 22:04:10,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155227025] [2024-06-03 22:04:10,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:04:10,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 22:04:10,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:04:10,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 22:04:10,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-03 22:04:10,220 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:04:10,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 48 transitions, 238 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:04:10,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:04:10,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:04:10,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:04:11,162 INFO L124 PetriNetUnfolderBase]: 1337/2040 cut-off events. [2024-06-03 22:04:11,163 INFO L125 PetriNetUnfolderBase]: For 5863/5863 co-relation queries the response was YES. [2024-06-03 22:04:11,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6991 conditions, 2040 events. 1337/2040 cut-off events. For 5863/5863 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9462 event pairs, 620 based on Foata normal form. 2/2039 useless extension candidates. Maximal degree in co-relation 6969. Up to 1955 conditions per place. [2024-06-03 22:04:11,173 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 52 selfloop transitions, 17 changer transitions 0/73 dead transitions. [2024-06-03 22:04:11,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 73 transitions, 458 flow [2024-06-03 22:04:11,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:04:11,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:04:11,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions. [2024-06-03 22:04:11,174 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4181184668989547 [2024-06-03 22:04:11,175 INFO L175 Difference]: Start difference. First operand has 54 places, 48 transitions, 238 flow. Second operand 7 states and 120 transitions. [2024-06-03 22:04:11,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 73 transitions, 458 flow [2024-06-03 22:04:11,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 73 transitions, 426 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-06-03 22:04:11,177 INFO L231 Difference]: Finished difference. Result has 57 places, 51 transitions, 280 flow [2024-06-03 22:04:11,178 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=280, PETRI_PLACES=57, PETRI_TRANSITIONS=51} [2024-06-03 22:04:11,178 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 15 predicate places. [2024-06-03 22:04:11,178 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 51 transitions, 280 flow [2024-06-03 22:04:11,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:04:11,178 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:04:11,179 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:04:11,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-03 22:04:11,179 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:04:11,179 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:04:11,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1608094034, now seen corresponding path program 1 times [2024-06-03 22:04:11,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:04:11,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129898064] [2024-06-03 22:04:11,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:04:11,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:04:11,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:04:19,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:04:19,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:04:19,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129898064] [2024-06-03 22:04:19,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129898064] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:04:19,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:04:19,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:04:19,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599486164] [2024-06-03 22:04:19,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:04:19,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:04:19,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:04:19,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:04:19,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:04:19,832 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:04:19,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 51 transitions, 280 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:04:19,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:04:19,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:04:19,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:04:20,686 INFO L124 PetriNetUnfolderBase]: 1377/2170 cut-off events. [2024-06-03 22:04:20,687 INFO L125 PetriNetUnfolderBase]: For 7623/7623 co-relation queries the response was YES. [2024-06-03 22:04:20,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7694 conditions, 2170 events. 1377/2170 cut-off events. For 7623/7623 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 10329 event pairs, 625 based on Foata normal form. 2/2169 useless extension candidates. Maximal degree in co-relation 7671. Up to 2033 conditions per place. [2024-06-03 22:04:20,696 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 58 selfloop transitions, 14 changer transitions 0/76 dead transitions. [2024-06-03 22:04:20,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 76 transitions, 511 flow [2024-06-03 22:04:20,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:04:20,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:04:20,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions. [2024-06-03 22:04:20,700 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40418118466898956 [2024-06-03 22:04:20,700 INFO L175 Difference]: Start difference. First operand has 57 places, 51 transitions, 280 flow. Second operand 7 states and 116 transitions. [2024-06-03 22:04:20,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 76 transitions, 511 flow [2024-06-03 22:04:20,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 76 transitions, 458 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-06-03 22:04:20,703 INFO L231 Difference]: Finished difference. Result has 60 places, 57 transitions, 314 flow [2024-06-03 22:04:20,703 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=314, PETRI_PLACES=60, PETRI_TRANSITIONS=57} [2024-06-03 22:04:20,704 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 18 predicate places. [2024-06-03 22:04:20,704 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 57 transitions, 314 flow [2024-06-03 22:04:20,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:04:20,704 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:04:20,704 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:04:20,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-03 22:04:20,704 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:04:20,705 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:04:20,705 INFO L85 PathProgramCache]: Analyzing trace with hash -414428582, now seen corresponding path program 1 times [2024-06-03 22:04:20,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:04:20,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833171042] [2024-06-03 22:04:20,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:04:20,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:04:20,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:04:28,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-03 22:04:28,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:04:28,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833171042] [2024-06-03 22:04:28,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833171042] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:04:28,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:04:28,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:04:28,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293822526] [2024-06-03 22:04:28,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:04:28,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:04:28,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:04:28,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:04:28,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:04:28,522 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:04:28,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 57 transitions, 314 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:04:28,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:04:28,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:04:28,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:04:29,522 INFO L124 PetriNetUnfolderBase]: 1555/2361 cut-off events. [2024-06-03 22:04:29,522 INFO L125 PetriNetUnfolderBase]: For 11273/11283 co-relation queries the response was YES. [2024-06-03 22:04:29,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9235 conditions, 2361 events. 1555/2361 cut-off events. For 11273/11283 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 11143 event pairs, 576 based on Foata normal form. 4/2362 useless extension candidates. Maximal degree in co-relation 9210. Up to 2248 conditions per place. [2024-06-03 22:04:29,536 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 67 selfloop transitions, 17 changer transitions 0/89 dead transitions. [2024-06-03 22:04:29,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 89 transitions, 588 flow [2024-06-03 22:04:29,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:04:29,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:04:29,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions. [2024-06-03 22:04:29,539 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43205574912891986 [2024-06-03 22:04:29,539 INFO L175 Difference]: Start difference. First operand has 60 places, 57 transitions, 314 flow. Second operand 7 states and 124 transitions. [2024-06-03 22:04:29,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 89 transitions, 588 flow [2024-06-03 22:04:29,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 89 transitions, 548 flow, removed 9 selfloop flow, removed 4 redundant places. [2024-06-03 22:04:29,544 INFO L231 Difference]: Finished difference. Result has 64 places, 63 transitions, 368 flow [2024-06-03 22:04:29,544 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=368, PETRI_PLACES=64, PETRI_TRANSITIONS=63} [2024-06-03 22:04:29,545 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 22 predicate places. [2024-06-03 22:04:29,545 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 63 transitions, 368 flow [2024-06-03 22:04:29,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:04:29,545 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:04:29,545 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:04:29,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-03 22:04:29,546 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:04:29,546 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:04:29,546 INFO L85 PathProgramCache]: Analyzing trace with hash -414308612, now seen corresponding path program 2 times [2024-06-03 22:04:29,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:04:29,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872904614] [2024-06-03 22:04:29,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:04:29,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:04:29,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:04:37,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:04:37,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:04:37,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872904614] [2024-06-03 22:04:37,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872904614] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:04:37,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:04:37,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:04:37,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307851168] [2024-06-03 22:04:37,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:04:37,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:04:37,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:04:37,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:04:37,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:04:37,699 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:04:37,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 63 transitions, 368 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:04:37,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:04:37,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:04:37,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:04:38,747 INFO L124 PetriNetUnfolderBase]: 1669/2527 cut-off events. [2024-06-03 22:04:38,748 INFO L125 PetriNetUnfolderBase]: For 15386/15396 co-relation queries the response was YES. [2024-06-03 22:04:38,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10817 conditions, 2527 events. 1669/2527 cut-off events. For 15386/15396 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 11991 event pairs, 557 based on Foata normal form. 18/2542 useless extension candidates. Maximal degree in co-relation 10790. Up to 2297 conditions per place. [2024-06-03 22:04:38,759 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 69 selfloop transitions, 24 changer transitions 0/98 dead transitions. [2024-06-03 22:04:38,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 98 transitions, 746 flow [2024-06-03 22:04:38,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:04:38,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:04:38,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 128 transitions. [2024-06-03 22:04:38,774 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.445993031358885 [2024-06-03 22:04:38,774 INFO L175 Difference]: Start difference. First operand has 64 places, 63 transitions, 368 flow. Second operand 7 states and 128 transitions. [2024-06-03 22:04:38,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 98 transitions, 746 flow [2024-06-03 22:04:38,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 98 transitions, 704 flow, removed 12 selfloop flow, removed 3 redundant places. [2024-06-03 22:04:38,780 INFO L231 Difference]: Finished difference. Result has 69 places, 71 transitions, 484 flow [2024-06-03 22:04:38,780 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=484, PETRI_PLACES=69, PETRI_TRANSITIONS=71} [2024-06-03 22:04:38,781 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 27 predicate places. [2024-06-03 22:04:38,781 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 71 transitions, 484 flow [2024-06-03 22:04:38,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:04:38,781 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:04:38,781 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:04:38,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-03 22:04:38,782 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:04:38,782 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:04:38,782 INFO L85 PathProgramCache]: Analyzing trace with hash 33568348, now seen corresponding path program 3 times [2024-06-03 22:04:38,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:04:38,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345204235] [2024-06-03 22:04:38,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:04:38,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:04:38,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:04:46,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:04:46,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:04:46,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345204235] [2024-06-03 22:04:46,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345204235] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:04:46,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:04:46,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:04:46,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803472786] [2024-06-03 22:04:46,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:04:46,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:04:46,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:04:46,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:04:46,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:04:46,896 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:04:46,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 71 transitions, 484 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:04:46,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:04:46,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:04:46,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:04:47,937 INFO L124 PetriNetUnfolderBase]: 1687/2555 cut-off events. [2024-06-03 22:04:47,937 INFO L125 PetriNetUnfolderBase]: For 19641/19641 co-relation queries the response was YES. [2024-06-03 22:04:47,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11913 conditions, 2555 events. 1687/2555 cut-off events. For 19641/19641 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 12164 event pairs, 500 based on Foata normal form. 8/2560 useless extension candidates. Maximal degree in co-relation 11884. Up to 2208 conditions per place. [2024-06-03 22:04:47,948 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 70 selfloop transitions, 38 changer transitions 0/113 dead transitions. [2024-06-03 22:04:47,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 113 transitions, 972 flow [2024-06-03 22:04:47,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:04:47,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:04:47,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-06-03 22:04:47,951 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45426829268292684 [2024-06-03 22:04:47,951 INFO L175 Difference]: Start difference. First operand has 69 places, 71 transitions, 484 flow. Second operand 8 states and 149 transitions. [2024-06-03 22:04:47,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 113 transitions, 972 flow [2024-06-03 22:04:47,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 113 transitions, 926 flow, removed 16 selfloop flow, removed 3 redundant places. [2024-06-03 22:04:47,959 INFO L231 Difference]: Finished difference. Result has 75 places, 79 transitions, 638 flow [2024-06-03 22:04:47,959 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=638, PETRI_PLACES=75, PETRI_TRANSITIONS=79} [2024-06-03 22:04:47,960 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 33 predicate places. [2024-06-03 22:04:47,960 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 79 transitions, 638 flow [2024-06-03 22:04:47,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:04:47,960 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:04:47,960 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:04:47,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-03 22:04:47,961 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:04:47,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:04:47,961 INFO L85 PathProgramCache]: Analyzing trace with hash 33814612, now seen corresponding path program 1 times [2024-06-03 22:04:47,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:04:47,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597180370] [2024-06-03 22:04:47,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:04:47,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:04:48,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:04:57,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:04:57,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:04:57,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597180370] [2024-06-03 22:04:57,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597180370] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:04:57,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:04:57,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:04:57,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063740878] [2024-06-03 22:04:57,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:04:57,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:04:57,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:04:57,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:04:57,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:04:57,399 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:04:57,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 79 transitions, 638 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:04:57,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:04:57,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:04:57,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:04:58,422 INFO L124 PetriNetUnfolderBase]: 1573/2453 cut-off events. [2024-06-03 22:04:58,423 INFO L125 PetriNetUnfolderBase]: For 20157/20157 co-relation queries the response was YES. [2024-06-03 22:04:58,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11741 conditions, 2453 events. 1573/2453 cut-off events. For 20157/20157 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 11740 event pairs, 480 based on Foata normal form. 4/2454 useless extension candidates. Maximal degree in co-relation 11709. Up to 2302 conditions per place. [2024-06-03 22:04:58,456 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 85 selfloop transitions, 16 changer transitions 0/105 dead transitions. [2024-06-03 22:04:58,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 105 transitions, 932 flow [2024-06-03 22:04:58,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:04:58,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:04:58,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2024-06-03 22:04:58,461 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39939024390243905 [2024-06-03 22:04:58,461 INFO L175 Difference]: Start difference. First operand has 75 places, 79 transitions, 638 flow. Second operand 8 states and 131 transitions. [2024-06-03 22:04:58,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 105 transitions, 932 flow [2024-06-03 22:04:58,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 105 transitions, 826 flow, removed 28 selfloop flow, removed 5 redundant places. [2024-06-03 22:04:58,474 INFO L231 Difference]: Finished difference. Result has 78 places, 81 transitions, 607 flow [2024-06-03 22:04:58,474 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=534, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=607, PETRI_PLACES=78, PETRI_TRANSITIONS=81} [2024-06-03 22:04:58,475 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 36 predicate places. [2024-06-03 22:04:58,475 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 81 transitions, 607 flow [2024-06-03 22:04:58,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:04:58,475 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:04:58,475 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:04:58,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-03 22:04:58,476 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:04:58,476 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:04:58,476 INFO L85 PathProgramCache]: Analyzing trace with hash -295611301, now seen corresponding path program 1 times [2024-06-03 22:04:58,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:04:58,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684515721] [2024-06-03 22:04:58,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:04:58,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:04:58,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:05:09,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:05:09,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:05:09,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684515721] [2024-06-03 22:05:09,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684515721] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:05:09,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:05:09,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 22:05:09,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162407278] [2024-06-03 22:05:09,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:05:09,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 22:05:09,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:05:09,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 22:05:09,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-06-03 22:05:09,559 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:05:09,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 81 transitions, 607 flow. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:05:09,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:05:09,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:05:09,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:05:10,463 INFO L124 PetriNetUnfolderBase]: 1567/2445 cut-off events. [2024-06-03 22:05:10,463 INFO L125 PetriNetUnfolderBase]: For 20150/20150 co-relation queries the response was YES. [2024-06-03 22:05:10,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11367 conditions, 2445 events. 1567/2445 cut-off events. For 20150/20150 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 11639 event pairs, 490 based on Foata normal form. 2/2444 useless extension candidates. Maximal degree in co-relation 11334. Up to 2333 conditions per place. [2024-06-03 22:05:10,475 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 81 selfloop transitions, 8 changer transitions 0/93 dead transitions. [2024-06-03 22:05:10,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 93 transitions, 829 flow [2024-06-03 22:05:10,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 22:05:10,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 22:05:10,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 83 transitions. [2024-06-03 22:05:10,477 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40487804878048783 [2024-06-03 22:05:10,477 INFO L175 Difference]: Start difference. First operand has 78 places, 81 transitions, 607 flow. Second operand 5 states and 83 transitions. [2024-06-03 22:05:10,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 93 transitions, 829 flow [2024-06-03 22:05:10,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 93 transitions, 774 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-03 22:05:10,488 INFO L231 Difference]: Finished difference. Result has 77 places, 84 transitions, 602 flow [2024-06-03 22:05:10,488 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=552, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=602, PETRI_PLACES=77, PETRI_TRANSITIONS=84} [2024-06-03 22:05:10,489 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 35 predicate places. [2024-06-03 22:05:10,489 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 84 transitions, 602 flow [2024-06-03 22:05:10,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:05:10,489 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:05:10,489 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:05:10,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-03 22:05:10,490 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:05:10,490 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:05:10,490 INFO L85 PathProgramCache]: Analyzing trace with hash -159299651, now seen corresponding path program 1 times [2024-06-03 22:05:10,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:05:10,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677882349] [2024-06-03 22:05:10,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:05:10,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:05:10,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:05:17,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:05:17,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:05:17,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677882349] [2024-06-03 22:05:17,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677882349] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:05:17,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:05:17,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:05:17,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205786906] [2024-06-03 22:05:17,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:05:17,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:05:17,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:05:17,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:05:17,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:05:18,079 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:05:18,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 84 transitions, 602 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:05:18,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:05:18,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:05:18,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:05:19,085 INFO L124 PetriNetUnfolderBase]: 1688/2557 cut-off events. [2024-06-03 22:05:19,085 INFO L125 PetriNetUnfolderBase]: For 26392/26392 co-relation queries the response was YES. [2024-06-03 22:05:19,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12888 conditions, 2557 events. 1688/2557 cut-off events. For 26392/26392 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 12130 event pairs, 483 based on Foata normal form. 2/2556 useless extension candidates. Maximal degree in co-relation 12854. Up to 2435 conditions per place. [2024-06-03 22:05:19,110 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 89 selfloop transitions, 19 changer transitions 0/113 dead transitions. [2024-06-03 22:05:19,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 113 transitions, 932 flow [2024-06-03 22:05:19,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:05:19,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:05:19,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions. [2024-06-03 22:05:19,122 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43205574912891986 [2024-06-03 22:05:19,123 INFO L175 Difference]: Start difference. First operand has 77 places, 84 transitions, 602 flow. Second operand 7 states and 124 transitions. [2024-06-03 22:05:19,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 113 transitions, 932 flow [2024-06-03 22:05:19,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 113 transitions, 904 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-06-03 22:05:19,134 INFO L231 Difference]: Finished difference. Result has 81 places, 87 transitions, 676 flow [2024-06-03 22:05:19,134 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=574, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=676, PETRI_PLACES=81, PETRI_TRANSITIONS=87} [2024-06-03 22:05:19,134 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 39 predicate places. [2024-06-03 22:05:19,134 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 87 transitions, 676 flow [2024-06-03 22:05:19,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:05:19,135 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:05:19,135 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:05:19,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-03 22:05:19,135 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:05:19,135 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:05:19,135 INFO L85 PathProgramCache]: Analyzing trace with hash 41341533, now seen corresponding path program 1 times [2024-06-03 22:05:19,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:05:19,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194295702] [2024-06-03 22:05:19,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:05:19,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:05:19,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:05:27,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:05:27,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:05:27,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194295702] [2024-06-03 22:05:27,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194295702] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:05:27,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:05:27,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:05:27,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673142843] [2024-06-03 22:05:27,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:05:27,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:05:27,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:05:27,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:05:27,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:05:27,312 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:05:27,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 87 transitions, 676 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:05:27,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:05:27,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:05:27,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:05:28,314 INFO L124 PetriNetUnfolderBase]: 1785/2663 cut-off events. [2024-06-03 22:05:28,315 INFO L125 PetriNetUnfolderBase]: For 28795/28795 co-relation queries the response was YES. [2024-06-03 22:05:28,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13294 conditions, 2663 events. 1785/2663 cut-off events. For 28795/28795 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 12089 event pairs, 491 based on Foata normal form. 6/2666 useless extension candidates. Maximal degree in co-relation 13259. Up to 2435 conditions per place. [2024-06-03 22:05:28,330 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 89 selfloop transitions, 35 changer transitions 0/127 dead transitions. [2024-06-03 22:05:28,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 127 transitions, 1099 flow [2024-06-03 22:05:28,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:05:28,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:05:28,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions. [2024-06-03 22:05:28,333 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4115853658536585 [2024-06-03 22:05:28,333 INFO L175 Difference]: Start difference. First operand has 81 places, 87 transitions, 676 flow. Second operand 8 states and 135 transitions. [2024-06-03 22:05:28,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 127 transitions, 1099 flow [2024-06-03 22:05:28,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 127 transitions, 1003 flow, removed 31 selfloop flow, removed 5 redundant places. [2024-06-03 22:05:28,349 INFO L231 Difference]: Finished difference. Result has 85 places, 97 transitions, 768 flow [2024-06-03 22:05:28,349 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=768, PETRI_PLACES=85, PETRI_TRANSITIONS=97} [2024-06-03 22:05:28,350 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 43 predicate places. [2024-06-03 22:05:28,350 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 97 transitions, 768 flow [2024-06-03 22:05:28,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:05:28,350 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:05:28,350 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:05:28,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-03 22:05:28,351 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:05:28,351 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:05:28,351 INFO L85 PathProgramCache]: Analyzing trace with hash -810108461, now seen corresponding path program 2 times [2024-06-03 22:05:28,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:05:28,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111662065] [2024-06-03 22:05:28,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:05:28,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:05:28,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:05:37,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:05:37,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:05:37,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111662065] [2024-06-03 22:05:37,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111662065] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:05:37,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:05:37,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:05:37,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828808367] [2024-06-03 22:05:37,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:05:37,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:05:37,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:05:37,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:05:37,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:05:37,223 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:05:37,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 97 transitions, 768 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:05:37,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:05:37,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:05:37,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:05:38,212 INFO L124 PetriNetUnfolderBase]: 1807/2695 cut-off events. [2024-06-03 22:05:38,212 INFO L125 PetriNetUnfolderBase]: For 31979/31979 co-relation queries the response was YES. [2024-06-03 22:05:38,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13861 conditions, 2695 events. 1807/2695 cut-off events. For 31979/31979 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 12196 event pairs, 496 based on Foata normal form. 2/2694 useless extension candidates. Maximal degree in co-relation 13824. Up to 2595 conditions per place. [2024-06-03 22:05:38,227 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 104 selfloop transitions, 31 changer transitions 0/138 dead transitions. [2024-06-03 22:05:38,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 138 transitions, 1211 flow [2024-06-03 22:05:38,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:05:38,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:05:38,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 143 transitions. [2024-06-03 22:05:38,230 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3875338753387534 [2024-06-03 22:05:38,230 INFO L175 Difference]: Start difference. First operand has 85 places, 97 transitions, 768 flow. Second operand 9 states and 143 transitions. [2024-06-03 22:05:38,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 138 transitions, 1211 flow [2024-06-03 22:05:38,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 138 transitions, 1155 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-06-03 22:05:38,248 INFO L231 Difference]: Finished difference. Result has 91 places, 108 transitions, 899 flow [2024-06-03 22:05:38,248 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=715, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=899, PETRI_PLACES=91, PETRI_TRANSITIONS=108} [2024-06-03 22:05:38,249 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 49 predicate places. [2024-06-03 22:05:38,249 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 108 transitions, 899 flow [2024-06-03 22:05:38,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:05:38,249 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:05:38,249 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:05:38,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-03 22:05:38,250 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:05:38,250 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:05:38,250 INFO L85 PathProgramCache]: Analyzing trace with hash -809841551, now seen corresponding path program 3 times [2024-06-03 22:05:38,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:05:38,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572751816] [2024-06-03 22:05:38,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:05:38,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:05:38,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:05:46,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:05:46,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:05:46,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572751816] [2024-06-03 22:05:46,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572751816] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:05:46,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:05:46,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:05:46,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105390941] [2024-06-03 22:05:46,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:05:46,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:05:46,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:05:46,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:05:46,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:05:46,564 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:05:46,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 108 transitions, 899 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:05:46,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:05:46,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:05:46,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:05:47,650 INFO L124 PetriNetUnfolderBase]: 1818/2711 cut-off events. [2024-06-03 22:05:47,651 INFO L125 PetriNetUnfolderBase]: For 35706/35706 co-relation queries the response was YES. [2024-06-03 22:05:47,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14414 conditions, 2711 events. 1818/2711 cut-off events. For 35706/35706 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 12266 event pairs, 496 based on Foata normal form. 2/2710 useless extension candidates. Maximal degree in co-relation 14374. Up to 2573 conditions per place. [2024-06-03 22:05:47,664 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 105 selfloop transitions, 43 changer transitions 0/151 dead transitions. [2024-06-03 22:05:47,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 151 transitions, 1443 flow [2024-06-03 22:05:47,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:05:47,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:05:47,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 160 transitions. [2024-06-03 22:05:47,667 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3902439024390244 [2024-06-03 22:05:47,667 INFO L175 Difference]: Start difference. First operand has 91 places, 108 transitions, 899 flow. Second operand 10 states and 160 transitions. [2024-06-03 22:05:47,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 151 transitions, 1443 flow [2024-06-03 22:05:47,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 151 transitions, 1383 flow, removed 14 selfloop flow, removed 4 redundant places. [2024-06-03 22:05:47,684 INFO L231 Difference]: Finished difference. Result has 98 places, 115 transitions, 1053 flow [2024-06-03 22:05:47,684 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=839, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1053, PETRI_PLACES=98, PETRI_TRANSITIONS=115} [2024-06-03 22:05:47,685 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 56 predicate places. [2024-06-03 22:05:47,685 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 115 transitions, 1053 flow [2024-06-03 22:05:47,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:05:47,685 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:05:47,685 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:05:47,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-03 22:05:47,686 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:05:47,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:05:47,686 INFO L85 PathProgramCache]: Analyzing trace with hash 185232063, now seen corresponding path program 4 times [2024-06-03 22:05:47,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:05:47,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632656517] [2024-06-03 22:05:47,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:05:47,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:05:47,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:05:54,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:05:54,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:05:54,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632656517] [2024-06-03 22:05:54,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632656517] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:05:54,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:05:54,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:05:54,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607760533] [2024-06-03 22:05:54,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:05:54,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:05:54,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:05:54,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:05:54,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:05:54,724 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:05:54,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 115 transitions, 1053 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:05:54,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:05:54,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:05:54,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:05:55,733 INFO L124 PetriNetUnfolderBase]: 1807/2696 cut-off events. [2024-06-03 22:05:55,733 INFO L125 PetriNetUnfolderBase]: For 38787/38802 co-relation queries the response was YES. [2024-06-03 22:05:55,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14541 conditions, 2696 events. 1807/2696 cut-off events. For 38787/38802 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 12206 event pairs, 503 based on Foata normal form. 12/2703 useless extension candidates. Maximal degree in co-relation 14499. Up to 2594 conditions per place. [2024-06-03 22:05:55,749 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 106 selfloop transitions, 29 changer transitions 0/138 dead transitions. [2024-06-03 22:05:55,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 138 transitions, 1381 flow [2024-06-03 22:05:55,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:05:55,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:05:55,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 128 transitions. [2024-06-03 22:05:55,753 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3902439024390244 [2024-06-03 22:05:55,753 INFO L175 Difference]: Start difference. First operand has 98 places, 115 transitions, 1053 flow. Second operand 8 states and 128 transitions. [2024-06-03 22:05:55,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 138 transitions, 1381 flow [2024-06-03 22:05:55,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 138 transitions, 1291 flow, removed 27 selfloop flow, removed 6 redundant places. [2024-06-03 22:05:55,782 INFO L231 Difference]: Finished difference. Result has 100 places, 115 transitions, 1029 flow [2024-06-03 22:05:55,782 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=963, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1029, PETRI_PLACES=100, PETRI_TRANSITIONS=115} [2024-06-03 22:05:55,783 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 58 predicate places. [2024-06-03 22:05:55,783 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 115 transitions, 1029 flow [2024-06-03 22:05:55,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:05:55,784 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:05:55,784 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:05:55,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-03 22:05:55,784 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:05:55,784 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:05:55,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1324373511, now seen corresponding path program 1 times [2024-06-03 22:05:55,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:05:55,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513611002] [2024-06-03 22:05:55,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:05:55,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:05:55,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:06:04,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:06:04,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:06:04,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513611002] [2024-06-03 22:06:04,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513611002] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:06:04,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:06:04,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:06:04,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404749106] [2024-06-03 22:06:04,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:06:04,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:06:04,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:06:04,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:06:04,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:06:04,697 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:06:04,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 115 transitions, 1029 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:06:04,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:06:04,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:06:04,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:06:05,791 INFO L124 PetriNetUnfolderBase]: 1761/2697 cut-off events. [2024-06-03 22:06:05,792 INFO L125 PetriNetUnfolderBase]: For 43433/43447 co-relation queries the response was YES. [2024-06-03 22:06:05,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14922 conditions, 2697 events. 1761/2697 cut-off events. For 43433/43447 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 12922 event pairs, 459 based on Foata normal form. 8/2683 useless extension candidates. Maximal degree in co-relation 14878. Up to 2482 conditions per place. [2024-06-03 22:06:05,808 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 130 selfloop transitions, 31 changer transitions 0/169 dead transitions. [2024-06-03 22:06:05,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 169 transitions, 1631 flow [2024-06-03 22:06:05,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:06:05,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:06:05,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 157 transitions. [2024-06-03 22:06:05,812 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4254742547425474 [2024-06-03 22:06:05,812 INFO L175 Difference]: Start difference. First operand has 100 places, 115 transitions, 1029 flow. Second operand 9 states and 157 transitions. [2024-06-03 22:06:05,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 169 transitions, 1631 flow [2024-06-03 22:06:05,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 169 transitions, 1561 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-03 22:06:05,840 INFO L231 Difference]: Finished difference. Result has 106 places, 134 transitions, 1247 flow [2024-06-03 22:06:05,840 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=965, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1247, PETRI_PLACES=106, PETRI_TRANSITIONS=134} [2024-06-03 22:06:05,841 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 64 predicate places. [2024-06-03 22:06:05,841 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 134 transitions, 1247 flow [2024-06-03 22:06:05,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:06:05,841 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:06:05,841 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:06:05,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-03 22:06:05,842 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:06:05,842 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:06:05,843 INFO L85 PathProgramCache]: Analyzing trace with hash -643381639, now seen corresponding path program 2 times [2024-06-03 22:06:05,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:06:05,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951733672] [2024-06-03 22:06:05,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:06:05,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:06:05,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:06:13,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:06:13,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:06:13,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951733672] [2024-06-03 22:06:13,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951733672] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:06:13,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:06:13,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:06:13,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676523553] [2024-06-03 22:06:13,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:06:13,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:06:13,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:06:13,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:06:13,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:06:13,878 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:06:13,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 134 transitions, 1247 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:06:13,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:06:13,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:06:13,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:06:15,033 INFO L124 PetriNetUnfolderBase]: 1802/2767 cut-off events. [2024-06-03 22:06:15,034 INFO L125 PetriNetUnfolderBase]: For 49469/49482 co-relation queries the response was YES. [2024-06-03 22:06:15,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15916 conditions, 2767 events. 1802/2767 cut-off events. For 49469/49482 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 13416 event pairs, 321 based on Foata normal form. 12/2764 useless extension candidates. Maximal degree in co-relation 15869. Up to 2488 conditions per place. [2024-06-03 22:06:15,051 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 125 selfloop transitions, 34 changer transitions 0/167 dead transitions. [2024-06-03 22:06:15,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 167 transitions, 1707 flow [2024-06-03 22:06:15,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:06:15,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:06:15,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 138 transitions. [2024-06-03 22:06:15,054 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42073170731707316 [2024-06-03 22:06:15,054 INFO L175 Difference]: Start difference. First operand has 106 places, 134 transitions, 1247 flow. Second operand 8 states and 138 transitions. [2024-06-03 22:06:15,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 167 transitions, 1707 flow [2024-06-03 22:06:15,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 167 transitions, 1641 flow, removed 18 selfloop flow, removed 3 redundant places. [2024-06-03 22:06:15,091 INFO L231 Difference]: Finished difference. Result has 111 places, 136 transitions, 1307 flow [2024-06-03 22:06:15,091 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1181, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1307, PETRI_PLACES=111, PETRI_TRANSITIONS=136} [2024-06-03 22:06:15,092 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 69 predicate places. [2024-06-03 22:06:15,092 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 136 transitions, 1307 flow [2024-06-03 22:06:15,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:06:15,092 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:06:15,092 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:06:15,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-03 22:06:15,093 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:06:15,093 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:06:15,093 INFO L85 PathProgramCache]: Analyzing trace with hash -643321189, now seen corresponding path program 3 times [2024-06-03 22:06:15,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:06:15,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407888536] [2024-06-03 22:06:15,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:06:15,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:06:15,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:06:24,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:06:24,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:06:24,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407888536] [2024-06-03 22:06:24,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407888536] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:06:24,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:06:24,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:06:24,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170523118] [2024-06-03 22:06:24,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:06:24,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:06:24,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:06:24,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:06:24,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:06:24,285 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:06:24,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 136 transitions, 1307 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:06:24,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:06:24,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:06:24,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:06:25,392 INFO L124 PetriNetUnfolderBase]: 1831/2816 cut-off events. [2024-06-03 22:06:25,392 INFO L125 PetriNetUnfolderBase]: For 56521/56534 co-relation queries the response was YES. [2024-06-03 22:06:25,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16601 conditions, 2816 events. 1831/2816 cut-off events. For 56521/56534 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 13692 event pairs, 423 based on Foata normal form. 16/2817 useless extension candidates. Maximal degree in co-relation 16553. Up to 2543 conditions per place. [2024-06-03 22:06:25,411 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 123 selfloop transitions, 38 changer transitions 0/169 dead transitions. [2024-06-03 22:06:25,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 169 transitions, 1777 flow [2024-06-03 22:06:25,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:06:25,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:06:25,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 139 transitions. [2024-06-03 22:06:25,414 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42378048780487804 [2024-06-03 22:06:25,414 INFO L175 Difference]: Start difference. First operand has 111 places, 136 transitions, 1307 flow. Second operand 8 states and 139 transitions. [2024-06-03 22:06:25,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 169 transitions, 1777 flow [2024-06-03 22:06:25,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 169 transitions, 1667 flow, removed 24 selfloop flow, removed 6 redundant places. [2024-06-03 22:06:25,459 INFO L231 Difference]: Finished difference. Result has 113 places, 138 transitions, 1335 flow [2024-06-03 22:06:25,459 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1201, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1335, PETRI_PLACES=113, PETRI_TRANSITIONS=138} [2024-06-03 22:06:25,460 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 71 predicate places. [2024-06-03 22:06:25,460 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 138 transitions, 1335 flow [2024-06-03 22:06:25,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:06:25,460 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:06:25,460 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:06:25,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-03 22:06:25,460 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:06:25,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:06:25,461 INFO L85 PathProgramCache]: Analyzing trace with hash -525048811, now seen corresponding path program 1 times [2024-06-03 22:06:25,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:06:25,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21660418] [2024-06-03 22:06:25,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:06:25,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:06:25,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:06:33,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:06:33,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:06:33,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21660418] [2024-06-03 22:06:33,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21660418] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:06:33,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:06:33,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:06:33,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099478736] [2024-06-03 22:06:33,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:06:33,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:06:33,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:06:33,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:06:33,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:06:34,123 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:06:34,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 138 transitions, 1335 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:06:34,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:06:34,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:06:34,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:06:35,340 INFO L124 PetriNetUnfolderBase]: 2004/3009 cut-off events. [2024-06-03 22:06:35,341 INFO L125 PetriNetUnfolderBase]: For 56091/56099 co-relation queries the response was YES. [2024-06-03 22:06:35,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17126 conditions, 3009 events. 2004/3009 cut-off events. For 56091/56099 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 13971 event pairs, 471 based on Foata normal form. 12/3018 useless extension candidates. Maximal degree in co-relation 17077. Up to 2920 conditions per place. [2024-06-03 22:06:35,358 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 147 selfloop transitions, 22 changer transitions 0/172 dead transitions. [2024-06-03 22:06:35,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 172 transitions, 1815 flow [2024-06-03 22:06:35,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:06:35,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:06:35,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 141 transitions. [2024-06-03 22:06:35,361 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3821138211382114 [2024-06-03 22:06:35,361 INFO L175 Difference]: Start difference. First operand has 113 places, 138 transitions, 1335 flow. Second operand 9 states and 141 transitions. [2024-06-03 22:06:35,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 172 transitions, 1815 flow [2024-06-03 22:06:35,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 172 transitions, 1705 flow, removed 20 selfloop flow, removed 6 redundant places. [2024-06-03 22:06:35,403 INFO L231 Difference]: Finished difference. Result has 116 places, 140 transitions, 1320 flow [2024-06-03 22:06:35,403 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1225, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1320, PETRI_PLACES=116, PETRI_TRANSITIONS=140} [2024-06-03 22:06:35,403 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 74 predicate places. [2024-06-03 22:06:35,404 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 140 transitions, 1320 flow [2024-06-03 22:06:35,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:06:35,405 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:06:35,408 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:06:35,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-03 22:06:35,408 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:06:35,409 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:06:35,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1281403707, now seen corresponding path program 4 times [2024-06-03 22:06:35,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:06:35,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355690246] [2024-06-03 22:06:35,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:06:35,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:06:35,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:06:43,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:06:43,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:06:43,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355690246] [2024-06-03 22:06:43,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355690246] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:06:43,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:06:43,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:06:43,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268756227] [2024-06-03 22:06:43,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:06:43,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:06:43,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:06:43,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:06:43,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:06:44,077 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:06:44,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 140 transitions, 1320 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:06:44,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:06:44,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:06:44,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:06:45,239 INFO L124 PetriNetUnfolderBase]: 1936/2989 cut-off events. [2024-06-03 22:06:45,239 INFO L125 PetriNetUnfolderBase]: For 68023/68034 co-relation queries the response was YES. [2024-06-03 22:06:45,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17528 conditions, 2989 events. 1936/2989 cut-off events. For 68023/68034 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 14754 event pairs, 451 based on Foata normal form. 34/3013 useless extension candidates. Maximal degree in co-relation 17478. Up to 2489 conditions per place. [2024-06-03 22:06:45,260 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 114 selfloop transitions, 52 changer transitions 0/174 dead transitions. [2024-06-03 22:06:45,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 174 transitions, 1808 flow [2024-06-03 22:06:45,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:06:45,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:06:45,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions. [2024-06-03 22:06:45,263 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4420731707317073 [2024-06-03 22:06:45,263 INFO L175 Difference]: Start difference. First operand has 116 places, 140 transitions, 1320 flow. Second operand 8 states and 145 transitions. [2024-06-03 22:06:45,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 174 transitions, 1808 flow [2024-06-03 22:06:45,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 174 transitions, 1713 flow, removed 18 selfloop flow, removed 7 redundant places. [2024-06-03 22:06:45,307 INFO L231 Difference]: Finished difference. Result has 117 places, 142 transitions, 1393 flow [2024-06-03 22:06:45,307 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1225, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1393, PETRI_PLACES=117, PETRI_TRANSITIONS=142} [2024-06-03 22:06:45,308 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 75 predicate places. [2024-06-03 22:06:45,308 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 142 transitions, 1393 flow [2024-06-03 22:06:45,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:06:45,308 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:06:45,308 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:06:45,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-03 22:06:45,308 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:06:45,309 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:06:45,309 INFO L85 PathProgramCache]: Analyzing trace with hash -626017670, now seen corresponding path program 1 times [2024-06-03 22:06:45,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:06:45,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101573362] [2024-06-03 22:06:45,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:06:45,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:06:45,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:06:58,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:06:58,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:06:58,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101573362] [2024-06-03 22:06:58,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101573362] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:06:58,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:06:58,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:06:58,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117903323] [2024-06-03 22:06:58,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:06:58,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:06:58,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:06:58,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:06:58,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:06:58,431 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:06:58,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 142 transitions, 1393 flow. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:06:58,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:06:58,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:06:58,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:06:59,528 INFO L124 PetriNetUnfolderBase]: 2134/3217 cut-off events. [2024-06-03 22:06:59,529 INFO L125 PetriNetUnfolderBase]: For 69374/69382 co-relation queries the response was YES. [2024-06-03 22:06:59,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18875 conditions, 3217 events. 2134/3217 cut-off events. For 69374/69382 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 15186 event pairs, 509 based on Foata normal form. 9/3223 useless extension candidates. Maximal degree in co-relation 18824. Up to 3149 conditions per place. [2024-06-03 22:06:59,554 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 146 selfloop transitions, 20 changer transitions 0/169 dead transitions. [2024-06-03 22:06:59,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 169 transitions, 1891 flow [2024-06-03 22:06:59,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:06:59,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:06:59,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2024-06-03 22:06:59,556 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146341463414634 [2024-06-03 22:06:59,556 INFO L175 Difference]: Start difference. First operand has 117 places, 142 transitions, 1393 flow. Second operand 6 states and 102 transitions. [2024-06-03 22:06:59,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 169 transitions, 1891 flow [2024-06-03 22:06:59,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 169 transitions, 1757 flow, removed 18 selfloop flow, removed 6 redundant places. [2024-06-03 22:06:59,633 INFO L231 Difference]: Finished difference. Result has 118 places, 149 transitions, 1388 flow [2024-06-03 22:06:59,633 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1259, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1388, PETRI_PLACES=118, PETRI_TRANSITIONS=149} [2024-06-03 22:06:59,633 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 76 predicate places. [2024-06-03 22:06:59,634 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 149 transitions, 1388 flow [2024-06-03 22:06:59,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:06:59,634 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:06:59,634 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:06:59,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-03 22:06:59,634 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:06:59,635 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:06:59,635 INFO L85 PathProgramCache]: Analyzing trace with hash -2100534629, now seen corresponding path program 5 times [2024-06-03 22:06:59,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:06:59,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705572058] [2024-06-03 22:06:59,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:06:59,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:06:59,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:07:08,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:07:08,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:07:08,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705572058] [2024-06-03 22:07:08,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705572058] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:07:08,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:07:08,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:07:08,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862604568] [2024-06-03 22:07:08,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:07:08,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:07:08,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:07:08,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:07:08,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:07:08,919 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:07:08,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 149 transitions, 1388 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:07:08,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:07:08,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:07:08,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:07:10,234 INFO L124 PetriNetUnfolderBase]: 2024/3134 cut-off events. [2024-06-03 22:07:10,234 INFO L125 PetriNetUnfolderBase]: For 77907/77939 co-relation queries the response was YES. [2024-06-03 22:07:10,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18893 conditions, 3134 events. 2024/3134 cut-off events. For 77907/77939 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 15682 event pairs, 457 based on Foata normal form. 37/3150 useless extension candidates. Maximal degree in co-relation 18840. Up to 2501 conditions per place. [2024-06-03 22:07:10,253 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 100 selfloop transitions, 76 changer transitions 0/184 dead transitions. [2024-06-03 22:07:10,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 184 transitions, 1990 flow [2024-06-03 22:07:10,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:07:10,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:07:10,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-06-03 22:07:10,256 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45426829268292684 [2024-06-03 22:07:10,256 INFO L175 Difference]: Start difference. First operand has 118 places, 149 transitions, 1388 flow. Second operand 8 states and 149 transitions. [2024-06-03 22:07:10,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 184 transitions, 1990 flow [2024-06-03 22:07:10,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 184 transitions, 1956 flow, removed 13 selfloop flow, removed 2 redundant places. [2024-06-03 22:07:10,302 INFO L231 Difference]: Finished difference. Result has 124 places, 151 transitions, 1572 flow [2024-06-03 22:07:10,302 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1354, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1572, PETRI_PLACES=124, PETRI_TRANSITIONS=151} [2024-06-03 22:07:10,303 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 82 predicate places. [2024-06-03 22:07:10,303 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 151 transitions, 1572 flow [2024-06-03 22:07:10,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:07:10,304 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:07:10,304 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:07:10,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-03 22:07:10,305 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:07:10,305 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:07:10,305 INFO L85 PathProgramCache]: Analyzing trace with hash 428361479, now seen corresponding path program 1 times [2024-06-03 22:07:10,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:07:10,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306067678] [2024-06-03 22:07:10,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:07:10,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:07:10,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:07:19,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:07:19,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:07:19,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306067678] [2024-06-03 22:07:19,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306067678] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:07:19,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:07:19,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:07:19,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049796264] [2024-06-03 22:07:19,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:07:19,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:07:19,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:07:19,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:07:19,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:07:19,771 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:07:19,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 151 transitions, 1572 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:07:19,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:07:19,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:07:19,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:07:21,113 INFO L124 PetriNetUnfolderBase]: 2237/3384 cut-off events. [2024-06-03 22:07:21,113 INFO L125 PetriNetUnfolderBase]: For 79055/79061 co-relation queries the response was YES. [2024-06-03 22:07:21,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20489 conditions, 3384 events. 2237/3384 cut-off events. For 79055/79061 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 16355 event pairs, 507 based on Foata normal form. 10/3391 useless extension candidates. Maximal degree in co-relation 20434. Up to 2995 conditions per place. [2024-06-03 22:07:21,138 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 129 selfloop transitions, 65 changer transitions 0/197 dead transitions. [2024-06-03 22:07:21,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 197 transitions, 2173 flow [2024-06-03 22:07:21,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:07:21,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:07:21,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 166 transitions. [2024-06-03 22:07:21,142 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40487804878048783 [2024-06-03 22:07:21,142 INFO L175 Difference]: Start difference. First operand has 124 places, 151 transitions, 1572 flow. Second operand 10 states and 166 transitions. [2024-06-03 22:07:21,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 197 transitions, 2173 flow [2024-06-03 22:07:21,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 197 transitions, 1971 flow, removed 20 selfloop flow, removed 6 redundant places. [2024-06-03 22:07:21,201 INFO L231 Difference]: Finished difference. Result has 129 places, 160 transitions, 1624 flow [2024-06-03 22:07:21,202 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1384, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1624, PETRI_PLACES=129, PETRI_TRANSITIONS=160} [2024-06-03 22:07:21,202 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 87 predicate places. [2024-06-03 22:07:21,202 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 160 transitions, 1624 flow [2024-06-03 22:07:21,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:07:21,215 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:07:21,215 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:07:21,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-03 22:07:21,216 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:07:21,216 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:07:21,216 INFO L85 PathProgramCache]: Analyzing trace with hash 428534459, now seen corresponding path program 2 times [2024-06-03 22:07:21,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:07:21,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683281874] [2024-06-03 22:07:21,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:07:21,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:07:21,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:07:31,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:07:31,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:07:31,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683281874] [2024-06-03 22:07:31,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683281874] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:07:31,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:07:31,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:07:31,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516602268] [2024-06-03 22:07:31,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:07:31,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:07:31,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:07:31,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:07:31,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:07:31,505 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:07:31,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 160 transitions, 1624 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:07:31,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:07:31,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:07:31,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:07:32,778 INFO L124 PetriNetUnfolderBase]: 2281/3448 cut-off events. [2024-06-03 22:07:32,779 INFO L125 PetriNetUnfolderBase]: For 81342/81348 co-relation queries the response was YES. [2024-06-03 22:07:32,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20821 conditions, 3448 events. 2281/3448 cut-off events. For 81342/81348 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 16680 event pairs, 507 based on Foata normal form. 10/3455 useless extension candidates. Maximal degree in co-relation 20764. Up to 3014 conditions per place. [2024-06-03 22:07:32,801 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 128 selfloop transitions, 73 changer transitions 0/204 dead transitions. [2024-06-03 22:07:32,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 204 transitions, 2226 flow [2024-06-03 22:07:32,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:07:32,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:07:32,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 169 transitions. [2024-06-03 22:07:32,804 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4121951219512195 [2024-06-03 22:07:32,804 INFO L175 Difference]: Start difference. First operand has 129 places, 160 transitions, 1624 flow. Second operand 10 states and 169 transitions. [2024-06-03 22:07:32,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 204 transitions, 2226 flow [2024-06-03 22:07:32,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 204 transitions, 2122 flow, removed 18 selfloop flow, removed 5 redundant places. [2024-06-03 22:07:32,875 INFO L231 Difference]: Finished difference. Result has 134 places, 166 transitions, 1768 flow [2024-06-03 22:07:32,875 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1520, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1768, PETRI_PLACES=134, PETRI_TRANSITIONS=166} [2024-06-03 22:07:32,875 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 92 predicate places. [2024-06-03 22:07:32,875 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 166 transitions, 1768 flow [2024-06-03 22:07:32,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:07:32,876 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:07:32,876 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:07:32,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-03 22:07:32,876 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:07:32,876 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:07:32,877 INFO L85 PathProgramCache]: Analyzing trace with hash -2100349931, now seen corresponding path program 2 times [2024-06-03 22:07:32,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:07:32,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476371428] [2024-06-03 22:07:32,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:07:32,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:07:32,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:07:41,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:07:41,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:07:41,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476371428] [2024-06-03 22:07:41,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476371428] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:07:41,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:07:41,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:07:41,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096394261] [2024-06-03 22:07:41,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:07:41,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:07:41,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:07:41,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:07:41,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:07:41,729 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:07:41,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 166 transitions, 1768 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:07:41,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:07:41,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:07:41,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:07:43,110 INFO L124 PetriNetUnfolderBase]: 2298/3475 cut-off events. [2024-06-03 22:07:43,111 INFO L125 PetriNetUnfolderBase]: For 87270/87300 co-relation queries the response was YES. [2024-06-03 22:07:43,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21480 conditions, 3475 events. 2298/3475 cut-off events. For 87270/87300 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 16841 event pairs, 526 based on Foata normal form. 24/3492 useless extension candidates. Maximal degree in co-relation 21421. Up to 3339 conditions per place. [2024-06-03 22:07:43,133 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 161 selfloop transitions, 34 changer transitions 0/198 dead transitions. [2024-06-03 22:07:43,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 198 transitions, 2304 flow [2024-06-03 22:07:43,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:07:43,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:07:43,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 142 transitions. [2024-06-03 22:07:43,136 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38482384823848237 [2024-06-03 22:07:43,136 INFO L175 Difference]: Start difference. First operand has 134 places, 166 transitions, 1768 flow. Second operand 9 states and 142 transitions. [2024-06-03 22:07:43,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 198 transitions, 2304 flow [2024-06-03 22:07:43,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 198 transitions, 2138 flow, removed 21 selfloop flow, removed 7 redundant places. [2024-06-03 22:07:43,207 INFO L231 Difference]: Finished difference. Result has 136 places, 168 transitions, 1731 flow [2024-06-03 22:07:43,207 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1602, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1731, PETRI_PLACES=136, PETRI_TRANSITIONS=168} [2024-06-03 22:07:43,208 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 94 predicate places. [2024-06-03 22:07:43,209 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 168 transitions, 1731 flow [2024-06-03 22:07:43,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:07:43,209 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:07:43,209 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:07:43,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-03 22:07:43,209 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:07:43,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:07:43,210 INFO L85 PathProgramCache]: Analyzing trace with hash -2094100579, now seen corresponding path program 3 times [2024-06-03 22:07:43,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:07:43,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350743841] [2024-06-03 22:07:43,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:07:43,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:07:43,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:07:52,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:07:52,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:07:52,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350743841] [2024-06-03 22:07:52,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350743841] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:07:52,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:07:52,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:07:52,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459732099] [2024-06-03 22:07:52,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:07:52,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:07:52,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:07:52,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:07:52,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:07:52,677 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:07:52,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 168 transitions, 1731 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:07:52,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:07:52,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:07:52,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:07:53,981 INFO L124 PetriNetUnfolderBase]: 2288/3461 cut-off events. [2024-06-03 22:07:53,981 INFO L125 PetriNetUnfolderBase]: For 80960/80966 co-relation queries the response was YES. [2024-06-03 22:07:53,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20956 conditions, 3461 events. 2288/3461 cut-off events. For 80960/80966 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 16797 event pairs, 502 based on Foata normal form. 10/3468 useless extension candidates. Maximal degree in co-relation 20897. Up to 3050 conditions per place. [2024-06-03 22:07:54,006 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 130 selfloop transitions, 74 changer transitions 0/207 dead transitions. [2024-06-03 22:07:54,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 207 transitions, 2275 flow [2024-06-03 22:07:54,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:07:54,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:07:54,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 166 transitions. [2024-06-03 22:07:54,010 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40487804878048783 [2024-06-03 22:07:54,010 INFO L175 Difference]: Start difference. First operand has 136 places, 168 transitions, 1731 flow. Second operand 10 states and 166 transitions. [2024-06-03 22:07:54,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 207 transitions, 2275 flow [2024-06-03 22:07:54,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 207 transitions, 2142 flow, removed 34 selfloop flow, removed 7 redundant places. [2024-06-03 22:07:54,085 INFO L231 Difference]: Finished difference. Result has 139 places, 170 transitions, 1778 flow [2024-06-03 22:07:54,085 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1598, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1778, PETRI_PLACES=139, PETRI_TRANSITIONS=170} [2024-06-03 22:07:54,086 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 97 predicate places. [2024-06-03 22:07:54,086 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 170 transitions, 1778 flow [2024-06-03 22:07:54,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:07:54,086 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:07:54,086 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:07:54,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-03 22:07:54,087 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:07:54,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:07:54,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1872448781, now seen corresponding path program 3 times [2024-06-03 22:07:54,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:07:54,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872390262] [2024-06-03 22:07:54,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:07:54,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:07:54,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:08:02,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:08:02,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:08:02,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872390262] [2024-06-03 22:08:02,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872390262] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:08:02,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:08:02,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:08:02,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675307743] [2024-06-03 22:08:02,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:08:02,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:08:02,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:08:02,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:08:02,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:08:02,890 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:08:02,890 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 170 transitions, 1778 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:08:02,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:08:02,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:08:02,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:08:04,244 INFO L124 PetriNetUnfolderBase]: 2305/3488 cut-off events. [2024-06-03 22:08:04,245 INFO L125 PetriNetUnfolderBase]: For 86581/86611 co-relation queries the response was YES. [2024-06-03 22:08:04,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21440 conditions, 3488 events. 2305/3488 cut-off events. For 86581/86611 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 16942 event pairs, 534 based on Foata normal form. 24/3505 useless extension candidates. Maximal degree in co-relation 21380. Up to 3352 conditions per place. [2024-06-03 22:08:04,269 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 164 selfloop transitions, 35 changer transitions 0/202 dead transitions. [2024-06-03 22:08:04,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 202 transitions, 2326 flow [2024-06-03 22:08:04,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:08:04,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:08:04,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 141 transitions. [2024-06-03 22:08:04,272 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3821138211382114 [2024-06-03 22:08:04,272 INFO L175 Difference]: Start difference. First operand has 139 places, 170 transitions, 1778 flow. Second operand 9 states and 141 transitions. [2024-06-03 22:08:04,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 202 transitions, 2326 flow [2024-06-03 22:08:04,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 202 transitions, 2177 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-03 22:08:04,334 INFO L231 Difference]: Finished difference. Result has 141 places, 172 transitions, 1764 flow [2024-06-03 22:08:04,335 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1629, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1764, PETRI_PLACES=141, PETRI_TRANSITIONS=172} [2024-06-03 22:08:04,335 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 99 predicate places. [2024-06-03 22:08:04,336 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 172 transitions, 1764 flow [2024-06-03 22:08:04,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:08:04,336 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:08:04,336 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:08:04,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-03 22:08:04,336 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:08:04,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:08:04,337 INFO L85 PathProgramCache]: Analyzing trace with hash 665013247, now seen corresponding path program 4 times [2024-06-03 22:08:04,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:08:04,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261043738] [2024-06-03 22:08:04,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:08:04,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:08:04,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:08:13,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:08:13,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:08:13,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261043738] [2024-06-03 22:08:13,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261043738] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:08:13,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:08:13,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:08:13,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095363033] [2024-06-03 22:08:13,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:08:13,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:08:13,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:08:13,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:08:13,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:08:13,353 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:08:13,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 172 transitions, 1764 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:08:13,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:08:13,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:08:13,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:08:14,625 INFO L124 PetriNetUnfolderBase]: 2322/3515 cut-off events. [2024-06-03 22:08:14,625 INFO L125 PetriNetUnfolderBase]: For 93485/93515 co-relation queries the response was YES. [2024-06-03 22:08:14,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21797 conditions, 3515 events. 2322/3515 cut-off events. For 93485/93515 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 17150 event pairs, 499 based on Foata normal form. 24/3532 useless extension candidates. Maximal degree in co-relation 21736. Up to 3242 conditions per place. [2024-06-03 22:08:14,649 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 151 selfloop transitions, 55 changer transitions 0/209 dead transitions. [2024-06-03 22:08:14,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 209 transitions, 2498 flow [2024-06-03 22:08:14,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:08:14,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:08:14,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 145 transitions. [2024-06-03 22:08:14,652 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39295392953929537 [2024-06-03 22:08:14,652 INFO L175 Difference]: Start difference. First operand has 141 places, 172 transitions, 1764 flow. Second operand 9 states and 145 transitions. [2024-06-03 22:08:14,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 209 transitions, 2498 flow [2024-06-03 22:08:14,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 209 transitions, 2381 flow, removed 25 selfloop flow, removed 7 redundant places. [2024-06-03 22:08:14,720 INFO L231 Difference]: Finished difference. Result has 143 places, 176 transitions, 1884 flow [2024-06-03 22:08:14,721 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1647, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1884, PETRI_PLACES=143, PETRI_TRANSITIONS=176} [2024-06-03 22:08:14,721 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 101 predicate places. [2024-06-03 22:08:14,721 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 176 transitions, 1884 flow [2024-06-03 22:08:14,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:08:14,721 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:08:14,722 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:08:14,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-03 22:08:14,722 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:08:14,722 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:08:14,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1864174571, now seen corresponding path program 5 times [2024-06-03 22:08:14,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:08:14,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193598401] [2024-06-03 22:08:14,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:08:14,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:08:14,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:08:23,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:08:23,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:08:23,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193598401] [2024-06-03 22:08:23,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193598401] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:08:23,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:08:23,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:08:23,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505373681] [2024-06-03 22:08:23,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:08:23,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:08:23,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:08:23,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:08:23,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:08:23,366 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:08:23,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 176 transitions, 1884 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:08:23,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:08:23,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:08:23,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:08:24,659 INFO L124 PetriNetUnfolderBase]: 2314/3503 cut-off events. [2024-06-03 22:08:24,660 INFO L125 PetriNetUnfolderBase]: For 97892/97922 co-relation queries the response was YES. [2024-06-03 22:08:24,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21893 conditions, 3503 events. 2314/3503 cut-off events. For 97892/97922 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 17006 event pairs, 532 based on Foata normal form. 24/3520 useless extension candidates. Maximal degree in co-relation 21831. Up to 3331 conditions per place. [2024-06-03 22:08:24,683 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 157 selfloop transitions, 46 changer transitions 0/206 dead transitions. [2024-06-03 22:08:24,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 206 transitions, 2386 flow [2024-06-03 22:08:24,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:08:24,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:08:24,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 142 transitions. [2024-06-03 22:08:24,686 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38482384823848237 [2024-06-03 22:08:24,686 INFO L175 Difference]: Start difference. First operand has 143 places, 176 transitions, 1884 flow. Second operand 9 states and 142 transitions. [2024-06-03 22:08:24,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 206 transitions, 2386 flow [2024-06-03 22:08:24,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 206 transitions, 2238 flow, removed 47 selfloop flow, removed 5 redundant places. [2024-06-03 22:08:24,761 INFO L231 Difference]: Finished difference. Result has 147 places, 176 transitions, 1835 flow [2024-06-03 22:08:24,761 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1736, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1835, PETRI_PLACES=147, PETRI_TRANSITIONS=176} [2024-06-03 22:08:24,761 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 105 predicate places. [2024-06-03 22:08:24,762 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 176 transitions, 1835 flow [2024-06-03 22:08:24,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:08:24,762 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:08:24,762 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:08:24,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-03 22:08:24,762 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:08:24,762 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:08:24,763 INFO L85 PathProgramCache]: Analyzing trace with hash -168545722, now seen corresponding path program 2 times [2024-06-03 22:08:24,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:08:24,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491321023] [2024-06-03 22:08:24,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:08:24,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:08:24,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:08:37,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:08:37,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:08:37,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491321023] [2024-06-03 22:08:37,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491321023] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:08:37,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:08:37,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:08:37,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520657760] [2024-06-03 22:08:37,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:08:37,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:08:37,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:08:37,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:08:37,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:08:37,259 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:08:37,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 176 transitions, 1835 flow. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:08:37,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:08:37,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:08:37,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:08:38,440 INFO L124 PetriNetUnfolderBase]: 2311/3499 cut-off events. [2024-06-03 22:08:38,440 INFO L125 PetriNetUnfolderBase]: For 99918/99948 co-relation queries the response was YES. [2024-06-03 22:08:38,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21911 conditions, 3499 events. 2311/3499 cut-off events. For 99918/99948 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 16909 event pairs, 532 based on Foata normal form. 21/3513 useless extension candidates. Maximal degree in co-relation 21847. Up to 3447 conditions per place. [2024-06-03 22:08:38,462 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 170 selfloop transitions, 19 changer transitions 0/192 dead transitions. [2024-06-03 22:08:38,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 192 transitions, 2296 flow [2024-06-03 22:08:38,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:08:38,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:08:38,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 91 transitions. [2024-06-03 22:08:38,465 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3699186991869919 [2024-06-03 22:08:38,465 INFO L175 Difference]: Start difference. First operand has 147 places, 176 transitions, 1835 flow. Second operand 6 states and 91 transitions. [2024-06-03 22:08:38,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 192 transitions, 2296 flow [2024-06-03 22:08:38,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 192 transitions, 2168 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-06-03 22:08:38,536 INFO L231 Difference]: Finished difference. Result has 146 places, 181 transitions, 1815 flow [2024-06-03 22:08:38,536 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1707, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1815, PETRI_PLACES=146, PETRI_TRANSITIONS=181} [2024-06-03 22:08:38,536 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 104 predicate places. [2024-06-03 22:08:38,540 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 181 transitions, 1815 flow [2024-06-03 22:08:38,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:08:38,540 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:08:38,541 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:08:38,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-03 22:08:38,541 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:08:38,541 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:08:38,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1874481212, now seen corresponding path program 1 times [2024-06-03 22:08:38,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:08:38,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832306374] [2024-06-03 22:08:38,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:08:38,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:08:38,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:08:48,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:08:48,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:08:48,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832306374] [2024-06-03 22:08:48,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832306374] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:08:48,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:08:48,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:08:48,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462620138] [2024-06-03 22:08:48,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:08:48,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:08:48,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:08:48,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:08:48,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:08:48,323 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:08:48,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 181 transitions, 1815 flow. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:08:48,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:08:48,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:08:48,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:08:49,466 INFO L124 PetriNetUnfolderBase]: 2160/3355 cut-off events. [2024-06-03 22:08:49,466 INFO L125 PetriNetUnfolderBase]: For 105279/105279 co-relation queries the response was YES. [2024-06-03 22:08:49,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21217 conditions, 3355 events. 2160/3355 cut-off events. For 105279/105279 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 16860 event pairs, 512 based on Foata normal form. 3/3352 useless extension candidates. Maximal degree in co-relation 21151. Up to 3188 conditions per place. [2024-06-03 22:08:49,488 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 178 selfloop transitions, 18 changer transitions 0/203 dead transitions. [2024-06-03 22:08:49,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 203 transitions, 2363 flow [2024-06-03 22:08:49,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:08:49,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:08:49,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 103 transitions. [2024-06-03 22:08:49,489 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4186991869918699 [2024-06-03 22:08:49,489 INFO L175 Difference]: Start difference. First operand has 146 places, 181 transitions, 1815 flow. Second operand 6 states and 103 transitions. [2024-06-03 22:08:49,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 203 transitions, 2363 flow [2024-06-03 22:08:49,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 203 transitions, 2312 flow, removed 13 selfloop flow, removed 3 redundant places. [2024-06-03 22:08:49,558 INFO L231 Difference]: Finished difference. Result has 149 places, 187 transitions, 1866 flow [2024-06-03 22:08:49,558 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1766, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1866, PETRI_PLACES=149, PETRI_TRANSITIONS=187} [2024-06-03 22:08:49,558 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 107 predicate places. [2024-06-03 22:08:49,559 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 187 transitions, 1866 flow [2024-06-03 22:08:49,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:08:49,559 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:08:49,559 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:08:49,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-03 22:08:49,559 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:08:49,559 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:08:49,559 INFO L85 PathProgramCache]: Analyzing trace with hash 129893212, now seen corresponding path program 2 times [2024-06-03 22:08:49,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:08:49,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868151815] [2024-06-03 22:08:49,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:08:49,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:08:49,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:08:59,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:08:59,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:08:59,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868151815] [2024-06-03 22:08:59,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868151815] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:08:59,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:08:59,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:08:59,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874385464] [2024-06-03 22:08:59,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:08:59,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:08:59,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:08:59,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:08:59,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:09:00,097 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:09:00,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 187 transitions, 1866 flow. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:09:00,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:09:00,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:09:00,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:09:01,297 INFO L124 PetriNetUnfolderBase]: 2151/3344 cut-off events. [2024-06-03 22:09:01,298 INFO L125 PetriNetUnfolderBase]: For 104288/104288 co-relation queries the response was YES. [2024-06-03 22:09:01,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21362 conditions, 3344 events. 2151/3344 cut-off events. For 104288/104288 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 16776 event pairs, 508 based on Foata normal form. 3/3344 useless extension candidates. Maximal degree in co-relation 21295. Up to 3196 conditions per place. [2024-06-03 22:09:01,322 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 178 selfloop transitions, 13 changer transitions 0/198 dead transitions. [2024-06-03 22:09:01,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 198 transitions, 2278 flow [2024-06-03 22:09:01,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:09:01,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:09:01,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions. [2024-06-03 22:09:01,328 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3902439024390244 [2024-06-03 22:09:01,328 INFO L175 Difference]: Start difference. First operand has 149 places, 187 transitions, 1866 flow. Second operand 6 states and 96 transitions. [2024-06-03 22:09:01,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 198 transitions, 2278 flow [2024-06-03 22:09:01,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 198 transitions, 2228 flow, removed 18 selfloop flow, removed 3 redundant places. [2024-06-03 22:09:01,406 INFO L231 Difference]: Finished difference. Result has 152 places, 187 transitions, 1849 flow [2024-06-03 22:09:01,406 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1816, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1849, PETRI_PLACES=152, PETRI_TRANSITIONS=187} [2024-06-03 22:09:01,407 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 110 predicate places. [2024-06-03 22:09:01,407 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 187 transitions, 1849 flow [2024-06-03 22:09:01,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:09:01,407 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:09:01,407 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:09:01,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-03 22:09:01,408 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:09:01,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:09:01,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1618726073, now seen corresponding path program 1 times [2024-06-03 22:09:01,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:09:01,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692598693] [2024-06-03 22:09:01,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:09:01,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:09:01,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:09:09,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:09:09,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:09:09,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692598693] [2024-06-03 22:09:09,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692598693] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:09:09,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:09:09,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:09:09,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275902796] [2024-06-03 22:09:09,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:09:09,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:09:09,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:09:09,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:09:09,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:09:10,154 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:09:10,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 187 transitions, 1849 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:09:10,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:09:10,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:09:10,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:09:11,645 INFO L124 PetriNetUnfolderBase]: 2392/3631 cut-off events. [2024-06-03 22:09:11,645 INFO L125 PetriNetUnfolderBase]: For 121478/121486 co-relation queries the response was YES. [2024-06-03 22:09:11,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23144 conditions, 3631 events. 2392/3631 cut-off events. For 121478/121486 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 17914 event pairs, 523 based on Foata normal form. 28/3656 useless extension candidates. Maximal degree in co-relation 23076. Up to 3191 conditions per place. [2024-06-03 22:09:11,674 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 175 selfloop transitions, 55 changer transitions 0/233 dead transitions. [2024-06-03 22:09:11,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 233 transitions, 2501 flow [2024-06-03 22:09:11,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:09:11,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:09:11,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 169 transitions. [2024-06-03 22:09:11,677 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4121951219512195 [2024-06-03 22:09:11,677 INFO L175 Difference]: Start difference. First operand has 152 places, 187 transitions, 1849 flow. Second operand 10 states and 169 transitions. [2024-06-03 22:09:11,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 233 transitions, 2501 flow [2024-06-03 22:09:11,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 233 transitions, 2467 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-06-03 22:09:11,772 INFO L231 Difference]: Finished difference. Result has 157 places, 188 transitions, 1977 flow [2024-06-03 22:09:11,772 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1815, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1977, PETRI_PLACES=157, PETRI_TRANSITIONS=188} [2024-06-03 22:09:11,773 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 115 predicate places. [2024-06-03 22:09:11,773 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 188 transitions, 1977 flow [2024-06-03 22:09:11,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:09:11,773 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:09:11,773 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:09:11,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-03 22:09:11,773 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:09:11,774 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:09:11,774 INFO L85 PathProgramCache]: Analyzing trace with hash 2067991144, now seen corresponding path program 1 times [2024-06-03 22:09:11,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:09:11,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674742500] [2024-06-03 22:09:11,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:09:11,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:09:11,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:09:25,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:09:25,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:09:25,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674742500] [2024-06-03 22:09:25,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674742500] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:09:25,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:09:25,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:09:25,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441028599] [2024-06-03 22:09:25,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:09:25,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:09:25,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:09:25,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:09:25,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:09:25,604 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:09:25,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 188 transitions, 1977 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:09:25,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:09:25,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:09:25,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:09:26,889 INFO L124 PetriNetUnfolderBase]: 2434/3689 cut-off events. [2024-06-03 22:09:26,889 INFO L125 PetriNetUnfolderBase]: For 121479/121487 co-relation queries the response was YES. [2024-06-03 22:09:26,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24030 conditions, 3689 events. 2434/3689 cut-off events. For 121479/121487 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 18190 event pairs, 540 based on Foata normal form. 10/3696 useless extension candidates. Maximal degree in co-relation 23961. Up to 3501 conditions per place. [2024-06-03 22:09:26,919 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 177 selfloop transitions, 44 changer transitions 0/224 dead transitions. [2024-06-03 22:09:26,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 224 transitions, 2705 flow [2024-06-03 22:09:26,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:09:26,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:09:26,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions. [2024-06-03 22:09:26,922 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4355400696864111 [2024-06-03 22:09:26,922 INFO L175 Difference]: Start difference. First operand has 157 places, 188 transitions, 1977 flow. Second operand 7 states and 125 transitions. [2024-06-03 22:09:26,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 224 transitions, 2705 flow [2024-06-03 22:09:27,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 224 transitions, 2575 flow, removed 13 selfloop flow, removed 8 redundant places. [2024-06-03 22:09:27,022 INFO L231 Difference]: Finished difference. Result has 157 places, 195 transitions, 2046 flow [2024-06-03 22:09:27,022 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1847, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2046, PETRI_PLACES=157, PETRI_TRANSITIONS=195} [2024-06-03 22:09:27,022 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 115 predicate places. [2024-06-03 22:09:27,022 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 195 transitions, 2046 flow [2024-06-03 22:09:27,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:09:27,023 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:09:27,023 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:09:27,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-03 22:09:27,023 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:09:27,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:09:27,023 INFO L85 PathProgramCache]: Analyzing trace with hash 2144384603, now seen corresponding path program 2 times [2024-06-03 22:09:27,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:09:27,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935080234] [2024-06-03 22:09:27,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:09:27,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:09:27,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:09:35,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:09:35,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:09:35,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935080234] [2024-06-03 22:09:35,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935080234] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:09:35,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:09:35,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:09:35,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26299273] [2024-06-03 22:09:35,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:09:35,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:09:35,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:09:35,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:09:35,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:09:35,668 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:09:35,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 195 transitions, 2046 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:09:35,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:09:35,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:09:35,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:09:37,262 INFO L124 PetriNetUnfolderBase]: 2587/3946 cut-off events. [2024-06-03 22:09:37,262 INFO L125 PetriNetUnfolderBase]: For 144267/144273 co-relation queries the response was YES. [2024-06-03 22:09:37,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26137 conditions, 3946 events. 2587/3946 cut-off events. For 144267/144273 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 19968 event pairs, 576 based on Foata normal form. 22/3965 useless extension candidates. Maximal degree in co-relation 26066. Up to 3128 conditions per place. [2024-06-03 22:09:37,294 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 185 selfloop transitions, 55 changer transitions 0/243 dead transitions. [2024-06-03 22:09:37,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 243 transitions, 2898 flow [2024-06-03 22:09:37,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:09:37,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:09:37,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 157 transitions. [2024-06-03 22:09:37,299 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4254742547425474 [2024-06-03 22:09:37,299 INFO L175 Difference]: Start difference. First operand has 157 places, 195 transitions, 2046 flow. Second operand 9 states and 157 transitions. [2024-06-03 22:09:37,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 243 transitions, 2898 flow [2024-06-03 22:09:37,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 243 transitions, 2836 flow, removed 18 selfloop flow, removed 3 redundant places. [2024-06-03 22:09:37,417 INFO L231 Difference]: Finished difference. Result has 164 places, 199 transitions, 2220 flow [2024-06-03 22:09:37,417 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1984, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2220, PETRI_PLACES=164, PETRI_TRANSITIONS=199} [2024-06-03 22:09:37,417 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 122 predicate places. [2024-06-03 22:09:37,417 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 199 transitions, 2220 flow [2024-06-03 22:09:37,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:09:37,418 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:09:37,418 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:09:37,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-03 22:09:37,418 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:09:37,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:09:37,418 INFO L85 PathProgramCache]: Analyzing trace with hash 2068290046, now seen corresponding path program 1 times [2024-06-03 22:09:37,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:09:37,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5541038] [2024-06-03 22:09:37,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:09:37,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:09:37,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:09:50,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:09:50,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:09:50,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5541038] [2024-06-03 22:09:50,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5541038] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:09:50,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:09:50,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:09:50,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656458243] [2024-06-03 22:09:50,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:09:50,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:09:50,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:09:50,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:09:50,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:09:50,957 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:09:50,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 199 transitions, 2220 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:09:50,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:09:50,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:09:50,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:09:52,430 INFO L124 PetriNetUnfolderBase]: 2597/3958 cut-off events. [2024-06-03 22:09:52,430 INFO L125 PetriNetUnfolderBase]: For 146282/146290 co-relation queries the response was YES. [2024-06-03 22:09:52,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26716 conditions, 3958 events. 2597/3958 cut-off events. For 146282/146290 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 20040 event pairs, 598 based on Foata normal form. 10/3965 useless extension candidates. Maximal degree in co-relation 26642. Up to 3876 conditions per place. [2024-06-03 22:09:52,461 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 194 selfloop transitions, 29 changer transitions 0/226 dead transitions. [2024-06-03 22:09:52,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 226 transitions, 2894 flow [2024-06-03 22:09:52,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:09:52,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:09:52,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2024-06-03 22:09:52,463 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.397212543554007 [2024-06-03 22:09:52,463 INFO L175 Difference]: Start difference. First operand has 164 places, 199 transitions, 2220 flow. Second operand 7 states and 114 transitions. [2024-06-03 22:09:52,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 226 transitions, 2894 flow [2024-06-03 22:09:52,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 226 transitions, 2817 flow, removed 17 selfloop flow, removed 4 redundant places. [2024-06-03 22:09:52,595 INFO L231 Difference]: Finished difference. Result has 167 places, 205 transitions, 2309 flow [2024-06-03 22:09:52,596 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2143, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2309, PETRI_PLACES=167, PETRI_TRANSITIONS=205} [2024-06-03 22:09:52,596 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 125 predicate places. [2024-06-03 22:09:52,596 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 205 transitions, 2309 flow [2024-06-03 22:09:52,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:09:52,597 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:09:52,597 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:09:52,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-03 22:09:52,597 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:09:52,597 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:09:52,597 INFO L85 PathProgramCache]: Analyzing trace with hash 2068289674, now seen corresponding path program 2 times [2024-06-03 22:09:52,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:09:52,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996282609] [2024-06-03 22:09:52,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:09:52,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:09:52,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:10:05,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:10:05,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:10:05,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996282609] [2024-06-03 22:10:05,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996282609] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:10:05,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:10:05,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:10:05,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24335954] [2024-06-03 22:10:05,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:10:05,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:10:05,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:10:05,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:10:05,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:10:05,889 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:10:05,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 205 transitions, 2309 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:10:05,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:10:05,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:10:05,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:10:07,364 INFO L124 PetriNetUnfolderBase]: 2607/3974 cut-off events. [2024-06-03 22:10:07,364 INFO L125 PetriNetUnfolderBase]: For 151289/151295 co-relation queries the response was YES. [2024-06-03 22:10:07,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27036 conditions, 3974 events. 2607/3974 cut-off events. For 151289/151295 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 20172 event pairs, 620 based on Foata normal form. 8/3979 useless extension candidates. Maximal degree in co-relation 26960. Up to 3823 conditions per place. [2024-06-03 22:10:07,395 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 186 selfloop transitions, 40 changer transitions 0/229 dead transitions. [2024-06-03 22:10:07,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 229 transitions, 2948 flow [2024-06-03 22:10:07,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:10:07,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:10:07,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2024-06-03 22:10:07,402 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.397212543554007 [2024-06-03 22:10:07,402 INFO L175 Difference]: Start difference. First operand has 167 places, 205 transitions, 2309 flow. Second operand 7 states and 114 transitions. [2024-06-03 22:10:07,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 229 transitions, 2948 flow [2024-06-03 22:10:07,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 229 transitions, 2879 flow, removed 27 selfloop flow, removed 3 redundant places. [2024-06-03 22:10:07,530 INFO L231 Difference]: Finished difference. Result has 171 places, 210 transitions, 2389 flow [2024-06-03 22:10:07,530 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2240, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2389, PETRI_PLACES=171, PETRI_TRANSITIONS=210} [2024-06-03 22:10:07,539 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 129 predicate places. [2024-06-03 22:10:07,539 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 210 transitions, 2389 flow [2024-06-03 22:10:07,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:10:07,539 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:10:07,539 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:10:07,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-03 22:10:07,540 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:10:07,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:10:07,540 INFO L85 PathProgramCache]: Analyzing trace with hash -686337787, now seen corresponding path program 3 times [2024-06-03 22:10:07,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:10:07,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796972154] [2024-06-03 22:10:07,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:10:07,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:10:07,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:10:16,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:10:16,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:10:16,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796972154] [2024-06-03 22:10:16,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796972154] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:10:16,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:10:16,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:10:16,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79546424] [2024-06-03 22:10:16,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:10:16,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:10:16,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:10:16,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:10:16,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:10:16,415 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:10:16,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 210 transitions, 2389 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:10:16,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:10:16,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:10:16,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:10:17,960 INFO L124 PetriNetUnfolderBase]: 2890/4437 cut-off events. [2024-06-03 22:10:17,960 INFO L125 PetriNetUnfolderBase]: For 182645/182651 co-relation queries the response was YES. [2024-06-03 22:10:17,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30209 conditions, 4437 events. 2890/4437 cut-off events. For 182645/182651 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 23326 event pairs, 632 based on Foata normal form. 22/4456 useless extension candidates. Maximal degree in co-relation 30131. Up to 3403 conditions per place. [2024-06-03 22:10:17,998 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 169 selfloop transitions, 92 changer transitions 0/264 dead transitions. [2024-06-03 22:10:17,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 264 transitions, 3326 flow [2024-06-03 22:10:18,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:10:18,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:10:18,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 178 transitions. [2024-06-03 22:10:18,001 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43414634146341463 [2024-06-03 22:10:18,001 INFO L175 Difference]: Start difference. First operand has 171 places, 210 transitions, 2389 flow. Second operand 10 states and 178 transitions. [2024-06-03 22:10:18,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 264 transitions, 3326 flow [2024-06-03 22:10:18,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 264 transitions, 3290 flow, removed 10 selfloop flow, removed 2 redundant places. [2024-06-03 22:10:18,152 INFO L231 Difference]: Finished difference. Result has 180 places, 216 transitions, 2683 flow [2024-06-03 22:10:18,152 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2353, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2683, PETRI_PLACES=180, PETRI_TRANSITIONS=216} [2024-06-03 22:10:18,153 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 138 predicate places. [2024-06-03 22:10:18,153 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 216 transitions, 2683 flow [2024-06-03 22:10:18,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:10:18,153 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:10:18,153 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:10:18,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-03 22:10:18,153 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:10:18,154 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:10:18,154 INFO L85 PathProgramCache]: Analyzing trace with hash 399667223, now seen corresponding path program 4 times [2024-06-03 22:10:18,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:10:18,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117936241] [2024-06-03 22:10:18,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:10:18,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:10:18,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:10:27,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:10:27,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:10:27,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117936241] [2024-06-03 22:10:27,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117936241] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:10:27,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:10:27,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:10:27,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470381273] [2024-06-03 22:10:27,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:10:27,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:10:27,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:10:27,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:10:27,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:10:27,512 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:10:27,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 216 transitions, 2683 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:10:27,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:10:27,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:10:27,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:10:29,188 INFO L124 PetriNetUnfolderBase]: 2915/4484 cut-off events. [2024-06-03 22:10:29,188 INFO L125 PetriNetUnfolderBase]: For 194683/194713 co-relation queries the response was YES. [2024-06-03 22:10:29,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31043 conditions, 4484 events. 2915/4484 cut-off events. For 194683/194713 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 23768 event pairs, 677 based on Foata normal form. 40/4517 useless extension candidates. Maximal degree in co-relation 30961. Up to 3897 conditions per place. [2024-06-03 22:10:29,222 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 180 selfloop transitions, 78 changer transitions 0/261 dead transitions. [2024-06-03 22:10:29,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 261 transitions, 3398 flow [2024-06-03 22:10:29,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:10:29,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:10:29,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 172 transitions. [2024-06-03 22:10:29,225 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4195121951219512 [2024-06-03 22:10:29,225 INFO L175 Difference]: Start difference. First operand has 180 places, 216 transitions, 2683 flow. Second operand 10 states and 172 transitions. [2024-06-03 22:10:29,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 261 transitions, 3398 flow [2024-06-03 22:10:29,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 261 transitions, 3294 flow, removed 20 selfloop flow, removed 4 redundant places. [2024-06-03 22:10:29,400 INFO L231 Difference]: Finished difference. Result has 186 places, 217 transitions, 2796 flow [2024-06-03 22:10:29,400 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2581, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2796, PETRI_PLACES=186, PETRI_TRANSITIONS=217} [2024-06-03 22:10:29,401 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 144 predicate places. [2024-06-03 22:10:29,401 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 217 transitions, 2796 flow [2024-06-03 22:10:29,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:10:29,401 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:10:29,401 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:10:29,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-03 22:10:29,402 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:10:29,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:10:29,402 INFO L85 PathProgramCache]: Analyzing trace with hash 349394485, now seen corresponding path program 5 times [2024-06-03 22:10:29,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:10:29,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702946021] [2024-06-03 22:10:29,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:10:29,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:10:29,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:10:37,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:10:37,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:10:37,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702946021] [2024-06-03 22:10:37,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702946021] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:10:37,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:10:37,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:10:37,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007532361] [2024-06-03 22:10:37,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:10:37,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:10:37,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:10:37,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:10:37,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:10:37,466 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:10:37,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 217 transitions, 2796 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:10:37,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:10:37,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:10:37,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:10:39,314 INFO L124 PetriNetUnfolderBase]: 3145/4854 cut-off events. [2024-06-03 22:10:39,314 INFO L125 PetriNetUnfolderBase]: For 218221/218251 co-relation queries the response was YES. [2024-06-03 22:10:39,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34279 conditions, 4854 events. 3145/4854 cut-off events. For 218221/218251 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 26308 event pairs, 725 based on Foata normal form. 36/4883 useless extension candidates. Maximal degree in co-relation 34195. Up to 4066 conditions per place. [2024-06-03 22:10:39,352 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 202 selfloop transitions, 72 changer transitions 0/277 dead transitions. [2024-06-03 22:10:39,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 277 transitions, 3844 flow [2024-06-03 22:10:39,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:10:39,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:10:39,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 185 transitions. [2024-06-03 22:10:39,356 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41019955654101997 [2024-06-03 22:10:39,356 INFO L175 Difference]: Start difference. First operand has 186 places, 217 transitions, 2796 flow. Second operand 11 states and 185 transitions. [2024-06-03 22:10:39,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 277 transitions, 3844 flow [2024-06-03 22:10:39,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 277 transitions, 3662 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-06-03 22:10:39,545 INFO L231 Difference]: Finished difference. Result has 191 places, 225 transitions, 2997 flow [2024-06-03 22:10:39,546 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2620, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2997, PETRI_PLACES=191, PETRI_TRANSITIONS=225} [2024-06-03 22:10:39,546 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 149 predicate places. [2024-06-03 22:10:39,546 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 225 transitions, 2997 flow [2024-06-03 22:10:39,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:10:39,546 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:10:39,546 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:10:39,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-03 22:10:39,547 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:10:39,547 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:10:39,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1125331719, now seen corresponding path program 6 times [2024-06-03 22:10:39,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:10:39,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179973029] [2024-06-03 22:10:39,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:10:39,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:10:39,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:10:48,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:10:48,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:10:48,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179973029] [2024-06-03 22:10:48,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179973029] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:10:48,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:10:48,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:10:48,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099282045] [2024-06-03 22:10:48,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:10:48,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:10:48,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:10:48,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:10:48,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:10:48,871 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:10:48,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 225 transitions, 2997 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:10:48,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:10:48,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:10:48,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:10:50,763 INFO L124 PetriNetUnfolderBase]: 3170/4901 cut-off events. [2024-06-03 22:10:50,763 INFO L125 PetriNetUnfolderBase]: For 225176/225206 co-relation queries the response was YES. [2024-06-03 22:10:50,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34581 conditions, 4901 events. 3170/4901 cut-off events. For 225176/225206 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 26719 event pairs, 731 based on Foata normal form. 40/4934 useless extension candidates. Maximal degree in co-relation 34494. Up to 4339 conditions per place. [2024-06-03 22:10:50,806 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 188 selfloop transitions, 79 changer transitions 0/270 dead transitions. [2024-06-03 22:10:50,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 270 transitions, 3732 flow [2024-06-03 22:10:50,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:10:50,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:10:50,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 171 transitions. [2024-06-03 22:10:50,810 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4170731707317073 [2024-06-03 22:10:50,810 INFO L175 Difference]: Start difference. First operand has 191 places, 225 transitions, 2997 flow. Second operand 10 states and 171 transitions. [2024-06-03 22:10:50,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 270 transitions, 3732 flow [2024-06-03 22:10:51,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 270 transitions, 3611 flow, removed 29 selfloop flow, removed 7 redundant places. [2024-06-03 22:10:51,039 INFO L231 Difference]: Finished difference. Result has 194 places, 226 transitions, 3095 flow [2024-06-03 22:10:51,039 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2880, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3095, PETRI_PLACES=194, PETRI_TRANSITIONS=226} [2024-06-03 22:10:51,039 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 152 predicate places. [2024-06-03 22:10:51,040 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 226 transitions, 3095 flow [2024-06-03 22:10:51,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:10:51,040 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:10:51,040 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:10:51,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-03 22:10:51,040 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:10:51,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:10:51,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1945639449, now seen corresponding path program 7 times [2024-06-03 22:10:51,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:10:51,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724167503] [2024-06-03 22:10:51,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:10:51,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:10:51,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:11:00,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:11:00,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:11:00,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724167503] [2024-06-03 22:11:00,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724167503] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:11:00,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:11:00,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:11:00,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689176184] [2024-06-03 22:11:00,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:11:00,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:11:00,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:11:00,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:11:00,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:11:00,374 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:11:00,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 226 transitions, 3095 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:11:00,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:11:00,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:11:00,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:11:02,500 INFO L124 PetriNetUnfolderBase]: 3484/5431 cut-off events. [2024-06-03 22:11:02,501 INFO L125 PetriNetUnfolderBase]: For 246837/246867 co-relation queries the response was YES. [2024-06-03 22:11:02,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38064 conditions, 5431 events. 3484/5431 cut-off events. For 246837/246867 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 30587 event pairs, 771 based on Foata normal form. 36/5460 useless extension candidates. Maximal degree in co-relation 37976. Up to 3545 conditions per place. [2024-06-03 22:11:02,546 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 195 selfloop transitions, 84 changer transitions 0/282 dead transitions. [2024-06-03 22:11:02,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 282 transitions, 4186 flow [2024-06-03 22:11:02,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:11:02,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:11:02,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 169 transitions. [2024-06-03 22:11:02,549 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4121951219512195 [2024-06-03 22:11:02,549 INFO L175 Difference]: Start difference. First operand has 194 places, 226 transitions, 3095 flow. Second operand 10 states and 169 transitions. [2024-06-03 22:11:02,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 282 transitions, 4186 flow [2024-06-03 22:11:02,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 282 transitions, 4004 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-06-03 22:11:02,782 INFO L231 Difference]: Finished difference. Result has 197 places, 233 transitions, 3349 flow [2024-06-03 22:11:02,782 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2915, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3349, PETRI_PLACES=197, PETRI_TRANSITIONS=233} [2024-06-03 22:11:02,782 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 155 predicate places. [2024-06-03 22:11:02,783 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 233 transitions, 3349 flow [2024-06-03 22:11:02,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:11:02,783 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:11:02,783 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:11:02,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-03 22:11:02,783 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:11:02,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:11:02,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1871998500, now seen corresponding path program 2 times [2024-06-03 22:11:02,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:11:02,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146268338] [2024-06-03 22:11:02,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:11:02,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:11:02,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:11:15,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:11:15,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:11:15,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146268338] [2024-06-03 22:11:15,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146268338] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:11:15,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:11:15,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:11:15,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731064910] [2024-06-03 22:11:15,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:11:15,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:11:15,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:11:15,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:11:15,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:11:16,040 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:11:16,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 233 transitions, 3349 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:11:16,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:11:16,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:11:16,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:11:17,918 INFO L124 PetriNetUnfolderBase]: 3478/5425 cut-off events. [2024-06-03 22:11:17,918 INFO L125 PetriNetUnfolderBase]: For 245317/245317 co-relation queries the response was YES. [2024-06-03 22:11:17,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38468 conditions, 5425 events. 3478/5425 cut-off events. For 245317/245317 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 30674 event pairs, 896 based on Foata normal form. 2/5424 useless extension candidates. Maximal degree in co-relation 38378. Up to 5385 conditions per place. [2024-06-03 22:11:17,962 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 228 selfloop transitions, 14 changer transitions 0/245 dead transitions. [2024-06-03 22:11:17,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 245 transitions, 3865 flow [2024-06-03 22:11:17,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:11:17,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:11:17,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 102 transitions. [2024-06-03 22:11:17,965 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3554006968641115 [2024-06-03 22:11:17,965 INFO L175 Difference]: Start difference. First operand has 197 places, 233 transitions, 3349 flow. Second operand 7 states and 102 transitions. [2024-06-03 22:11:17,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 245 transitions, 3865 flow [2024-06-03 22:11:18,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 245 transitions, 3681 flow, removed 28 selfloop flow, removed 7 redundant places. [2024-06-03 22:11:18,261 INFO L231 Difference]: Finished difference. Result has 197 places, 233 transitions, 3199 flow [2024-06-03 22:11:18,261 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3165, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3199, PETRI_PLACES=197, PETRI_TRANSITIONS=233} [2024-06-03 22:11:18,262 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 155 predicate places. [2024-06-03 22:11:18,262 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 233 transitions, 3199 flow [2024-06-03 22:11:18,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:11:18,262 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:11:18,262 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:11:18,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-03 22:11:18,263 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:11:18,263 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:11:18,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1872414582, now seen corresponding path program 3 times [2024-06-03 22:11:18,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:11:18,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533652497] [2024-06-03 22:11:18,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:11:18,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:11:18,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:11:31,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:11:31,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:11:31,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533652497] [2024-06-03 22:11:31,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533652497] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:11:31,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:11:31,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:11:31,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003884015] [2024-06-03 22:11:31,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:11:31,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:11:31,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:11:31,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:11:31,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:11:31,515 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:11:31,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 233 transitions, 3199 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:11:31,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:11:31,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:11:31,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:11:33,405 INFO L124 PetriNetUnfolderBase]: 3472/5418 cut-off events. [2024-06-03 22:11:33,405 INFO L125 PetriNetUnfolderBase]: For 248200/248224 co-relation queries the response was YES. [2024-06-03 22:11:33,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37814 conditions, 5418 events. 3472/5418 cut-off events. For 248200/248224 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 30619 event pairs, 898 based on Foata normal form. 14/5418 useless extension candidates. Maximal degree in co-relation 37723. Up to 5267 conditions per place. [2024-06-03 22:11:33,448 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 202 selfloop transitions, 40 changer transitions 0/245 dead transitions. [2024-06-03 22:11:33,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 245 transitions, 3719 flow [2024-06-03 22:11:33,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:11:33,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:11:33,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 107 transitions. [2024-06-03 22:11:33,449 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37282229965156793 [2024-06-03 22:11:33,450 INFO L175 Difference]: Start difference. First operand has 197 places, 233 transitions, 3199 flow. Second operand 7 states and 107 transitions. [2024-06-03 22:11:33,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 245 transitions, 3719 flow [2024-06-03 22:11:33,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 245 transitions, 3636 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-06-03 22:11:33,682 INFO L231 Difference]: Finished difference. Result has 196 places, 233 transitions, 3202 flow [2024-06-03 22:11:33,682 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3116, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3202, PETRI_PLACES=196, PETRI_TRANSITIONS=233} [2024-06-03 22:11:33,682 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 154 predicate places. [2024-06-03 22:11:33,682 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 233 transitions, 3202 flow [2024-06-03 22:11:33,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:11:33,683 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:11:33,683 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:11:33,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-03 22:11:33,683 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:11:33,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:11:33,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1872414210, now seen corresponding path program 3 times [2024-06-03 22:11:33,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:11:33,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941952299] [2024-06-03 22:11:33,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:11:33,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:11:33,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:11:46,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:11:46,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:11:46,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941952299] [2024-06-03 22:11:46,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941952299] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:11:46,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:11:46,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:11:46,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835800738] [2024-06-03 22:11:46,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:11:46,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:11:46,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:11:46,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:11:46,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:11:46,809 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:11:46,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 233 transitions, 3202 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:11:46,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:11:46,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:11:46,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:11:48,713 INFO L124 PetriNetUnfolderBase]: 3466/5405 cut-off events. [2024-06-03 22:11:48,713 INFO L125 PetriNetUnfolderBase]: For 254370/254378 co-relation queries the response was YES. [2024-06-03 22:11:48,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37910 conditions, 5405 events. 3466/5405 cut-off events. For 254370/254378 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 30522 event pairs, 866 based on Foata normal form. 10/5412 useless extension candidates. Maximal degree in co-relation 37820. Up to 5329 conditions per place. [2024-06-03 22:11:48,756 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 223 selfloop transitions, 30 changer transitions 0/256 dead transitions. [2024-06-03 22:11:48,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 256 transitions, 3776 flow [2024-06-03 22:11:48,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:11:48,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:11:48,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 135 transitions. [2024-06-03 22:11:48,759 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36585365853658536 [2024-06-03 22:11:48,759 INFO L175 Difference]: Start difference. First operand has 196 places, 233 transitions, 3202 flow. Second operand 9 states and 135 transitions. [2024-06-03 22:11:48,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 256 transitions, 3776 flow [2024-06-03 22:11:48,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 256 transitions, 3646 flow, removed 14 selfloop flow, removed 6 redundant places. [2024-06-03 22:11:48,981 INFO L231 Difference]: Finished difference. Result has 199 places, 233 transitions, 3138 flow [2024-06-03 22:11:48,981 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3072, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3138, PETRI_PLACES=199, PETRI_TRANSITIONS=233} [2024-06-03 22:11:48,981 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 157 predicate places. [2024-06-03 22:11:48,981 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 233 transitions, 3138 flow [2024-06-03 22:11:48,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:11:48,982 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:11:48,982 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:11:48,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-03 22:11:48,982 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:11:48,982 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:11:48,982 INFO L85 PathProgramCache]: Analyzing trace with hash -2049481374, now seen corresponding path program 1 times [2024-06-03 22:11:48,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:11:48,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840527703] [2024-06-03 22:11:48,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:11:48,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:11:49,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:11:58,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:11:58,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:11:58,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840527703] [2024-06-03 22:11:58,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840527703] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:11:58,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:11:58,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:11:58,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024137181] [2024-06-03 22:11:58,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:11:58,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:11:58,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:11:58,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:11:58,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:11:58,918 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:11:58,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 233 transitions, 3138 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:11:58,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:11:58,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:11:58,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:12:00,744 INFO L124 PetriNetUnfolderBase]: 3340/5289 cut-off events. [2024-06-03 22:12:00,744 INFO L125 PetriNetUnfolderBase]: For 265268/265269 co-relation queries the response was YES. [2024-06-03 22:12:00,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37448 conditions, 5289 events. 3340/5289 cut-off events. For 265268/265269 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 30535 event pairs, 866 based on Foata normal form. 3/5287 useless extension candidates. Maximal degree in co-relation 37357. Up to 5131 conditions per place. [2024-06-03 22:12:00,791 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 229 selfloop transitions, 14 changer transitions 0/253 dead transitions. [2024-06-03 22:12:00,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 253 transitions, 3724 flow [2024-06-03 22:12:00,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:12:00,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:12:00,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions. [2024-06-03 22:12:00,792 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39372822299651566 [2024-06-03 22:12:00,792 INFO L175 Difference]: Start difference. First operand has 199 places, 233 transitions, 3138 flow. Second operand 7 states and 113 transitions. [2024-06-03 22:12:00,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 253 transitions, 3724 flow [2024-06-03 22:12:01,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 253 transitions, 3619 flow, removed 7 selfloop flow, removed 9 redundant places. [2024-06-03 22:12:01,096 INFO L231 Difference]: Finished difference. Result has 197 places, 236 transitions, 3123 flow [2024-06-03 22:12:01,096 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3033, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3123, PETRI_PLACES=197, PETRI_TRANSITIONS=236} [2024-06-03 22:12:01,096 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 155 predicate places. [2024-06-03 22:12:01,096 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 236 transitions, 3123 flow [2024-06-03 22:12:01,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:12:01,097 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:12:01,097 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:12:01,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-03 22:12:01,097 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:12:01,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:12:01,097 INFO L85 PathProgramCache]: Analyzing trace with hash -468645074, now seen corresponding path program 2 times [2024-06-03 22:12:01,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:12:01,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314285024] [2024-06-03 22:12:01,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:12:01,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:12:01,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:12:11,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:12:11,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:12:11,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314285024] [2024-06-03 22:12:11,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314285024] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:12:11,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:12:11,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:12:11,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487640522] [2024-06-03 22:12:11,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:12:11,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:12:11,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:12:11,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:12:11,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:12:11,474 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:12:11,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 236 transitions, 3123 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:12:11,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:12:11,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:12:11,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:12:13,177 INFO L124 PetriNetUnfolderBase]: 3349/5301 cut-off events. [2024-06-03 22:12:13,177 INFO L125 PetriNetUnfolderBase]: For 273322/273323 co-relation queries the response was YES. [2024-06-03 22:12:13,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37851 conditions, 5301 events. 3349/5301 cut-off events. For 273322/273323 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 30573 event pairs, 854 based on Foata normal form. 4/5299 useless extension candidates. Maximal degree in co-relation 37760. Up to 5098 conditions per place. [2024-06-03 22:12:13,224 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 222 selfloop transitions, 28 changer transitions 0/260 dead transitions. [2024-06-03 22:12:13,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 260 transitions, 3873 flow [2024-06-03 22:12:13,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:12:13,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:12:13,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 118 transitions. [2024-06-03 22:12:13,226 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41114982578397213 [2024-06-03 22:12:13,226 INFO L175 Difference]: Start difference. First operand has 197 places, 236 transitions, 3123 flow. Second operand 7 states and 118 transitions. [2024-06-03 22:12:13,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 260 transitions, 3873 flow [2024-06-03 22:12:13,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 260 transitions, 3807 flow, removed 21 selfloop flow, removed 5 redundant places. [2024-06-03 22:12:13,488 INFO L231 Difference]: Finished difference. Result has 199 places, 242 transitions, 3237 flow [2024-06-03 22:12:13,488 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3057, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3237, PETRI_PLACES=199, PETRI_TRANSITIONS=242} [2024-06-03 22:12:13,489 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 157 predicate places. [2024-06-03 22:12:13,489 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 242 transitions, 3237 flow [2024-06-03 22:12:13,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:12:13,489 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:12:13,489 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:12:13,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-03 22:12:13,489 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:12:13,490 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:12:13,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1525222854, now seen corresponding path program 3 times [2024-06-03 22:12:13,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:12:13,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948257215] [2024-06-03 22:12:13,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:12:13,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:12:13,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:12:23,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:12:23,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:12:23,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948257215] [2024-06-03 22:12:23,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948257215] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:12:23,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:12:23,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:12:23,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373719600] [2024-06-03 22:12:23,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:12:23,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:12:23,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:12:23,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:12:23,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:12:23,859 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:12:23,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 242 transitions, 3237 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:12:23,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:12:23,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:12:23,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:12:25,633 INFO L124 PetriNetUnfolderBase]: 3332/5280 cut-off events. [2024-06-03 22:12:25,633 INFO L125 PetriNetUnfolderBase]: For 281521/281523 co-relation queries the response was YES. [2024-06-03 22:12:25,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37974 conditions, 5280 events. 3332/5280 cut-off events. For 281521/281523 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 30498 event pairs, 854 based on Foata normal form. 3/5278 useless extension candidates. Maximal degree in co-relation 37882. Up to 5123 conditions per place. [2024-06-03 22:12:25,677 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 229 selfloop transitions, 16 changer transitions 0/255 dead transitions. [2024-06-03 22:12:25,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 255 transitions, 3761 flow [2024-06-03 22:12:25,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:12:25,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:12:25,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 109 transitions. [2024-06-03 22:12:25,688 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3797909407665505 [2024-06-03 22:12:25,688 INFO L175 Difference]: Start difference. First operand has 199 places, 242 transitions, 3237 flow. Second operand 7 states and 109 transitions. [2024-06-03 22:12:25,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 255 transitions, 3761 flow [2024-06-03 22:12:25,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 255 transitions, 3655 flow, removed 44 selfloop flow, removed 3 redundant places. [2024-06-03 22:12:25,949 INFO L231 Difference]: Finished difference. Result has 203 places, 242 transitions, 3169 flow [2024-06-03 22:12:25,949 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3131, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3169, PETRI_PLACES=203, PETRI_TRANSITIONS=242} [2024-06-03 22:12:25,950 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 161 predicate places. [2024-06-03 22:12:25,950 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 242 transitions, 3169 flow [2024-06-03 22:12:25,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:12:25,950 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:12:25,950 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:12:25,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-03 22:12:25,951 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:12:25,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:12:25,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1871983620, now seen corresponding path program 1 times [2024-06-03 22:12:25,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:12:25,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080536302] [2024-06-03 22:12:25,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:12:25,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:12:26,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:12:38,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:12:38,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:12:38,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080536302] [2024-06-03 22:12:38,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080536302] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:12:38,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:12:38,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:12:38,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704760801] [2024-06-03 22:12:38,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:12:38,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:12:38,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:12:38,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:12:38,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:12:38,581 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:12:38,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 242 transitions, 3169 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:12:38,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:12:38,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:12:38,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:12:40,388 INFO L124 PetriNetUnfolderBase]: 3482/5432 cut-off events. [2024-06-03 22:12:40,389 INFO L125 PetriNetUnfolderBase]: For 285842/285842 co-relation queries the response was YES. [2024-06-03 22:12:40,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38815 conditions, 5432 events. 3482/5432 cut-off events. For 285842/285842 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 30600 event pairs, 894 based on Foata normal form. 2/5431 useless extension candidates. Maximal degree in co-relation 38721. Up to 5394 conditions per place. [2024-06-03 22:12:40,438 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 240 selfloop transitions, 13 changer transitions 0/256 dead transitions. [2024-06-03 22:12:40,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 256 transitions, 3741 flow [2024-06-03 22:12:40,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:12:40,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:12:40,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2024-06-03 22:12:40,440 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3519163763066202 [2024-06-03 22:12:40,440 INFO L175 Difference]: Start difference. First operand has 203 places, 242 transitions, 3169 flow. Second operand 7 states and 101 transitions. [2024-06-03 22:12:40,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 256 transitions, 3741 flow [2024-06-03 22:12:40,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 256 transitions, 3692 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-03 22:12:40,762 INFO L231 Difference]: Finished difference. Result has 204 places, 244 transitions, 3189 flow [2024-06-03 22:12:40,763 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3120, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3189, PETRI_PLACES=204, PETRI_TRANSITIONS=244} [2024-06-03 22:12:40,763 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 162 predicate places. [2024-06-03 22:12:40,763 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 244 transitions, 3189 flow [2024-06-03 22:12:40,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:12:40,763 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:12:40,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-03 22:12:40,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-03 22:12:40,764 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:12:40,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:12:40,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1197138808, now seen corresponding path program 1 times [2024-06-03 22:12:40,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:12:40,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078180281] [2024-06-03 22:12:40,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:12:40,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:12:40,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:12:50,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:12:50,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:12:50,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078180281] [2024-06-03 22:12:50,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078180281] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:12:50,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:12:50,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:12:50,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395303145] [2024-06-03 22:12:50,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:12:50,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:12:50,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:12:50,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:12:50,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:12:50,746 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:12:50,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 244 transitions, 3189 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:12:50,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:12:50,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:12:50,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:12:52,802 INFO L124 PetriNetUnfolderBase]: 3523/5501 cut-off events. [2024-06-03 22:12:52,802 INFO L125 PetriNetUnfolderBase]: For 308637/308643 co-relation queries the response was YES. [2024-06-03 22:12:52,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39568 conditions, 5501 events. 3523/5501 cut-off events. For 308637/308643 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 31102 event pairs, 706 based on Foata normal form. 18/5516 useless extension candidates. Maximal degree in co-relation 39473. Up to 5163 conditions per place. [2024-06-03 22:12:52,852 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 244 selfloop transitions, 36 changer transitions 0/283 dead transitions. [2024-06-03 22:12:52,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 283 transitions, 3925 flow [2024-06-03 22:12:52,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:12:52,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:12:52,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 144 transitions. [2024-06-03 22:12:52,854 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3902439024390244 [2024-06-03 22:12:52,854 INFO L175 Difference]: Start difference. First operand has 204 places, 244 transitions, 3189 flow. Second operand 9 states and 144 transitions. [2024-06-03 22:12:52,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 283 transitions, 3925 flow [2024-06-03 22:12:53,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 283 transitions, 3872 flow, removed 15 selfloop flow, removed 5 redundant places. [2024-06-03 22:12:53,150 INFO L231 Difference]: Finished difference. Result has 209 places, 248 transitions, 3296 flow [2024-06-03 22:12:53,151 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3136, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3296, PETRI_PLACES=209, PETRI_TRANSITIONS=248} [2024-06-03 22:12:53,151 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 167 predicate places. [2024-06-03 22:12:53,151 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 248 transitions, 3296 flow [2024-06-03 22:12:53,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:12:53,152 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:12:53,152 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:12:53,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-03 22:12:53,152 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:12:53,168 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:12:53,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1255346578, now seen corresponding path program 2 times [2024-06-03 22:12:53,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:12:53,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843902692] [2024-06-03 22:12:53,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:12:53,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:12:53,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:13:03,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:13:03,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:13:03,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843902692] [2024-06-03 22:13:03,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843902692] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:13:03,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:13:03,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:13:03,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712768651] [2024-06-03 22:13:03,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:13:03,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:13:03,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:13:03,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:13:03,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:13:03,383 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:13:03,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 248 transitions, 3296 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:13:03,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:13:03,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:13:03,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:13:05,407 INFO L124 PetriNetUnfolderBase]: 3564/5570 cut-off events. [2024-06-03 22:13:05,407 INFO L125 PetriNetUnfolderBase]: For 321835/321843 co-relation queries the response was YES. [2024-06-03 22:13:05,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40523 conditions, 5570 events. 3564/5570 cut-off events. For 321835/321843 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 31769 event pairs, 852 based on Foata normal form. 20/5587 useless extension candidates. Maximal degree in co-relation 40426. Up to 5292 conditions per place. [2024-06-03 22:13:05,463 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 251 selfloop transitions, 40 changer transitions 0/294 dead transitions. [2024-06-03 22:13:05,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 294 transitions, 4076 flow [2024-06-03 22:13:05,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:13:05,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:13:05,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 162 transitions. [2024-06-03 22:13:05,465 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3951219512195122 [2024-06-03 22:13:05,466 INFO L175 Difference]: Start difference. First operand has 209 places, 248 transitions, 3296 flow. Second operand 10 states and 162 transitions. [2024-06-03 22:13:05,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 294 transitions, 4076 flow [2024-06-03 22:13:05,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 294 transitions, 3957 flow, removed 26 selfloop flow, removed 6 redundant places. [2024-06-03 22:13:05,883 INFO L231 Difference]: Finished difference. Result has 215 places, 251 transitions, 3344 flow [2024-06-03 22:13:05,884 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3177, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3344, PETRI_PLACES=215, PETRI_TRANSITIONS=251} [2024-06-03 22:13:05,885 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 173 predicate places. [2024-06-03 22:13:05,885 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 251 transitions, 3344 flow [2024-06-03 22:13:05,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:13:05,885 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:13:05,885 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:13:05,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-03 22:13:05,886 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:13:05,886 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:13:05,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1255231258, now seen corresponding path program 3 times [2024-06-03 22:13:05,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:13:05,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874475574] [2024-06-03 22:13:05,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:13:05,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:13:05,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:13:16,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:13:16,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:13:16,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874475574] [2024-06-03 22:13:16,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874475574] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:13:16,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:13:16,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:13:16,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033652924] [2024-06-03 22:13:16,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:13:16,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:13:16,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:13:16,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:13:16,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:13:16,263 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:13:16,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 251 transitions, 3344 flow. Second operand has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:13:16,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:13:16,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:13:16,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:13:18,418 INFO L124 PetriNetUnfolderBase]: 3605/5643 cut-off events. [2024-06-03 22:13:18,418 INFO L125 PetriNetUnfolderBase]: For 339341/339347 co-relation queries the response was YES. [2024-06-03 22:13:18,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41045 conditions, 5643 events. 3605/5643 cut-off events. For 339341/339347 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 32409 event pairs, 840 based on Foata normal form. 18/5658 useless extension candidates. Maximal degree in co-relation 40945. Up to 5148 conditions per place. [2024-06-03 22:13:18,465 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 232 selfloop transitions, 57 changer transitions 0/292 dead transitions. [2024-06-03 22:13:18,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 292 transitions, 4135 flow [2024-06-03 22:13:18,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:13:18,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:13:18,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 148 transitions. [2024-06-03 22:13:18,468 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4010840108401084 [2024-06-03 22:13:18,468 INFO L175 Difference]: Start difference. First operand has 215 places, 251 transitions, 3344 flow. Second operand 9 states and 148 transitions. [2024-06-03 22:13:18,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 292 transitions, 4135 flow [2024-06-03 22:13:18,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 292 transitions, 4023 flow, removed 20 selfloop flow, removed 6 redundant places. [2024-06-03 22:13:18,885 INFO L231 Difference]: Finished difference. Result has 219 places, 257 transitions, 3481 flow [2024-06-03 22:13:18,885 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3232, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3481, PETRI_PLACES=219, PETRI_TRANSITIONS=257} [2024-06-03 22:13:18,885 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 177 predicate places. [2024-06-03 22:13:18,885 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 257 transitions, 3481 flow [2024-06-03 22:13:18,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:13:18,886 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:13:18,886 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:13:18,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-03 22:13:18,886 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:13:18,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:13:18,889 INFO L85 PathProgramCache]: Analyzing trace with hash -316782640, now seen corresponding path program 1 times [2024-06-03 22:13:18,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:13:18,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221215654] [2024-06-03 22:13:18,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:13:18,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:13:18,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:13:32,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:13:32,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:13:32,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221215654] [2024-06-03 22:13:32,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221215654] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:13:32,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:13:32,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:13:32,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755179819] [2024-06-03 22:13:32,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:13:32,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:13:32,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:13:32,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:13:32,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:13:33,083 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:13:33,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 257 transitions, 3481 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:13:33,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:13:33,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:13:33,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:13:35,283 INFO L124 PetriNetUnfolderBase]: 3625/5669 cut-off events. [2024-06-03 22:13:35,284 INFO L125 PetriNetUnfolderBase]: For 342858/342866 co-relation queries the response was YES. [2024-06-03 22:13:35,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41567 conditions, 5669 events. 3625/5669 cut-off events. For 342858/342866 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 32468 event pairs, 886 based on Foata normal form. 12/5678 useless extension candidates. Maximal degree in co-relation 41465. Up to 5421 conditions per place. [2024-06-03 22:13:35,337 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 234 selfloop transitions, 57 changer transitions 0/294 dead transitions. [2024-06-03 22:13:35,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 294 transitions, 4349 flow [2024-06-03 22:13:35,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:13:35,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:13:35,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 137 transitions. [2024-06-03 22:13:35,342 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4176829268292683 [2024-06-03 22:13:35,342 INFO L175 Difference]: Start difference. First operand has 219 places, 257 transitions, 3481 flow. Second operand 8 states and 137 transitions. [2024-06-03 22:13:35,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 294 transitions, 4349 flow [2024-06-03 22:13:35,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 294 transitions, 4156 flow, removed 49 selfloop flow, removed 6 redundant places. [2024-06-03 22:13:35,764 INFO L231 Difference]: Finished difference. Result has 221 places, 263 transitions, 3502 flow [2024-06-03 22:13:35,764 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3288, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3502, PETRI_PLACES=221, PETRI_TRANSITIONS=263} [2024-06-03 22:13:35,764 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 179 predicate places. [2024-06-03 22:13:35,765 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 263 transitions, 3502 flow [2024-06-03 22:13:35,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:13:35,765 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:13:35,765 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:13:35,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-03 22:13:35,765 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:13:35,766 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:13:35,766 INFO L85 PathProgramCache]: Analyzing trace with hash -313238503, now seen corresponding path program 1 times [2024-06-03 22:13:35,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:13:35,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277802208] [2024-06-03 22:13:35,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:13:35,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:13:35,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:13:46,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:13:46,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:13:46,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277802208] [2024-06-03 22:13:46,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277802208] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:13:46,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:13:46,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:13:46,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585668730] [2024-06-03 22:13:46,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:13:46,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:13:46,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:13:46,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:13:46,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:13:46,184 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:13:46,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 263 transitions, 3502 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:13:46,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:13:46,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:13:46,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:13:48,153 INFO L124 PetriNetUnfolderBase]: 3638/5687 cut-off events. [2024-06-03 22:13:48,153 INFO L125 PetriNetUnfolderBase]: For 348507/348515 co-relation queries the response was YES. [2024-06-03 22:13:48,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41815 conditions, 5687 events. 3638/5687 cut-off events. For 348507/348515 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 32647 event pairs, 891 based on Foata normal form. 9/5693 useless extension candidates. Maximal degree in co-relation 41713. Up to 5614 conditions per place. [2024-06-03 22:13:48,204 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 261 selfloop transitions, 26 changer transitions 0/290 dead transitions. [2024-06-03 22:13:48,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 290 transitions, 4336 flow [2024-06-03 22:13:48,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:13:48,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:13:48,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions. [2024-06-03 22:13:48,206 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39372822299651566 [2024-06-03 22:13:48,206 INFO L175 Difference]: Start difference. First operand has 221 places, 263 transitions, 3502 flow. Second operand 7 states and 113 transitions. [2024-06-03 22:13:48,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 290 transitions, 4336 flow [2024-06-03 22:13:48,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 290 transitions, 4247 flow, removed 25 selfloop flow, removed 4 redundant places. [2024-06-03 22:13:48,645 INFO L231 Difference]: Finished difference. Result has 224 places, 269 transitions, 3565 flow [2024-06-03 22:13:48,645 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3413, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3565, PETRI_PLACES=224, PETRI_TRANSITIONS=269} [2024-06-03 22:13:48,646 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 182 predicate places. [2024-06-03 22:13:48,646 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 269 transitions, 3565 flow [2024-06-03 22:13:48,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:13:48,646 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:13:48,646 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:13:48,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-03 22:13:48,646 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:13:48,647 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:13:48,647 INFO L85 PathProgramCache]: Analyzing trace with hash 920866563, now seen corresponding path program 2 times [2024-06-03 22:13:48,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:13:48,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50903360] [2024-06-03 22:13:48,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:13:48,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:13:48,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:13:58,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-03 22:13:58,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:13:58,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50903360] [2024-06-03 22:13:58,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50903360] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:13:58,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:13:58,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:13:58,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451826339] [2024-06-03 22:13:58,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:13:58,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:13:58,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:13:58,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:13:58,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:13:58,385 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:13:58,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 269 transitions, 3565 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:13:58,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:13:58,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:13:58,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:14:00,253 INFO L124 PetriNetUnfolderBase]: 3648/5701 cut-off events. [2024-06-03 22:14:00,253 INFO L125 PetriNetUnfolderBase]: For 359770/359778 co-relation queries the response was YES. [2024-06-03 22:14:00,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42224 conditions, 5701 events. 3648/5701 cut-off events. For 359770/359778 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 32645 event pairs, 885 based on Foata normal form. 9/5707 useless extension candidates. Maximal degree in co-relation 42120. Up to 5636 conditions per place. [2024-06-03 22:14:00,310 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 263 selfloop transitions, 28 changer transitions 0/294 dead transitions. [2024-06-03 22:14:00,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 294 transitions, 4282 flow [2024-06-03 22:14:00,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:14:00,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:14:00,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 112 transitions. [2024-06-03 22:14:00,311 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3902439024390244 [2024-06-03 22:14:00,311 INFO L175 Difference]: Start difference. First operand has 224 places, 269 transitions, 3565 flow. Second operand 7 states and 112 transitions. [2024-06-03 22:14:00,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 294 transitions, 4282 flow [2024-06-03 22:14:00,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 294 transitions, 4192 flow, removed 35 selfloop flow, removed 3 redundant places. [2024-06-03 22:14:00,756 INFO L231 Difference]: Finished difference. Result has 229 places, 276 transitions, 3644 flow [2024-06-03 22:14:00,757 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3491, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3644, PETRI_PLACES=229, PETRI_TRANSITIONS=276} [2024-06-03 22:14:00,757 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 187 predicate places. [2024-06-03 22:14:00,757 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 276 transitions, 3644 flow [2024-06-03 22:14:00,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:14:00,757 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:14:00,758 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:14:00,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-03 22:14:00,758 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:14:00,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:14:00,758 INFO L85 PathProgramCache]: Analyzing trace with hash -2067384496, now seen corresponding path program 4 times [2024-06-03 22:14:00,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:14:00,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926613331] [2024-06-03 22:14:00,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:14:00,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:14:00,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:14:10,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:14:10,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:14:10,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926613331] [2024-06-03 22:14:10,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926613331] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:14:10,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:14:10,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:14:10,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7193989] [2024-06-03 22:14:10,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:14:10,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:14:10,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:14:10,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:14:10,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:14:10,408 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:14:10,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 276 transitions, 3644 flow. Second operand has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:14:10,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:14:10,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:14:10,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:14:12,641 INFO L124 PetriNetUnfolderBase]: 3608/5639 cut-off events. [2024-06-03 22:14:12,641 INFO L125 PetriNetUnfolderBase]: For 369749/369755 co-relation queries the response was YES. [2024-06-03 22:14:12,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41114 conditions, 5639 events. 3608/5639 cut-off events. For 369749/369755 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 32251 event pairs, 808 based on Foata normal form. 30/5666 useless extension candidates. Maximal degree in co-relation 41007. Up to 5103 conditions per place. [2024-06-03 22:14:12,690 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 253 selfloop transitions, 55 changer transitions 0/311 dead transitions. [2024-06-03 22:14:12,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 311 transitions, 4368 flow [2024-06-03 22:14:12,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:14:12,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:14:12,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 148 transitions. [2024-06-03 22:14:12,693 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4010840108401084 [2024-06-03 22:14:12,693 INFO L175 Difference]: Start difference. First operand has 229 places, 276 transitions, 3644 flow. Second operand 9 states and 148 transitions. [2024-06-03 22:14:12,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 311 transitions, 4368 flow [2024-06-03 22:14:13,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 311 transitions, 4266 flow, removed 33 selfloop flow, removed 4 redundant places. [2024-06-03 22:14:13,193 INFO L231 Difference]: Finished difference. Result has 234 places, 276 transitions, 3661 flow [2024-06-03 22:14:13,193 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3542, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3661, PETRI_PLACES=234, PETRI_TRANSITIONS=276} [2024-06-03 22:14:13,194 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 192 predicate places. [2024-06-03 22:14:13,194 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 276 transitions, 3661 flow [2024-06-03 22:14:13,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:14:13,194 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:14:13,194 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:14:13,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-03 22:14:13,195 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:14:13,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:14:13,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1818026124, now seen corresponding path program 2 times [2024-06-03 22:14:13,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:14:13,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888718380] [2024-06-03 22:14:13,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:14:13,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:14:13,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:14:27,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:14:27,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:14:27,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888718380] [2024-06-03 22:14:27,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888718380] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:14:27,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:14:27,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:14:27,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753335761] [2024-06-03 22:14:27,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:14:27,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:14:27,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:14:27,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:14:27,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:14:27,552 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:14:27,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 276 transitions, 3661 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:14:27,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:14:27,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:14:27,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:14:29,822 INFO L124 PetriNetUnfolderBase]: 3660/5711 cut-off events. [2024-06-03 22:14:29,822 INFO L125 PetriNetUnfolderBase]: For 365478/365484 co-relation queries the response was YES. [2024-06-03 22:14:29,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41949 conditions, 5711 events. 3660/5711 cut-off events. For 365478/365484 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 32622 event pairs, 867 based on Foata normal form. 10/5718 useless extension candidates. Maximal degree in co-relation 41841. Up to 5426 conditions per place. [2024-06-03 22:14:29,880 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 242 selfloop transitions, 63 changer transitions 0/308 dead transitions. [2024-06-03 22:14:29,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 308 transitions, 4653 flow [2024-06-03 22:14:29,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:14:29,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:14:29,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 134 transitions. [2024-06-03 22:14:29,883 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40853658536585363 [2024-06-03 22:14:29,883 INFO L175 Difference]: Start difference. First operand has 234 places, 276 transitions, 3661 flow. Second operand 8 states and 134 transitions. [2024-06-03 22:14:29,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 308 transitions, 4653 flow [2024-06-03 22:14:30,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 308 transitions, 4521 flow, removed 18 selfloop flow, removed 6 redundant places. [2024-06-03 22:14:30,294 INFO L231 Difference]: Finished difference. Result has 236 places, 282 transitions, 3745 flow [2024-06-03 22:14:30,295 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3533, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3745, PETRI_PLACES=236, PETRI_TRANSITIONS=282} [2024-06-03 22:14:30,295 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 194 predicate places. [2024-06-03 22:14:30,295 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 282 transitions, 3745 flow [2024-06-03 22:14:30,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:14:30,296 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:14:30,296 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:14:30,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-03 22:14:30,296 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:14:30,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:14:30,296 INFO L85 PathProgramCache]: Analyzing trace with hash -307528210, now seen corresponding path program 3 times [2024-06-03 22:14:30,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:14:30,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079744797] [2024-06-03 22:14:30,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:14:30,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:14:30,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:14:44,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:14:44,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:14:44,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079744797] [2024-06-03 22:14:44,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079744797] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:14:44,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:14:44,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:14:44,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149039704] [2024-06-03 22:14:44,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:14:44,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:14:44,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:14:44,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:14:44,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:14:44,380 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:14:44,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 282 transitions, 3745 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:14:44,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:14:44,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:14:44,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:14:46,545 INFO L124 PetriNetUnfolderBase]: 3648/5695 cut-off events. [2024-06-03 22:14:46,546 INFO L125 PetriNetUnfolderBase]: For 357286/357292 co-relation queries the response was YES. [2024-06-03 22:14:46,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41473 conditions, 5695 events. 3648/5695 cut-off events. For 357286/357292 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 32555 event pairs, 865 based on Foata normal form. 10/5702 useless extension candidates. Maximal degree in co-relation 41364. Up to 5418 conditions per place. [2024-06-03 22:14:46,610 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 243 selfloop transitions, 62 changer transitions 0/308 dead transitions. [2024-06-03 22:14:46,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 308 transitions, 4549 flow [2024-06-03 22:14:46,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:14:46,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:14:46,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions. [2024-06-03 22:14:46,613 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4115853658536585 [2024-06-03 22:14:46,613 INFO L175 Difference]: Start difference. First operand has 236 places, 282 transitions, 3745 flow. Second operand 8 states and 135 transitions. [2024-06-03 22:14:46,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 308 transitions, 4549 flow [2024-06-03 22:14:47,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 308 transitions, 4420 flow, removed 28 selfloop flow, removed 4 redundant places. [2024-06-03 22:14:47,190 INFO L231 Difference]: Finished difference. Result has 240 places, 282 transitions, 3746 flow [2024-06-03 22:14:47,190 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3616, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3746, PETRI_PLACES=240, PETRI_TRANSITIONS=282} [2024-06-03 22:14:47,191 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 198 predicate places. [2024-06-03 22:14:47,191 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 282 transitions, 3746 flow [2024-06-03 22:14:47,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:14:47,191 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:14:47,191 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:14:47,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-03 22:14:47,191 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:14:47,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:14:47,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1796546653, now seen corresponding path program 3 times [2024-06-03 22:14:47,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:14:47,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160561238] [2024-06-03 22:14:47,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:14:47,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:14:47,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:14:58,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:14:58,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:14:58,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160561238] [2024-06-03 22:14:58,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160561238] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:14:58,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:14:58,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:14:58,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58742228] [2024-06-03 22:14:58,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:14:58,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:14:58,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:14:58,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:14:58,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:14:58,436 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:14:58,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 282 transitions, 3746 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:14:58,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:14:58,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:14:58,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:15:00,388 INFO L124 PetriNetUnfolderBase]: 3653/5702 cut-off events. [2024-06-03 22:15:00,388 INFO L125 PetriNetUnfolderBase]: For 363893/363917 co-relation queries the response was YES. [2024-06-03 22:15:00,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41597 conditions, 5702 events. 3653/5702 cut-off events. For 363893/363917 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 32623 event pairs, 872 based on Foata normal form. 17/5712 useless extension candidates. Maximal degree in co-relation 41487. Up to 5593 conditions per place. [2024-06-03 22:15:00,445 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 268 selfloop transitions, 42 changer transitions 0/313 dead transitions. [2024-06-03 22:15:00,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 313 transitions, 4790 flow [2024-06-03 22:15:00,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:15:00,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:15:00,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions. [2024-06-03 22:15:00,448 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39372822299651566 [2024-06-03 22:15:00,448 INFO L175 Difference]: Start difference. First operand has 240 places, 282 transitions, 3746 flow. Second operand 7 states and 113 transitions. [2024-06-03 22:15:00,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 313 transitions, 4790 flow [2024-06-03 22:15:00,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 313 transitions, 4658 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-03 22:15:00,986 INFO L231 Difference]: Finished difference. Result has 241 places, 293 transitions, 3878 flow [2024-06-03 22:15:00,986 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3614, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3878, PETRI_PLACES=241, PETRI_TRANSITIONS=293} [2024-06-03 22:15:00,987 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 199 predicate places. [2024-06-03 22:15:00,987 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 293 transitions, 3878 flow [2024-06-03 22:15:00,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:15:00,987 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:15:00,987 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:15:00,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-03 22:15:00,987 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:15:00,988 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:15:00,988 INFO L85 PathProgramCache]: Analyzing trace with hash 894299161, now seen corresponding path program 4 times [2024-06-03 22:15:00,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:15:00,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14596745] [2024-06-03 22:15:00,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:15:00,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:15:01,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:15:12,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:15:12,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:15:12,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14596745] [2024-06-03 22:15:12,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14596745] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:15:12,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:15:12,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:15:12,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288454061] [2024-06-03 22:15:12,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:15:12,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:15:12,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:15:12,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:15:12,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:15:12,086 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:15:12,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 293 transitions, 3878 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:15:12,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:15:12,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:15:12,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:15:14,113 INFO L124 PetriNetUnfolderBase]: 3684/5743 cut-off events. [2024-06-03 22:15:14,121 INFO L125 PetriNetUnfolderBase]: For 379001/379009 co-relation queries the response was YES. [2024-06-03 22:15:14,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42426 conditions, 5743 events. 3684/5743 cut-off events. For 379001/379009 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 32833 event pairs, 859 based on Foata normal form. 9/5749 useless extension candidates. Maximal degree in co-relation 42314. Up to 5600 conditions per place. [2024-06-03 22:15:14,188 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 265 selfloop transitions, 59 changer transitions 0/327 dead transitions. [2024-06-03 22:15:14,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 327 transitions, 4872 flow [2024-06-03 22:15:14,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:15:14,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:15:14,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 132 transitions. [2024-06-03 22:15:14,191 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4024390243902439 [2024-06-03 22:15:14,191 INFO L175 Difference]: Start difference. First operand has 241 places, 293 transitions, 3878 flow. Second operand 8 states and 132 transitions. [2024-06-03 22:15:14,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 327 transitions, 4872 flow [2024-06-03 22:15:14,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 327 transitions, 4746 flow, removed 55 selfloop flow, removed 2 redundant places. [2024-06-03 22:15:14,740 INFO L231 Difference]: Finished difference. Result has 248 places, 302 transitions, 4064 flow [2024-06-03 22:15:14,740 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3784, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4064, PETRI_PLACES=248, PETRI_TRANSITIONS=302} [2024-06-03 22:15:14,741 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 206 predicate places. [2024-06-03 22:15:14,741 INFO L495 AbstractCegarLoop]: Abstraction has has 248 places, 302 transitions, 4064 flow [2024-06-03 22:15:14,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:15:14,741 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:15:14,741 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:15:14,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-03 22:15:14,741 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:15:14,742 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:15:14,742 INFO L85 PathProgramCache]: Analyzing trace with hash 827466643, now seen corresponding path program 5 times [2024-06-03 22:15:14,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:15:14,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846817004] [2024-06-03 22:15:14,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:15:14,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:15:14,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:15:24,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:15:24,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:15:24,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846817004] [2024-06-03 22:15:24,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846817004] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:15:24,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:15:24,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:15:24,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682019507] [2024-06-03 22:15:24,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:15:24,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:15:24,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:15:24,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:15:24,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:15:24,978 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:15:24,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 302 transitions, 4064 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:15:24,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:15:24,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:15:24,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:15:26,945 INFO L124 PetriNetUnfolderBase]: 3681/5741 cut-off events. [2024-06-03 22:15:26,946 INFO L125 PetriNetUnfolderBase]: For 388973/388997 co-relation queries the response was YES. [2024-06-03 22:15:26,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42685 conditions, 5741 events. 3681/5741 cut-off events. For 388973/388997 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 32816 event pairs, 870 based on Foata normal form. 17/5751 useless extension candidates. Maximal degree in co-relation 42570. Up to 5676 conditions per place. [2024-06-03 22:15:27,026 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 282 selfloop transitions, 30 changer transitions 0/315 dead transitions. [2024-06-03 22:15:27,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 315 transitions, 4846 flow [2024-06-03 22:15:27,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:15:27,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:15:27,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 104 transitions. [2024-06-03 22:15:27,029 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3623693379790941 [2024-06-03 22:15:27,029 INFO L175 Difference]: Start difference. First operand has 248 places, 302 transitions, 4064 flow. Second operand 7 states and 104 transitions. [2024-06-03 22:15:27,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 315 transitions, 4846 flow [2024-06-03 22:15:27,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 315 transitions, 4722 flow, removed 27 selfloop flow, removed 4 redundant places. [2024-06-03 22:15:27,611 INFO L231 Difference]: Finished difference. Result has 251 places, 302 transitions, 4006 flow [2024-06-03 22:15:27,612 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3940, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4006, PETRI_PLACES=251, PETRI_TRANSITIONS=302} [2024-06-03 22:15:27,612 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 209 predicate places. [2024-06-03 22:15:27,612 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 302 transitions, 4006 flow [2024-06-03 22:15:27,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:15:27,613 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:15:27,613 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:15:27,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-03 22:15:27,613 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:15:27,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:15:27,613 INFO L85 PathProgramCache]: Analyzing trace with hash 2084695065, now seen corresponding path program 6 times [2024-06-03 22:15:27,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:15:27,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999700517] [2024-06-03 22:15:27,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:15:27,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:15:27,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:15:37,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:15:37,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:15:37,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999700517] [2024-06-03 22:15:37,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999700517] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:15:37,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:15:37,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:15:37,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82827840] [2024-06-03 22:15:37,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:15:37,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:15:37,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:15:37,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:15:37,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:15:37,902 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:15:37,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 302 transitions, 4006 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:15:37,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:15:37,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:15:37,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:15:39,850 INFO L124 PetriNetUnfolderBase]: 3678/5737 cut-off events. [2024-06-03 22:15:39,850 INFO L125 PetriNetUnfolderBase]: For 398437/398461 co-relation queries the response was YES. [2024-06-03 22:15:39,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42656 conditions, 5737 events. 3678/5737 cut-off events. For 398437/398461 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 32782 event pairs, 872 based on Foata normal form. 17/5747 useless extension candidates. Maximal degree in co-relation 42540. Up to 5682 conditions per place. [2024-06-03 22:15:39,909 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 289 selfloop transitions, 22 changer transitions 0/314 dead transitions. [2024-06-03 22:15:39,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 314 transitions, 4668 flow [2024-06-03 22:15:39,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:15:39,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:15:39,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 102 transitions. [2024-06-03 22:15:39,911 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3554006968641115 [2024-06-03 22:15:39,912 INFO L175 Difference]: Start difference. First operand has 251 places, 302 transitions, 4006 flow. Second operand 7 states and 102 transitions. [2024-06-03 22:15:39,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 314 transitions, 4668 flow [2024-06-03 22:15:40,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 314 transitions, 4592 flow, removed 16 selfloop flow, removed 4 redundant places. [2024-06-03 22:15:40,447 INFO L231 Difference]: Finished difference. Result has 254 places, 302 transitions, 3980 flow [2024-06-03 22:15:40,448 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3930, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3980, PETRI_PLACES=254, PETRI_TRANSITIONS=302} [2024-06-03 22:15:40,448 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 212 predicate places. [2024-06-03 22:15:40,448 INFO L495 AbstractCegarLoop]: Abstraction has has 254 places, 302 transitions, 3980 flow [2024-06-03 22:15:40,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:15:40,448 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:15:40,449 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:15:40,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-03 22:15:40,449 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:15:40,449 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:15:40,449 INFO L85 PathProgramCache]: Analyzing trace with hash 20992242, now seen corresponding path program 5 times [2024-06-03 22:15:40,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:15:40,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605761438] [2024-06-03 22:15:40,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:15:40,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:15:40,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:15:50,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:15:50,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:15:50,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605761438] [2024-06-03 22:15:50,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605761438] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:15:50,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:15:50,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:15:50,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496219632] [2024-06-03 22:15:50,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:15:50,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:15:50,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:15:50,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:15:50,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:15:50,516 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:15:50,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 302 transitions, 3980 flow. Second operand has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:15:50,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:15:50,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:15:50,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:15:52,764 INFO L124 PetriNetUnfolderBase]: 3638/5676 cut-off events. [2024-06-03 22:15:52,764 INFO L125 PetriNetUnfolderBase]: For 408767/408788 co-relation queries the response was YES. [2024-06-03 22:15:52,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41235 conditions, 5676 events. 3638/5676 cut-off events. For 408767/408788 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 32378 event pairs, 765 based on Foata normal form. 35/5697 useless extension candidates. Maximal degree in co-relation 41118. Up to 5107 conditions per place. [2024-06-03 22:15:52,828 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 264 selfloop transitions, 71 changer transitions 0/338 dead transitions. [2024-06-03 22:15:52,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 338 transitions, 4779 flow [2024-06-03 22:15:52,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:15:52,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:15:52,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions. [2024-06-03 22:15:52,833 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4092140921409214 [2024-06-03 22:15:52,833 INFO L175 Difference]: Start difference. First operand has 254 places, 302 transitions, 3980 flow. Second operand 9 states and 151 transitions. [2024-06-03 22:15:52,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 338 transitions, 4779 flow [2024-06-03 22:15:53,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 338 transitions, 4668 flow, removed 29 selfloop flow, removed 6 redundant places. [2024-06-03 22:15:53,465 INFO L231 Difference]: Finished difference. Result has 258 places, 304 transitions, 4050 flow [2024-06-03 22:15:53,465 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3869, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4050, PETRI_PLACES=258, PETRI_TRANSITIONS=304} [2024-06-03 22:15:53,465 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 216 predicate places. [2024-06-03 22:15:53,466 INFO L495 AbstractCegarLoop]: Abstraction has has 258 places, 304 transitions, 4050 flow [2024-06-03 22:15:53,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:15:53,466 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:15:53,466 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:15:53,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-03 22:15:53,466 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:15:53,466 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:15:53,467 INFO L85 PathProgramCache]: Analyzing trace with hash 20876922, now seen corresponding path program 6 times [2024-06-03 22:15:53,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:15:53,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783622816] [2024-06-03 22:15:53,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:15:53,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:15:53,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:16:02,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:16:02,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:16:02,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783622816] [2024-06-03 22:16:02,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783622816] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:16:02,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:16:02,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:16:02,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83205425] [2024-06-03 22:16:02,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:16:02,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:16:02,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:16:02,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:16:02,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:16:02,997 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:16:02,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 304 transitions, 4050 flow. Second operand has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:16:02,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:16:02,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:16:02,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:16:05,123 INFO L124 PetriNetUnfolderBase]: 3618/5644 cut-off events. [2024-06-03 22:16:05,123 INFO L125 PetriNetUnfolderBase]: For 388359/388380 co-relation queries the response was YES. [2024-06-03 22:16:05,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40671 conditions, 5644 events. 3618/5644 cut-off events. For 388359/388380 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 32196 event pairs, 751 based on Foata normal form. 23/5653 useless extension candidates. Maximal degree in co-relation 40552. Up to 5085 conditions per place. [2024-06-03 22:16:05,177 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 265 selfloop transitions, 74 changer transitions 0/342 dead transitions. [2024-06-03 22:16:05,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 342 transitions, 4891 flow [2024-06-03 22:16:05,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:16:05,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:16:05,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 150 transitions. [2024-06-03 22:16:05,180 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4065040650406504 [2024-06-03 22:16:05,180 INFO L175 Difference]: Start difference. First operand has 258 places, 304 transitions, 4050 flow. Second operand 9 states and 150 transitions. [2024-06-03 22:16:05,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 342 transitions, 4891 flow [2024-06-03 22:16:05,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 342 transitions, 4715 flow, removed 21 selfloop flow, removed 6 redundant places. [2024-06-03 22:16:05,760 INFO L231 Difference]: Finished difference. Result has 262 places, 308 transitions, 4102 flow [2024-06-03 22:16:05,760 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3874, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4102, PETRI_PLACES=262, PETRI_TRANSITIONS=308} [2024-06-03 22:16:05,761 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 220 predicate places. [2024-06-03 22:16:05,761 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 308 transitions, 4102 flow [2024-06-03 22:16:05,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:16:05,761 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:16:05,761 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:16:05,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-03 22:16:05,761 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:16:05,761 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:16:05,762 INFO L85 PathProgramCache]: Analyzing trace with hash 161367726, now seen corresponding path program 7 times [2024-06-03 22:16:05,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:16:05,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960448972] [2024-06-03 22:16:05,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:16:05,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:16:05,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:16:15,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:16:15,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:16:15,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960448972] [2024-06-03 22:16:15,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960448972] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:16:15,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:16:15,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:16:15,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869827603] [2024-06-03 22:16:15,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:16:15,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:16:15,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:16:15,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:16:15,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:16:16,022 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:16:16,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 308 transitions, 4102 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:16:16,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:16:16,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:16:16,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:16:18,139 INFO L124 PetriNetUnfolderBase]: 3598/5609 cut-off events. [2024-06-03 22:16:18,139 INFO L125 PetriNetUnfolderBase]: For 382860/382864 co-relation queries the response was YES. [2024-06-03 22:16:18,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40050 conditions, 5609 events. 3598/5609 cut-off events. For 382860/382864 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 31991 event pairs, 727 based on Foata normal form. 16/5622 useless extension candidates. Maximal degree in co-relation 39929. Up to 5130 conditions per place. [2024-06-03 22:16:18,210 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 274 selfloop transitions, 74 changer transitions 0/351 dead transitions. [2024-06-03 22:16:18,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 351 transitions, 4856 flow [2024-06-03 22:16:18,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:16:18,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:16:18,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 178 transitions. [2024-06-03 22:16:18,213 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3946784922394678 [2024-06-03 22:16:18,213 INFO L175 Difference]: Start difference. First operand has 262 places, 308 transitions, 4102 flow. Second operand 11 states and 178 transitions. [2024-06-03 22:16:18,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 351 transitions, 4856 flow [2024-06-03 22:16:18,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 351 transitions, 4434 flow, removed 62 selfloop flow, removed 8 redundant places. [2024-06-03 22:16:18,946 INFO L231 Difference]: Finished difference. Result has 264 places, 307 transitions, 3754 flow [2024-06-03 22:16:18,946 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3602, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3754, PETRI_PLACES=264, PETRI_TRANSITIONS=307} [2024-06-03 22:16:18,947 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 222 predicate places. [2024-06-03 22:16:18,947 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 307 transitions, 3754 flow [2024-06-03 22:16:18,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:16:18,947 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:16:18,947 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:16:18,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-03 22:16:18,947 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:16:18,948 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:16:18,948 INFO L85 PathProgramCache]: Analyzing trace with hash 2084691438, now seen corresponding path program 4 times [2024-06-03 22:16:18,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:16:18,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132025259] [2024-06-03 22:16:18,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:16:18,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:16:18,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:16:33,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:16:33,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:16:33,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132025259] [2024-06-03 22:16:33,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132025259] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:16:33,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:16:33,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:16:33,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115067132] [2024-06-03 22:16:33,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:16:33,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:16:33,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:16:33,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:16:33,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:16:33,293 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:16:33,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 307 transitions, 3754 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:16:33,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:16:33,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:16:33,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:16:35,567 INFO L124 PetriNetUnfolderBase]: 3618/5640 cut-off events. [2024-06-03 22:16:35,568 INFO L125 PetriNetUnfolderBase]: For 379458/379473 co-relation queries the response was YES. [2024-06-03 22:16:35,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38959 conditions, 5640 events. 3618/5640 cut-off events. For 379458/379473 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 32073 event pairs, 815 based on Foata normal form. 11/5637 useless extension candidates. Maximal degree in co-relation 38840. Up to 5348 conditions per place. [2024-06-03 22:16:35,627 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 259 selfloop transitions, 67 changer transitions 0/329 dead transitions. [2024-06-03 22:16:35,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 329 transitions, 4635 flow [2024-06-03 22:16:35,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:16:35,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:16:35,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 126 transitions. [2024-06-03 22:16:35,630 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38414634146341464 [2024-06-03 22:16:35,630 INFO L175 Difference]: Start difference. First operand has 264 places, 307 transitions, 3754 flow. Second operand 8 states and 126 transitions. [2024-06-03 22:16:35,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 329 transitions, 4635 flow [2024-06-03 22:16:36,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 329 transitions, 4478 flow, removed 7 selfloop flow, removed 8 redundant places. [2024-06-03 22:16:36,271 INFO L231 Difference]: Finished difference. Result has 264 places, 310 transitions, 3780 flow [2024-06-03 22:16:36,271 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3597, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3780, PETRI_PLACES=264, PETRI_TRANSITIONS=310} [2024-06-03 22:16:36,271 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 222 predicate places. [2024-06-03 22:16:36,271 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 310 transitions, 3780 flow [2024-06-03 22:16:36,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:16:36,271 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:16:36,272 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:16:36,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-03 22:16:36,272 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:16:36,272 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:16:36,272 INFO L85 PathProgramCache]: Analyzing trace with hash 2084702598, now seen corresponding path program 5 times [2024-06-03 22:16:36,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:16:36,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162656942] [2024-06-03 22:16:36,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:16:36,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:16:36,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:16:50,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:16:50,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:16:50,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162656942] [2024-06-03 22:16:50,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162656942] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:16:50,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:16:50,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:16:50,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085061113] [2024-06-03 22:16:50,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:16:50,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:16:50,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:16:50,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:16:50,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:16:50,908 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:16:50,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 310 transitions, 3780 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:16:50,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:16:50,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:16:50,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:16:53,102 INFO L124 PetriNetUnfolderBase]: 3606/5621 cut-off events. [2024-06-03 22:16:53,102 INFO L125 PetriNetUnfolderBase]: For 381166/381190 co-relation queries the response was YES. [2024-06-03 22:16:53,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38623 conditions, 5621 events. 3606/5621 cut-off events. For 381166/381190 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 31979 event pairs, 791 based on Foata normal form. 20/5634 useless extension candidates. Maximal degree in co-relation 38503. Up to 5340 conditions per place. [2024-06-03 22:16:53,170 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 268 selfloop transitions, 72 changer transitions 0/343 dead transitions. [2024-06-03 22:16:53,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 343 transitions, 4696 flow [2024-06-03 22:16:53,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 22:16:53,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 22:16:53,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 179 transitions. [2024-06-03 22:16:53,171 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3638211382113821 [2024-06-03 22:16:53,171 INFO L175 Difference]: Start difference. First operand has 264 places, 310 transitions, 3780 flow. Second operand 12 states and 179 transitions. [2024-06-03 22:16:53,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 343 transitions, 4696 flow [2024-06-03 22:16:53,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 343 transitions, 4465 flow, removed 16 selfloop flow, removed 7 redundant places. [2024-06-03 22:16:53,706 INFO L231 Difference]: Finished difference. Result has 269 places, 310 transitions, 3699 flow [2024-06-03 22:16:53,706 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3549, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3699, PETRI_PLACES=269, PETRI_TRANSITIONS=310} [2024-06-03 22:16:53,707 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 227 predicate places. [2024-06-03 22:16:53,707 INFO L495 AbstractCegarLoop]: Abstraction has has 269 places, 310 transitions, 3699 flow [2024-06-03 22:16:53,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:16:53,707 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:16:53,707 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:16:53,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-03 22:16:53,707 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:16:53,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:16:53,708 INFO L85 PathProgramCache]: Analyzing trace with hash 2097589608, now seen corresponding path program 6 times [2024-06-03 22:16:53,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:16:53,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625449446] [2024-06-03 22:16:53,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:16:53,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:16:53,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:17:07,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:17:07,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:17:07,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625449446] [2024-06-03 22:17:07,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625449446] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:17:07,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:17:07,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:17:07,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789079648] [2024-06-03 22:17:07,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:17:07,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:17:07,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:17:07,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:17:07,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:17:08,007 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-03 22:17:08,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 310 transitions, 3699 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:17:08,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:17:08,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-03 22:17:08,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:17:09,958 INFO L124 PetriNetUnfolderBase]: 3594/5607 cut-off events. [2024-06-03 22:17:09,959 INFO L125 PetriNetUnfolderBase]: For 381331/381331 co-relation queries the response was YES. [2024-06-03 22:17:10,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38345 conditions, 5607 events. 3594/5607 cut-off events. For 381331/381331 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 31908 event pairs, 824 based on Foata normal form. 4/5608 useless extension candidates. Maximal degree in co-relation 38224. Up to 5548 conditions per place. [2024-06-03 22:17:10,031 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 301 selfloop transitions, 20 changer transitions 0/324 dead transitions. [2024-06-03 22:17:10,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 324 transitions, 4383 flow [2024-06-03 22:17:10,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:17:10,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:17:10,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 114 transitions. [2024-06-03 22:17:10,034 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3475609756097561 [2024-06-03 22:17:10,034 INFO L175 Difference]: Start difference. First operand has 269 places, 310 transitions, 3699 flow. Second operand 8 states and 114 transitions. [2024-06-03 22:17:10,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 324 transitions, 4383 flow [2024-06-03 22:17:10,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 324 transitions, 4137 flow, removed 21 selfloop flow, removed 12 redundant places. [2024-06-03 22:17:10,648 INFO L231 Difference]: Finished difference. Result has 265 places, 310 transitions, 3500 flow [2024-06-03 22:17:10,648 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3453, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3500, PETRI_PLACES=265, PETRI_TRANSITIONS=310} [2024-06-03 22:17:10,649 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 223 predicate places. [2024-06-03 22:17:10,649 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 310 transitions, 3500 flow [2024-06-03 22:17:10,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:17:10,649 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:17:10,649 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:17:10,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-03 22:17:10,649 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:17:10,650 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:17:10,650 INFO L85 PathProgramCache]: Analyzing trace with hash 890497817, now seen corresponding path program 1 times [2024-06-03 22:17:10,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:17:10,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655726089] [2024-06-03 22:17:10,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:17:10,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:17:10,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:17:22,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:17:22,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:17:22,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655726089] [2024-06-03 22:17:22,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655726089] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:17:22,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:17:22,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:17:22,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691965814] [2024-06-03 22:17:22,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:17:22,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:17:22,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:17:22,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:17:22,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:17:22,552 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:17:22,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 310 transitions, 3500 flow. Second operand has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:17:22,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:17:22,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:17:22,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:17:24,501 INFO L124 PetriNetUnfolderBase]: 3506/5528 cut-off events. [2024-06-03 22:17:24,502 INFO L125 PetriNetUnfolderBase]: For 398452/398457 co-relation queries the response was YES. [2024-06-03 22:17:24,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37954 conditions, 5528 events. 3506/5528 cut-off events. For 398452/398457 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 32066 event pairs, 806 based on Foata normal form. 4/5520 useless extension candidates. Maximal degree in co-relation 37833. Up to 5330 conditions per place. [2024-06-03 22:17:24,559 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 300 selfloop transitions, 23 changer transitions 0/341 dead transitions. [2024-06-03 22:17:24,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 341 transitions, 4442 flow [2024-06-03 22:17:24,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:17:24,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:17:24,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 143 transitions. [2024-06-03 22:17:24,560 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3875338753387534 [2024-06-03 22:17:24,561 INFO L175 Difference]: Start difference. First operand has 265 places, 310 transitions, 3500 flow. Second operand 9 states and 143 transitions. [2024-06-03 22:17:24,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 341 transitions, 4442 flow [2024-06-03 22:17:25,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 341 transitions, 4366 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-03 22:17:25,171 INFO L231 Difference]: Finished difference. Result has 266 places, 316 transitions, 3570 flow [2024-06-03 22:17:25,172 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3424, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3570, PETRI_PLACES=266, PETRI_TRANSITIONS=316} [2024-06-03 22:17:25,172 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 224 predicate places. [2024-06-03 22:17:25,172 INFO L495 AbstractCegarLoop]: Abstraction has has 266 places, 316 transitions, 3570 flow [2024-06-03 22:17:25,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:17:25,173 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:17:25,173 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:17:25,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-03 22:17:25,173 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:17:25,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:17:25,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1640859791, now seen corresponding path program 2 times [2024-06-03 22:17:25,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:17:25,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965747610] [2024-06-03 22:17:25,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:17:25,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:17:25,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15