./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix042.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/mix042.oepc.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cde23df1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix042.oepc.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix042.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-cde23df-m [2024-06-14 15:19:34,393 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-14 15:19:34,459 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-14 15:19:34,467 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-14 15:19:34,467 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-14 15:19:34,501 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-14 15:19:34,504 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-14 15:19:34,505 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-14 15:19:34,505 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-14 15:19:34,508 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-14 15:19:34,509 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-14 15:19:34,509 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-14 15:19:34,509 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-14 15:19:34,510 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-14 15:19:34,511 INFO L153 SettingsManager]: * Use SBE=true [2024-06-14 15:19:34,511 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-14 15:19:34,511 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-14 15:19:34,511 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-14 15:19:34,512 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-14 15:19:34,512 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-14 15:19:34,512 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-14 15:19:34,512 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-14 15:19:34,513 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-14 15:19:34,513 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-14 15:19:34,513 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-14 15:19:34,513 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-14 15:19:34,513 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-14 15:19:34,514 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-14 15:19:34,514 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-14 15:19:34,514 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-14 15:19:34,515 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-14 15:19:34,515 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-14 15:19:34,516 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 15:19:34,516 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-14 15:19:34,516 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-14 15:19:34,516 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-14 15:19:34,516 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-14 15:19:34,517 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-14 15:19:34,517 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-14 15:19:34,517 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-14 15:19:34,517 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-14 15:19:34,517 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-14 15:19:34,518 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-14 15:19:34,518 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-14 15:19:34,715 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-14 15:19:34,739 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-14 15:19:34,741 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-14 15:19:34,742 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-14 15:19:34,742 INFO L274 PluginConnector]: CDTParser initialized [2024-06-14 15:19:34,743 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix042.oepc.i [2024-06-14 15:19:35,744 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-14 15:19:35,963 INFO L384 CDTParser]: Found 1 translation units. [2024-06-14 15:19:35,968 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix042.oepc.i [2024-06-14 15:19:35,983 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31a4cb0cd/d352ff98ab3441f19f3f3dff4c841458/FLAG96cf73f15 [2024-06-14 15:19:35,994 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31a4cb0cd/d352ff98ab3441f19f3f3dff4c841458 [2024-06-14 15:19:35,996 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-14 15:19:35,997 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-14 15:19:35,997 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/mix042.oepc.yml/witness.yml [2024-06-14 15:19:36,206 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-14 15:19:36,207 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-14 15:19:36,210 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-14 15:19:36,210 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-14 15:19:36,214 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-14 15:19:36,214 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 03:19:35" (1/2) ... [2024-06-14 15:19:36,216 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@197e1d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:19:36, skipping insertion in model container [2024-06-14 15:19:36,216 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 03:19:35" (1/2) ... [2024-06-14 15:19:36,218 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@50696f55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:19:36, skipping insertion in model container [2024-06-14 15:19:36,218 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:19:36" (2/2) ... [2024-06-14 15:19:36,218 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@197e1d8 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:19:36, skipping insertion in model container [2024-06-14 15:19:36,218 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:19:36" (2/2) ... [2024-06-14 15:19:36,218 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-14 15:19:36,293 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-14 15:19:36,294 INFO L97 edCorrectnessWitness]: Location invariant before [L849-L849] ((((((((((((((((((((! multithreaded || a$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_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || a$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )a$flush_delayed) + (long long )weak$$choice2 >= 0LL && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff0_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff0_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff0_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )x >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )z >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )x >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )y >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )z >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )x >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )y >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )z >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )x >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )y >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )z >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )x >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )y >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )z >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )a >= 0LL) && (long long )__unbuffered_cnt + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )a + (long long )a$flush_delayed >= 0LL) && (long long )a + (long long )a$mem_tmp >= 0LL) && (long long )a + (long long )a$r_buff0_thd0 >= 0LL) && (long long )a + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a + (long long )a$read_delayed >= 0LL) && (long long )a + (long long )a$w_buff0 >= 0LL) && (long long )a + (long long )a$w_buff1 >= 0LL) && (long long )a + (long long )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )a$flush_delayed + (long long )a$mem_tmp >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$flush_delayed + (long long )a$read_delayed >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff1 >= 0LL) && (long long )a$flush_delayed + (long long )main$tmp_guard1 >= 0LL) && (long long )a$flush_delayed + (long long )x >= 0LL) && (long long )a$flush_delayed + (long long )y >= 0LL) && (long long )a$flush_delayed + (long long )z >= 0LL) && (long long )a$flush_delayed + (long long )weak$$choice0 >= 0LL) && (long long )a$flush_delayed + (long long )weak$$choice2 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$mem_tmp + (long long )a$read_delayed >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff1 >= 0LL) && (long long )a$mem_tmp + (long long )main$tmp_guard1 >= 0LL) && (long long )a$mem_tmp + (long long )x >= 0LL) && (long long )a$mem_tmp + (long long )y >= 0LL) && (long long )a$mem_tmp + (long long )z >= 0LL) && (long long )a$mem_tmp + (long long )weak$$choice0 >= 0LL) && (long long )a$mem_tmp + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )x >= 0LL) && (long long )a$r_buff0_thd0 + (long long )y >= 0LL) && (long long )a$r_buff0_thd0 + (long long )z >= 0LL) && (long long )a$r_buff0_thd0 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )x >= 0LL) && (long long )a$r_buff0_thd2 + (long long )y >= 0LL) && (long long )a$r_buff0_thd2 + (long long )z >= 0LL) && (long long )a$r_buff0_thd2 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )x >= 0LL) && (long long )a$r_buff0_thd3 + (long long )y >= 0LL) && (long long )a$r_buff0_thd3 + (long long )z >= 0LL) && (long long )a$r_buff0_thd3 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )x >= 0LL) && (long long )a$r_buff1_thd0 + (long long )y >= 0LL) && (long long )a$r_buff1_thd0 + (long long )z >= 0LL) && (long long )a$r_buff1_thd0 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )x >= 0LL) && (long long )a$r_buff1_thd2 + (long long )y >= 0LL) && (long long )a$r_buff1_thd2 + (long long )z >= 0LL) && (long long )a$r_buff1_thd2 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )x >= 0LL) && (long long )a$r_buff1_thd3 + (long long )y >= 0LL) && (long long )a$r_buff1_thd3 + (long long )z >= 0LL) && (long long )a$r_buff1_thd3 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )weak$$choice2 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff1 >= 0LL) && (long long )a$read_delayed + (long long )main$tmp_guard1 >= 0LL) && (long long )a$read_delayed + (long long )x >= 0LL) && (long long )a$read_delayed + (long long )y >= 0LL) && (long long )a$read_delayed + (long long )z >= 0LL) && (long long )a$read_delayed + (long long )weak$$choice0 >= 0LL) && (long long )a$read_delayed + (long long )weak$$choice2 >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0 + (long long )x >= 0LL) && (long long )a$w_buff0 + (long long )y >= 0LL) && (long long )a$w_buff0 + (long long )z >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )a$w_buff1 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff1 + (long long )x >= 0LL) && (long long )a$w_buff1 + (long long )y >= 0LL) && (long long )a$w_buff1 + (long long )z >= 0LL) && (long long )a$w_buff1 + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff1 + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff0_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd3) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff0_thd3) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff1_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff1_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff1_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff1_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff1_thd3) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff1_thd3) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$read_delayed) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$read_delayed) - (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff0_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd2) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd3) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff0_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd3) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff0_thd3) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff1_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff1_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) - (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) - (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff1_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff1_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff1_thd3) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff1_thd3) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$read_delayed) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$read_delayed) - (long long )a$w_buff1 >= 0LL) && (2LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd1 >= 0LL) && (2LL - (long long )a$r_buff0_thd1) - (long long )a$w_buff0 >= 0LL) && (2LL - (long long )a$r_buff0_thd1) - (long long )a$w_buff1 >= 0LL) && (2LL - (long long )a$r_buff1_thd1) - (long long )a$w_buff0 >= 0LL) && (2LL - (long long )a$r_buff1_thd1) - (long long )a$w_buff1 >= 0LL) && (2LL - (long long )a$w_buff0) - (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$read_delayed >= 0LL) && (long long )a - (long long )a$r_buff0_thd0 >= 0LL) && (long long )a - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a - (long long )a$read_delayed >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$flush_delayed - (long long )a$read_delayed >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$mem_tmp - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd3 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd3 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd3 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd3 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd0 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff1_thd0 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff1_thd0 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd2 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff1_thd2 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd3 - (long long )a$read_delayed >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1 >= 0LL))) && (! multithreaded || a$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= a) && 0 <= a$mem_tmp) && 0 <= a$w_buff0) && 0 <= a$w_buff1) && 0 <= x) && 0 <= y) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && a <= 1) && a$mem_tmp <= 1) && a$w_buff0 <= 1) && a$w_buff1 <= 1) && x <= 1) && z <= 1) && a$flush_delayed == (_Bool)0) && a$r_buff0_thd0 == (_Bool)0) && a$r_buff0_thd2 == (_Bool)0) && a$r_buff0_thd3 == (_Bool)0) && a$r_buff1_thd0 == (_Bool)0) && a$r_buff1_thd2 == (_Bool)0) && a$r_buff1_thd3 == (_Bool)0) && a$read_delayed == (_Bool)0) && a$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (a == 0 || a == 1)) && (a$mem_tmp == 0 || a$mem_tmp == 1)) && (a$w_buff0 == 0 || a$w_buff0 == 1)) && (a$w_buff1 == 0 || a$w_buff1 == 1)) && (x == 0 || x == 1)) && (z == 0 || z == 1)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || a$read_delayed == (_Bool)0)) && (! multithreaded || a$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= a$mem_tmp && a$mem_tmp <= 1) && (a$mem_tmp == 0 || a$mem_tmp == 1)))) && (! multithreaded || a$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || a$read_delayed_var == 0)) && (! multithreaded || a$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= a$w_buff0 && a$w_buff0 <= 1) && (a$w_buff0 == 0 || a$w_buff0 == 1)))) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || ((0 <= a$w_buff1 && a$w_buff1 <= 1) && (a$w_buff1 == 0 || a$w_buff1 == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1))) [2024-06-14 15:19:36,295 INFO L97 edCorrectnessWitness]: Location invariant before [L846-L846] ((((((((((((((((((((! multithreaded || a$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_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || a$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )a$flush_delayed) + (long long )weak$$choice2 >= 0LL && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff0_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff0_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff0_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )x >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )z >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )x >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )y >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )z >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )x >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )y >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )z >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )x >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )y >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )z >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )x >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )y >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )z >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )a >= 0LL) && (long long )__unbuffered_cnt + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )a + (long long )a$flush_delayed >= 0LL) && (long long )a + (long long )a$mem_tmp >= 0LL) && (long long )a + (long long )a$r_buff0_thd0 >= 0LL) && (long long )a + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a + (long long )a$read_delayed >= 0LL) && (long long )a + (long long )a$w_buff0 >= 0LL) && (long long )a + (long long )a$w_buff1 >= 0LL) && (long long )a + (long long )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )a$flush_delayed + (long long )a$mem_tmp >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$flush_delayed + (long long )a$read_delayed >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff1 >= 0LL) && (long long )a$flush_delayed + (long long )main$tmp_guard1 >= 0LL) && (long long )a$flush_delayed + (long long )x >= 0LL) && (long long )a$flush_delayed + (long long )y >= 0LL) && (long long )a$flush_delayed + (long long )z >= 0LL) && (long long )a$flush_delayed + (long long )weak$$choice0 >= 0LL) && (long long )a$flush_delayed + (long long )weak$$choice2 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$mem_tmp + (long long )a$read_delayed >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff1 >= 0LL) && (long long )a$mem_tmp + (long long )main$tmp_guard1 >= 0LL) && (long long )a$mem_tmp + (long long )x >= 0LL) && (long long )a$mem_tmp + (long long )y >= 0LL) && (long long )a$mem_tmp + (long long )z >= 0LL) && (long long )a$mem_tmp + (long long )weak$$choice0 >= 0LL) && (long long )a$mem_tmp + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )x >= 0LL) && (long long )a$r_buff0_thd0 + (long long )y >= 0LL) && (long long )a$r_buff0_thd0 + (long long )z >= 0LL) && (long long )a$r_buff0_thd0 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )x >= 0LL) && (long long )a$r_buff0_thd2 + (long long )y >= 0LL) && (long long )a$r_buff0_thd2 + (long long )z >= 0LL) && (long long )a$r_buff0_thd2 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )x >= 0LL) && (long long )a$r_buff0_thd3 + (long long )y >= 0LL) && (long long )a$r_buff0_thd3 + (long long )z >= 0LL) && (long long )a$r_buff0_thd3 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )x >= 0LL) && (long long )a$r_buff1_thd0 + (long long )y >= 0LL) && (long long )a$r_buff1_thd0 + (long long )z >= 0LL) && (long long )a$r_buff1_thd0 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )x >= 0LL) && (long long )a$r_buff1_thd2 + (long long )y >= 0LL) && (long long )a$r_buff1_thd2 + (long long )z >= 0LL) && (long long )a$r_buff1_thd2 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )x >= 0LL) && (long long )a$r_buff1_thd3 + (long long )y >= 0LL) && (long long )a$r_buff1_thd3 + (long long )z >= 0LL) && (long long )a$r_buff1_thd3 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )weak$$choice2 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff1 >= 0LL) && (long long )a$read_delayed + (long long )main$tmp_guard1 >= 0LL) && (long long )a$read_delayed + (long long )x >= 0LL) && (long long )a$read_delayed + (long long )y >= 0LL) && (long long )a$read_delayed + (long long )z >= 0LL) && (long long )a$read_delayed + (long long )weak$$choice0 >= 0LL) && (long long )a$read_delayed + (long long )weak$$choice2 >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0 + (long long )x >= 0LL) && (long long )a$w_buff0 + (long long )y >= 0LL) && (long long )a$w_buff0 + (long long )z >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )a$w_buff1 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff1 + (long long )x >= 0LL) && (long long )a$w_buff1 + (long long )y >= 0LL) && (long long )a$w_buff1 + (long long )z >= 0LL) && (long long )a$w_buff1 + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff1 + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff0_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd3) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff0_thd3) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff1_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff1_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff1_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff1_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff1_thd3) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff1_thd3) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$read_delayed) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$read_delayed) - (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff0_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd2) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd3) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff0_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd3) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff0_thd3) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff1_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff1_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) - (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) - (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff1_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff1_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff1_thd3) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff1_thd3) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$read_delayed) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$read_delayed) - (long long )a$w_buff1 >= 0LL) && (2LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd1 >= 0LL) && (2LL - (long long )a$r_buff0_thd1) - (long long )a$w_buff0 >= 0LL) && (2LL - (long long )a$r_buff0_thd1) - (long long )a$w_buff1 >= 0LL) && (2LL - (long long )a$r_buff1_thd1) - (long long )a$w_buff0 >= 0LL) && (2LL - (long long )a$r_buff1_thd1) - (long long )a$w_buff1 >= 0LL) && (2LL - (long long )a$w_buff0) - (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$read_delayed >= 0LL) && (long long )a - (long long )a$r_buff0_thd0 >= 0LL) && (long long )a - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a - (long long )a$read_delayed >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$flush_delayed - (long long )a$read_delayed >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$mem_tmp - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd3 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd3 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd3 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd3 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd0 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff1_thd0 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff1_thd0 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd2 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff1_thd2 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd3 - (long long )a$read_delayed >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1 >= 0LL))) && (! multithreaded || a$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= a) && 0 <= a$mem_tmp) && 0 <= a$w_buff0) && 0 <= a$w_buff1) && 0 <= x) && 0 <= y) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && a <= 1) && a$mem_tmp <= 1) && a$w_buff0 <= 1) && a$w_buff1 <= 1) && x <= 1) && z <= 1) && a$flush_delayed == (_Bool)0) && a$r_buff0_thd0 == (_Bool)0) && a$r_buff0_thd2 == (_Bool)0) && a$r_buff0_thd3 == (_Bool)0) && a$r_buff1_thd0 == (_Bool)0) && a$r_buff1_thd2 == (_Bool)0) && a$r_buff1_thd3 == (_Bool)0) && a$read_delayed == (_Bool)0) && a$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (a == 0 || a == 1)) && (a$mem_tmp == 0 || a$mem_tmp == 1)) && (a$w_buff0 == 0 || a$w_buff0 == 1)) && (a$w_buff1 == 0 || a$w_buff1 == 1)) && (x == 0 || x == 1)) && (z == 0 || z == 1)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || a$read_delayed == (_Bool)0)) && (! multithreaded || a$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= a$mem_tmp && a$mem_tmp <= 1) && (a$mem_tmp == 0 || a$mem_tmp == 1)))) && (! multithreaded || a$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || a$read_delayed_var == 0)) && (! multithreaded || a$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= a$w_buff0 && a$w_buff0 <= 1) && (a$w_buff0 == 0 || a$w_buff0 == 1)))) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || ((0 <= a$w_buff1 && a$w_buff1 <= 1) && (a$w_buff1 == 0 || a$w_buff1 == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1))) [2024-06-14 15:19:36,296 INFO L97 edCorrectnessWitness]: Location invariant before [L848-L848] ((((((((((((((((((((! multithreaded || a$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_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || a$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )a$flush_delayed) + (long long )weak$$choice2 >= 0LL && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff0_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff0_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff0_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )x >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )z >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )x >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )y >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )z >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )x >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )y >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )z >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )x >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )y >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )z >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )x >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )y >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )z >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )a >= 0LL) && (long long )__unbuffered_cnt + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )a + (long long )a$flush_delayed >= 0LL) && (long long )a + (long long )a$mem_tmp >= 0LL) && (long long )a + (long long )a$r_buff0_thd0 >= 0LL) && (long long )a + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a + (long long )a$read_delayed >= 0LL) && (long long )a + (long long )a$w_buff0 >= 0LL) && (long long )a + (long long )a$w_buff1 >= 0LL) && (long long )a + (long long )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )a$flush_delayed + (long long )a$mem_tmp >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$flush_delayed + (long long )a$read_delayed >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff1 >= 0LL) && (long long )a$flush_delayed + (long long )main$tmp_guard1 >= 0LL) && (long long )a$flush_delayed + (long long )x >= 0LL) && (long long )a$flush_delayed + (long long )y >= 0LL) && (long long )a$flush_delayed + (long long )z >= 0LL) && (long long )a$flush_delayed + (long long )weak$$choice0 >= 0LL) && (long long )a$flush_delayed + (long long )weak$$choice2 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$mem_tmp + (long long )a$read_delayed >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff1 >= 0LL) && (long long )a$mem_tmp + (long long )main$tmp_guard1 >= 0LL) && (long long )a$mem_tmp + (long long )x >= 0LL) && (long long )a$mem_tmp + (long long )y >= 0LL) && (long long )a$mem_tmp + (long long )z >= 0LL) && (long long )a$mem_tmp + (long long )weak$$choice0 >= 0LL) && (long long )a$mem_tmp + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )x >= 0LL) && (long long )a$r_buff0_thd0 + (long long )y >= 0LL) && (long long )a$r_buff0_thd0 + (long long )z >= 0LL) && (long long )a$r_buff0_thd0 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )x >= 0LL) && (long long )a$r_buff0_thd2 + (long long )y >= 0LL) && (long long )a$r_buff0_thd2 + (long long )z >= 0LL) && (long long )a$r_buff0_thd2 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )x >= 0LL) && (long long )a$r_buff0_thd3 + (long long )y >= 0LL) && (long long )a$r_buff0_thd3 + (long long )z >= 0LL) && (long long )a$r_buff0_thd3 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )x >= 0LL) && (long long )a$r_buff1_thd0 + (long long )y >= 0LL) && (long long )a$r_buff1_thd0 + (long long )z >= 0LL) && (long long )a$r_buff1_thd0 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )x >= 0LL) && (long long )a$r_buff1_thd2 + (long long )y >= 0LL) && (long long )a$r_buff1_thd2 + (long long )z >= 0LL) && (long long )a$r_buff1_thd2 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )x >= 0LL) && (long long )a$r_buff1_thd3 + (long long )y >= 0LL) && (long long )a$r_buff1_thd3 + (long long )z >= 0LL) && (long long )a$r_buff1_thd3 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )weak$$choice2 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff1 >= 0LL) && (long long )a$read_delayed + (long long )main$tmp_guard1 >= 0LL) && (long long )a$read_delayed + (long long )x >= 0LL) && (long long )a$read_delayed + (long long )y >= 0LL) && (long long )a$read_delayed + (long long )z >= 0LL) && (long long )a$read_delayed + (long long )weak$$choice0 >= 0LL) && (long long )a$read_delayed + (long long )weak$$choice2 >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0 + (long long )x >= 0LL) && (long long )a$w_buff0 + (long long )y >= 0LL) && (long long )a$w_buff0 + (long long )z >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )a$w_buff1 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff1 + (long long )x >= 0LL) && (long long )a$w_buff1 + (long long )y >= 0LL) && (long long )a$w_buff1 + (long long )z >= 0LL) && (long long )a$w_buff1 + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff1 + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff0_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd3) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff0_thd3) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff1_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff1_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff1_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff1_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff1_thd3) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff1_thd3) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$read_delayed) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$read_delayed) - (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff0_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd2) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd3) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff0_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd3) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff0_thd3) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff1_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff1_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) - (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) - (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff1_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff1_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff1_thd3) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff1_thd3) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$read_delayed) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$read_delayed) - (long long )a$w_buff1 >= 0LL) && (2LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd1 >= 0LL) && (2LL - (long long )a$r_buff0_thd1) - (long long )a$w_buff0 >= 0LL) && (2LL - (long long )a$r_buff0_thd1) - (long long )a$w_buff1 >= 0LL) && (2LL - (long long )a$r_buff1_thd1) - (long long )a$w_buff0 >= 0LL) && (2LL - (long long )a$r_buff1_thd1) - (long long )a$w_buff1 >= 0LL) && (2LL - (long long )a$w_buff0) - (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$read_delayed >= 0LL) && (long long )a - (long long )a$r_buff0_thd0 >= 0LL) && (long long )a - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a - (long long )a$read_delayed >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$flush_delayed - (long long )a$read_delayed >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$mem_tmp - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd3 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd3 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd3 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd3 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd0 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff1_thd0 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff1_thd0 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd2 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff1_thd2 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd3 - (long long )a$read_delayed >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1 >= 0LL))) && (! multithreaded || a$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= a) && 0 <= a$mem_tmp) && 0 <= a$w_buff0) && 0 <= a$w_buff1) && 0 <= x) && 0 <= y) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && a <= 1) && a$mem_tmp <= 1) && a$w_buff0 <= 1) && a$w_buff1 <= 1) && x <= 1) && z <= 1) && a$flush_delayed == (_Bool)0) && a$r_buff0_thd0 == (_Bool)0) && a$r_buff0_thd2 == (_Bool)0) && a$r_buff0_thd3 == (_Bool)0) && a$r_buff1_thd0 == (_Bool)0) && a$r_buff1_thd2 == (_Bool)0) && a$r_buff1_thd3 == (_Bool)0) && a$read_delayed == (_Bool)0) && a$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (a == 0 || a == 1)) && (a$mem_tmp == 0 || a$mem_tmp == 1)) && (a$w_buff0 == 0 || a$w_buff0 == 1)) && (a$w_buff1 == 0 || a$w_buff1 == 1)) && (x == 0 || x == 1)) && (z == 0 || z == 1)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || a$read_delayed == (_Bool)0)) && (! multithreaded || a$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= a$mem_tmp && a$mem_tmp <= 1) && (a$mem_tmp == 0 || a$mem_tmp == 1)))) && (! multithreaded || a$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || a$read_delayed_var == 0)) && (! multithreaded || a$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= a$w_buff0 && a$w_buff0 <= 1) && (a$w_buff0 == 0 || a$w_buff0 == 1)))) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || ((0 <= a$w_buff1 && a$w_buff1 <= 1) && (a$w_buff1 == 0 || a$w_buff1 == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1))) [2024-06-14 15:19:36,296 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-14 15:19:36,297 INFO L106 edCorrectnessWitness]: ghost_update [L844-L844] multithreaded = 1; [2024-06-14 15:19:36,337 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-14 15:19:36,702 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 15:19:36,719 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-14 15:19:37,082 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 15:19:37,119 INFO L206 MainTranslator]: Completed translation [2024-06-14 15:19:37,120 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:19:37 WrapperNode [2024-06-14 15:19:37,120 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-14 15:19:37,122 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-14 15:19:37,122 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-14 15:19:37,122 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-14 15:19:37,128 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:19:37" (1/1) ... [2024-06-14 15:19:37,185 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:19:37" (1/1) ... [2024-06-14 15:19:37,325 INFO L138 Inliner]: procedures = 175, calls = 47, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 127 [2024-06-14 15:19:37,326 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-14 15:19:37,327 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-14 15:19:37,327 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-14 15:19:37,327 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-14 15:19:37,336 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:19:37" (1/1) ... [2024-06-14 15:19:37,336 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:19:37" (1/1) ... [2024-06-14 15:19:37,378 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:19:37" (1/1) ... [2024-06-14 15:19:37,437 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-14 15:19:37,438 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:19:37" (1/1) ... [2024-06-14 15:19:37,438 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:19:37" (1/1) ... [2024-06-14 15:19:37,483 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:19:37" (1/1) ... [2024-06-14 15:19:37,485 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:19:37" (1/1) ... [2024-06-14 15:19:37,496 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:19:37" (1/1) ... [2024-06-14 15:19:37,501 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:19:37" (1/1) ... [2024-06-14 15:19:37,520 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-14 15:19:37,521 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-14 15:19:37,522 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-14 15:19:37,522 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-14 15:19:37,523 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:19:37" (1/1) ... [2024-06-14 15:19:37,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 15:19:37,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 15:19:37,547 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-14 15:19:37,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-14 15:19:37,579 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-14 15:19:37,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-14 15:19:37,579 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-14 15:19:37,579 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-14 15:19:37,579 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-14 15:19:37,579 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-14 15:19:37,580 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-14 15:19:37,580 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-14 15:19:37,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-14 15:19:37,580 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-14 15:19:37,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-14 15:19:37,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-14 15:19:37,581 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-14 15:19:37,679 INFO L244 CfgBuilder]: Building ICFG [2024-06-14 15:19:37,681 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-14 15:19:38,962 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-14 15:19:38,963 INFO L293 CfgBuilder]: Performing block encoding [2024-06-14 15:19:39,297 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-14 15:19:39,298 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-14 15:19:39,299 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 03:19:39 BoogieIcfgContainer [2024-06-14 15:19:39,299 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-14 15:19:39,301 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-14 15:19:39,301 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-14 15:19:39,304 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-14 15:19:39,304 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.06 03:19:35" (1/4) ... [2024-06-14 15:19:39,305 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e5cac39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 03:19:39, skipping insertion in model container [2024-06-14 15:19:39,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:19:36" (2/4) ... [2024-06-14 15:19:39,305 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e5cac39 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 03:19:39, skipping insertion in model container [2024-06-14 15:19:39,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:19:37" (3/4) ... [2024-06-14 15:19:39,306 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e5cac39 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 03:19:39, skipping insertion in model container [2024-06-14 15:19:39,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 03:19:39" (4/4) ... [2024-06-14 15:19:39,307 INFO L112 eAbstractionObserver]: Analyzing ICFG mix042.oepc.i [2024-06-14 15:19:39,320 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-14 15:19:39,321 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-14 15:19:39,321 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-14 15:19:39,454 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-14 15:19:39,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 43 transitions, 98 flow [2024-06-14 15:19:39,534 INFO L124 PetriNetUnfolderBase]: 0/40 cut-off events. [2024-06-14 15:19:39,534 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 15:19:39,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 40 events. 0/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 68 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-14 15:19:39,537 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 43 transitions, 98 flow [2024-06-14 15:19:39,540 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 34 transitions, 77 flow [2024-06-14 15:19:39,546 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-14 15:19:39,551 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;@534f0480, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-14 15:19:39,551 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-14 15:19:39,558 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-14 15:19:39,558 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2024-06-14 15:19:39,558 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 15:19:39,558 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:19:39,559 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-14 15:19:39,559 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:19:39,563 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:19:39,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1196790123, now seen corresponding path program 1 times [2024-06-14 15:19:39,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:19:39,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730522693] [2024-06-14 15:19:39,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:19:39,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:19:39,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:19:46,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:19:46,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:19:46,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730522693] [2024-06-14 15:19:46,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730522693] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:19:46,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:19:46,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-14 15:19:46,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649848481] [2024-06-14 15:19:46,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:19:46,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-14 15:19:46,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:19:46,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-14 15:19:46,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-14 15:19:46,933 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-14 15:19:46,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 77 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:19:46,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:19:46,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-14 15:19:46,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:19:48,080 INFO L124 PetriNetUnfolderBase]: 1566/2407 cut-off events. [2024-06-14 15:19:48,080 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2024-06-14 15:19:48,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4820 conditions, 2407 events. 1566/2407 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 11613 event pairs, 1097 based on Foata normal form. 1/2345 useless extension candidates. Maximal degree in co-relation 4805. Up to 2326 conditions per place. [2024-06-14 15:19:48,097 INFO L140 encePairwiseOnDemand]: 36/43 looper letters, 35 selfloop transitions, 4 changer transitions 0/44 dead transitions. [2024-06-14 15:19:48,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 44 transitions, 181 flow [2024-06-14 15:19:48,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-14 15:19:48,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-14 15:19:48,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2024-06-14 15:19:48,107 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5813953488372093 [2024-06-14 15:19:48,108 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 77 flow. Second operand 3 states and 75 transitions. [2024-06-14 15:19:48,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 44 transitions, 181 flow [2024-06-14 15:19:48,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 44 transitions, 176 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-14 15:19:48,114 INFO L231 Difference]: Finished difference. Result has 44 places, 37 transitions, 104 flow [2024-06-14 15:19:48,115 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=44, PETRI_TRANSITIONS=37} [2024-06-14 15:19:48,118 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 0 predicate places. [2024-06-14 15:19:48,118 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 104 flow [2024-06-14 15:19:48,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:19:48,118 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:19:48,118 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:19:48,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-14 15:19:48,119 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:19:48,121 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:19:48,121 INFO L85 PathProgramCache]: Analyzing trace with hash 935955316, now seen corresponding path program 1 times [2024-06-14 15:19:48,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:19:48,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645061199] [2024-06-14 15:19:48,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:19:48,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:19:48,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:19:53,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:19:53,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:19:53,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645061199] [2024-06-14 15:19:53,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645061199] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:19:53,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:19:53,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-14 15:19:53,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389467474] [2024-06-14 15:19:53,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:19:53,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 15:19:53,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:19:53,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 15:19:53,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-14 15:19:53,280 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-14 15:19:53,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 104 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:19:53,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:19:53,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-14 15:19:53,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:19:54,341 INFO L124 PetriNetUnfolderBase]: 1560/2398 cut-off events. [2024-06-14 15:19:54,341 INFO L125 PetriNetUnfolderBase]: For 448/448 co-relation queries the response was YES. [2024-06-14 15:19:54,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5416 conditions, 2398 events. 1560/2398 cut-off events. For 448/448 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 11610 event pairs, 930 based on Foata normal form. 3/2371 useless extension candidates. Maximal degree in co-relation 5401. Up to 2302 conditions per place. [2024-06-14 15:19:54,352 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 42 selfloop transitions, 7 changer transitions 0/54 dead transitions. [2024-06-14 15:19:54,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 54 transitions, 248 flow [2024-06-14 15:19:54,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-14 15:19:54,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-14 15:19:54,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2024-06-14 15:19:54,354 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5581395348837209 [2024-06-14 15:19:54,354 INFO L175 Difference]: Start difference. First operand has 44 places, 37 transitions, 104 flow. Second operand 4 states and 96 transitions. [2024-06-14 15:19:54,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 54 transitions, 248 flow [2024-06-14 15:19:54,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 54 transitions, 244 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-14 15:19:54,357 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 140 flow [2024-06-14 15:19:54,357 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=140, PETRI_PLACES=47, PETRI_TRANSITIONS=40} [2024-06-14 15:19:54,358 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 3 predicate places. [2024-06-14 15:19:54,358 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 140 flow [2024-06-14 15:19:54,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:19:54,359 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:19:54,359 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:19:54,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-14 15:19:54,361 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:19:54,363 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:19:54,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1804923987, now seen corresponding path program 1 times [2024-06-14 15:19:54,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:19:54,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582654796] [2024-06-14 15:19:54,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:19:54,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:19:54,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:19:59,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:19:59,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:19:59,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582654796] [2024-06-14 15:19:59,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582654796] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:19:59,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:19:59,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 15:19:59,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891349520] [2024-06-14 15:19:59,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:19:59,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 15:19:59,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:19:59,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 15:19:59,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-14 15:20:00,105 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-14 15:20:00,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 140 flow. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 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-14 15:20:00,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:20:00,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-14 15:20:00,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:20:01,431 INFO L124 PetriNetUnfolderBase]: 1893/2883 cut-off events. [2024-06-14 15:20:01,431 INFO L125 PetriNetUnfolderBase]: For 1453/1453 co-relation queries the response was YES. [2024-06-14 15:20:01,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7172 conditions, 2883 events. 1893/2883 cut-off events. For 1453/1453 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 13805 event pairs, 878 based on Foata normal form. 3/2850 useless extension candidates. Maximal degree in co-relation 7155. Up to 2753 conditions per place. [2024-06-14 15:20:01,443 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 57 selfloop transitions, 13 changer transitions 0/74 dead transitions. [2024-06-14 15:20:01,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 74 transitions, 382 flow [2024-06-14 15:20:01,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:20:01,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:20:01,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 133 transitions. [2024-06-14 15:20:01,446 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5155038759689923 [2024-06-14 15:20:01,446 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 140 flow. Second operand 6 states and 133 transitions. [2024-06-14 15:20:01,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 74 transitions, 382 flow [2024-06-14 15:20:01,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 74 transitions, 362 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-06-14 15:20:01,449 INFO L231 Difference]: Finished difference. Result has 52 places, 46 transitions, 198 flow [2024-06-14 15:20:01,449 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=198, PETRI_PLACES=52, PETRI_TRANSITIONS=46} [2024-06-14 15:20:01,450 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 8 predicate places. [2024-06-14 15:20:01,450 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 46 transitions, 198 flow [2024-06-14 15:20:01,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 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-14 15:20:01,450 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:20:01,450 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:20:01,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-14 15:20:01,451 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-14 15:20:01,451 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:20:01,451 INFO L85 PathProgramCache]: Analyzing trace with hash 118069753, now seen corresponding path program 1 times [2024-06-14 15:20:01,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:20:01,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259317554] [2024-06-14 15:20:01,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:20:01,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:20:01,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:20:06,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:20:06,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:20:06,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259317554] [2024-06-14 15:20:06,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259317554] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:20:06,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:20:06,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:20:06,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267662114] [2024-06-14 15:20:06,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:20:06,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:20:06,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:20:06,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:20:06,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:20:07,040 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-14 15:20:07,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 46 transitions, 198 flow. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:20:07,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:20:07,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-14 15:20:07,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:20:08,390 INFO L124 PetriNetUnfolderBase]: 1884/2868 cut-off events. [2024-06-14 15:20:08,390 INFO L125 PetriNetUnfolderBase]: For 2881/2881 co-relation queries the response was YES. [2024-06-14 15:20:08,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7941 conditions, 2868 events. 1884/2868 cut-off events. For 2881/2881 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 13674 event pairs, 690 based on Foata normal form. 6/2838 useless extension candidates. Maximal degree in co-relation 7922. Up to 2708 conditions per place. [2024-06-14 15:20:08,404 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 61 selfloop transitions, 15 changer transitions 0/80 dead transitions. [2024-06-14 15:20:08,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 80 transitions, 442 flow [2024-06-14 15:20:08,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:20:08,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:20:08,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 149 transitions. [2024-06-14 15:20:08,406 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4950166112956811 [2024-06-14 15:20:08,406 INFO L175 Difference]: Start difference. First operand has 52 places, 46 transitions, 198 flow. Second operand 7 states and 149 transitions. [2024-06-14 15:20:08,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 80 transitions, 442 flow [2024-06-14 15:20:08,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 80 transitions, 414 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-14 15:20:08,409 INFO L231 Difference]: Finished difference. Result has 55 places, 47 transitions, 219 flow [2024-06-14 15:20:08,409 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=219, PETRI_PLACES=55, PETRI_TRANSITIONS=47} [2024-06-14 15:20:08,410 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 11 predicate places. [2024-06-14 15:20:08,410 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 47 transitions, 219 flow [2024-06-14 15:20:08,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:20:08,411 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:20:08,411 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:20:08,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-14 15:20:08,411 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:20:08,411 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:20:08,411 INFO L85 PathProgramCache]: Analyzing trace with hash -318663339, now seen corresponding path program 1 times [2024-06-14 15:20:08,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:20:08,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600851791] [2024-06-14 15:20:08,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:20:08,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:20:08,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:20:20,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:20:20,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:20:20,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600851791] [2024-06-14 15:20:20,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600851791] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:20:20,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:20:20,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 15:20:20,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338840810] [2024-06-14 15:20:20,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:20:20,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 15:20:20,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:20:20,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 15:20:20,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-14 15:20:20,552 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-14 15:20:20,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 47 transitions, 219 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-14 15:20:20,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:20:20,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-14 15:20:20,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:20:21,865 INFO L124 PetriNetUnfolderBase]: 1879/2861 cut-off events. [2024-06-14 15:20:21,865 INFO L125 PetriNetUnfolderBase]: For 4336/4336 co-relation queries the response was YES. [2024-06-14 15:20:21,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8418 conditions, 2861 events. 1879/2861 cut-off events. For 4336/4336 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 13595 event pairs, 812 based on Foata normal form. 2/2827 useless extension candidates. Maximal degree in co-relation 8398. Up to 2767 conditions per place. [2024-06-14 15:20:21,879 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 49 selfloop transitions, 8 changer transitions 0/61 dead transitions. [2024-06-14 15:20:21,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 61 transitions, 377 flow [2024-06-14 15:20:21,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 15:20:21,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 15:20:21,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 93 transitions. [2024-06-14 15:20:21,881 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4325581395348837 [2024-06-14 15:20:21,881 INFO L175 Difference]: Start difference. First operand has 55 places, 47 transitions, 219 flow. Second operand 5 states and 93 transitions. [2024-06-14 15:20:21,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 61 transitions, 377 flow [2024-06-14 15:20:21,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 61 transitions, 338 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-14 15:20:21,889 INFO L231 Difference]: Finished difference. Result has 55 places, 50 transitions, 226 flow [2024-06-14 15:20:21,889 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=226, PETRI_PLACES=55, PETRI_TRANSITIONS=50} [2024-06-14 15:20:21,892 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 11 predicate places. [2024-06-14 15:20:21,892 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 50 transitions, 226 flow [2024-06-14 15:20:21,893 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-14 15:20:21,893 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:20:21,893 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:20:21,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-14 15:20:21,893 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:20:21,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:20:21,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1288627549, now seen corresponding path program 1 times [2024-06-14 15:20:21,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:20:21,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106829868] [2024-06-14 15:20:21,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:20:21,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:20:21,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:20:35,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:20:35,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:20:35,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106829868] [2024-06-14 15:20:35,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106829868] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:20:35,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:20:35,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:20:35,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582005438] [2024-06-14 15:20:35,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:20:35,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:20:35,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:20:35,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:20:35,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:20:35,569 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-14 15:20:35,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 50 transitions, 226 flow. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:20:35,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:20:35,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-14 15:20:35,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:20:36,968 INFO L124 PetriNetUnfolderBase]: 1883/2868 cut-off events. [2024-06-14 15:20:36,969 INFO L125 PetriNetUnfolderBase]: For 6035/6035 co-relation queries the response was YES. [2024-06-14 15:20:36,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8978 conditions, 2868 events. 1883/2868 cut-off events. For 6035/6035 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 13579 event pairs, 762 based on Foata normal form. 6/2874 useless extension candidates. Maximal degree in co-relation 8956. Up to 2725 conditions per place. [2024-06-14 15:20:36,989 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 59 selfloop transitions, 19 changer transitions 0/82 dead transitions. [2024-06-14 15:20:36,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 82 transitions, 506 flow [2024-06-14 15:20:36,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:20:36,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:20:36,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2024-06-14 15:20:36,991 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40988372093023256 [2024-06-14 15:20:36,991 INFO L175 Difference]: Start difference. First operand has 55 places, 50 transitions, 226 flow. Second operand 8 states and 141 transitions. [2024-06-14 15:20:36,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 82 transitions, 506 flow [2024-06-14 15:20:36,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 82 transitions, 484 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-14 15:20:36,996 INFO L231 Difference]: Finished difference. Result has 62 places, 61 transitions, 329 flow [2024-06-14 15:20:36,996 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=329, PETRI_PLACES=62, PETRI_TRANSITIONS=61} [2024-06-14 15:20:36,999 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 18 predicate places. [2024-06-14 15:20:36,999 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 61 transitions, 329 flow [2024-06-14 15:20:36,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:20:36,999 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:20:36,999 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:20:36,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-14 15:20:36,999 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:20:37,000 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:20:37,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1836004428, now seen corresponding path program 1 times [2024-06-14 15:20:37,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:20:37,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122540172] [2024-06-14 15:20:37,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:20:37,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:20:37,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:20:47,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:20:47,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:20:47,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122540172] [2024-06-14 15:20:47,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122540172] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:20:47,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:20:47,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:20:47,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386594677] [2024-06-14 15:20:47,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:20:47,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:20:47,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:20:47,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:20:47,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:20:47,656 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-14 15:20:47,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 61 transitions, 329 flow. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:20:47,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:20:47,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-14 15:20:47,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:20:48,901 INFO L124 PetriNetUnfolderBase]: 1894/2919 cut-off events. [2024-06-14 15:20:48,901 INFO L125 PetriNetUnfolderBase]: For 9060/9064 co-relation queries the response was YES. [2024-06-14 15:20:48,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10145 conditions, 2919 events. 1894/2919 cut-off events. For 9060/9064 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 14019 event pairs, 771 based on Foata normal form. 6/2924 useless extension candidates. Maximal degree in co-relation 10120. Up to 2754 conditions per place. [2024-06-14 15:20:48,915 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 67 selfloop transitions, 16 changer transitions 0/87 dead transitions. [2024-06-14 15:20:48,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 87 transitions, 617 flow [2024-06-14 15:20:48,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:20:48,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:20:48,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 116 transitions. [2024-06-14 15:20:48,916 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4496124031007752 [2024-06-14 15:20:48,917 INFO L175 Difference]: Start difference. First operand has 62 places, 61 transitions, 329 flow. Second operand 6 states and 116 transitions. [2024-06-14 15:20:48,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 87 transitions, 617 flow [2024-06-14 15:20:48,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 87 transitions, 593 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-06-14 15:20:48,922 INFO L231 Difference]: Finished difference. Result has 65 places, 67 transitions, 399 flow [2024-06-14 15:20:48,922 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=399, PETRI_PLACES=65, PETRI_TRANSITIONS=67} [2024-06-14 15:20:48,922 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 21 predicate places. [2024-06-14 15:20:48,923 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 67 transitions, 399 flow [2024-06-14 15:20:48,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:20:48,923 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:20:48,923 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:20:48,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-14 15:20:48,923 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:20:48,924 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:20:48,924 INFO L85 PathProgramCache]: Analyzing trace with hash -376681642, now seen corresponding path program 2 times [2024-06-14 15:20:48,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:20:48,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352388679] [2024-06-14 15:20:48,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:20:48,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:20:48,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:20:58,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:20:58,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:20:58,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352388679] [2024-06-14 15:20:58,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352388679] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:20:58,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:20:58,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:20:58,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457009348] [2024-06-14 15:20:58,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:20:58,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:20:58,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:20:58,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:20:58,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:20:59,015 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-14 15:20:59,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 67 transitions, 399 flow. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:20:59,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:20:59,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-14 15:20:59,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:21:00,309 INFO L124 PetriNetUnfolderBase]: 1889/2911 cut-off events. [2024-06-14 15:21:00,310 INFO L125 PetriNetUnfolderBase]: For 11432/11432 co-relation queries the response was YES. [2024-06-14 15:21:00,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10739 conditions, 2911 events. 1889/2911 cut-off events. For 11432/11432 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 13968 event pairs, 767 based on Foata normal form. 2/2912 useless extension candidates. Maximal degree in co-relation 10712. Up to 2773 conditions per place. [2024-06-14 15:21:00,325 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 67 selfloop transitions, 11 changer transitions 0/82 dead transitions. [2024-06-14 15:21:00,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 82 transitions, 593 flow [2024-06-14 15:21:00,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:21:00,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:21:00,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions. [2024-06-14 15:21:00,326 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42248062015503873 [2024-06-14 15:21:00,326 INFO L175 Difference]: Start difference. First operand has 65 places, 67 transitions, 399 flow. Second operand 6 states and 109 transitions. [2024-06-14 15:21:00,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 82 transitions, 593 flow [2024-06-14 15:21:00,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 82 transitions, 551 flow, removed 17 selfloop flow, removed 2 redundant places. [2024-06-14 15:21:00,335 INFO L231 Difference]: Finished difference. Result has 69 places, 67 transitions, 387 flow [2024-06-14 15:21:00,335 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=357, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=387, PETRI_PLACES=69, PETRI_TRANSITIONS=67} [2024-06-14 15:21:00,336 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 25 predicate places. [2024-06-14 15:21:00,336 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 67 transitions, 387 flow [2024-06-14 15:21:00,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:21:00,336 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:21:00,337 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:21:00,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-14 15:21:00,337 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:21:00,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:21:00,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1081681208, now seen corresponding path program 1 times [2024-06-14 15:21:00,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:21:00,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159199051] [2024-06-14 15:21:00,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:21:00,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:21:00,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:21:11,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:21:11,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:21:11,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159199051] [2024-06-14 15:21:11,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159199051] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:21:11,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:21:11,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:21:11,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487031304] [2024-06-14 15:21:11,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:21:11,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:21:11,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:21:11,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:21:11,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:21:11,736 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-14 15:21:11,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 67 transitions, 387 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 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-14 15:21:11,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:21:11,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-14 15:21:11,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:21:13,080 INFO L124 PetriNetUnfolderBase]: 1900/2927 cut-off events. [2024-06-14 15:21:13,081 INFO L125 PetriNetUnfolderBase]: For 13202/13202 co-relation queries the response was YES. [2024-06-14 15:21:13,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10945 conditions, 2927 events. 1900/2927 cut-off events. For 13202/13202 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 14045 event pairs, 746 based on Foata normal form. 2/2928 useless extension candidates. Maximal degree in co-relation 10916. Up to 2759 conditions per place. [2024-06-14 15:21:13,093 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 68 selfloop transitions, 16 changer transitions 0/88 dead transitions. [2024-06-14 15:21:13,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 88 transitions, 629 flow [2024-06-14 15:21:13,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:21:13,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:21:13,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2024-06-14 15:21:13,095 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4418604651162791 [2024-06-14 15:21:13,095 INFO L175 Difference]: Start difference. First operand has 69 places, 67 transitions, 387 flow. Second operand 6 states and 114 transitions. [2024-06-14 15:21:13,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 88 transitions, 629 flow [2024-06-14 15:21:13,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 88 transitions, 595 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-14 15:21:13,104 INFO L231 Difference]: Finished difference. Result has 69 places, 70 transitions, 431 flow [2024-06-14 15:21:13,104 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=431, PETRI_PLACES=69, PETRI_TRANSITIONS=70} [2024-06-14 15:21:13,105 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 25 predicate places. [2024-06-14 15:21:13,105 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 70 transitions, 431 flow [2024-06-14 15:21:13,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 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-14 15:21:13,105 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:21:13,105 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:21:13,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-14 15:21:13,105 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:21:13,106 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:21:13,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1597826140, now seen corresponding path program 1 times [2024-06-14 15:21:13,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:21:13,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888395340] [2024-06-14 15:21:13,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:21:13,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:21:13,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:21:24,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:21:24,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:21:24,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888395340] [2024-06-14 15:21:24,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888395340] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:21:24,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:21:24,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:21:24,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224819219] [2024-06-14 15:21:24,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:21:24,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:21:24,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:21:24,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:21:24,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:21:24,215 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-14 15:21:24,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 70 transitions, 431 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 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-14 15:21:24,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:21:24,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-14 15:21:24,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:21:25,654 INFO L124 PetriNetUnfolderBase]: 1984/3044 cut-off events. [2024-06-14 15:21:25,654 INFO L125 PetriNetUnfolderBase]: For 16747/16751 co-relation queries the response was YES. [2024-06-14 15:21:25,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12021 conditions, 3044 events. 1984/3044 cut-off events. For 16747/16751 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 14571 event pairs, 674 based on Foata normal form. 10/3054 useless extension candidates. Maximal degree in co-relation 11992. Up to 2747 conditions per place. [2024-06-14 15:21:25,689 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 88 selfloop transitions, 31 changer transitions 0/123 dead transitions. [2024-06-14 15:21:25,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 123 transitions, 957 flow [2024-06-14 15:21:25,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:21:25,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:21:25,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 161 transitions. [2024-06-14 15:21:25,690 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4680232558139535 [2024-06-14 15:21:25,690 INFO L175 Difference]: Start difference. First operand has 69 places, 70 transitions, 431 flow. Second operand 8 states and 161 transitions. [2024-06-14 15:21:25,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 123 transitions, 957 flow [2024-06-14 15:21:25,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 123 transitions, 899 flow, removed 15 selfloop flow, removed 5 redundant places. [2024-06-14 15:21:25,702 INFO L231 Difference]: Finished difference. Result has 75 places, 87 transitions, 608 flow [2024-06-14 15:21:25,703 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=381, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=608, PETRI_PLACES=75, PETRI_TRANSITIONS=87} [2024-06-14 15:21:25,703 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 31 predicate places. [2024-06-14 15:21:25,703 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 87 transitions, 608 flow [2024-06-14 15:21:25,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 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-14 15:21:25,704 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:21:25,704 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:21:25,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-14 15:21:25,704 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:21:25,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:21:25,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1597826326, now seen corresponding path program 2 times [2024-06-14 15:21:25,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:21:25,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181583801] [2024-06-14 15:21:25,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:21:25,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:21:25,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:21:36,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:21:36,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:21:36,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181583801] [2024-06-14 15:21:36,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181583801] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:21:36,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:21:36,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:21:36,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146489393] [2024-06-14 15:21:36,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:21:36,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:21:36,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:21:36,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:21:36,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:21:36,327 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-14 15:21:36,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 87 transitions, 608 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 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-14 15:21:36,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:21:36,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-14 15:21:36,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:21:37,841 INFO L124 PetriNetUnfolderBase]: 1995/3063 cut-off events. [2024-06-14 15:21:37,841 INFO L125 PetriNetUnfolderBase]: For 19179/19183 co-relation queries the response was YES. [2024-06-14 15:21:37,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13231 conditions, 3063 events. 1995/3063 cut-off events. For 19179/19183 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 14672 event pairs, 719 based on Foata normal form. 6/3068 useless extension candidates. Maximal degree in co-relation 13199. Up to 2856 conditions per place. [2024-06-14 15:21:37,889 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 87 selfloop transitions, 26 changer transitions 0/117 dead transitions. [2024-06-14 15:21:37,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 117 transitions, 1006 flow [2024-06-14 15:21:37,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:21:37,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:21:37,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions. [2024-06-14 15:21:37,891 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44518272425249167 [2024-06-14 15:21:37,891 INFO L175 Difference]: Start difference. First operand has 75 places, 87 transitions, 608 flow. Second operand 7 states and 134 transitions. [2024-06-14 15:21:37,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 117 transitions, 1006 flow [2024-06-14 15:21:37,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 117 transitions, 964 flow, removed 17 selfloop flow, removed 2 redundant places. [2024-06-14 15:21:37,921 INFO L231 Difference]: Finished difference. Result has 80 places, 93 transitions, 708 flow [2024-06-14 15:21:37,922 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=708, PETRI_PLACES=80, PETRI_TRANSITIONS=93} [2024-06-14 15:21:37,922 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 36 predicate places. [2024-06-14 15:21:37,922 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 93 transitions, 708 flow [2024-06-14 15:21:37,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 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-14 15:21:37,923 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:21:37,923 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:21:37,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-14 15:21:37,923 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-14 15:21:37,923 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:21:37,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1208009504, now seen corresponding path program 2 times [2024-06-14 15:21:37,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:21:37,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453119630] [2024-06-14 15:21:37,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:21:37,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:21:37,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:21:48,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:21:48,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:21:48,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453119630] [2024-06-14 15:21:48,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453119630] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:21:48,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:21:48,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:21:48,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338602077] [2024-06-14 15:21:48,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:21:48,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:21:48,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:21:48,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:21:48,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:21:48,959 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-14 15:21:48,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 93 transitions, 708 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 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-14 15:21:48,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:21:48,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-14 15:21:48,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:21:50,431 INFO L124 PetriNetUnfolderBase]: 2031/3112 cut-off events. [2024-06-14 15:21:50,431 INFO L125 PetriNetUnfolderBase]: For 23458/23458 co-relation queries the response was YES. [2024-06-14 15:21:50,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14090 conditions, 3112 events. 2031/3112 cut-off events. For 23458/23458 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 14906 event pairs, 701 based on Foata normal form. 6/3118 useless extension candidates. Maximal degree in co-relation 14056. Up to 2931 conditions per place. [2024-06-14 15:21:50,446 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 96 selfloop transitions, 23 changer transitions 0/123 dead transitions. [2024-06-14 15:21:50,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 123 transitions, 1096 flow [2024-06-14 15:21:50,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:21:50,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:21:50,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 157 transitions. [2024-06-14 15:21:50,465 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40568475452196384 [2024-06-14 15:21:50,465 INFO L175 Difference]: Start difference. First operand has 80 places, 93 transitions, 708 flow. Second operand 9 states and 157 transitions. [2024-06-14 15:21:50,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 123 transitions, 1096 flow [2024-06-14 15:21:50,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 123 transitions, 1044 flow, removed 18 selfloop flow, removed 3 redundant places. [2024-06-14 15:21:50,486 INFO L231 Difference]: Finished difference. Result has 87 places, 99 transitions, 777 flow [2024-06-14 15:21:50,487 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=656, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=777, PETRI_PLACES=87, PETRI_TRANSITIONS=99} [2024-06-14 15:21:50,489 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 43 predicate places. [2024-06-14 15:21:50,489 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 99 transitions, 777 flow [2024-06-14 15:21:50,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 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-14 15:21:50,489 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:21:50,490 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:21:50,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-14 15:21:50,490 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:21:50,490 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:21:50,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1076919608, now seen corresponding path program 3 times [2024-06-14 15:21:50,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:21:50,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889796728] [2024-06-14 15:21:50,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:21:50,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:21:50,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:22:01,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:22:01,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:22:01,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889796728] [2024-06-14 15:22:01,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889796728] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:22:01,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:22:01,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:22:01,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415497518] [2024-06-14 15:22:01,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:22:01,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:22:01,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:22:01,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:22:01,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:22:01,201 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-14 15:22:01,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 99 transitions, 777 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 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-14 15:22:01,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:22:01,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-14 15:22:01,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:22:02,721 INFO L124 PetriNetUnfolderBase]: 2026/3107 cut-off events. [2024-06-14 15:22:02,722 INFO L125 PetriNetUnfolderBase]: For 26324/26324 co-relation queries the response was YES. [2024-06-14 15:22:02,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14524 conditions, 3107 events. 2026/3107 cut-off events. For 26324/26324 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 14848 event pairs, 712 based on Foata normal form. 2/3108 useless extension candidates. Maximal degree in co-relation 14487. Up to 2960 conditions per place. [2024-06-14 15:22:02,738 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 100 selfloop transitions, 14 changer transitions 0/118 dead transitions. [2024-06-14 15:22:02,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 118 transitions, 1053 flow [2024-06-14 15:22:02,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:22:02,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:22:02,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions. [2024-06-14 15:22:02,740 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4152823920265781 [2024-06-14 15:22:02,740 INFO L175 Difference]: Start difference. First operand has 87 places, 99 transitions, 777 flow. Second operand 7 states and 125 transitions. [2024-06-14 15:22:02,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 118 transitions, 1053 flow [2024-06-14 15:22:02,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 118 transitions, 972 flow, removed 21 selfloop flow, removed 6 redundant places. [2024-06-14 15:22:02,757 INFO L231 Difference]: Finished difference. Result has 88 places, 99 transitions, 732 flow [2024-06-14 15:22:02,757 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=696, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=732, PETRI_PLACES=88, PETRI_TRANSITIONS=99} [2024-06-14 15:22:02,757 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 44 predicate places. [2024-06-14 15:22:02,758 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 99 transitions, 732 flow [2024-06-14 15:22:02,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 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-14 15:22:02,758 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:22:02,758 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:22:02,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-14 15:22:02,758 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:22:02,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:22:02,759 INFO L85 PathProgramCache]: Analyzing trace with hash -190339262, now seen corresponding path program 3 times [2024-06-14 15:22:02,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:22:02,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378389846] [2024-06-14 15:22:02,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:22:02,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:22:02,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:22:13,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:22:13,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:22:13,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378389846] [2024-06-14 15:22:13,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378389846] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:22:13,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:22:13,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:22:13,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335803565] [2024-06-14 15:22:13,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:22:13,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:22:13,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:22:13,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:22:13,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:22:13,254 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-14 15:22:13,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 99 transitions, 732 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 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-14 15:22:13,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:22:13,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-14 15:22:13,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:22:14,774 INFO L124 PetriNetUnfolderBase]: 2030/3111 cut-off events. [2024-06-14 15:22:14,775 INFO L125 PetriNetUnfolderBase]: For 29046/29046 co-relation queries the response was YES. [2024-06-14 15:22:14,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14650 conditions, 3111 events. 2030/3111 cut-off events. For 29046/29046 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 14882 event pairs, 701 based on Foata normal form. 6/3117 useless extension candidates. Maximal degree in co-relation 14612. Up to 2870 conditions per place. [2024-06-14 15:22:14,790 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 101 selfloop transitions, 30 changer transitions 0/135 dead transitions. [2024-06-14 15:22:14,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 135 transitions, 1217 flow [2024-06-14 15:22:14,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:22:14,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:22:14,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 164 transitions. [2024-06-14 15:22:14,791 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42377260981912146 [2024-06-14 15:22:14,791 INFO L175 Difference]: Start difference. First operand has 88 places, 99 transitions, 732 flow. Second operand 9 states and 164 transitions. [2024-06-14 15:22:14,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 135 transitions, 1217 flow [2024-06-14 15:22:14,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 135 transitions, 1173 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-14 15:22:14,810 INFO L231 Difference]: Finished difference. Result has 92 places, 106 transitions, 856 flow [2024-06-14 15:22:14,810 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=688, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=856, PETRI_PLACES=92, PETRI_TRANSITIONS=106} [2024-06-14 15:22:14,811 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 48 predicate places. [2024-06-14 15:22:14,812 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 106 transitions, 856 flow [2024-06-14 15:22:14,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 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-14 15:22:14,812 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:22:14,812 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:22:14,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-14 15:22:14,813 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:22:14,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:22:14,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1420448542, now seen corresponding path program 1 times [2024-06-14 15:22:14,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:22:14,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759530258] [2024-06-14 15:22:14,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:22:14,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:22:14,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:22:27,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:22:27,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:22:27,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759530258] [2024-06-14 15:22:27,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759530258] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:22:27,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:22:27,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:22:27,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066862845] [2024-06-14 15:22:27,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:22:27,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:22:27,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:22:27,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:22:27,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:22:28,150 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-14 15:22:28,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 106 transitions, 856 flow. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:22:28,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:22:28,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-14 15:22:28,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:22:29,670 INFO L124 PetriNetUnfolderBase]: 2033/3115 cut-off events. [2024-06-14 15:22:29,670 INFO L125 PetriNetUnfolderBase]: For 33600/33600 co-relation queries the response was YES. [2024-06-14 15:22:29,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15265 conditions, 3115 events. 2033/3115 cut-off events. For 33600/33600 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 14885 event pairs, 678 based on Foata normal form. 6/3121 useless extension candidates. Maximal degree in co-relation 15225. Up to 2915 conditions per place. [2024-06-14 15:22:29,685 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 102 selfloop transitions, 27 changer transitions 0/133 dead transitions. [2024-06-14 15:22:29,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 133 transitions, 1264 flow [2024-06-14 15:22:29,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:22:29,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:22:29,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 158 transitions. [2024-06-14 15:22:29,687 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4082687338501292 [2024-06-14 15:22:29,687 INFO L175 Difference]: Start difference. First operand has 92 places, 106 transitions, 856 flow. Second operand 9 states and 158 transitions. [2024-06-14 15:22:29,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 133 transitions, 1264 flow [2024-06-14 15:22:29,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 133 transitions, 1207 flow, removed 17 selfloop flow, removed 5 redundant places. [2024-06-14 15:22:29,708 INFO L231 Difference]: Finished difference. Result has 96 places, 109 transitions, 907 flow [2024-06-14 15:22:29,708 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=799, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=907, PETRI_PLACES=96, PETRI_TRANSITIONS=109} [2024-06-14 15:22:29,709 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 52 predicate places. [2024-06-14 15:22:29,709 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 109 transitions, 907 flow [2024-06-14 15:22:29,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:22:29,709 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:22:29,709 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:22:29,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-14 15:22:29,710 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:22:29,710 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:22:29,710 INFO L85 PathProgramCache]: Analyzing trace with hash 2030036270, now seen corresponding path program 1 times [2024-06-14 15:22:29,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:22:29,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162518401] [2024-06-14 15:22:29,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:22:29,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:22:29,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:22:46,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:22:46,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:22:46,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162518401] [2024-06-14 15:22:46,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162518401] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:22:46,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:22:46,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:22:46,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718338625] [2024-06-14 15:22:46,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:22:46,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:22:46,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:22:46,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:22:46,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:22:46,214 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-14 15:22:46,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 109 transitions, 907 flow. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:22:46,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:22:46,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-14 15:22:46,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:22:47,602 INFO L124 PetriNetUnfolderBase]: 1904/2985 cut-off events. [2024-06-14 15:22:47,602 INFO L125 PetriNetUnfolderBase]: For 36217/36217 co-relation queries the response was YES. [2024-06-14 15:22:47,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15148 conditions, 2985 events. 1904/2985 cut-off events. For 36217/36217 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 14714 event pairs, 703 based on Foata normal form. 1/2986 useless extension candidates. Maximal degree in co-relation 15106. Up to 2769 conditions per place. [2024-06-14 15:22:47,626 INFO L140 encePairwiseOnDemand]: 36/43 looper letters, 95 selfloop transitions, 8 changer transitions 0/117 dead transitions. [2024-06-14 15:22:47,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 117 transitions, 1133 flow [2024-06-14 15:22:47,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 15:22:47,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 15:22:47,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 93 transitions. [2024-06-14 15:22:47,629 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4325581395348837 [2024-06-14 15:22:47,629 INFO L175 Difference]: Start difference. First operand has 96 places, 109 transitions, 907 flow. Second operand 5 states and 93 transitions. [2024-06-14 15:22:47,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 117 transitions, 1133 flow [2024-06-14 15:22:47,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 117 transitions, 1037 flow, removed 23 selfloop flow, removed 7 redundant places. [2024-06-14 15:22:47,656 INFO L231 Difference]: Finished difference. Result has 94 places, 109 transitions, 833 flow [2024-06-14 15:22:47,657 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=811, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=833, PETRI_PLACES=94, PETRI_TRANSITIONS=109} [2024-06-14 15:22:47,658 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 50 predicate places. [2024-06-14 15:22:47,658 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 109 transitions, 833 flow [2024-06-14 15:22:47,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:22:47,658 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:22:47,658 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:22:47,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-14 15:22:47,660 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:22:47,660 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:22:47,661 INFO L85 PathProgramCache]: Analyzing trace with hash 2003183379, now seen corresponding path program 1 times [2024-06-14 15:22:47,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:22:47,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31876442] [2024-06-14 15:22:47,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:22:47,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:22:47,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:23:01,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:23:01,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:23:01,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31876442] [2024-06-14 15:23:01,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31876442] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:23:01,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:23:01,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:23:01,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159991299] [2024-06-14 15:23:01,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:23:01,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:23:01,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:23:01,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:23:01,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:23:01,868 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-14 15:23:01,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 109 transitions, 833 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 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-14 15:23:01,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:23:01,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-14 15:23:01,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:23:03,467 INFO L124 PetriNetUnfolderBase]: 2057/3150 cut-off events. [2024-06-14 15:23:03,467 INFO L125 PetriNetUnfolderBase]: For 40317/40317 co-relation queries the response was YES. [2024-06-14 15:23:03,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16081 conditions, 3150 events. 2057/3150 cut-off events. For 40317/40317 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 15012 event pairs, 682 based on Foata normal form. 2/3152 useless extension candidates. Maximal degree in co-relation 16038. Up to 2950 conditions per place. [2024-06-14 15:23:03,484 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 117 selfloop transitions, 25 changer transitions 0/146 dead transitions. [2024-06-14 15:23:03,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 146 transitions, 1349 flow [2024-06-14 15:23:03,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:23:03,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:23:03,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2024-06-14 15:23:03,486 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4418604651162791 [2024-06-14 15:23:03,486 INFO L175 Difference]: Start difference. First operand has 94 places, 109 transitions, 833 flow. Second operand 8 states and 152 transitions. [2024-06-14 15:23:03,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 146 transitions, 1349 flow [2024-06-14 15:23:03,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 146 transitions, 1333 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-14 15:23:03,508 INFO L231 Difference]: Finished difference. Result has 98 places, 115 transitions, 977 flow [2024-06-14 15:23:03,509 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=817, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=977, PETRI_PLACES=98, PETRI_TRANSITIONS=115} [2024-06-14 15:23:03,509 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 54 predicate places. [2024-06-14 15:23:03,509 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 115 transitions, 977 flow [2024-06-14 15:23:03,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 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-14 15:23:03,509 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:23:03,510 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:23:03,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-14 15:23:03,510 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-14 15:23:03,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:23:03,510 INFO L85 PathProgramCache]: Analyzing trace with hash 2003273589, now seen corresponding path program 2 times [2024-06-14 15:23:03,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:23:03,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707775806] [2024-06-14 15:23:03,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:23:03,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:23:03,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:23:16,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:23:16,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:23:16,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707775806] [2024-06-14 15:23:16,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707775806] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:23:16,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:23:16,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:23:16,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162352287] [2024-06-14 15:23:16,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:23:16,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:23:16,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:23:16,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:23:16,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:23:16,768 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-14 15:23:16,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 115 transitions, 977 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 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-14 15:23:16,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:23:16,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-14 15:23:16,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:23:18,176 INFO L124 PetriNetUnfolderBase]: 2052/3143 cut-off events. [2024-06-14 15:23:18,176 INFO L125 PetriNetUnfolderBase]: For 45634/45634 co-relation queries the response was YES. [2024-06-14 15:23:18,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16696 conditions, 3143 events. 2052/3143 cut-off events. For 45634/45634 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 14992 event pairs, 682 based on Foata normal form. 2/3145 useless extension candidates. Maximal degree in co-relation 16652. Up to 2969 conditions per place. [2024-06-14 15:23:18,212 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 114 selfloop transitions, 19 changer transitions 0/137 dead transitions. [2024-06-14 15:23:18,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 137 transitions, 1299 flow [2024-06-14 15:23:18,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:23:18,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:23:18,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 130 transitions. [2024-06-14 15:23:18,214 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4318936877076412 [2024-06-14 15:23:18,214 INFO L175 Difference]: Start difference. First operand has 98 places, 115 transitions, 977 flow. Second operand 7 states and 130 transitions. [2024-06-14 15:23:18,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 137 transitions, 1299 flow [2024-06-14 15:23:18,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 137 transitions, 1199 flow, removed 40 selfloop flow, removed 4 redundant places. [2024-06-14 15:23:18,242 INFO L231 Difference]: Finished difference. Result has 101 places, 115 transitions, 923 flow [2024-06-14 15:23:18,242 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=877, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=923, PETRI_PLACES=101, PETRI_TRANSITIONS=115} [2024-06-14 15:23:18,243 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 57 predicate places. [2024-06-14 15:23:18,244 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 115 transitions, 923 flow [2024-06-14 15:23:18,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 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-14 15:23:18,244 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:23:18,244 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:23:18,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-14 15:23:18,244 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:23:18,245 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:23:18,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1291310598, now seen corresponding path program 1 times [2024-06-14 15:23:18,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:23:18,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905997209] [2024-06-14 15:23:18,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:23:18,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:23:18,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:23:28,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:23:28,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:23:28,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905997209] [2024-06-14 15:23:28,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905997209] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:23:28,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:23:28,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:23:28,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125265364] [2024-06-14 15:23:28,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:23:28,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:23:28,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:23:28,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:23:28,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:23:29,098 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-14 15:23:29,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 115 transitions, 923 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 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-14 15:23:29,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:23:29,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-14 15:23:29,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:23:30,758 INFO L124 PetriNetUnfolderBase]: 2112/3216 cut-off events. [2024-06-14 15:23:30,758 INFO L125 PetriNetUnfolderBase]: For 50945/50945 co-relation queries the response was YES. [2024-06-14 15:23:30,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17349 conditions, 3216 events. 2112/3216 cut-off events. For 50945/50945 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 15335 event pairs, 664 based on Foata normal form. 6/3220 useless extension candidates. Maximal degree in co-relation 17303. Up to 3012 conditions per place. [2024-06-14 15:23:30,781 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 129 selfloop transitions, 28 changer transitions 0/161 dead transitions. [2024-06-14 15:23:30,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 161 transitions, 1551 flow [2024-06-14 15:23:30,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:23:30,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:23:30,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions. [2024-06-14 15:23:30,783 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4392764857881137 [2024-06-14 15:23:30,783 INFO L175 Difference]: Start difference. First operand has 101 places, 115 transitions, 923 flow. Second operand 9 states and 170 transitions. [2024-06-14 15:23:30,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 161 transitions, 1551 flow [2024-06-14 15:23:30,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 161 transitions, 1505 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-14 15:23:30,815 INFO L231 Difference]: Finished difference. Result has 106 places, 126 transitions, 1093 flow [2024-06-14 15:23:30,815 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=877, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1093, PETRI_PLACES=106, PETRI_TRANSITIONS=126} [2024-06-14 15:23:30,815 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 62 predicate places. [2024-06-14 15:23:30,816 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 126 transitions, 1093 flow [2024-06-14 15:23:30,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 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-14 15:23:30,816 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:23:30,816 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:23:30,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-14 15:23:30,816 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:23:30,832 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:23:30,832 INFO L85 PathProgramCache]: Analyzing trace with hash 2006992814, now seen corresponding path program 2 times [2024-06-14 15:23:30,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:23:30,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297548003] [2024-06-14 15:23:30,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:23:30,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:23:30,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:23:41,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-14 15:23:41,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:23:41,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297548003] [2024-06-14 15:23:41,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297548003] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:23:41,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:23:41,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:23:41,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522608474] [2024-06-14 15:23:41,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:23:41,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:23:41,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:23:41,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:23:41,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:23:41,765 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-14 15:23:41,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 126 transitions, 1093 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 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-14 15:23:41,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:23:41,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-14 15:23:41,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:23:43,540 INFO L124 PetriNetUnfolderBase]: 2228/3381 cut-off events. [2024-06-14 15:23:43,541 INFO L125 PetriNetUnfolderBase]: For 61525/61531 co-relation queries the response was YES. [2024-06-14 15:23:43,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19507 conditions, 3381 events. 2228/3381 cut-off events. For 61525/61531 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 16141 event pairs, 649 based on Foata normal form. 12/3391 useless extension candidates. Maximal degree in co-relation 19458. Up to 2812 conditions per place. [2024-06-14 15:23:43,566 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 119 selfloop transitions, 57 changer transitions 0/180 dead transitions. [2024-06-14 15:23:43,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 180 transitions, 1981 flow [2024-06-14 15:23:43,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:23:43,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:23:43,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 184 transitions. [2024-06-14 15:23:43,568 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4754521963824289 [2024-06-14 15:23:43,568 INFO L175 Difference]: Start difference. First operand has 106 places, 126 transitions, 1093 flow. Second operand 9 states and 184 transitions. [2024-06-14 15:23:43,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 180 transitions, 1981 flow [2024-06-14 15:23:43,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 180 transitions, 1863 flow, removed 35 selfloop flow, removed 5 redundant places. [2024-06-14 15:23:43,609 INFO L231 Difference]: Finished difference. Result has 111 places, 137 transitions, 1255 flow [2024-06-14 15:23:43,610 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=975, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1255, PETRI_PLACES=111, PETRI_TRANSITIONS=137} [2024-06-14 15:23:43,610 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 67 predicate places. [2024-06-14 15:23:43,610 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 137 transitions, 1255 flow [2024-06-14 15:23:43,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 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-14 15:23:43,610 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:23:43,610 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:23:43,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-14 15:23:43,611 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:23:43,611 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:23:43,611 INFO L85 PathProgramCache]: Analyzing trace with hash 831341203, now seen corresponding path program 3 times [2024-06-14 15:23:43,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:23:43,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262739861] [2024-06-14 15:23:43,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:23:43,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:23:43,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:23:56,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:23:56,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:23:56,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262739861] [2024-06-14 15:23:56,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262739861] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:23:56,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:23:56,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:23:56,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733639034] [2024-06-14 15:23:56,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:23:56,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:23:56,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:23:56,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:23:56,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:23:56,807 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-14 15:23:56,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 137 transitions, 1255 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 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-14 15:23:56,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:23:56,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-14 15:23:56,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:23:58,437 INFO L124 PetriNetUnfolderBase]: 2239/3403 cut-off events. [2024-06-14 15:23:58,438 INFO L125 PetriNetUnfolderBase]: For 69425/69425 co-relation queries the response was YES. [2024-06-14 15:23:58,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20585 conditions, 3403 events. 2239/3403 cut-off events. For 69425/69425 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 16280 event pairs, 695 based on Foata normal form. 2/3402 useless extension candidates. Maximal degree in co-relation 20534. Up to 3199 conditions per place. [2024-06-14 15:23:58,460 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 136 selfloop transitions, 30 changer transitions 0/170 dead transitions. [2024-06-14 15:23:58,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 170 transitions, 1725 flow [2024-06-14 15:23:58,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:23:58,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:23:58,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 163 transitions. [2024-06-14 15:23:58,462 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42118863049095606 [2024-06-14 15:23:58,462 INFO L175 Difference]: Start difference. First operand has 111 places, 137 transitions, 1255 flow. Second operand 9 states and 163 transitions. [2024-06-14 15:23:58,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 170 transitions, 1725 flow [2024-06-14 15:23:58,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 170 transitions, 1604 flow, removed 42 selfloop flow, removed 4 redundant places. [2024-06-14 15:23:58,508 INFO L231 Difference]: Finished difference. Result has 116 places, 140 transitions, 1270 flow [2024-06-14 15:23:58,508 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1134, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1270, PETRI_PLACES=116, PETRI_TRANSITIONS=140} [2024-06-14 15:23:58,508 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 72 predicate places. [2024-06-14 15:23:58,508 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 140 transitions, 1270 flow [2024-06-14 15:23:58,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 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-14 15:23:58,509 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:23:58,509 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:23:58,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-14 15:23:58,509 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:23:58,509 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:23:58,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1164749584, now seen corresponding path program 3 times [2024-06-14 15:23:58,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:23:58,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809332697] [2024-06-14 15:23:58,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:23:58,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:23:58,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:24:09,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:24:09,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:24:09,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809332697] [2024-06-14 15:24:09,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809332697] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:24:09,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:24:09,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:24:09,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919908384] [2024-06-14 15:24:09,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:24:09,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:24:09,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:24:09,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:24:09,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:24:09,874 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-14 15:24:09,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 140 transitions, 1270 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 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-14 15:24:09,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:24:09,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-14 15:24:09,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:24:11,745 INFO L124 PetriNetUnfolderBase]: 2243/3403 cut-off events. [2024-06-14 15:24:11,745 INFO L125 PetriNetUnfolderBase]: For 74539/74545 co-relation queries the response was YES. [2024-06-14 15:24:11,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20611 conditions, 3403 events. 2243/3403 cut-off events. For 74539/74545 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 16253 event pairs, 638 based on Foata normal form. 12/3413 useless extension candidates. Maximal degree in co-relation 20558. Up to 2837 conditions per place. [2024-06-14 15:24:11,769 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 115 selfloop transitions, 65 changer transitions 0/184 dead transitions. [2024-06-14 15:24:11,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 184 transitions, 2007 flow [2024-06-14 15:24:11,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:24:11,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:24:11,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 182 transitions. [2024-06-14 15:24:11,771 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4702842377260982 [2024-06-14 15:24:11,771 INFO L175 Difference]: Start difference. First operand has 116 places, 140 transitions, 1270 flow. Second operand 9 states and 182 transitions. [2024-06-14 15:24:11,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 184 transitions, 2007 flow [2024-06-14 15:24:11,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 184 transitions, 1895 flow, removed 28 selfloop flow, removed 7 redundant places. [2024-06-14 15:24:11,822 INFO L231 Difference]: Finished difference. Result has 118 places, 144 transitions, 1358 flow [2024-06-14 15:24:11,822 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1158, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1358, PETRI_PLACES=118, PETRI_TRANSITIONS=144} [2024-06-14 15:24:11,822 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 74 predicate places. [2024-06-14 15:24:11,822 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 144 transitions, 1358 flow [2024-06-14 15:24:11,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 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-14 15:24:11,823 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:24:11,823 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:24:11,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-14 15:24:11,823 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-14 15:24:11,824 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:24:11,824 INFO L85 PathProgramCache]: Analyzing trace with hash -493420863, now seen corresponding path program 4 times [2024-06-14 15:24:11,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:24:11,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049328522] [2024-06-14 15:24:11,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:24:11,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:24:11,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:24:24,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:24:24,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:24:24,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049328522] [2024-06-14 15:24:24,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049328522] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:24:24,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:24:24,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:24:24,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873924059] [2024-06-14 15:24:24,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:24:24,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:24:24,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:24:24,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:24:24,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:24:24,701 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-14 15:24:24,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 144 transitions, 1358 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 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-14 15:24:24,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:24:24,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-14 15:24:24,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:24:26,291 INFO L124 PetriNetUnfolderBase]: 2238/3402 cut-off events. [2024-06-14 15:24:26,292 INFO L125 PetriNetUnfolderBase]: For 79258/79258 co-relation queries the response was YES. [2024-06-14 15:24:26,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21093 conditions, 3402 events. 2238/3402 cut-off events. For 79258/79258 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 16296 event pairs, 696 based on Foata normal form. 2/3401 useless extension candidates. Maximal degree in co-relation 21039. Up to 3255 conditions per place. [2024-06-14 15:24:26,315 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 149 selfloop transitions, 17 changer transitions 0/170 dead transitions. [2024-06-14 15:24:26,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 170 transitions, 1818 flow [2024-06-14 15:24:26,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:24:26,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:24:26,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2024-06-14 15:24:26,316 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40988372093023256 [2024-06-14 15:24:26,316 INFO L175 Difference]: Start difference. First operand has 118 places, 144 transitions, 1358 flow. Second operand 8 states and 141 transitions. [2024-06-14 15:24:26,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 170 transitions, 1818 flow [2024-06-14 15:24:26,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 170 transitions, 1675 flow, removed 21 selfloop flow, removed 6 redundant places. [2024-06-14 15:24:26,364 INFO L231 Difference]: Finished difference. Result has 120 places, 147 transitions, 1333 flow [2024-06-14 15:24:26,364 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1215, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1333, PETRI_PLACES=120, PETRI_TRANSITIONS=147} [2024-06-14 15:24:26,364 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 76 predicate places. [2024-06-14 15:24:26,365 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 147 transitions, 1333 flow [2024-06-14 15:24:26,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 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-14 15:24:26,365 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:24:26,365 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:24:26,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-14 15:24:26,365 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:24:26,366 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:24:26,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1605548644, now seen corresponding path program 4 times [2024-06-14 15:24:26,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:24:26,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839373776] [2024-06-14 15:24:26,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:24:26,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:24:26,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:24:37,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:24:37,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:24:37,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839373776] [2024-06-14 15:24:37,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839373776] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:24:37,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:24:37,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:24:37,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887268695] [2024-06-14 15:24:37,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:24:37,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:24:37,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:24:37,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:24:37,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:24:37,570 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-14 15:24:37,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 147 transitions, 1333 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 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-14 15:24:37,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:24:37,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-14 15:24:37,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:24:39,243 INFO L124 PetriNetUnfolderBase]: 2322/3522 cut-off events. [2024-06-14 15:24:39,243 INFO L125 PetriNetUnfolderBase]: For 90260/90260 co-relation queries the response was YES. [2024-06-14 15:24:39,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22147 conditions, 3522 events. 2322/3522 cut-off events. For 90260/90260 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 16916 event pairs, 688 based on Foata normal form. 6/3525 useless extension candidates. Maximal degree in co-relation 22092. Up to 3142 conditions per place. [2024-06-14 15:24:39,276 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 148 selfloop transitions, 41 changer transitions 0/193 dead transitions. [2024-06-14 15:24:39,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 193 transitions, 2225 flow [2024-06-14 15:24:39,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:24:39,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:24:39,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 186 transitions. [2024-06-14 15:24:39,277 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4325581395348837 [2024-06-14 15:24:39,277 INFO L175 Difference]: Start difference. First operand has 120 places, 147 transitions, 1333 flow. Second operand 10 states and 186 transitions. [2024-06-14 15:24:39,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 193 transitions, 2225 flow [2024-06-14 15:24:39,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 193 transitions, 2127 flow, removed 34 selfloop flow, removed 6 redundant places. [2024-06-14 15:24:39,327 INFO L231 Difference]: Finished difference. Result has 126 places, 156 transitions, 1528 flow [2024-06-14 15:24:39,327 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1235, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1528, PETRI_PLACES=126, PETRI_TRANSITIONS=156} [2024-06-14 15:24:39,328 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 82 predicate places. [2024-06-14 15:24:39,328 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 156 transitions, 1528 flow [2024-06-14 15:24:39,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 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-14 15:24:39,328 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:24:39,328 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:24:39,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-14 15:24:39,328 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-14 15:24:39,329 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:24:39,329 INFO L85 PathProgramCache]: Analyzing trace with hash 508144494, now seen corresponding path program 5 times [2024-06-14 15:24:39,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:24:39,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398898090] [2024-06-14 15:24:39,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:24:39,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:24:39,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:24:49,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:24:49,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:24:49,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398898090] [2024-06-14 15:24:49,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398898090] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:24:49,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:24:49,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:24:49,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165042889] [2024-06-14 15:24:49,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:24:49,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:24:49,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:24:49,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:24:49,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:24:49,971 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-14 15:24:49,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 156 transitions, 1528 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 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-14 15:24:49,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:24:49,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-14 15:24:49,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:24:51,747 INFO L124 PetriNetUnfolderBase]: 2310/3506 cut-off events. [2024-06-14 15:24:51,748 INFO L125 PetriNetUnfolderBase]: For 97930/97930 co-relation queries the response was YES. [2024-06-14 15:24:51,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22716 conditions, 3506 events. 2310/3506 cut-off events. For 97930/97930 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 16819 event pairs, 682 based on Foata normal form. 6/3509 useless extension candidates. Maximal degree in co-relation 22658. Up to 3136 conditions per place. [2024-06-14 15:24:51,772 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 148 selfloop transitions, 40 changer transitions 0/192 dead transitions. [2024-06-14 15:24:51,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 192 transitions, 2220 flow [2024-06-14 15:24:51,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:24:51,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:24:51,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 184 transitions. [2024-06-14 15:24:51,774 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42790697674418604 [2024-06-14 15:24:51,774 INFO L175 Difference]: Start difference. First operand has 126 places, 156 transitions, 1528 flow. Second operand 10 states and 184 transitions. [2024-06-14 15:24:51,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 192 transitions, 2220 flow [2024-06-14 15:24:51,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 192 transitions, 2005 flow, removed 61 selfloop flow, removed 8 redundant places. [2024-06-14 15:24:51,835 INFO L231 Difference]: Finished difference. Result has 128 places, 156 transitions, 1403 flow [2024-06-14 15:24:51,836 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1313, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1403, PETRI_PLACES=128, PETRI_TRANSITIONS=156} [2024-06-14 15:24:51,836 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 84 predicate places. [2024-06-14 15:24:51,836 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 156 transitions, 1403 flow [2024-06-14 15:24:51,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 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-14 15:24:51,837 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:24:51,837 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:24:51,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-14 15:24:51,837 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:24:51,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:24:51,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1084507428, now seen corresponding path program 6 times [2024-06-14 15:24:51,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:24:51,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601301161] [2024-06-14 15:24:51,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:24:51,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:24:51,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:25:01,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:25:01,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:25:01,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601301161] [2024-06-14 15:25:01,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601301161] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:25:01,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:25:01,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:25:01,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918616320] [2024-06-14 15:25:01,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:25:01,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:25:01,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:25:01,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:25:01,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:25:02,154 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-14 15:25:02,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 156 transitions, 1403 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 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-14 15:25:02,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:25:02,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-14 15:25:02,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:25:03,720 INFO L124 PetriNetUnfolderBase]: 2314/3512 cut-off events. [2024-06-14 15:25:03,720 INFO L125 PetriNetUnfolderBase]: For 99710/99710 co-relation queries the response was YES. [2024-06-14 15:25:03,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22404 conditions, 3512 events. 2314/3512 cut-off events. For 99710/99710 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 16852 event pairs, 689 based on Foata normal form. 6/3515 useless extension candidates. Maximal degree in co-relation 22346. Up to 3306 conditions per place. [2024-06-14 15:25:03,745 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 157 selfloop transitions, 27 changer transitions 0/188 dead transitions. [2024-06-14 15:25:03,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 188 transitions, 1968 flow [2024-06-14 15:25:03,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:25:03,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:25:03,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 174 transitions. [2024-06-14 15:25:03,747 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4046511627906977 [2024-06-14 15:25:03,747 INFO L175 Difference]: Start difference. First operand has 128 places, 156 transitions, 1403 flow. Second operand 10 states and 174 transitions. [2024-06-14 15:25:03,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 188 transitions, 1968 flow [2024-06-14 15:25:03,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 188 transitions, 1864 flow, removed 8 selfloop flow, removed 9 redundant places. [2024-06-14 15:25:03,811 INFO L231 Difference]: Finished difference. Result has 129 places, 160 transitions, 1447 flow [2024-06-14 15:25:03,811 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1306, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1447, PETRI_PLACES=129, PETRI_TRANSITIONS=160} [2024-06-14 15:25:03,811 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 85 predicate places. [2024-06-14 15:25:03,811 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 160 transitions, 1447 flow [2024-06-14 15:25:03,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 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-14 15:25:03,812 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:25:03,812 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:25:03,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-14 15:25:03,812 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-14 15:25:03,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:25:03,812 INFO L85 PathProgramCache]: Analyzing trace with hash 515768851, now seen corresponding path program 1 times [2024-06-14 15:25:03,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:25:03,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712724689] [2024-06-14 15:25:03,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:25:03,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:25:03,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:25:14,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:25:14,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:25:14,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712724689] [2024-06-14 15:25:14,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712724689] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:25:14,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:25:14,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:25:14,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788512051] [2024-06-14 15:25:14,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:25:14,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:25:14,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:25:14,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:25:14,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:25:14,500 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-14 15:25:14,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 160 transitions, 1447 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 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-14 15:25:14,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:25:14,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-14 15:25:14,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:25:16,138 INFO L124 PetriNetUnfolderBase]: 2316/3520 cut-off events. [2024-06-14 15:25:16,138 INFO L125 PetriNetUnfolderBase]: For 104751/104751 co-relation queries the response was YES. [2024-06-14 15:25:16,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22532 conditions, 3520 events. 2316/3520 cut-off events. For 104751/104751 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 16921 event pairs, 676 based on Foata normal form. 3/3523 useless extension candidates. Maximal degree in co-relation 22474. Up to 3310 conditions per place. [2024-06-14 15:25:16,160 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 151 selfloop transitions, 30 changer transitions 0/185 dead transitions. [2024-06-14 15:25:16,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 185 transitions, 1983 flow [2024-06-14 15:25:16,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:25:16,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:25:16,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions. [2024-06-14 15:25:16,161 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44518272425249167 [2024-06-14 15:25:16,161 INFO L175 Difference]: Start difference. First operand has 129 places, 160 transitions, 1447 flow. Second operand 7 states and 134 transitions. [2024-06-14 15:25:16,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 185 transitions, 1983 flow [2024-06-14 15:25:16,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 185 transitions, 1884 flow, removed 25 selfloop flow, removed 8 redundant places. [2024-06-14 15:25:16,226 INFO L231 Difference]: Finished difference. Result has 128 places, 164 transitions, 1500 flow [2024-06-14 15:25:16,227 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1348, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1500, PETRI_PLACES=128, PETRI_TRANSITIONS=164} [2024-06-14 15:25:16,227 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 84 predicate places. [2024-06-14 15:25:16,227 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 164 transitions, 1500 flow [2024-06-14 15:25:16,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 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-14 15:25:16,227 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:25:16,228 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:25:16,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-14 15:25:16,228 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:25:16,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:25:16,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1477671676, now seen corresponding path program 1 times [2024-06-14 15:25:16,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:25:16,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694612561] [2024-06-14 15:25:16,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:25:16,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:25:16,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:25:34,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:25:34,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:25:34,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694612561] [2024-06-14 15:25:34,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694612561] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:25:34,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:25:34,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:25:34,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516885306] [2024-06-14 15:25:34,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:25:34,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:25:34,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:25:34,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:25:34,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:25:34,573 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-14 15:25:34,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 164 transitions, 1500 flow. Second operand has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:25:34,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:25:34,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-14 15:25:34,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:25:36,262 INFO L124 PetriNetUnfolderBase]: 2394/3578 cut-off events. [2024-06-14 15:25:36,262 INFO L125 PetriNetUnfolderBase]: For 125116/125140 co-relation queries the response was YES. [2024-06-14 15:25:36,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24350 conditions, 3578 events. 2394/3578 cut-off events. For 125116/125140 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 16953 event pairs, 765 based on Foata normal form. 1/3540 useless extension candidates. Maximal degree in co-relation 24291. Up to 3455 conditions per place. [2024-06-14 15:25:36,290 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 151 selfloop transitions, 11 changer transitions 0/176 dead transitions. [2024-06-14 15:25:36,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 176 transitions, 1874 flow [2024-06-14 15:25:36,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:25:36,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:25:36,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2024-06-14 15:25:36,292 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3953488372093023 [2024-06-14 15:25:36,292 INFO L175 Difference]: Start difference. First operand has 128 places, 164 transitions, 1500 flow. Second operand 6 states and 102 transitions. [2024-06-14 15:25:36,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 176 transitions, 1874 flow [2024-06-14 15:25:36,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 176 transitions, 1770 flow, removed 27 selfloop flow, removed 5 redundant places. [2024-06-14 15:25:36,370 INFO L231 Difference]: Finished difference. Result has 129 places, 167 transitions, 1458 flow [2024-06-14 15:25:36,370 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1396, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1458, PETRI_PLACES=129, PETRI_TRANSITIONS=167} [2024-06-14 15:25:36,371 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 85 predicate places. [2024-06-14 15:25:36,371 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 167 transitions, 1458 flow [2024-06-14 15:25:36,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:25:36,371 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:25:36,371 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:25:36,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-14 15:25:36,372 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:25:36,376 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:25:36,377 INFO L85 PathProgramCache]: Analyzing trace with hash 979598911, now seen corresponding path program 1 times [2024-06-14 15:25:36,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:25:36,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957208049] [2024-06-14 15:25:36,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:25:36,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:25:36,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:25:48,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:25:48,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:25:48,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957208049] [2024-06-14 15:25:48,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957208049] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:25:48,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:25:48,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:25:48,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419257431] [2024-06-14 15:25:48,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:25:48,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:25:48,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:25:48,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:25:48,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:25:49,072 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-14 15:25:49,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 167 transitions, 1458 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:25:49,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:25:49,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-14 15:25:49,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:25:50,904 INFO L124 PetriNetUnfolderBase]: 2427/3659 cut-off events. [2024-06-14 15:25:50,904 INFO L125 PetriNetUnfolderBase]: For 137760/137760 co-relation queries the response was YES. [2024-06-14 15:25:50,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25562 conditions, 3659 events. 2427/3659 cut-off events. For 137760/137760 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 17634 event pairs, 542 based on Foata normal form. 4/3663 useless extension candidates. Maximal degree in co-relation 25502. Up to 3376 conditions per place. [2024-06-14 15:25:50,929 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 173 selfloop transitions, 30 changer transitions 0/208 dead transitions. [2024-06-14 15:25:50,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 208 transitions, 2208 flow [2024-06-14 15:25:50,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:25:50,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:25:50,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions. [2024-06-14 15:25:50,933 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43669250645994834 [2024-06-14 15:25:50,933 INFO L175 Difference]: Start difference. First operand has 129 places, 167 transitions, 1458 flow. Second operand 9 states and 169 transitions. [2024-06-14 15:25:50,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 208 transitions, 2208 flow [2024-06-14 15:25:50,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 208 transitions, 2168 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-06-14 15:25:50,999 INFO L231 Difference]: Finished difference. Result has 134 places, 171 transitions, 1637 flow [2024-06-14 15:25:50,999 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1418, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1637, PETRI_PLACES=134, PETRI_TRANSITIONS=171} [2024-06-14 15:25:51,000 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 90 predicate places. [2024-06-14 15:25:51,000 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 171 transitions, 1637 flow [2024-06-14 15:25:51,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:25:51,000 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:25:51,000 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:25:51,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-14 15:25:51,000 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:25:51,001 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:25:51,001 INFO L85 PathProgramCache]: Analyzing trace with hash 979601825, now seen corresponding path program 1 times [2024-06-14 15:25:51,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:25:51,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768600875] [2024-06-14 15:25:51,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:25:51,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:25:51,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:26:04,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:26:04,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:26:04,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768600875] [2024-06-14 15:26:04,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768600875] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:26:04,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:26:04,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:26:04,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133305356] [2024-06-14 15:26:04,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:26:04,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:26:04,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:26:04,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:26:04,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:26:04,600 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-14 15:26:04,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 171 transitions, 1637 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:26:04,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:26:04,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-14 15:26:04,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:26:06,701 INFO L124 PetriNetUnfolderBase]: 2536/3799 cut-off events. [2024-06-14 15:26:06,701 INFO L125 PetriNetUnfolderBase]: For 151446/151446 co-relation queries the response was YES. [2024-06-14 15:26:06,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27170 conditions, 3799 events. 2536/3799 cut-off events. For 151446/151446 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 18229 event pairs, 597 based on Foata normal form. 6/3800 useless extension candidates. Maximal degree in co-relation 27109. Up to 3412 conditions per place. [2024-06-14 15:26:06,726 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 178 selfloop transitions, 56 changer transitions 0/239 dead transitions. [2024-06-14 15:26:06,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 239 transitions, 2775 flow [2024-06-14 15:26:06,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:26:06,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:26:06,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 225 transitions. [2024-06-14 15:26:06,728 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.436046511627907 [2024-06-14 15:26:06,728 INFO L175 Difference]: Start difference. First operand has 134 places, 171 transitions, 1637 flow. Second operand 12 states and 225 transitions. [2024-06-14 15:26:06,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 239 transitions, 2775 flow [2024-06-14 15:26:06,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 239 transitions, 2651 flow, removed 47 selfloop flow, removed 5 redundant places. [2024-06-14 15:26:06,810 INFO L231 Difference]: Finished difference. Result has 146 places, 191 transitions, 1983 flow [2024-06-14 15:26:06,810 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1513, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1983, PETRI_PLACES=146, PETRI_TRANSITIONS=191} [2024-06-14 15:26:06,811 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 102 predicate places. [2024-06-14 15:26:06,811 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 191 transitions, 1983 flow [2024-06-14 15:26:06,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:26:06,811 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:26:06,811 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:26:06,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-14 15:26:06,812 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-14 15:26:06,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:26:06,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1969143849, now seen corresponding path program 2 times [2024-06-14 15:26:06,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:26:06,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975154624] [2024-06-14 15:26:06,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:26:06,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:26:06,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:26:20,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:26:20,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:26:20,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975154624] [2024-06-14 15:26:20,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975154624] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:26:20,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:26:20,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:26:20,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333656474] [2024-06-14 15:26:20,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:26:20,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:26:20,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:26:20,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:26:20,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:26:20,569 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-14 15:26:20,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 191 transitions, 1983 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:26:20,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:26:20,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-14 15:26:20,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:26:22,652 INFO L124 PetriNetUnfolderBase]: 2537/3812 cut-off events. [2024-06-14 15:26:22,652 INFO L125 PetriNetUnfolderBase]: For 164913/164915 co-relation queries the response was YES. [2024-06-14 15:26:22,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28372 conditions, 3812 events. 2537/3812 cut-off events. For 164913/164915 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 18430 event pairs, 677 based on Foata normal form. 4/3811 useless extension candidates. Maximal degree in co-relation 28304. Up to 3608 conditions per place. [2024-06-14 15:26:22,683 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 204 selfloop transitions, 25 changer transitions 0/234 dead transitions. [2024-06-14 15:26:22,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 234 transitions, 2599 flow [2024-06-14 15:26:22,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:26:22,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:26:22,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 183 transitions. [2024-06-14 15:26:22,689 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4255813953488372 [2024-06-14 15:26:22,689 INFO L175 Difference]: Start difference. First operand has 146 places, 191 transitions, 1983 flow. Second operand 10 states and 183 transitions. [2024-06-14 15:26:22,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 234 transitions, 2599 flow [2024-06-14 15:26:22,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 234 transitions, 2475 flow, removed 57 selfloop flow, removed 3 redundant places. [2024-06-14 15:26:22,791 INFO L231 Difference]: Finished difference. Result has 153 places, 193 transitions, 1974 flow [2024-06-14 15:26:22,791 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1859, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1974, PETRI_PLACES=153, PETRI_TRANSITIONS=193} [2024-06-14 15:26:22,792 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 109 predicate places. [2024-06-14 15:26:22,792 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 193 transitions, 1974 flow [2024-06-14 15:26:22,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:26:22,792 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:26:22,792 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:26:22,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-14 15:26:22,793 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-14 15:26:22,793 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:26:22,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1971940359, now seen corresponding path program 3 times [2024-06-14 15:26:22,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:26:22,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281531604] [2024-06-14 15:26:22,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:26:22,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:26:22,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:26:36,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:26:36,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:26:36,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281531604] [2024-06-14 15:26:36,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281531604] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:26:36,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:26:36,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:26:36,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603975999] [2024-06-14 15:26:36,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:26:36,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:26:36,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:26:36,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:26:36,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:26:36,812 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-14 15:26:36,813 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 193 transitions, 1974 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:26:36,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:26:36,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-14 15:26:36,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:26:38,971 INFO L124 PetriNetUnfolderBase]: 2529/3800 cut-off events. [2024-06-14 15:26:38,972 INFO L125 PetriNetUnfolderBase]: For 171280/171282 co-relation queries the response was YES. [2024-06-14 15:26:38,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28318 conditions, 3800 events. 2529/3800 cut-off events. For 171280/171282 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 18394 event pairs, 675 based on Foata normal form. 4/3799 useless extension candidates. Maximal degree in co-relation 28248. Up to 3620 conditions per place. [2024-06-14 15:26:39,007 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 203 selfloop transitions, 19 changer transitions 0/227 dead transitions. [2024-06-14 15:26:39,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 227 transitions, 2504 flow [2024-06-14 15:26:39,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:26:39,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:26:39,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 163 transitions. [2024-06-14 15:26:39,010 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42118863049095606 [2024-06-14 15:26:39,011 INFO L175 Difference]: Start difference. First operand has 153 places, 193 transitions, 1974 flow. Second operand 9 states and 163 transitions. [2024-06-14 15:26:39,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 227 transitions, 2504 flow [2024-06-14 15:26:39,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 227 transitions, 2359 flow, removed 47 selfloop flow, removed 8 redundant places. [2024-06-14 15:26:39,148 INFO L231 Difference]: Finished difference. Result has 154 places, 193 transitions, 1874 flow [2024-06-14 15:26:39,148 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1829, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1874, PETRI_PLACES=154, PETRI_TRANSITIONS=193} [2024-06-14 15:26:39,149 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 110 predicate places. [2024-06-14 15:26:39,149 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 193 transitions, 1874 flow [2024-06-14 15:26:39,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:26:39,149 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:26:39,149 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:26:39,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-14 15:26:39,149 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:26:39,150 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:26:39,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1774885, now seen corresponding path program 2 times [2024-06-14 15:26:39,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:26:39,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192201384] [2024-06-14 15:26:39,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:26:39,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:26:39,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:26:52,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:26:52,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:26:52,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192201384] [2024-06-14 15:26:52,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192201384] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:26:52,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:26:52,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:26:52,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350912958] [2024-06-14 15:26:52,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:26:52,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:26:52,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:26:52,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:26:52,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:26:52,533 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-14 15:26:52,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 193 transitions, 1874 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:26:52,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:26:52,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-14 15:26:52,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:26:54,650 INFO L124 PetriNetUnfolderBase]: 2633/3944 cut-off events. [2024-06-14 15:26:54,651 INFO L125 PetriNetUnfolderBase]: For 185031/185039 co-relation queries the response was YES. [2024-06-14 15:26:54,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29629 conditions, 3944 events. 2633/3944 cut-off events. For 185031/185039 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 19169 event pairs, 605 based on Foata normal form. 12/3951 useless extension candidates. Maximal degree in co-relation 29558. Up to 3184 conditions per place. [2024-06-14 15:26:54,682 INFO L140 encePairwiseOnDemand]: 29/43 looper letters, 159 selfloop transitions, 83 changer transitions 0/247 dead transitions. [2024-06-14 15:26:54,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 247 transitions, 3054 flow [2024-06-14 15:26:54,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:26:54,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:26:54,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 203 transitions. [2024-06-14 15:26:54,684 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4720930232558139 [2024-06-14 15:26:54,684 INFO L175 Difference]: Start difference. First operand has 154 places, 193 transitions, 1874 flow. Second operand 10 states and 203 transitions. [2024-06-14 15:26:54,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 247 transitions, 3054 flow [2024-06-14 15:26:54,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 247 transitions, 3002 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-14 15:26:54,808 INFO L231 Difference]: Finished difference. Result has 157 places, 201 transitions, 2177 flow [2024-06-14 15:26:54,809 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1822, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2177, PETRI_PLACES=157, PETRI_TRANSITIONS=201} [2024-06-14 15:26:54,809 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 113 predicate places. [2024-06-14 15:26:54,809 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 201 transitions, 2177 flow [2024-06-14 15:26:54,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:26:54,809 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:26:54,809 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:26:54,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-14 15:26:54,810 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:26:54,810 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:26:54,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1774761, now seen corresponding path program 4 times [2024-06-14 15:26:54,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:26:54,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619607526] [2024-06-14 15:26:54,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:26:54,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:26:54,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:27:07,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:27:07,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:27:07,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619607526] [2024-06-14 15:27:07,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619607526] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:27:07,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:27:07,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:27:07,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417268556] [2024-06-14 15:27:07,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:27:07,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:27:07,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:27:07,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:27:07,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:27:07,859 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-14 15:27:07,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 201 transitions, 2177 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:27:07,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:27:07,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-14 15:27:07,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:27:09,865 INFO L124 PetriNetUnfolderBase]: 2638/3959 cut-off events. [2024-06-14 15:27:09,865 INFO L125 PetriNetUnfolderBase]: For 201352/201360 co-relation queries the response was YES. [2024-06-14 15:27:09,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31223 conditions, 3959 events. 2638/3959 cut-off events. For 201352/201360 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 19273 event pairs, 691 based on Foata normal form. 10/3964 useless extension candidates. Maximal degree in co-relation 31150. Up to 3733 conditions per place. [2024-06-14 15:27:09,905 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 198 selfloop transitions, 31 changer transitions 0/234 dead transitions. [2024-06-14 15:27:09,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 234 transitions, 2799 flow [2024-06-14 15:27:09,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:27:09,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:27:09,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 164 transitions. [2024-06-14 15:27:09,908 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42377260981912146 [2024-06-14 15:27:09,908 INFO L175 Difference]: Start difference. First operand has 157 places, 201 transitions, 2177 flow. Second operand 9 states and 164 transitions. [2024-06-14 15:27:09,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 234 transitions, 2799 flow [2024-06-14 15:27:10,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 234 transitions, 2595 flow, removed 56 selfloop flow, removed 6 redundant places. [2024-06-14 15:27:10,060 INFO L231 Difference]: Finished difference. Result has 160 places, 203 transitions, 2132 flow [2024-06-14 15:27:10,060 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1973, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2132, PETRI_PLACES=160, PETRI_TRANSITIONS=203} [2024-06-14 15:27:10,061 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 116 predicate places. [2024-06-14 15:27:10,061 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 203 transitions, 2132 flow [2024-06-14 15:27:10,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:27:10,061 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:27:10,061 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:27:10,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-14 15:27:10,061 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:27:10,062 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:27:10,062 INFO L85 PathProgramCache]: Analyzing trace with hash 2087416227, now seen corresponding path program 1 times [2024-06-14 15:27:10,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:27:10,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611138903] [2024-06-14 15:27:10,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:27:10,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:27:10,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:27:22,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:27:22,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:27:22,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611138903] [2024-06-14 15:27:22,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611138903] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:27:22,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:27:22,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:27:22,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651844294] [2024-06-14 15:27:22,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:27:22,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:27:22,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:27:22,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:27:22,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:27:22,237 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-14 15:27:22,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 203 transitions, 2132 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:27:22,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:27:22,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-14 15:27:22,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:27:24,259 INFO L124 PetriNetUnfolderBase]: 2673/4011 cut-off events. [2024-06-14 15:27:24,259 INFO L125 PetriNetUnfolderBase]: For 215160/215164 co-relation queries the response was YES. [2024-06-14 15:27:24,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31723 conditions, 4011 events. 2673/4011 cut-off events. For 215160/215164 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 19693 event pairs, 629 based on Foata normal form. 8/4014 useless extension candidates. Maximal degree in co-relation 31648. Up to 3656 conditions per place. [2024-06-14 15:27:24,297 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 185 selfloop transitions, 49 changer transitions 0/239 dead transitions. [2024-06-14 15:27:24,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 239 transitions, 2964 flow [2024-06-14 15:27:24,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:27:24,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:27:24,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 160 transitions. [2024-06-14 15:27:24,298 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46511627906976744 [2024-06-14 15:27:24,298 INFO L175 Difference]: Start difference. First operand has 160 places, 203 transitions, 2132 flow. Second operand 8 states and 160 transitions. [2024-06-14 15:27:24,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 239 transitions, 2964 flow [2024-06-14 15:27:24,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 239 transitions, 2823 flow, removed 41 selfloop flow, removed 7 redundant places. [2024-06-14 15:27:24,435 INFO L231 Difference]: Finished difference. Result has 161 places, 206 transitions, 2184 flow [2024-06-14 15:27:24,435 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1991, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2184, PETRI_PLACES=161, PETRI_TRANSITIONS=206} [2024-06-14 15:27:24,435 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 117 predicate places. [2024-06-14 15:27:24,436 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 206 transitions, 2184 flow [2024-06-14 15:27:24,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:27:24,436 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:27:24,436 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:27:24,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-14 15:27:24,436 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-14 15:27:24,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:27:24,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1779535, now seen corresponding path program 3 times [2024-06-14 15:27:24,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:27:24,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510940659] [2024-06-14 15:27:24,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:27:24,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:27:24,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:27:36,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:27:36,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:27:36,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510940659] [2024-06-14 15:27:36,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510940659] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:27:36,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:27:36,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:27:36,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51925837] [2024-06-14 15:27:36,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:27:36,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:27:36,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:27:36,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:27:36,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:27:37,005 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-14 15:27:37,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 206 transitions, 2184 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:27:37,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:27:37,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-14 15:27:37,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:27:39,118 INFO L124 PetriNetUnfolderBase]: 2711/4068 cut-off events. [2024-06-14 15:27:39,119 INFO L125 PetriNetUnfolderBase]: For 225106/225112 co-relation queries the response was YES. [2024-06-14 15:27:39,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32629 conditions, 4068 events. 2711/4068 cut-off events. For 225106/225112 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 19958 event pairs, 592 based on Foata normal form. 12/4080 useless extension candidates. Maximal degree in co-relation 32553. Up to 3322 conditions per place. [2024-06-14 15:27:39,153 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 165 selfloop transitions, 89 changer transitions 0/259 dead transitions. [2024-06-14 15:27:39,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 259 transitions, 3341 flow [2024-06-14 15:27:39,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:27:39,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:27:39,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 202 transitions. [2024-06-14 15:27:39,157 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4697674418604651 [2024-06-14 15:27:39,157 INFO L175 Difference]: Start difference. First operand has 161 places, 206 transitions, 2184 flow. Second operand 10 states and 202 transitions. [2024-06-14 15:27:39,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 259 transitions, 3341 flow [2024-06-14 15:27:39,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 259 transitions, 3174 flow, removed 37 selfloop flow, removed 6 redundant places. [2024-06-14 15:27:39,304 INFO L231 Difference]: Finished difference. Result has 166 places, 213 transitions, 2388 flow [2024-06-14 15:27:39,305 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2017, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2388, PETRI_PLACES=166, PETRI_TRANSITIONS=213} [2024-06-14 15:27:39,305 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 122 predicate places. [2024-06-14 15:27:39,305 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 213 transitions, 2388 flow [2024-06-14 15:27:39,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:27:39,306 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:27:39,306 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:27:39,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-14 15:27:39,306 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:27:39,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:27:39,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1952515, now seen corresponding path program 4 times [2024-06-14 15:27:39,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:27:39,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644772707] [2024-06-14 15:27:39,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:27:39,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:27:39,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:27:51,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:27:51,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:27:51,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644772707] [2024-06-14 15:27:51,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644772707] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:27:51,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:27:51,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:27:51,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224639100] [2024-06-14 15:27:51,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:27:51,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:27:51,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:27:51,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:27:51,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:27:51,800 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-14 15:27:51,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 213 transitions, 2388 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:27:51,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:27:51,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-14 15:27:51,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:27:53,849 INFO L124 PetriNetUnfolderBase]: 2715/4074 cut-off events. [2024-06-14 15:27:53,850 INFO L125 PetriNetUnfolderBase]: For 235020/235026 co-relation queries the response was YES. [2024-06-14 15:27:53,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33591 conditions, 4074 events. 2715/4074 cut-off events. For 235020/235026 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 19953 event pairs, 578 based on Foata normal form. 12/4086 useless extension candidates. Maximal degree in co-relation 33513. Up to 3328 conditions per place. [2024-06-14 15:27:53,888 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 163 selfloop transitions, 94 changer transitions 0/262 dead transitions. [2024-06-14 15:27:53,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 262 transitions, 3457 flow [2024-06-14 15:27:53,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:27:53,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:27:53,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 201 transitions. [2024-06-14 15:27:53,889 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46744186046511627 [2024-06-14 15:27:53,890 INFO L175 Difference]: Start difference. First operand has 166 places, 213 transitions, 2388 flow. Second operand 10 states and 201 transitions. [2024-06-14 15:27:53,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 262 transitions, 3457 flow [2024-06-14 15:27:54,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 262 transitions, 3251 flow, removed 37 selfloop flow, removed 7 redundant places. [2024-06-14 15:27:54,071 INFO L231 Difference]: Finished difference. Result has 169 places, 217 transitions, 2482 flow [2024-06-14 15:27:54,072 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2182, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2482, PETRI_PLACES=169, PETRI_TRANSITIONS=217} [2024-06-14 15:27:54,072 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 125 predicate places. [2024-06-14 15:27:54,072 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 217 transitions, 2482 flow [2024-06-14 15:27:54,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:27:54,073 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:27:54,073 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:27:54,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-14 15:27:54,073 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:27:54,073 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:27:54,073 INFO L85 PathProgramCache]: Analyzing trace with hash 938294797, now seen corresponding path program 1 times [2024-06-14 15:27:54,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:27:54,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899779498] [2024-06-14 15:27:54,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:27:54,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:27:54,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:28:07,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:28:07,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:28:07,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899779498] [2024-06-14 15:28:07,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899779498] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:28:07,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:28:07,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:28:07,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337756106] [2024-06-14 15:28:07,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:28:07,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:28:07,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:28:07,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:28:07,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:28:08,022 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-14 15:28:08,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 217 transitions, 2482 flow. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:28:08,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:28:08,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-14 15:28:08,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:28:09,662 INFO L124 PetriNetUnfolderBase]: 2545/3880 cut-off events. [2024-06-14 15:28:09,663 INFO L125 PetriNetUnfolderBase]: For 243736/243760 co-relation queries the response was YES. [2024-06-14 15:28:09,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32754 conditions, 3880 events. 2545/3880 cut-off events. For 243736/243760 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 19489 event pairs, 662 based on Foata normal form. 2/3843 useless extension candidates. Maximal degree in co-relation 32675. Up to 3609 conditions per place. [2024-06-14 15:28:09,696 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 194 selfloop transitions, 22 changer transitions 0/236 dead transitions. [2024-06-14 15:28:09,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 236 transitions, 3081 flow [2024-06-14 15:28:09,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:28:09,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:28:09,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 116 transitions. [2024-06-14 15:28:09,697 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4496124031007752 [2024-06-14 15:28:09,697 INFO L175 Difference]: Start difference. First operand has 169 places, 217 transitions, 2482 flow. Second operand 6 states and 116 transitions. [2024-06-14 15:28:09,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 236 transitions, 3081 flow [2024-06-14 15:28:09,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 236 transitions, 2814 flow, removed 39 selfloop flow, removed 8 redundant places. [2024-06-14 15:28:09,850 INFO L231 Difference]: Finished difference. Result has 167 places, 220 transitions, 2323 flow [2024-06-14 15:28:09,851 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2221, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2323, PETRI_PLACES=167, PETRI_TRANSITIONS=220} [2024-06-14 15:28:09,851 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 123 predicate places. [2024-06-14 15:28:09,851 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 220 transitions, 2323 flow [2024-06-14 15:28:09,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:28:09,852 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:28:09,852 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:28:09,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-14 15:28:09,852 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:28:09,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:28:09,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1199307583, now seen corresponding path program 2 times [2024-06-14 15:28:09,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:28:09,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073943339] [2024-06-14 15:28:09,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:28:09,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:28:09,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:28:22,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:28:22,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:28:22,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073943339] [2024-06-14 15:28:22,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073943339] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:28:22,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:28:22,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:28:22,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243390407] [2024-06-14 15:28:22,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:28:22,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:28:22,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:28:22,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:28:22,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:28:22,720 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-14 15:28:22,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 220 transitions, 2323 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:28:22,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:28:22,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-14 15:28:22,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:28:24,621 INFO L124 PetriNetUnfolderBase]: 2737/4112 cut-off events. [2024-06-14 15:28:24,624 INFO L125 PetriNetUnfolderBase]: For 255322/255322 co-relation queries the response was YES. [2024-06-14 15:28:24,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33683 conditions, 4112 events. 2737/4112 cut-off events. For 255322/255322 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 20220 event pairs, 675 based on Foata normal form. 6/4118 useless extension candidates. Maximal degree in co-relation 33603. Up to 3905 conditions per place. [2024-06-14 15:28:24,662 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 220 selfloop transitions, 24 changer transitions 0/249 dead transitions. [2024-06-14 15:28:24,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 249 transitions, 3043 flow [2024-06-14 15:28:24,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:28:24,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:28:24,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-06-14 15:28:24,664 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4331395348837209 [2024-06-14 15:28:24,664 INFO L175 Difference]: Start difference. First operand has 167 places, 220 transitions, 2323 flow. Second operand 8 states and 149 transitions. [2024-06-14 15:28:24,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 249 transitions, 3043 flow [2024-06-14 15:28:24,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 249 transitions, 2971 flow, removed 17 selfloop flow, removed 4 redundant places. [2024-06-14 15:28:24,852 INFO L231 Difference]: Finished difference. Result has 171 places, 223 transitions, 2405 flow [2024-06-14 15:28:24,852 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2251, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2405, PETRI_PLACES=171, PETRI_TRANSITIONS=223} [2024-06-14 15:28:24,853 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 127 predicate places. [2024-06-14 15:28:24,853 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 223 transitions, 2405 flow [2024-06-14 15:28:24,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:28:24,854 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:28:24,854 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:28:24,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-14 15:28:24,854 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:28:24,854 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:28:24,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1773856911, now seen corresponding path program 5 times [2024-06-14 15:28:24,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:28:24,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341858838] [2024-06-14 15:28:24,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:28:24,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:28:24,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:28:37,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:28:37,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:28:37,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341858838] [2024-06-14 15:28:37,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341858838] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:28:37,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:28:37,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:28:37,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939051554] [2024-06-14 15:28:37,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:28:37,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:28:37,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:28:37,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:28:37,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:28:37,749 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-14 15:28:37,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 223 transitions, 2405 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:28:37,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:28:37,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-14 15:28:37,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:28:39,695 INFO L124 PetriNetUnfolderBase]: 2773/4164 cut-off events. [2024-06-14 15:28:39,696 INFO L125 PetriNetUnfolderBase]: For 270371/270371 co-relation queries the response was YES. [2024-06-14 15:28:39,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34728 conditions, 4164 events. 2773/4164 cut-off events. For 270371/270371 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 20543 event pairs, 663 based on Foata normal form. 6/4170 useless extension candidates. Maximal degree in co-relation 34647. Up to 3915 conditions per place. [2024-06-14 15:28:39,734 INFO L140 encePairwiseOnDemand]: 29/43 looper letters, 224 selfloop transitions, 31 changer transitions 0/260 dead transitions. [2024-06-14 15:28:39,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 260 transitions, 3193 flow [2024-06-14 15:28:39,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:28:39,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:28:39,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 192 transitions. [2024-06-14 15:28:39,738 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4059196617336152 [2024-06-14 15:28:39,738 INFO L175 Difference]: Start difference. First operand has 171 places, 223 transitions, 2405 flow. Second operand 11 states and 192 transitions. [2024-06-14 15:28:39,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 260 transitions, 3193 flow [2024-06-14 15:28:39,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 260 transitions, 3063 flow, removed 43 selfloop flow, removed 6 redundant places. [2024-06-14 15:28:39,995 INFO L231 Difference]: Finished difference. Result has 176 places, 227 transitions, 2470 flow [2024-06-14 15:28:39,995 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2275, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2470, PETRI_PLACES=176, PETRI_TRANSITIONS=227} [2024-06-14 15:28:39,996 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 132 predicate places. [2024-06-14 15:28:39,996 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 227 transitions, 2470 flow [2024-06-14 15:28:39,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:28:39,996 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:28:39,996 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:28:39,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-14 15:28:39,997 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-14 15:28:39,997 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:28:39,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1199077191, now seen corresponding path program 1 times [2024-06-14 15:28:39,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:28:39,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647134451] [2024-06-14 15:28:39,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:28:39,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:28:40,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:28:52,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:28:52,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:28:52,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647134451] [2024-06-14 15:28:52,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647134451] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:28:52,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:28:52,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:28:52,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127857184] [2024-06-14 15:28:52,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:28:52,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:28:52,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:28:52,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:28:52,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:28:52,548 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-14 15:28:52,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 227 transitions, 2470 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:28:52,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:28:52,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-14 15:28:52,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:28:54,667 INFO L124 PetriNetUnfolderBase]: 2776/4168 cut-off events. [2024-06-14 15:28:54,668 INFO L125 PetriNetUnfolderBase]: For 277721/277721 co-relation queries the response was YES. [2024-06-14 15:28:54,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35208 conditions, 4168 events. 2776/4168 cut-off events. For 277721/277721 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 20526 event pairs, 674 based on Foata normal form. 3/4171 useless extension candidates. Maximal degree in co-relation 35126. Up to 3907 conditions per place. [2024-06-14 15:28:54,707 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 214 selfloop transitions, 40 changer transitions 0/259 dead transitions. [2024-06-14 15:28:54,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 259 transitions, 3238 flow [2024-06-14 15:28:54,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:28:54,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:28:54,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 176 transitions. [2024-06-14 15:28:54,708 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40930232558139534 [2024-06-14 15:28:54,708 INFO L175 Difference]: Start difference. First operand has 176 places, 227 transitions, 2470 flow. Second operand 10 states and 176 transitions. [2024-06-14 15:28:54,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 259 transitions, 3238 flow [2024-06-14 15:28:54,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 259 transitions, 3073 flow, removed 54 selfloop flow, removed 9 redundant places. [2024-06-14 15:28:54,939 INFO L231 Difference]: Finished difference. Result has 177 places, 231 transitions, 2517 flow [2024-06-14 15:28:54,939 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2305, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2517, PETRI_PLACES=177, PETRI_TRANSITIONS=231} [2024-06-14 15:28:54,940 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 133 predicate places. [2024-06-14 15:28:54,940 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 231 transitions, 2517 flow [2024-06-14 15:28:54,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:28:54,940 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:28:54,940 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:28:54,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-14 15:28:54,940 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-14 15:28:54,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:28:54,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1767607745, now seen corresponding path program 3 times [2024-06-14 15:28:54,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:28:54,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765590978] [2024-06-14 15:28:54,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:28:54,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:28:55,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:29:07,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:29:07,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:29:07,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765590978] [2024-06-14 15:29:07,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765590978] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:29:07,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:29:07,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:29:07,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552255080] [2024-06-14 15:29:07,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:29:07,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:29:07,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:29:07,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:29:07,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:29:08,141 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-14 15:29:08,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 231 transitions, 2517 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:29:08,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:29:08,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-14 15:29:08,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:29:10,136 INFO L124 PetriNetUnfolderBase]: 2803/4211 cut-off events. [2024-06-14 15:29:10,136 INFO L125 PetriNetUnfolderBase]: For 293050/293050 co-relation queries the response was YES. [2024-06-14 15:29:10,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35704 conditions, 4211 events. 2803/4211 cut-off events. For 293050/293050 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 20807 event pairs, 673 based on Foata normal form. 6/4217 useless extension candidates. Maximal degree in co-relation 35621. Up to 3944 conditions per place. [2024-06-14 15:29:10,180 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 227 selfloop transitions, 30 changer transitions 0/262 dead transitions. [2024-06-14 15:29:10,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 262 transitions, 3367 flow [2024-06-14 15:29:10,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:29:10,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:29:10,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2024-06-14 15:29:10,182 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4418604651162791 [2024-06-14 15:29:10,182 INFO L175 Difference]: Start difference. First operand has 177 places, 231 transitions, 2517 flow. Second operand 8 states and 152 transitions. [2024-06-14 15:29:10,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 262 transitions, 3367 flow [2024-06-14 15:29:10,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 262 transitions, 3213 flow, removed 42 selfloop flow, removed 8 redundant places. [2024-06-14 15:29:10,408 INFO L231 Difference]: Finished difference. Result has 177 places, 234 transitions, 2541 flow [2024-06-14 15:29:10,408 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2363, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2541, PETRI_PLACES=177, PETRI_TRANSITIONS=234} [2024-06-14 15:29:10,408 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 133 predicate places. [2024-06-14 15:29:10,409 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 234 transitions, 2541 flow [2024-06-14 15:29:10,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:29:10,414 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:29:10,415 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:29:10,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-14 15:29:10,415 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-14 15:29:10,415 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:29:10,415 INFO L85 PathProgramCache]: Analyzing trace with hash 167591649, now seen corresponding path program 6 times [2024-06-14 15:29:10,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:29:10,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372524394] [2024-06-14 15:29:10,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:29:10,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:29:10,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:29:23,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:29:23,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:29:23,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372524394] [2024-06-14 15:29:23,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372524394] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:29:23,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:29:23,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:29:23,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790043594] [2024-06-14 15:29:23,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:29:23,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:29:23,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:29:23,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:29:23,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:29:23,307 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-14 15:29:23,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 234 transitions, 2541 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:29:23,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:29:23,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-14 15:29:23,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:29:25,552 INFO L124 PetriNetUnfolderBase]: 2840/4264 cut-off events. [2024-06-14 15:29:25,553 INFO L125 PetriNetUnfolderBase]: For 309745/309745 co-relation queries the response was YES. [2024-06-14 15:29:25,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36662 conditions, 4264 events. 2840/4264 cut-off events. For 309745/309745 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 21115 event pairs, 659 based on Foata normal form. 6/4270 useless extension candidates. Maximal degree in co-relation 36578. Up to 3794 conditions per place. [2024-06-14 15:29:25,594 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 212 selfloop transitions, 60 changer transitions 0/277 dead transitions. [2024-06-14 15:29:25,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 277 transitions, 3493 flow [2024-06-14 15:29:25,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:29:25,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:29:25,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 202 transitions. [2024-06-14 15:29:25,596 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.427061310782241 [2024-06-14 15:29:25,596 INFO L175 Difference]: Start difference. First operand has 177 places, 234 transitions, 2541 flow. Second operand 11 states and 202 transitions. [2024-06-14 15:29:25,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 277 transitions, 3493 flow [2024-06-14 15:29:25,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 277 transitions, 3339 flow, removed 49 selfloop flow, removed 6 redundant places. [2024-06-14 15:29:25,851 INFO L231 Difference]: Finished difference. Result has 182 places, 238 transitions, 2654 flow [2024-06-14 15:29:25,851 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2387, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2654, PETRI_PLACES=182, PETRI_TRANSITIONS=238} [2024-06-14 15:29:25,851 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 138 predicate places. [2024-06-14 15:29:25,852 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 238 transitions, 2654 flow [2024-06-14 15:29:25,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:29:25,852 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:29:25,852 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:29:25,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-14 15:29:25,852 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-14 15:29:25,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:29:25,853 INFO L85 PathProgramCache]: Analyzing trace with hash 511930409, now seen corresponding path program 5 times [2024-06-14 15:29:25,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:29:25,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491525908] [2024-06-14 15:29:25,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:29:25,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:29:25,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:29:38,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:29:38,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:29:38,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491525908] [2024-06-14 15:29:38,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491525908] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:29:38,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:29:38,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:29:38,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880507042] [2024-06-14 15:29:38,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:29:38,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:29:38,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:29:38,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:29:38,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:29:38,991 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-14 15:29:38,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 238 transitions, 2654 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:29:38,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:29:38,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-14 15:29:38,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:29:41,058 INFO L124 PetriNetUnfolderBase]: 2831/4251 cut-off events. [2024-06-14 15:29:41,058 INFO L125 PetriNetUnfolderBase]: For 317109/317109 co-relation queries the response was YES. [2024-06-14 15:29:41,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36958 conditions, 4251 events. 2831/4251 cut-off events. For 317109/317109 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 21006 event pairs, 690 based on Foata normal form. 4/4255 useless extension candidates. Maximal degree in co-relation 36873. Up to 4077 conditions per place. [2024-06-14 15:29:41,104 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 244 selfloop transitions, 19 changer transitions 0/268 dead transitions. [2024-06-14 15:29:41,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 268 transitions, 3356 flow [2024-06-14 15:29:41,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:29:41,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:29:41,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 157 transitions. [2024-06-14 15:29:41,105 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40568475452196384 [2024-06-14 15:29:41,105 INFO L175 Difference]: Start difference. First operand has 182 places, 238 transitions, 2654 flow. Second operand 9 states and 157 transitions. [2024-06-14 15:29:41,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 268 transitions, 3356 flow [2024-06-14 15:29:41,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 268 transitions, 3099 flow, removed 63 selfloop flow, removed 9 redundant places. [2024-06-14 15:29:41,328 INFO L231 Difference]: Finished difference. Result has 182 places, 240 transitions, 2552 flow [2024-06-14 15:29:41,328 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2397, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2552, PETRI_PLACES=182, PETRI_TRANSITIONS=240} [2024-06-14 15:29:41,329 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 138 predicate places. [2024-06-14 15:29:41,329 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 240 transitions, 2552 flow [2024-06-14 15:29:41,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:29:41,329 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:29:41,329 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:29:41,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-14 15:29:41,329 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-14 15:29:41,330 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:29:41,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1199076943, now seen corresponding path program 4 times [2024-06-14 15:29:41,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:29:41,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593635988] [2024-06-14 15:29:41,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:29:41,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:29:41,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:29:53,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-14 15:29:53,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:29:53,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593635988] [2024-06-14 15:29:53,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593635988] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:29:53,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:29:53,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:29:53,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348885120] [2024-06-14 15:29:53,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:29:53,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:29:53,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:29:53,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:29:53,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:29:53,403 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-14 15:29:53,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 240 transitions, 2552 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:29:53,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:29:53,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-14 15:29:53,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:29:55,432 INFO L124 PetriNetUnfolderBase]: 2860/4296 cut-off events. [2024-06-14 15:29:55,432 INFO L125 PetriNetUnfolderBase]: For 333550/333550 co-relation queries the response was YES. [2024-06-14 15:29:55,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37178 conditions, 4296 events. 2860/4296 cut-off events. For 333550/333550 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 21272 event pairs, 683 based on Foata normal form. 6/4302 useless extension candidates. Maximal degree in co-relation 37092. Up to 4030 conditions per place. [2024-06-14 15:29:55,475 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 228 selfloop transitions, 36 changer transitions 0/269 dead transitions. [2024-06-14 15:29:55,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 269 transitions, 3348 flow [2024-06-14 15:29:55,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:29:55,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:29:55,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions. [2024-06-14 15:29:55,478 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.438953488372093 [2024-06-14 15:29:55,479 INFO L175 Difference]: Start difference. First operand has 182 places, 240 transitions, 2552 flow. Second operand 8 states and 151 transitions. [2024-06-14 15:29:55,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 269 transitions, 3348 flow [2024-06-14 15:29:55,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 269 transitions, 3211 flow, removed 51 selfloop flow, removed 7 redundant places. [2024-06-14 15:29:55,682 INFO L231 Difference]: Finished difference. Result has 183 places, 243 transitions, 2621 flow [2024-06-14 15:29:55,683 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2415, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2621, PETRI_PLACES=183, PETRI_TRANSITIONS=243} [2024-06-14 15:29:55,684 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 139 predicate places. [2024-06-14 15:29:55,684 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 243 transitions, 2621 flow [2024-06-14 15:29:55,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:29:55,685 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:29:55,685 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:29:55,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-14 15:29:55,685 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:29:55,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:29:55,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1420713613, now seen corresponding path program 5 times [2024-06-14 15:29:55,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:29:55,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641621577] [2024-06-14 15:29:55,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:29:55,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:29:55,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:30:07,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:30:07,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:30:07,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641621577] [2024-06-14 15:30:07,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641621577] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:30:07,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:30:07,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:30:07,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583040543] [2024-06-14 15:30:07,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:30:07,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:30:07,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:30:07,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:30:07,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:30:07,845 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-14 15:30:07,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 243 transitions, 2621 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:30:07,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:30:07,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-14 15:30:07,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:30:09,879 INFO L124 PetriNetUnfolderBase]: 2863/4301 cut-off events. [2024-06-14 15:30:09,880 INFO L125 PetriNetUnfolderBase]: For 340801/340801 co-relation queries the response was YES. [2024-06-14 15:30:09,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37448 conditions, 4301 events. 2863/4301 cut-off events. For 340801/340801 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 21352 event pairs, 668 based on Foata normal form. 6/4307 useless extension candidates. Maximal degree in co-relation 37361. Up to 4066 conditions per place. [2024-06-14 15:30:09,918 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 239 selfloop transitions, 28 changer transitions 0/272 dead transitions. [2024-06-14 15:30:09,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 272 transitions, 3429 flow [2024-06-14 15:30:09,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:30:09,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:30:09,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2024-06-14 15:30:09,919 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.436046511627907 [2024-06-14 15:30:09,919 INFO L175 Difference]: Start difference. First operand has 183 places, 243 transitions, 2621 flow. Second operand 8 states and 150 transitions. [2024-06-14 15:30:09,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 272 transitions, 3429 flow [2024-06-14 15:30:10,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 272 transitions, 3243 flow, removed 61 selfloop flow, removed 6 redundant places. [2024-06-14 15:30:10,136 INFO L231 Difference]: Finished difference. Result has 185 places, 246 transitions, 2629 flow [2024-06-14 15:30:10,136 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2443, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2629, PETRI_PLACES=185, PETRI_TRANSITIONS=246} [2024-06-14 15:30:10,137 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 141 predicate places. [2024-06-14 15:30:10,137 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 246 transitions, 2629 flow [2024-06-14 15:30:10,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:30:10,137 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:30:10,137 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:30:10,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-14 15:30:10,138 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:30:10,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:30:10,138 INFO L85 PathProgramCache]: Analyzing trace with hash 511935183, now seen corresponding path program 7 times [2024-06-14 15:30:10,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:30:10,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291416372] [2024-06-14 15:30:10,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:30:10,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:30:10,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:30:22,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:30:22,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:30:22,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291416372] [2024-06-14 15:30:22,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291416372] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:30:22,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:30:22,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:30:22,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631084839] [2024-06-14 15:30:22,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:30:22,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:30:22,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:30:22,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:30:22,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:30:22,909 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-14 15:30:22,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 246 transitions, 2629 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:30:22,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:30:22,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-14 15:30:22,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:30:25,038 INFO L124 PetriNetUnfolderBase]: 2898/4352 cut-off events. [2024-06-14 15:30:25,038 INFO L125 PetriNetUnfolderBase]: For 340715/340715 co-relation queries the response was YES. [2024-06-14 15:30:25,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37655 conditions, 4352 events. 2898/4352 cut-off events. For 340715/340715 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 21603 event pairs, 659 based on Foata normal form. 6/4358 useless extension candidates. Maximal degree in co-relation 37567. Up to 3942 conditions per place. [2024-06-14 15:30:25,083 INFO L140 encePairwiseOnDemand]: 29/43 looper letters, 237 selfloop transitions, 47 changer transitions 0/289 dead transitions. [2024-06-14 15:30:25,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 289 transitions, 3707 flow [2024-06-14 15:30:25,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:30:25,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:30:25,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 201 transitions. [2024-06-14 15:30:25,087 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4249471458773784 [2024-06-14 15:30:25,088 INFO L175 Difference]: Start difference. First operand has 185 places, 246 transitions, 2629 flow. Second operand 11 states and 201 transitions. [2024-06-14 15:30:25,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 289 transitions, 3707 flow [2024-06-14 15:30:25,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 289 transitions, 3545 flow, removed 55 selfloop flow, removed 6 redundant places. [2024-06-14 15:30:25,337 INFO L231 Difference]: Finished difference. Result has 190 places, 250 transitions, 2722 flow [2024-06-14 15:30:25,337 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2467, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2722, PETRI_PLACES=190, PETRI_TRANSITIONS=250} [2024-06-14 15:30:25,338 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 146 predicate places. [2024-06-14 15:30:25,338 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 250 transitions, 2722 flow [2024-06-14 15:30:25,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:30:25,338 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:30:25,338 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:30:25,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-14 15:30:25,338 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:30:25,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:30:25,339 INFO L85 PathProgramCache]: Analyzing trace with hash 511930533, now seen corresponding path program 8 times [2024-06-14 15:30:25,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:30:25,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672410432] [2024-06-14 15:30:25,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:30:25,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:30:25,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:30:38,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:30:38,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:30:38,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672410432] [2024-06-14 15:30:38,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672410432] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:30:38,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:30:38,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:30:38,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829446403] [2024-06-14 15:30:38,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:30:38,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:30:38,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:30:38,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:30:38,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:30:38,487 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-14 15:30:38,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 250 transitions, 2722 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:30:38,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:30:38,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-14 15:30:38,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:30:40,696 INFO L124 PetriNetUnfolderBase]: 2919/4382 cut-off events. [2024-06-14 15:30:40,697 INFO L125 PetriNetUnfolderBase]: For 355174/355174 co-relation queries the response was YES. [2024-06-14 15:30:40,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38499 conditions, 4382 events. 2919/4382 cut-off events. For 355174/355174 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 21777 event pairs, 656 based on Foata normal form. 6/4388 useless extension candidates. Maximal degree in co-relation 38410. Up to 3753 conditions per place. [2024-06-14 15:30:40,745 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 223 selfloop transitions, 75 changer transitions 0/303 dead transitions. [2024-06-14 15:30:40,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 303 transitions, 4256 flow [2024-06-14 15:30:40,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:30:40,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:30:40,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 205 transitions. [2024-06-14 15:30:40,748 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4334038054968288 [2024-06-14 15:30:40,748 INFO L175 Difference]: Start difference. First operand has 190 places, 250 transitions, 2722 flow. Second operand 11 states and 205 transitions. [2024-06-14 15:30:40,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 303 transitions, 4256 flow [2024-06-14 15:30:40,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 303 transitions, 4031 flow, removed 68 selfloop flow, removed 9 redundant places. [2024-06-14 15:30:40,982 INFO L231 Difference]: Finished difference. Result has 194 places, 261 transitions, 3023 flow [2024-06-14 15:30:40,982 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2497, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3023, PETRI_PLACES=194, PETRI_TRANSITIONS=261} [2024-06-14 15:30:40,983 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 150 predicate places. [2024-06-14 15:30:40,983 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 261 transitions, 3023 flow [2024-06-14 15:30:40,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:30:40,983 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:30:40,983 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:30:40,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-14 15:30:40,983 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:30:40,984 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:30:40,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1420718347, now seen corresponding path program 2 times [2024-06-14 15:30:40,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:30:40,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184905701] [2024-06-14 15:30:40,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:30:40,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:30:41,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:30:54,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:30:54,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:30:54,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184905701] [2024-06-14 15:30:54,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184905701] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:30:54,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:30:54,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:30:54,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517922258] [2024-06-14 15:30:54,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:30:54,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:30:54,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:30:54,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:30:54,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:30:54,710 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-14 15:30:54,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 261 transitions, 3023 flow. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:30:54,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:30:54,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-14 15:30:54,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:30:56,484 INFO L124 PetriNetUnfolderBase]: 2727/4164 cut-off events. [2024-06-14 15:30:56,484 INFO L125 PetriNetUnfolderBase]: For 364816/364840 co-relation queries the response was YES. [2024-06-14 15:30:56,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37759 conditions, 4164 events. 2727/4164 cut-off events. For 364816/364840 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 21342 event pairs, 678 based on Foata normal form. 2/4127 useless extension candidates. Maximal degree in co-relation 37667. Up to 3887 conditions per place. [2024-06-14 15:30:56,526 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 232 selfloop transitions, 13 changer transitions 0/270 dead transitions. [2024-06-14 15:30:56,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 270 transitions, 3535 flow [2024-06-14 15:30:56,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:30:56,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:30:56,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions. [2024-06-14 15:30:56,528 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41472868217054265 [2024-06-14 15:30:56,528 INFO L175 Difference]: Start difference. First operand has 194 places, 261 transitions, 3023 flow. Second operand 6 states and 107 transitions. [2024-06-14 15:30:56,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 270 transitions, 3535 flow [2024-06-14 15:30:56,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 270 transitions, 3292 flow, removed 108 selfloop flow, removed 5 redundant places. [2024-06-14 15:30:56,769 INFO L231 Difference]: Finished difference. Result has 195 places, 261 transitions, 2814 flow [2024-06-14 15:30:56,770 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2780, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2814, PETRI_PLACES=195, PETRI_TRANSITIONS=261} [2024-06-14 15:30:56,770 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 151 predicate places. [2024-06-14 15:30:56,770 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 261 transitions, 2814 flow [2024-06-14 15:30:56,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:30:56,770 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:30:56,770 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:30:56,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-14 15:30:56,771 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:30:56,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:30:56,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1777850777, now seen corresponding path program 1 times [2024-06-14 15:30:56,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:30:56,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7377714] [2024-06-14 15:30:56,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:30:56,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:30:56,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:31:15,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:31:15,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:31:15,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7377714] [2024-06-14 15:31:15,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7377714] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:31:15,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:31:15,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:31:15,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733668285] [2024-06-14 15:31:15,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:31:15,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:31:15,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:31:15,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:31:15,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:31:15,485 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-14 15:31:15,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 261 transitions, 2814 flow. Second operand has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:31:15,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:31:15,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-14 15:31:15,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:31:17,503 INFO L124 PetriNetUnfolderBase]: 2912/4373 cut-off events. [2024-06-14 15:31:17,504 INFO L125 PetriNetUnfolderBase]: For 372335/372335 co-relation queries the response was YES. [2024-06-14 15:31:17,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38776 conditions, 4373 events. 2912/4373 cut-off events. For 372335/372335 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 21724 event pairs, 699 based on Foata normal form. 3/4376 useless extension candidates. Maximal degree in co-relation 38682. Up to 4198 conditions per place. [2024-06-14 15:31:17,551 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 251 selfloop transitions, 26 changer transitions 0/282 dead transitions. [2024-06-14 15:31:17,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 282 transitions, 3547 flow [2024-06-14 15:31:17,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:31:17,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:31:17,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions. [2024-06-14 15:31:17,567 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4069767441860465 [2024-06-14 15:31:17,567 INFO L175 Difference]: Start difference. First operand has 195 places, 261 transitions, 2814 flow. Second operand 8 states and 140 transitions. [2024-06-14 15:31:17,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 282 transitions, 3547 flow [2024-06-14 15:31:17,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 282 transitions, 3509 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-14 15:31:17,911 INFO L231 Difference]: Finished difference. Result has 198 places, 264 transitions, 2882 flow [2024-06-14 15:31:17,911 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2776, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2882, PETRI_PLACES=198, PETRI_TRANSITIONS=264} [2024-06-14 15:31:17,912 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 154 predicate places. [2024-06-14 15:31:17,912 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 264 transitions, 2882 flow [2024-06-14 15:31:17,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:31:17,912 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:31:17,912 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:31:17,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-14 15:31:17,913 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:31:17,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:31:17,913 INFO L85 PathProgramCache]: Analyzing trace with hash 944164399, now seen corresponding path program 2 times [2024-06-14 15:31:17,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:31:17,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831835464] [2024-06-14 15:31:17,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:31:17,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:31:17,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:31:37,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:31:37,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:31:37,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831835464] [2024-06-14 15:31:37,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831835464] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:31:37,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:31:37,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:31:37,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079290908] [2024-06-14 15:31:37,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:31:37,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:31:37,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:31:37,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:31:37,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:31:37,755 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-14 15:31:37,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 264 transitions, 2882 flow. Second operand has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:31:37,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:31:37,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-14 15:31:37,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:31:39,616 INFO L124 PetriNetUnfolderBase]: 2877/4320 cut-off events. [2024-06-14 15:31:39,616 INFO L125 PetriNetUnfolderBase]: For 381650/381656 co-relation queries the response was YES. [2024-06-14 15:31:39,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38734 conditions, 4320 events. 2877/4320 cut-off events. For 381650/381656 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 21397 event pairs, 700 based on Foata normal form. 7/4327 useless extension candidates. Maximal degree in co-relation 38639. Up to 4147 conditions per place. [2024-06-14 15:31:39,660 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 246 selfloop transitions, 26 changer transitions 0/277 dead transitions. [2024-06-14 15:31:39,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 277 transitions, 3458 flow [2024-06-14 15:31:39,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:31:39,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:31:39,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions. [2024-06-14 15:31:39,662 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4119601328903654 [2024-06-14 15:31:39,662 INFO L175 Difference]: Start difference. First operand has 198 places, 264 transitions, 2882 flow. Second operand 7 states and 124 transitions. [2024-06-14 15:31:39,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 277 transitions, 3458 flow [2024-06-14 15:31:39,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 277 transitions, 3398 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-14 15:31:39,977 INFO L231 Difference]: Finished difference. Result has 199 places, 264 transitions, 2880 flow [2024-06-14 15:31:39,978 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2822, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2880, PETRI_PLACES=199, PETRI_TRANSITIONS=264} [2024-06-14 15:31:39,978 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 155 predicate places. [2024-06-14 15:31:39,978 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 264 transitions, 2880 flow [2024-06-14 15:31:39,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:31:39,979 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:31:39,979 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:31:39,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-14 15:31:39,979 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:31:39,979 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:31:39,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1420732235, now seen corresponding path program 1 times [2024-06-14 15:31:39,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:31:39,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432089282] [2024-06-14 15:31:39,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:31:39,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:31:40,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:32:00,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:32:00,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:32:00,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432089282] [2024-06-14 15:32:00,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432089282] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:32:00,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:32:00,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:32:00,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916429199] [2024-06-14 15:32:00,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:32:00,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:32:00,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:32:00,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:32:00,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:32:00,603 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-14 15:32:00,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 264 transitions, 2880 flow. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:32:00,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:32:00,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-14 15:32:00,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:32:02,453 INFO L124 PetriNetUnfolderBase]: 2846/4262 cut-off events. [2024-06-14 15:32:02,453 INFO L125 PetriNetUnfolderBase]: For 391001/391024 co-relation queries the response was YES. [2024-06-14 15:32:02,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38578 conditions, 4262 events. 2846/4262 cut-off events. For 391001/391024 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 20986 event pairs, 727 based on Foata normal form. 3/4228 useless extension candidates. Maximal degree in co-relation 38482. Up to 4087 conditions per place. [2024-06-14 15:32:02,497 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 242 selfloop transitions, 14 changer transitions 0/279 dead transitions. [2024-06-14 15:32:02,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 279 transitions, 3454 flow [2024-06-14 15:32:02,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:32:02,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:32:02,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2024-06-14 15:32:02,498 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38870431893687707 [2024-06-14 15:32:02,498 INFO L175 Difference]: Start difference. First operand has 199 places, 264 transitions, 2880 flow. Second operand 7 states and 117 transitions. [2024-06-14 15:32:02,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 279 transitions, 3454 flow [2024-06-14 15:32:02,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 279 transitions, 3392 flow, removed 1 selfloop flow, removed 6 redundant places. [2024-06-14 15:32:02,808 INFO L231 Difference]: Finished difference. Result has 200 places, 267 transitions, 2892 flow [2024-06-14 15:32:02,809 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2818, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2892, PETRI_PLACES=200, PETRI_TRANSITIONS=267} [2024-06-14 15:32:02,809 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 156 predicate places. [2024-06-14 15:32:02,809 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 267 transitions, 2892 flow [2024-06-14 15:32:02,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:32:02,810 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:32:02,810 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:32:02,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-14 15:32:02,810 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-14 15:32:02,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:32:02,811 INFO L85 PathProgramCache]: Analyzing trace with hash 687394225, now seen corresponding path program 1 times [2024-06-14 15:32:02,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:32:02,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826540212] [2024-06-14 15:32:02,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:32:02,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:32:02,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:32:15,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:32:15,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:32:15,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826540212] [2024-06-14 15:32:15,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826540212] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:32:15,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:32:15,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:32:15,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514573503] [2024-06-14 15:32:15,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:32:15,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:32:15,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:32:15,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:32:15,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:32:16,175 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-14 15:32:16,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 267 transitions, 2892 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:32:16,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:32:16,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-14 15:32:16,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:32:18,647 INFO L124 PetriNetUnfolderBase]: 3230/4851 cut-off events. [2024-06-14 15:32:18,648 INFO L125 PetriNetUnfolderBase]: For 484138/484138 co-relation queries the response was YES. [2024-06-14 15:32:18,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46831 conditions, 4851 events. 3230/4851 cut-off events. For 484138/484138 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 24822 event pairs, 632 based on Foata normal form. 24/4860 useless extension candidates. Maximal degree in co-relation 46734. Up to 3832 conditions per place. [2024-06-14 15:32:18,703 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 269 selfloop transitions, 58 changer transitions 0/332 dead transitions. [2024-06-14 15:32:18,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 332 transitions, 4622 flow [2024-06-14 15:32:18,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:32:18,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:32:18,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 208 transitions. [2024-06-14 15:32:18,705 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48372093023255813 [2024-06-14 15:32:18,705 INFO L175 Difference]: Start difference. First operand has 200 places, 267 transitions, 2892 flow. Second operand 10 states and 208 transitions. [2024-06-14 15:32:18,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 332 transitions, 4622 flow [2024-06-14 15:32:19,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 332 transitions, 4570 flow, removed 14 selfloop flow, removed 5 redundant places. [2024-06-14 15:32:19,098 INFO L231 Difference]: Finished difference. Result has 207 places, 273 transitions, 3231 flow [2024-06-14 15:32:19,098 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2840, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3231, PETRI_PLACES=207, PETRI_TRANSITIONS=273} [2024-06-14 15:32:19,099 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 163 predicate places. [2024-06-14 15:32:19,099 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 273 transitions, 3231 flow [2024-06-14 15:32:19,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:32:19,099 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:32:19,099 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:32:19,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-14 15:32:19,100 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-14 15:32:19,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:32:19,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1809688505, now seen corresponding path program 2 times [2024-06-14 15:32:19,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:32:19,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934076943] [2024-06-14 15:32:19,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:32:19,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:32:19,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:32:32,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:32:32,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:32:32,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934076943] [2024-06-14 15:32:32,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934076943] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:32:32,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:32:32,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:32:32,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358161020] [2024-06-14 15:32:32,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:32:32,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:32:32,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:32:32,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:32:32,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:32:33,164 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-14 15:32:33,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 273 transitions, 3231 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:32:33,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:32:33,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-14 15:32:33,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:32:36,107 INFO L124 PetriNetUnfolderBase]: 3449/5220 cut-off events. [2024-06-14 15:32:36,107 INFO L125 PetriNetUnfolderBase]: For 563770/563770 co-relation queries the response was YES. [2024-06-14 15:32:36,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52733 conditions, 5220 events. 3449/5220 cut-off events. For 563770/563770 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 27620 event pairs, 891 based on Foata normal form. 24/5234 useless extension candidates. Maximal degree in co-relation 52633. Up to 4206 conditions per place. [2024-06-14 15:32:36,174 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 285 selfloop transitions, 51 changer transitions 0/341 dead transitions. [2024-06-14 15:32:36,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 341 transitions, 4943 flow [2024-06-14 15:32:36,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:32:36,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:32:36,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 234 transitions. [2024-06-14 15:32:36,175 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45348837209302323 [2024-06-14 15:32:36,175 INFO L175 Difference]: Start difference. First operand has 207 places, 273 transitions, 3231 flow. Second operand 12 states and 234 transitions. [2024-06-14 15:32:36,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 341 transitions, 4943 flow [2024-06-14 15:32:36,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 341 transitions, 4768 flow, removed 55 selfloop flow, removed 5 redundant places. [2024-06-14 15:32:36,727 INFO L231 Difference]: Finished difference. Result has 215 places, 278 transitions, 3421 flow [2024-06-14 15:32:36,728 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=3056, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3421, PETRI_PLACES=215, PETRI_TRANSITIONS=278} [2024-06-14 15:32:36,731 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 171 predicate places. [2024-06-14 15:32:36,732 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 278 transitions, 3421 flow [2024-06-14 15:32:36,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:32:36,732 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:32:36,732 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:32:36,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-14 15:32:36,732 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-14 15:32:36,733 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:32:36,733 INFO L85 PathProgramCache]: Analyzing trace with hash 689271895, now seen corresponding path program 3 times [2024-06-14 15:32:36,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:32:36,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951888137] [2024-06-14 15:32:36,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:32:36,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:32:36,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:32:49,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:32:49,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:32:49,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951888137] [2024-06-14 15:32:49,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951888137] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:32:49,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:32:49,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:32:49,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112234769] [2024-06-14 15:32:49,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:32:49,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:32:49,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:32:49,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:32:49,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:32:49,839 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-14 15:32:49,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 278 transitions, 3421 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:32:49,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:32:49,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-14 15:32:49,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:32:52,860 INFO L124 PetriNetUnfolderBase]: 3633/5509 cut-off events. [2024-06-14 15:32:52,860 INFO L125 PetriNetUnfolderBase]: For 609682/609682 co-relation queries the response was YES. [2024-06-14 15:32:52,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55797 conditions, 5509 events. 3633/5509 cut-off events. For 609682/609682 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 29469 event pairs, 957 based on Foata normal form. 30/5529 useless extension candidates. Maximal degree in co-relation 55694. Up to 4971 conditions per place. [2024-06-14 15:32:52,921 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 285 selfloop transitions, 55 changer transitions 0/345 dead transitions. [2024-06-14 15:32:52,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 345 transitions, 4821 flow [2024-06-14 15:32:52,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:32:52,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:32:52,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 232 transitions. [2024-06-14 15:32:52,923 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4496124031007752 [2024-06-14 15:32:52,923 INFO L175 Difference]: Start difference. First operand has 215 places, 278 transitions, 3421 flow. Second operand 12 states and 232 transitions. [2024-06-14 15:32:52,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 345 transitions, 4821 flow [2024-06-14 15:32:53,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 345 transitions, 4653 flow, removed 50 selfloop flow, removed 8 redundant places. [2024-06-14 15:32:53,506 INFO L231 Difference]: Finished difference. Result has 221 places, 288 transitions, 3612 flow [2024-06-14 15:32:53,507 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=3259, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3612, PETRI_PLACES=221, PETRI_TRANSITIONS=288} [2024-06-14 15:32:53,507 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 177 predicate places. [2024-06-14 15:32:53,507 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 288 transitions, 3612 flow [2024-06-14 15:32:53,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:32:53,507 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:32:53,508 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:32:53,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-14 15:32:53,508 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:32:53,508 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:32:53,508 INFO L85 PathProgramCache]: Analyzing trace with hash 776113807, now seen corresponding path program 1 times [2024-06-14 15:32:53,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:32:53,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445975346] [2024-06-14 15:32:53,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:32:53,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:32:53,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:33:05,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:33:05,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:33:05,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445975346] [2024-06-14 15:33:05,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445975346] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:33:05,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:33:05,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:33:05,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640920915] [2024-06-14 15:33:05,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:33:05,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:33:05,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:33:05,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:33:05,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:33:05,244 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-14 15:33:05,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 288 transitions, 3612 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:33:05,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:33:05,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-14 15:33:05,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:33:08,021 INFO L124 PetriNetUnfolderBase]: 3632/5516 cut-off events. [2024-06-14 15:33:08,024 INFO L125 PetriNetUnfolderBase]: For 592702/592702 co-relation queries the response was YES. [2024-06-14 15:33:08,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55715 conditions, 5516 events. 3632/5516 cut-off events. For 592702/592702 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 29635 event pairs, 958 based on Foata normal form. 6/5517 useless extension candidates. Maximal degree in co-relation 55608. Up to 5275 conditions per place. [2024-06-14 15:33:08,086 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 287 selfloop transitions, 37 changer transitions 0/329 dead transitions. [2024-06-14 15:33:08,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 329 transitions, 4601 flow [2024-06-14 15:33:08,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:33:08,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:33:08,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 185 transitions. [2024-06-14 15:33:08,087 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43023255813953487 [2024-06-14 15:33:08,088 INFO L175 Difference]: Start difference. First operand has 221 places, 288 transitions, 3612 flow. Second operand 10 states and 185 transitions. [2024-06-14 15:33:08,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 329 transitions, 4601 flow [2024-06-14 15:33:08,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 329 transitions, 4452 flow, removed 38 selfloop flow, removed 7 redundant places. [2024-06-14 15:33:08,615 INFO L231 Difference]: Finished difference. Result has 224 places, 291 transitions, 3688 flow [2024-06-14 15:33:08,616 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=3463, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3688, PETRI_PLACES=224, PETRI_TRANSITIONS=291} [2024-06-14 15:33:08,616 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 180 predicate places. [2024-06-14 15:33:08,616 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 291 transitions, 3688 flow [2024-06-14 15:33:08,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:33:08,616 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:33:08,617 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:33:08,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-14 15:33:08,617 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:33:08,617 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:33:08,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1000758223, now seen corresponding path program 4 times [2024-06-14 15:33:08,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:33:08,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887551602] [2024-06-14 15:33:08,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:33:08,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:33:08,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:33:20,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:33:20,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:33:20,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887551602] [2024-06-14 15:33:20,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887551602] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:33:20,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:33:20,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:33:20,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768485959] [2024-06-14 15:33:20,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:33:20,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:33:20,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:33:20,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:33:20,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:33:21,218 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-14 15:33:21,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 291 transitions, 3688 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:33:21,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:33:21,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-14 15:33:21,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:33:24,362 INFO L124 PetriNetUnfolderBase]: 3792/5772 cut-off events. [2024-06-14 15:33:24,363 INFO L125 PetriNetUnfolderBase]: For 650055/650055 co-relation queries the response was YES. [2024-06-14 15:33:24,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57959 conditions, 5772 events. 3792/5772 cut-off events. For 650055/650055 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 31349 event pairs, 981 based on Foata normal form. 30/5797 useless extension candidates. Maximal degree in co-relation 57851. Up to 5345 conditions per place. [2024-06-14 15:33:24,429 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 299 selfloop transitions, 40 changer transitions 0/344 dead transitions. [2024-06-14 15:33:24,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 344 transitions, 4804 flow [2024-06-14 15:33:24,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:33:24,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:33:24,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 206 transitions. [2024-06-14 15:33:24,431 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4355179704016913 [2024-06-14 15:33:24,431 INFO L175 Difference]: Start difference. First operand has 224 places, 291 transitions, 3688 flow. Second operand 11 states and 206 transitions. [2024-06-14 15:33:24,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 344 transitions, 4804 flow [2024-06-14 15:33:25,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 344 transitions, 4606 flow, removed 64 selfloop flow, removed 8 redundant places. [2024-06-14 15:33:25,073 INFO L231 Difference]: Finished difference. Result has 228 places, 297 transitions, 3761 flow [2024-06-14 15:33:25,074 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=3490, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3761, PETRI_PLACES=228, PETRI_TRANSITIONS=297} [2024-06-14 15:33:25,074 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 184 predicate places. [2024-06-14 15:33:25,074 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 297 transitions, 3761 flow [2024-06-14 15:33:25,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:33:25,075 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:33:25,075 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:33:25,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-14 15:33:25,075 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:33:25,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:33:25,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1000614073, now seen corresponding path program 5 times [2024-06-14 15:33:25,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:33:25,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244744124] [2024-06-14 15:33:25,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:33:25,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:33:25,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:33:39,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:33:39,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:33:39,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244744124] [2024-06-14 15:33:39,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244744124] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:33:39,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:33:39,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:33:39,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294684741] [2024-06-14 15:33:39,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:33:39,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:33:39,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:33:39,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:33:39,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:33:39,869 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-14 15:33:39,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 297 transitions, 3761 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:33:39,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:33:39,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-14 15:33:39,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Killed by 15