./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix017.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-06-19_11-23-25.files/mutex-meet-rel/mix017.oepc.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de 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/mix017.oepc.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/mix017.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-7724a2d-m [2024-06-27 23:23:58,437 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 23:23:58,501 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 23:23:58,506 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 23:23:58,507 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 23:23:58,530 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 23:23:58,530 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 23:23:58,531 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 23:23:58,531 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 23:23:58,534 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 23:23:58,534 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 23:23:58,535 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 23:23:58,535 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 23:23:58,536 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 23:23:58,537 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 23:23:58,537 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 23:23:58,537 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 23:23:58,537 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 23:23:58,537 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 23:23:58,538 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 23:23:58,538 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 23:23:58,538 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 23:23:58,538 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 23:23:58,539 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 23:23:58,539 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 23:23:58,539 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 23:23:58,539 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 23:23:58,539 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 23:23:58,540 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 23:23:58,540 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 23:23:58,541 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 23:23:58,541 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 23:23:58,541 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 23:23:58,541 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 23:23:58,542 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 23:23:58,542 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 23:23:58,542 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 23:23:58,542 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 23:23:58,542 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 23:23:58,542 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 23:23:58,543 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 23:23:58,543 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 23:23:58,543 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 23:23:58,543 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-27 23:23:58,804 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 23:23:58,831 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 23:23:58,832 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 23:23:58,833 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 23:23:58,834 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 23:23:58,834 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix017.oepc.i [2024-06-27 23:23:59,789 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 23:24:00,021 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 23:24:00,028 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix017.oepc.i [2024-06-27 23:24:00,040 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32bd9ef65/389a1654f5434af8ab14c7fc0d191c67/FLAG9d7d45cc0 [2024-06-27 23:24:00,050 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32bd9ef65/389a1654f5434af8ab14c7fc0d191c67 [2024-06-27 23:24:00,052 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-27 23:24:00,053 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-27 23:24:00,053 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/mix017.oepc.yml/witness.yml [2024-06-27 23:24:00,143 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 23:24:00,144 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-27 23:24:00,145 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 23:24:00,145 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 23:24:00,148 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 23:24:00,149 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 11:24:00" (1/2) ... [2024-06-27 23:24:00,150 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34d40d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:24:00, skipping insertion in model container [2024-06-27 23:24:00,150 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 11:24:00" (1/2) ... [2024-06-27 23:24:00,153 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@41064cf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:24:00, skipping insertion in model container [2024-06-27 23:24:00,153 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 11:24:00" (2/2) ... [2024-06-27 23:24:00,153 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34d40d4 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:24:00, skipping insertion in model container [2024-06-27 23:24:00,154 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 11:24:00" (2/2) ... [2024-06-27 23:24:00,154 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-27 23:24:00,177 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-27 23:24:00,178 INFO L97 edCorrectnessWitness]: Location invariant before [L875-L875] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EAX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p1_EAX) + (long long )y >= 0LL) && (0LL - (long long )__unbuffered_p2_EAX) + (long long )z >= 0LL) && (0LL - (long long )__unbuffered_p3_EAX) + (long long )z >= 0LL) && (0LL - (long long )__unbuffered_p3_EBX) + (long long )a >= 0LL) && (0LL - (long long )__unbuffered_p3_EBX) + (long long )a$mem_tmp >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$r_buff0_thd1 >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff0_thd1 >= 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_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0 >= 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_buff0_used >= 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_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd4) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd4) + (long long )a$w_buff0_used >= 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_buff0_used >= 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$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0_used >= 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_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd4) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd4) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )a$w_buff0_used >= 0LL) && (long long )a + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a + (long long )a$w_buff0 >= 0LL) && (long long )a + (long long )a$w_buff0_used >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0_used >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd4 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd4 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff1_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )x >= 0LL) && (long long )a$r_buff0_thd1 + (long long )y >= 0LL) && (long long )a$r_buff0_thd1 + (long long )z >= 0LL) && (long long )a$r_buff0_thd1 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd4 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd4 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd1 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd1 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd4 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd4 + (long long )a$w_buff0_used >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1_used >= 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_buff0_used + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0_used + (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0_used + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0_used + (long long )x >= 0LL) && (long long )a$w_buff0_used + (long long )y >= 0LL) && (long long )a$w_buff0_used + (long long )z >= 0LL) && (long long )a$w_buff0_used + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0_used + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )a$w_buff0_used) - (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )a$mem_tmp >= 0LL) && (long long )a - (long long )a$mem_tmp >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd4 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd1 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd4 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff1_used >= 0LL) && (long long )a$r_buff1_thd1 - (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd1 - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0_used - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff1 - (long long )a$w_buff1_used >= 0LL) [2024-06-27 23:24:00,179 INFO L97 edCorrectnessWitness]: Location invariant before [L873-L873] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EAX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p1_EAX) + (long long )y >= 0LL) && (0LL - (long long )__unbuffered_p2_EAX) + (long long )z >= 0LL) && (0LL - (long long )__unbuffered_p3_EAX) + (long long )z >= 0LL) && (0LL - (long long )__unbuffered_p3_EBX) + (long long )a >= 0LL) && (0LL - (long long )__unbuffered_p3_EBX) + (long long )a$mem_tmp >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$r_buff0_thd1 >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff0_thd1 >= 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_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0 >= 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_buff0_used >= 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_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd4) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd4) + (long long )a$w_buff0_used >= 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_buff0_used >= 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$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0_used >= 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_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd4) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd4) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )a$w_buff0_used >= 0LL) && (long long )a + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a + (long long )a$w_buff0 >= 0LL) && (long long )a + (long long )a$w_buff0_used >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0_used >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd4 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd4 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff1_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )x >= 0LL) && (long long )a$r_buff0_thd1 + (long long )y >= 0LL) && (long long )a$r_buff0_thd1 + (long long )z >= 0LL) && (long long )a$r_buff0_thd1 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd4 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd4 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd1 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd1 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd4 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd4 + (long long )a$w_buff0_used >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1_used >= 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_buff0_used + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0_used + (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0_used + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0_used + (long long )x >= 0LL) && (long long )a$w_buff0_used + (long long )y >= 0LL) && (long long )a$w_buff0_used + (long long )z >= 0LL) && (long long )a$w_buff0_used + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0_used + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )a$w_buff0_used) - (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )a$mem_tmp >= 0LL) && (long long )a - (long long )a$mem_tmp >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd4 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd1 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd4 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff1_used >= 0LL) && (long long )a$r_buff1_thd1 - (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd1 - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0_used - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff1 - (long long )a$w_buff1_used >= 0LL) [2024-06-27 23:24:00,179 INFO L97 edCorrectnessWitness]: Location invariant before [L871-L871] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EAX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p1_EAX) + (long long )y >= 0LL) && (0LL - (long long )__unbuffered_p2_EAX) + (long long )z >= 0LL) && (0LL - (long long )__unbuffered_p3_EAX) + (long long )z >= 0LL) && (0LL - (long long )__unbuffered_p3_EBX) + (long long )a >= 0LL) && (0LL - (long long )__unbuffered_p3_EBX) + (long long )a$mem_tmp >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$r_buff0_thd1 >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff0_thd1 >= 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_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0 >= 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_buff0_used >= 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_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd4) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd4) + (long long )a$w_buff0_used >= 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_buff0_used >= 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$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0_used >= 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_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd4) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd4) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )a$w_buff0_used >= 0LL) && (long long )a + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a + (long long )a$w_buff0 >= 0LL) && (long long )a + (long long )a$w_buff0_used >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0_used >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd4 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd4 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff1_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )x >= 0LL) && (long long )a$r_buff0_thd1 + (long long )y >= 0LL) && (long long )a$r_buff0_thd1 + (long long )z >= 0LL) && (long long )a$r_buff0_thd1 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd4 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd4 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd1 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd1 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd4 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd4 + (long long )a$w_buff0_used >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1_used >= 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_buff0_used + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0_used + (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0_used + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0_used + (long long )x >= 0LL) && (long long )a$w_buff0_used + (long long )y >= 0LL) && (long long )a$w_buff0_used + (long long )z >= 0LL) && (long long )a$w_buff0_used + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0_used + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )a$w_buff0_used) - (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )a$mem_tmp >= 0LL) && (long long )a - (long long )a$mem_tmp >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd4 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd1 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd4 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff1_used >= 0LL) && (long long )a$r_buff1_thd1 - (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd1 - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0_used - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff1 - (long long )a$w_buff1_used >= 0LL) [2024-06-27 23:24:00,179 INFO L97 edCorrectnessWitness]: Location invariant before [L876-L876] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EAX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p1_EAX) + (long long )y >= 0LL) && (0LL - (long long )__unbuffered_p2_EAX) + (long long )z >= 0LL) && (0LL - (long long )__unbuffered_p3_EAX) + (long long )z >= 0LL) && (0LL - (long long )__unbuffered_p3_EBX) + (long long )a >= 0LL) && (0LL - (long long )__unbuffered_p3_EBX) + (long long )a$mem_tmp >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$r_buff0_thd1 >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff0_thd1 >= 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_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0 >= 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_buff0_used >= 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_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd4) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd4) + (long long )a$w_buff0_used >= 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_buff0_used >= 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$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0_used >= 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_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd4) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd4) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )a$w_buff0_used >= 0LL) && (long long )a + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a + (long long )a$w_buff0 >= 0LL) && (long long )a + (long long )a$w_buff0_used >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0_used >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd4 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd4 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff1_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )x >= 0LL) && (long long )a$r_buff0_thd1 + (long long )y >= 0LL) && (long long )a$r_buff0_thd1 + (long long )z >= 0LL) && (long long )a$r_buff0_thd1 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd4 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd4 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd1 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd1 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd4 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd4 + (long long )a$w_buff0_used >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1_used >= 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_buff0_used + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0_used + (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0_used + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0_used + (long long )x >= 0LL) && (long long )a$w_buff0_used + (long long )y >= 0LL) && (long long )a$w_buff0_used + (long long )z >= 0LL) && (long long )a$w_buff0_used + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0_used + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )a$w_buff0_used) - (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )a$mem_tmp >= 0LL) && (long long )a - (long long )a$mem_tmp >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd4 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd1 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd4 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff1_used >= 0LL) && (long long )a$r_buff1_thd1 - (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd1 - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0_used - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff1 - (long long )a$w_buff1_used >= 0LL) [2024-06-27 23:24:00,179 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-27 23:24:00,180 INFO L106 edCorrectnessWitness]: ghost_update [L869-L869] multithreaded = 1; [2024-06-27 23:24:00,216 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 23:24:00,521 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 23:24:00,531 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-27 23:24:00,750 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 23:24:00,784 INFO L206 MainTranslator]: Completed translation [2024-06-27 23:24:00,785 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:24:00 WrapperNode [2024-06-27 23:24:00,785 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 23:24:00,785 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 23:24:00,786 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 23:24:00,786 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 23:24:00,791 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 27.06 11:24:00" (1/1) ... [2024-06-27 23:24:00,815 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 27.06 11:24:00" (1/1) ... [2024-06-27 23:24:00,914 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 140 [2024-06-27 23:24:00,914 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 23:24:00,915 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 23:24:00,915 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 23:24:00,915 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 23:24:00,924 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:24:00" (1/1) ... [2024-06-27 23:24:00,924 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:24:00" (1/1) ... [2024-06-27 23:24:00,941 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:24:00" (1/1) ... [2024-06-27 23:24:00,971 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-27 23:24:00,971 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:24:00" (1/1) ... [2024-06-27 23:24:00,971 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:24:00" (1/1) ... [2024-06-27 23:24:00,993 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:24:00" (1/1) ... [2024-06-27 23:24:00,995 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:24:00" (1/1) ... [2024-06-27 23:24:01,001 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:24:00" (1/1) ... [2024-06-27 23:24:01,005 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:24:00" (1/1) ... [2024-06-27 23:24:01,018 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 23:24:01,019 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 23:24:01,019 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 23:24:01,019 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 23:24:01,020 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:24:00" (1/1) ... [2024-06-27 23:24:01,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 23:24:01,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 23:24:01,043 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-27 23:24:01,064 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-27 23:24:01,075 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 23:24:01,075 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 23:24:01,075 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-27 23:24:01,075 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-27 23:24:01,075 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-27 23:24:01,076 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-27 23:24:01,076 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-27 23:24:01,076 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-27 23:24:01,076 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-06-27 23:24:01,076 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-06-27 23:24:01,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 23:24:01,076 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 23:24:01,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 23:24:01,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 23:24:01,078 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 23:24:01,204 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 23:24:01,206 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 23:24:01,856 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 23:24:01,856 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 23:24:02,028 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 23:24:02,029 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-27 23:24:02,029 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 11:24:02 BoogieIcfgContainer [2024-06-27 23:24:02,029 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 23:24:02,030 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 23:24:02,031 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 23:24:02,033 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 23:24:02,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 11:24:00" (1/4) ... [2024-06-27 23:24:02,034 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26672b58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 11:24:02, skipping insertion in model container [2024-06-27 23:24:02,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 11:24:00" (2/4) ... [2024-06-27 23:24:02,035 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26672b58 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 11:24:02, skipping insertion in model container [2024-06-27 23:24:02,035 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:24:00" (3/4) ... [2024-06-27 23:24:02,036 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26672b58 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 11:24:02, skipping insertion in model container [2024-06-27 23:24:02,036 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 11:24:02" (4/4) ... [2024-06-27 23:24:02,037 INFO L112 eAbstractionObserver]: Analyzing ICFG mix017.oepc.i [2024-06-27 23:24:02,050 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 23:24:02,050 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-06-27 23:24:02,051 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 23:24:02,108 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 23:24:02,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 52 transitions, 120 flow [2024-06-27 23:24:02,168 INFO L124 PetriNetUnfolderBase]: 0/48 cut-off events. [2024-06-27 23:24:02,169 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 23:24:02,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 48 events. 0/48 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 82 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-27 23:24:02,171 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 52 transitions, 120 flow [2024-06-27 23:24:02,175 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 42 transitions, 96 flow [2024-06-27 23:24:02,186 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 23:24:02,191 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;@100f0eab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 23:24:02,192 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-06-27 23:24:02,211 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 23:24:02,212 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-27 23:24:02,212 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 23:24:02,212 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:24:02,213 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 23:24:02,213 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:24:02,218 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:24:02,219 INFO L85 PathProgramCache]: Analyzing trace with hash 406019951, now seen corresponding path program 1 times [2024-06-27 23:24:02,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:24:02,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648336345] [2024-06-27 23:24:02,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:24:02,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:24:02,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:24:04,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:24:04,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:24:04,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648336345] [2024-06-27 23:24:04,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648336345] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:24:04,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:24:04,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 23:24:04,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342372765] [2024-06-27 23:24:04,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:24:04,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 23:24:04,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:24:04,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 23:24:04,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 23:24:04,264 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 52 [2024-06-27 23:24:04,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:24:04,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:24:04,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 52 [2024-06-27 23:24:04,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:24:06,039 INFO L124 PetriNetUnfolderBase]: 9042/12432 cut-off events. [2024-06-27 23:24:06,039 INFO L125 PetriNetUnfolderBase]: For 153/153 co-relation queries the response was YES. [2024-06-27 23:24:06,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25034 conditions, 12432 events. 9042/12432 cut-off events. For 153/153 co-relation queries the response was YES. Maximal size of possible extension queue 448. Compared 65975 event pairs, 6942 based on Foata normal form. 1/12248 useless extension candidates. Maximal degree in co-relation 25021. Up to 12273 conditions per place. [2024-06-27 23:24:06,115 INFO L140 encePairwiseOnDemand]: 43/52 looper letters, 43 selfloop transitions, 5 changer transitions 0/56 dead transitions. [2024-06-27 23:24:06,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 56 transitions, 229 flow [2024-06-27 23:24:06,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 23:24:06,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 23:24:06,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2024-06-27 23:24:06,126 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6217948717948718 [2024-06-27 23:24:06,127 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 96 flow. Second operand 3 states and 97 transitions. [2024-06-27 23:24:06,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 56 transitions, 229 flow [2024-06-27 23:24:06,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 56 transitions, 222 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-27 23:24:06,133 INFO L231 Difference]: Finished difference. Result has 54 places, 46 transitions, 131 flow [2024-06-27 23:24:06,135 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=131, PETRI_PLACES=54, PETRI_TRANSITIONS=46} [2024-06-27 23:24:06,137 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -1 predicate places. [2024-06-27 23:24:06,137 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 131 flow [2024-06-27 23:24:06,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:24:06,138 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:24:06,138 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:24:06,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 23:24:06,138 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:24:06,139 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:24:06,139 INFO L85 PathProgramCache]: Analyzing trace with hash -656326388, now seen corresponding path program 1 times [2024-06-27 23:24:06,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:24:06,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138928456] [2024-06-27 23:24:06,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:24:06,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:24:06,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:24:07,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:24:07,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:24:07,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138928456] [2024-06-27 23:24:07,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138928456] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:24:07,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:24:07,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 23:24:07,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016103799] [2024-06-27 23:24:07,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:24:07,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 23:24:07,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:24:07,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 23:24:07,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 23:24:07,566 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 52 [2024-06-27 23:24:07,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 131 flow. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:24:07,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:24:07,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 52 [2024-06-27 23:24:07,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:24:09,310 INFO L124 PetriNetUnfolderBase]: 9032/12429 cut-off events. [2024-06-27 23:24:09,311 INFO L125 PetriNetUnfolderBase]: For 2474/2474 co-relation queries the response was YES. [2024-06-27 23:24:09,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28342 conditions, 12429 events. 9032/12429 cut-off events. For 2474/2474 co-relation queries the response was YES. Maximal size of possible extension queue 448. Compared 66155 event pairs, 6162 based on Foata normal form. 4/12408 useless extension candidates. Maximal degree in co-relation 28330. Up to 12238 conditions per place. [2024-06-27 23:24:09,360 INFO L140 encePairwiseOnDemand]: 42/52 looper letters, 53 selfloop transitions, 9 changer transitions 0/70 dead transitions. [2024-06-27 23:24:09,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 70 transitions, 321 flow [2024-06-27 23:24:09,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 23:24:09,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 23:24:09,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 126 transitions. [2024-06-27 23:24:09,363 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6057692307692307 [2024-06-27 23:24:09,363 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 131 flow. Second operand 4 states and 126 transitions. [2024-06-27 23:24:09,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 70 transitions, 321 flow [2024-06-27 23:24:09,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 70 transitions, 316 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 23:24:09,366 INFO L231 Difference]: Finished difference. Result has 57 places, 50 transitions, 179 flow [2024-06-27 23:24:09,366 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=179, PETRI_PLACES=57, PETRI_TRANSITIONS=50} [2024-06-27 23:24:09,366 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 2 predicate places. [2024-06-27 23:24:09,366 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 50 transitions, 179 flow [2024-06-27 23:24:09,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:24:09,367 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:24:09,367 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:24:09,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 23:24:09,367 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:24:09,368 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:24:09,368 INFO L85 PathProgramCache]: Analyzing trace with hash 630570155, now seen corresponding path program 1 times [2024-06-27 23:24:09,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:24:09,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682618637] [2024-06-27 23:24:09,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:24:09,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:24:09,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:24:11,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:24:11,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:24:11,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682618637] [2024-06-27 23:24:11,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682618637] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:24:11,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:24:11,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:24:11,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215115063] [2024-06-27 23:24:11,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:24:11,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:24:11,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:24:11,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:24:11,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:24:11,501 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 52 [2024-06-27 23:24:11,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 50 transitions, 179 flow. Second operand has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:24:11,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:24:11,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 52 [2024-06-27 23:24:11,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:24:13,484 INFO L124 PetriNetUnfolderBase]: 10952/15010 cut-off events. [2024-06-27 23:24:13,484 INFO L125 PetriNetUnfolderBase]: For 8199/8199 co-relation queries the response was YES. [2024-06-27 23:24:13,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37905 conditions, 15010 events. 10952/15010 cut-off events. For 8199/8199 co-relation queries the response was YES. Maximal size of possible extension queue 528. Compared 80191 event pairs, 6286 based on Foata normal form. 4/14984 useless extension candidates. Maximal degree in co-relation 37890. Up to 14757 conditions per place. [2024-06-27 23:24:13,568 INFO L140 encePairwiseOnDemand]: 39/52 looper letters, 74 selfloop transitions, 18 changer transitions 0/98 dead transitions. [2024-06-27 23:24:13,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 98 transitions, 510 flow [2024-06-27 23:24:13,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:24:13,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:24:13,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 187 transitions. [2024-06-27 23:24:13,570 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5137362637362637 [2024-06-27 23:24:13,570 INFO L175 Difference]: Start difference. First operand has 57 places, 50 transitions, 179 flow. Second operand 7 states and 187 transitions. [2024-06-27 23:24:13,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 98 transitions, 510 flow [2024-06-27 23:24:13,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 98 transitions, 482 flow, removed 6 selfloop flow, removed 2 redundant places. [2024-06-27 23:24:13,574 INFO L231 Difference]: Finished difference. Result has 63 places, 58 transitions, 258 flow [2024-06-27 23:24:13,574 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=258, PETRI_PLACES=63, PETRI_TRANSITIONS=58} [2024-06-27 23:24:13,575 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 8 predicate places. [2024-06-27 23:24:13,575 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 58 transitions, 258 flow [2024-06-27 23:24:13,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:24:13,575 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:24:13,576 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:24:13,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 23:24:13,576 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:24:13,576 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:24:13,576 INFO L85 PathProgramCache]: Analyzing trace with hash 651841701, now seen corresponding path program 1 times [2024-06-27 23:24:13,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:24:13,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649847625] [2024-06-27 23:24:13,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:24:13,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:24:13,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:24:16,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:24:16,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:24:16,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649847625] [2024-06-27 23:24:16,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649847625] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:24:16,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:24:16,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:24:16,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049865666] [2024-06-27 23:24:16,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:24:16,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:24:16,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:24:16,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:24:16,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:24:16,254 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 52 [2024-06-27 23:24:16,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 58 transitions, 258 flow. Second operand has 8 states, 8 states have (on average 14.125) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:24:16,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:24:16,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 52 [2024-06-27 23:24:16,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:24:18,184 INFO L124 PetriNetUnfolderBase]: 10936/14988 cut-off events. [2024-06-27 23:24:18,185 INFO L125 PetriNetUnfolderBase]: For 16570/16570 co-relation queries the response was YES. [2024-06-27 23:24:18,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42250 conditions, 14988 events. 10936/14988 cut-off events. For 16570/16570 co-relation queries the response was YES. Maximal size of possible extension queue 528. Compared 80088 event pairs, 5376 based on Foata normal form. 8/14966 useless extension candidates. Maximal degree in co-relation 42232. Up to 14691 conditions per place. [2024-06-27 23:24:18,255 INFO L140 encePairwiseOnDemand]: 39/52 looper letters, 81 selfloop transitions, 21 changer transitions 0/108 dead transitions. [2024-06-27 23:24:18,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 108 transitions, 602 flow [2024-06-27 23:24:18,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:24:18,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:24:18,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 210 transitions. [2024-06-27 23:24:18,257 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5048076923076923 [2024-06-27 23:24:18,257 INFO L175 Difference]: Start difference. First operand has 63 places, 58 transitions, 258 flow. Second operand 8 states and 210 transitions. [2024-06-27 23:24:18,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 108 transitions, 602 flow [2024-06-27 23:24:18,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 108 transitions, 561 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-27 23:24:18,263 INFO L231 Difference]: Finished difference. Result has 66 places, 60 transitions, 291 flow [2024-06-27 23:24:18,264 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=291, PETRI_PLACES=66, PETRI_TRANSITIONS=60} [2024-06-27 23:24:18,264 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 11 predicate places. [2024-06-27 23:24:18,265 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 60 transitions, 291 flow [2024-06-27 23:24:18,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:24:18,265 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:24:18,265 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:24:18,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 23:24:18,265 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:24:18,266 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:24:18,266 INFO L85 PathProgramCache]: Analyzing trace with hash 75418624, now seen corresponding path program 1 times [2024-06-27 23:24:18,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:24:18,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850084501] [2024-06-27 23:24:18,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:24:18,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:24:18,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:24:20,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:24:20,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:24:20,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850084501] [2024-06-27 23:24:20,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850084501] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:24:20,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:24:20,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 23:24:20,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107722546] [2024-06-27 23:24:20,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:24:20,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 23:24:20,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:24:20,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 23:24:20,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 23:24:20,253 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 52 [2024-06-27 23:24:20,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 60 transitions, 291 flow. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 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-27 23:24:20,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:24:20,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 52 [2024-06-27 23:24:20,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:24:22,170 INFO L124 PetriNetUnfolderBase]: 10918/14968 cut-off events. [2024-06-27 23:24:22,170 INFO L125 PetriNetUnfolderBase]: For 27891/27891 co-relation queries the response was YES. [2024-06-27 23:24:22,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45265 conditions, 14968 events. 10918/14968 cut-off events. For 27891/27891 co-relation queries the response was YES. Maximal size of possible extension queue 533. Compared 80673 event pairs, 7040 based on Foata normal form. 6/14960 useless extension candidates. Maximal degree in co-relation 45246. Up to 14742 conditions per place. [2024-06-27 23:24:22,233 INFO L140 encePairwiseOnDemand]: 41/52 looper letters, 65 selfloop transitions, 12 changer transitions 0/83 dead transitions. [2024-06-27 23:24:22,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 83 transitions, 526 flow [2024-06-27 23:24:22,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 23:24:22,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 23:24:22,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 125 transitions. [2024-06-27 23:24:22,235 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4807692307692308 [2024-06-27 23:24:22,235 INFO L175 Difference]: Start difference. First operand has 66 places, 60 transitions, 291 flow. Second operand 5 states and 125 transitions. [2024-06-27 23:24:22,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 83 transitions, 526 flow [2024-06-27 23:24:22,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 83 transitions, 468 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-06-27 23:24:22,240 INFO L231 Difference]: Finished difference. Result has 66 places, 66 transitions, 318 flow [2024-06-27 23:24:22,241 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=318, PETRI_PLACES=66, PETRI_TRANSITIONS=66} [2024-06-27 23:24:22,241 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 11 predicate places. [2024-06-27 23:24:22,241 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 66 transitions, 318 flow [2024-06-27 23:24:22,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 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-27 23:24:22,242 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:24:22,242 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:24:22,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 23:24:22,242 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:24:22,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:24:22,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1505591707, now seen corresponding path program 1 times [2024-06-27 23:24:22,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:24:22,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699789268] [2024-06-27 23:24:22,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:24:22,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:24:22,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:24:24,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:24:24,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:24:24,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699789268] [2024-06-27 23:24:24,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699789268] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:24:24,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:24:24,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:24:24,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414168307] [2024-06-27 23:24:24,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:24:24,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:24:24,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:24:24,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:24:24,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:24:24,334 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 52 [2024-06-27 23:24:24,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 66 transitions, 318 flow. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:24:24,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:24:24,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 52 [2024-06-27 23:24:24,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:24:26,329 INFO L124 PetriNetUnfolderBase]: 10988/15064 cut-off events. [2024-06-27 23:24:26,330 INFO L125 PetriNetUnfolderBase]: For 38718/38718 co-relation queries the response was YES. [2024-06-27 23:24:26,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49230 conditions, 15064 events. 10988/15064 cut-off events. For 38718/38718 co-relation queries the response was YES. Maximal size of possible extension queue 535. Compared 81373 event pairs, 6698 based on Foata normal form. 3/15065 useless extension candidates. Maximal degree in co-relation 49209. Up to 14775 conditions per place. [2024-06-27 23:24:26,408 INFO L140 encePairwiseOnDemand]: 38/52 looper letters, 87 selfloop transitions, 32 changer transitions 0/125 dead transitions. [2024-06-27 23:24:26,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 125 transitions, 853 flow [2024-06-27 23:24:26,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:24:26,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:24:26,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 181 transitions. [2024-06-27 23:24:26,410 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49725274725274726 [2024-06-27 23:24:26,410 INFO L175 Difference]: Start difference. First operand has 66 places, 66 transitions, 318 flow. Second operand 7 states and 181 transitions. [2024-06-27 23:24:26,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 125 transitions, 853 flow [2024-06-27 23:24:26,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 125 transitions, 805 flow, removed 18 selfloop flow, removed 1 redundant places. [2024-06-27 23:24:26,417 INFO L231 Difference]: Finished difference. Result has 75 places, 89 transitions, 553 flow [2024-06-27 23:24:26,417 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=553, PETRI_PLACES=75, PETRI_TRANSITIONS=89} [2024-06-27 23:24:26,417 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 20 predicate places. [2024-06-27 23:24:26,417 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 89 transitions, 553 flow [2024-06-27 23:24:26,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:24:26,418 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:24:26,418 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:24:26,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 23:24:26,418 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:24:26,419 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:24:26,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1261602305, now seen corresponding path program 2 times [2024-06-27 23:24:26,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:24:26,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254943520] [2024-06-27 23:24:26,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:24:26,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:24:26,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:24:28,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:24:28,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:24:28,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254943520] [2024-06-27 23:24:28,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254943520] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:24:28,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:24:28,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:24:28,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340602673] [2024-06-27 23:24:28,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:24:28,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:24:28,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:24:28,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:24:28,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:24:28,495 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 52 [2024-06-27 23:24:28,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 89 transitions, 553 flow. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:24:28,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:24:28,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 52 [2024-06-27 23:24:28,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:24:30,297 INFO L124 PetriNetUnfolderBase]: 11064/15198 cut-off events. [2024-06-27 23:24:30,297 INFO L125 PetriNetUnfolderBase]: For 53565/53565 co-relation queries the response was YES. [2024-06-27 23:24:30,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53929 conditions, 15198 events. 11064/15198 cut-off events. For 53565/53565 co-relation queries the response was YES. Maximal size of possible extension queue 535. Compared 82184 event pairs, 6896 based on Foata normal form. 5/15188 useless extension candidates. Maximal degree in co-relation 53902. Up to 14876 conditions per place. [2024-06-27 23:24:30,375 INFO L140 encePairwiseOnDemand]: 40/52 looper letters, 88 selfloop transitions, 39 changer transitions 0/133 dead transitions. [2024-06-27 23:24:30,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 133 transitions, 1096 flow [2024-06-27 23:24:30,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 23:24:30,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 23:24:30,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 153 transitions. [2024-06-27 23:24:30,376 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49038461538461536 [2024-06-27 23:24:30,376 INFO L175 Difference]: Start difference. First operand has 75 places, 89 transitions, 553 flow. Second operand 6 states and 153 transitions. [2024-06-27 23:24:30,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 133 transitions, 1096 flow [2024-06-27 23:24:30,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 133 transitions, 1046 flow, removed 24 selfloop flow, removed 1 redundant places. [2024-06-27 23:24:30,406 INFO L231 Difference]: Finished difference. Result has 81 places, 106 transitions, 804 flow [2024-06-27 23:24:30,406 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=525, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=804, PETRI_PLACES=81, PETRI_TRANSITIONS=106} [2024-06-27 23:24:30,408 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 26 predicate places. [2024-06-27 23:24:30,408 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 106 transitions, 804 flow [2024-06-27 23:24:30,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:24:30,408 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:24:30,408 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:24:30,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 23:24:30,409 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:24:30,409 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:24:30,409 INFO L85 PathProgramCache]: Analyzing trace with hash -278829631, now seen corresponding path program 3 times [2024-06-27 23:24:30,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:24:30,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215568193] [2024-06-27 23:24:30,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:24:30,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:24:30,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:24:32,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:24:32,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:24:32,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215568193] [2024-06-27 23:24:32,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215568193] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:24:32,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:24:32,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:24:32,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571292235] [2024-06-27 23:24:32,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:24:32,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:24:32,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:24:32,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:24:32,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:24:32,115 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 52 [2024-06-27 23:24:32,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 106 transitions, 804 flow. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:24:32,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:24:32,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 52 [2024-06-27 23:24:32,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:24:34,131 INFO L124 PetriNetUnfolderBase]: 11048/15180 cut-off events. [2024-06-27 23:24:34,131 INFO L125 PetriNetUnfolderBase]: For 60689/60689 co-relation queries the response was YES. [2024-06-27 23:24:34,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54675 conditions, 15180 events. 11048/15180 cut-off events. For 60689/60689 co-relation queries the response was YES. Maximal size of possible extension queue 535. Compared 81981 event pairs, 6893 based on Foata normal form. 5/15171 useless extension candidates. Maximal degree in co-relation 54644. Up to 14913 conditions per place. [2024-06-27 23:24:34,214 INFO L140 encePairwiseOnDemand]: 40/52 looper letters, 104 selfloop transitions, 20 changer transitions 0/130 dead transitions. [2024-06-27 23:24:34,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 130 transitions, 1132 flow [2024-06-27 23:24:34,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 23:24:34,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 23:24:34,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 147 transitions. [2024-06-27 23:24:34,216 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47115384615384615 [2024-06-27 23:24:34,216 INFO L175 Difference]: Start difference. First operand has 81 places, 106 transitions, 804 flow. Second operand 6 states and 147 transitions. [2024-06-27 23:24:34,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 130 transitions, 1132 flow [2024-06-27 23:24:34,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 130 transitions, 1020 flow, removed 38 selfloop flow, removed 2 redundant places. [2024-06-27 23:24:34,266 INFO L231 Difference]: Finished difference. Result has 85 places, 106 transitions, 747 flow [2024-06-27 23:24:34,267 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=692, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=747, PETRI_PLACES=85, PETRI_TRANSITIONS=106} [2024-06-27 23:24:34,267 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 30 predicate places. [2024-06-27 23:24:34,267 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 106 transitions, 747 flow [2024-06-27 23:24:34,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:24:34,268 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:24:34,268 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:24:34,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 23:24:34,268 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:24:34,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:24:34,268 INFO L85 PathProgramCache]: Analyzing trace with hash 805289995, now seen corresponding path program 1 times [2024-06-27 23:24:34,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:24:34,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067052269] [2024-06-27 23:24:34,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:24:34,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:24:34,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:24:36,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:24:36,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:24:36,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067052269] [2024-06-27 23:24:36,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067052269] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:24:36,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:24:36,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:24:36,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256471209] [2024-06-27 23:24:36,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:24:36,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:24:36,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:24:36,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:24:36,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:24:36,457 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 52 [2024-06-27 23:24:36,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 106 transitions, 747 flow. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:24:36,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:24:36,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 52 [2024-06-27 23:24:36,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:24:38,926 INFO L124 PetriNetUnfolderBase]: 11149/15318 cut-off events. [2024-06-27 23:24:38,926 INFO L125 PetriNetUnfolderBase]: For 69840/69846 co-relation queries the response was YES. [2024-06-27 23:24:38,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56307 conditions, 15318 events. 11149/15318 cut-off events. For 69840/69846 co-relation queries the response was YES. Maximal size of possible extension queue 535. Compared 82839 event pairs, 6516 based on Foata normal form. 7/15317 useless extension candidates. Maximal degree in co-relation 56274. Up to 14967 conditions per place. [2024-06-27 23:24:39,000 INFO L140 encePairwiseOnDemand]: 37/52 looper letters, 133 selfloop transitions, 45 changer transitions 0/184 dead transitions. [2024-06-27 23:24:39,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 184 transitions, 1507 flow [2024-06-27 23:24:39,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:24:39,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:24:39,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 248 transitions. [2024-06-27 23:24:39,002 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47692307692307695 [2024-06-27 23:24:39,002 INFO L175 Difference]: Start difference. First operand has 85 places, 106 transitions, 747 flow. Second operand 10 states and 248 transitions. [2024-06-27 23:24:39,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 184 transitions, 1507 flow [2024-06-27 23:24:39,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 184 transitions, 1435 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-27 23:24:39,058 INFO L231 Difference]: Finished difference. Result has 91 places, 127 transitions, 960 flow [2024-06-27 23:24:39,058 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=675, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=960, PETRI_PLACES=91, PETRI_TRANSITIONS=127} [2024-06-27 23:24:39,059 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 36 predicate places. [2024-06-27 23:24:39,059 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 127 transitions, 960 flow [2024-06-27 23:24:39,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:24:39,059 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:24:39,059 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:24:39,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 23:24:39,060 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:24:39,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:24:39,060 INFO L85 PathProgramCache]: Analyzing trace with hash 562846459, now seen corresponding path program 2 times [2024-06-27 23:24:39,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:24:39,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104223330] [2024-06-27 23:24:39,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:24:39,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:24:39,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:24:41,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:24:41,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:24:41,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104223330] [2024-06-27 23:24:41,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104223330] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:24:41,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:24:41,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:24:41,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170696222] [2024-06-27 23:24:41,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:24:41,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:24:41,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:24:41,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:24:41,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:24:41,565 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 52 [2024-06-27 23:24:41,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 127 transitions, 960 flow. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:24:41,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:24:41,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 52 [2024-06-27 23:24:41,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:24:43,818 INFO L124 PetriNetUnfolderBase]: 11248/15463 cut-off events. [2024-06-27 23:24:43,818 INFO L125 PetriNetUnfolderBase]: For 89714/89720 co-relation queries the response was YES. [2024-06-27 23:24:43,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61247 conditions, 15463 events. 11248/15463 cut-off events. For 89714/89720 co-relation queries the response was YES. Maximal size of possible extension queue 534. Compared 83498 event pairs, 6316 based on Foata normal form. 9/15467 useless extension candidates. Maximal degree in co-relation 61214. Up to 15097 conditions per place. [2024-06-27 23:24:43,915 INFO L140 encePairwiseOnDemand]: 37/52 looper letters, 132 selfloop transitions, 52 changer transitions 0/190 dead transitions. [2024-06-27 23:24:43,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 190 transitions, 1704 flow [2024-06-27 23:24:43,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:24:43,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:24:43,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 199 transitions. [2024-06-27 23:24:43,916 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47836538461538464 [2024-06-27 23:24:43,916 INFO L175 Difference]: Start difference. First operand has 91 places, 127 transitions, 960 flow. Second operand 8 states and 199 transitions. [2024-06-27 23:24:43,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 190 transitions, 1704 flow [2024-06-27 23:24:43,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 190 transitions, 1561 flow, removed 50 selfloop flow, removed 4 redundant places. [2024-06-27 23:24:44,001 INFO L231 Difference]: Finished difference. Result has 96 places, 151 transitions, 1216 flow [2024-06-27 23:24:44,001 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=873, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1216, PETRI_PLACES=96, PETRI_TRANSITIONS=151} [2024-06-27 23:24:44,002 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 41 predicate places. [2024-06-27 23:24:44,002 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 151 transitions, 1216 flow [2024-06-27 23:24:44,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:24:44,002 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:24:44,002 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:24:44,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 23:24:44,003 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:24:44,003 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:24:44,003 INFO L85 PathProgramCache]: Analyzing trace with hash 562966429, now seen corresponding path program 3 times [2024-06-27 23:24:44,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:24:44,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349122806] [2024-06-27 23:24:44,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:24:44,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:24:44,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:24:46,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:24:46,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:24:46,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349122806] [2024-06-27 23:24:46,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349122806] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:24:46,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:24:46,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:24:46,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558251238] [2024-06-27 23:24:46,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:24:46,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:24:46,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:24:46,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:24:46,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:24:46,489 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 52 [2024-06-27 23:24:46,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 151 transitions, 1216 flow. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:24:46,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:24:46,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 52 [2024-06-27 23:24:46,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:24:48,685 INFO L124 PetriNetUnfolderBase]: 11295/15540 cut-off events. [2024-06-27 23:24:48,685 INFO L125 PetriNetUnfolderBase]: For 101450/101450 co-relation queries the response was YES. [2024-06-27 23:24:48,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63031 conditions, 15540 events. 11295/15540 cut-off events. For 101450/101450 co-relation queries the response was YES. Maximal size of possible extension queue 534. Compared 83881 event pairs, 6295 based on Foata normal form. 3/15542 useless extension candidates. Maximal degree in co-relation 62995. Up to 14973 conditions per place. [2024-06-27 23:24:48,796 INFO L140 encePairwiseOnDemand]: 37/52 looper letters, 103 selfloop transitions, 101 changer transitions 0/210 dead transitions. [2024-06-27 23:24:48,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 210 transitions, 2042 flow [2024-06-27 23:24:48,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:24:48,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:24:48,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 207 transitions. [2024-06-27 23:24:48,797 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49759615384615385 [2024-06-27 23:24:48,798 INFO L175 Difference]: Start difference. First operand has 96 places, 151 transitions, 1216 flow. Second operand 8 states and 207 transitions. [2024-06-27 23:24:48,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 210 transitions, 2042 flow [2024-06-27 23:24:48,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 210 transitions, 1949 flow, removed 23 selfloop flow, removed 3 redundant places. [2024-06-27 23:24:48,926 INFO L231 Difference]: Finished difference. Result has 102 places, 167 transitions, 1545 flow [2024-06-27 23:24:48,926 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=1123, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1545, PETRI_PLACES=102, PETRI_TRANSITIONS=167} [2024-06-27 23:24:48,927 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 47 predicate places. [2024-06-27 23:24:48,927 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 167 transitions, 1545 flow [2024-06-27 23:24:48,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:24:48,927 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:24:48,927 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:24:48,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 23:24:48,928 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:24:48,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:24:48,928 INFO L85 PathProgramCache]: Analyzing trace with hash 529922565, now seen corresponding path program 4 times [2024-06-27 23:24:48,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:24:48,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139141548] [2024-06-27 23:24:48,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:24:48,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:24:48,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:24:50,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-27 23:24:50,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:24:50,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139141548] [2024-06-27 23:24:50,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139141548] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:24:50,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:24:50,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:24:50,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225941972] [2024-06-27 23:24:50,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:24:50,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:24:50,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:24:50,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:24:50,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:24:50,904 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 52 [2024-06-27 23:24:50,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 167 transitions, 1545 flow. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:24:50,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:24:50,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 52 [2024-06-27 23:24:50,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:24:53,191 INFO L124 PetriNetUnfolderBase]: 11381/15655 cut-off events. [2024-06-27 23:24:53,191 INFO L125 PetriNetUnfolderBase]: For 130177/130181 co-relation queries the response was YES. [2024-06-27 23:24:53,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67790 conditions, 15655 events. 11381/15655 cut-off events. For 130177/130181 co-relation queries the response was YES. Maximal size of possible extension queue 537. Compared 84837 event pairs, 6826 based on Foata normal form. 9/15647 useless extension candidates. Maximal degree in co-relation 67752. Up to 15290 conditions per place. [2024-06-27 23:24:53,296 INFO L140 encePairwiseOnDemand]: 39/52 looper letters, 165 selfloop transitions, 56 changer transitions 0/227 dead transitions. [2024-06-27 23:24:53,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 227 transitions, 2387 flow [2024-06-27 23:24:53,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:24:53,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:24:53,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 172 transitions. [2024-06-27 23:24:53,298 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4725274725274725 [2024-06-27 23:24:53,298 INFO L175 Difference]: Start difference. First operand has 102 places, 167 transitions, 1545 flow. Second operand 7 states and 172 transitions. [2024-06-27 23:24:53,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 227 transitions, 2387 flow [2024-06-27 23:24:53,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 227 transitions, 2219 flow, removed 44 selfloop flow, removed 4 redundant places. [2024-06-27 23:24:53,435 INFO L231 Difference]: Finished difference. Result has 106 places, 196 transitions, 1865 flow [2024-06-27 23:24:53,435 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=1396, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1865, PETRI_PLACES=106, PETRI_TRANSITIONS=196} [2024-06-27 23:24:53,435 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 51 predicate places. [2024-06-27 23:24:53,435 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 196 transitions, 1865 flow [2024-06-27 23:24:53,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:24:53,436 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:24:53,436 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:24:53,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-27 23:24:53,436 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:24:53,436 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:24:53,437 INFO L85 PathProgramCache]: Analyzing trace with hash 530042535, now seen corresponding path program 5 times [2024-06-27 23:24:53,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:24:53,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894655874] [2024-06-27 23:24:53,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:24:53,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:24:53,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:24:55,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:24:55,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:24:55,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894655874] [2024-06-27 23:24:55,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894655874] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:24:55,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:24:55,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:24:55,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155030960] [2024-06-27 23:24:55,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:24:55,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:24:55,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:24:55,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:24:55,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:24:55,282 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 52 [2024-06-27 23:24:55,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 196 transitions, 1865 flow. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:24:55,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:24:55,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 52 [2024-06-27 23:24:55,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:24:57,387 INFO L124 PetriNetUnfolderBase]: 11439/15733 cut-off events. [2024-06-27 23:24:57,387 INFO L125 PetriNetUnfolderBase]: For 133797/133797 co-relation queries the response was YES. [2024-06-27 23:24:57,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67252 conditions, 15733 events. 11439/15733 cut-off events. For 133797/133797 co-relation queries the response was YES. Maximal size of possible extension queue 537. Compared 85218 event pairs, 6837 based on Foata normal form. 5/15720 useless extension candidates. Maximal degree in co-relation 67212. Up to 15234 conditions per place. [2024-06-27 23:24:57,497 INFO L140 encePairwiseOnDemand]: 39/52 looper letters, 144 selfloop transitions, 95 changer transitions 0/245 dead transitions. [2024-06-27 23:24:57,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 245 transitions, 2721 flow [2024-06-27 23:24:57,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:24:57,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:24:57,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 178 transitions. [2024-06-27 23:24:57,498 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.489010989010989 [2024-06-27 23:24:57,498 INFO L175 Difference]: Start difference. First operand has 106 places, 196 transitions, 1865 flow. Second operand 7 states and 178 transitions. [2024-06-27 23:24:57,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 245 transitions, 2721 flow [2024-06-27 23:24:57,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 245 transitions, 2646 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-27 23:24:57,656 INFO L231 Difference]: Finished difference. Result has 109 places, 208 transitions, 2137 flow [2024-06-27 23:24:57,656 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=1790, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2137, PETRI_PLACES=109, PETRI_TRANSITIONS=208} [2024-06-27 23:24:57,657 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 54 predicate places. [2024-06-27 23:24:57,657 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 208 transitions, 2137 flow [2024-06-27 23:24:57,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:24:57,657 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:24:57,657 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:24:57,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-27 23:24:57,658 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:24:57,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:24:57,658 INFO L85 PathProgramCache]: Analyzing trace with hash -53783009, now seen corresponding path program 6 times [2024-06-27 23:24:57,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:24:57,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708587639] [2024-06-27 23:24:57,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:24:57,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:24:57,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:24:59,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:24:59,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:24:59,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708587639] [2024-06-27 23:24:59,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708587639] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:24:59,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:24:59,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:24:59,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90278616] [2024-06-27 23:24:59,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:24:59,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:24:59,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:24:59,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:24:59,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:24:59,421 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 52 [2024-06-27 23:24:59,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 208 transitions, 2137 flow. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:24:59,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:24:59,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 52 [2024-06-27 23:24:59,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:25:01,621 INFO L124 PetriNetUnfolderBase]: 11423/15714 cut-off events. [2024-06-27 23:25:01,621 INFO L125 PetriNetUnfolderBase]: For 149826/149826 co-relation queries the response was YES. [2024-06-27 23:25:01,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68572 conditions, 15714 events. 11423/15714 cut-off events. For 149826/149826 co-relation queries the response was YES. Maximal size of possible extension queue 537. Compared 85030 event pairs, 6848 based on Foata normal form. 5/15702 useless extension candidates. Maximal degree in co-relation 68531. Up to 15392 conditions per place. [2024-06-27 23:25:01,725 INFO L140 encePairwiseOnDemand]: 39/52 looper letters, 206 selfloop transitions, 28 changer transitions 0/240 dead transitions. [2024-06-27 23:25:01,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 240 transitions, 2769 flow [2024-06-27 23:25:01,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:25:01,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:25:01,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 170 transitions. [2024-06-27 23:25:01,726 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46703296703296704 [2024-06-27 23:25:01,726 INFO L175 Difference]: Start difference. First operand has 109 places, 208 transitions, 2137 flow. Second operand 7 states and 170 transitions. [2024-06-27 23:25:01,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 240 transitions, 2769 flow [2024-06-27 23:25:01,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 240 transitions, 2512 flow, removed 60 selfloop flow, removed 4 redundant places. [2024-06-27 23:25:01,892 INFO L231 Difference]: Finished difference. Result has 112 places, 208 transitions, 1952 flow [2024-06-27 23:25:01,892 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=1880, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1952, PETRI_PLACES=112, PETRI_TRANSITIONS=208} [2024-06-27 23:25:01,893 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 57 predicate places. [2024-06-27 23:25:01,893 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 208 transitions, 1952 flow [2024-06-27 23:25:01,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:25:01,894 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:25:01,894 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:25:01,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-27 23:25:01,895 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:25:01,895 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:25:01,895 INFO L85 PathProgramCache]: Analyzing trace with hash 529470777, now seen corresponding path program 1 times [2024-06-27 23:25:01,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:25:01,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083139643] [2024-06-27 23:25:01,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:25:01,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:25:01,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:25:04,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-27 23:25:04,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:25:04,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083139643] [2024-06-27 23:25:04,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083139643] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:25:04,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:25:04,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:25:04,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928355800] [2024-06-27 23:25:04,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:25:04,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:25:04,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:25:04,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:25:04,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:25:04,683 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 52 [2024-06-27 23:25:04,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 208 transitions, 1952 flow. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:25:04,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:25:04,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 52 [2024-06-27 23:25:04,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:25:07,603 INFO L124 PetriNetUnfolderBase]: 14120/19302 cut-off events. [2024-06-27 23:25:07,604 INFO L125 PetriNetUnfolderBase]: For 195982/195982 co-relation queries the response was YES. [2024-06-27 23:25:07,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83696 conditions, 19302 events. 14120/19302 cut-off events. For 195982/195982 co-relation queries the response was YES. Maximal size of possible extension queue 621. Compared 103595 event pairs, 8256 based on Foata normal form. 6/19297 useless extension candidates. Maximal degree in co-relation 83654. Up to 18957 conditions per place. [2024-06-27 23:25:07,705 INFO L140 encePairwiseOnDemand]: 38/52 looper letters, 218 selfloop transitions, 24 changer transitions 0/247 dead transitions. [2024-06-27 23:25:07,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 247 transitions, 2658 flow [2024-06-27 23:25:07,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:25:07,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:25:07,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 177 transitions. [2024-06-27 23:25:07,721 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4254807692307692 [2024-06-27 23:25:07,721 INFO L175 Difference]: Start difference. First operand has 112 places, 208 transitions, 1952 flow. Second operand 8 states and 177 transitions. [2024-06-27 23:25:07,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 247 transitions, 2658 flow [2024-06-27 23:25:07,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 247 transitions, 2452 flow, removed 20 selfloop flow, removed 7 redundant places. [2024-06-27 23:25:07,913 INFO L231 Difference]: Finished difference. Result has 114 places, 217 transitions, 1919 flow [2024-06-27 23:25:07,913 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=1753, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1919, PETRI_PLACES=114, PETRI_TRANSITIONS=217} [2024-06-27 23:25:07,914 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 59 predicate places. [2024-06-27 23:25:07,914 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 217 transitions, 1919 flow [2024-06-27 23:25:07,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:25:07,914 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:25:07,914 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:25:07,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-27 23:25:07,915 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:25:07,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:25:07,915 INFO L85 PathProgramCache]: Analyzing trace with hash -54094487, now seen corresponding path program 1 times [2024-06-27 23:25:07,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:25:07,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139851063] [2024-06-27 23:25:07,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:25:07,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:25:07,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:25:09,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-27 23:25:09,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:25:09,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139851063] [2024-06-27 23:25:09,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139851063] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:25:09,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:25:09,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 23:25:09,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15547850] [2024-06-27 23:25:09,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:25:09,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 23:25:09,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:25:09,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 23:25:09,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 23:25:09,727 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 52 [2024-06-27 23:25:09,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 217 transitions, 1919 flow. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:25:09,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:25:09,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 52 [2024-06-27 23:25:09,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:25:12,240 INFO L124 PetriNetUnfolderBase]: 13307/18467 cut-off events. [2024-06-27 23:25:12,240 INFO L125 PetriNetUnfolderBase]: For 224180/224290 co-relation queries the response was YES. [2024-06-27 23:25:12,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84655 conditions, 18467 events. 13307/18467 cut-off events. For 224180/224290 co-relation queries the response was YES. Maximal size of possible extension queue 621. Compared 102579 event pairs, 8326 based on Foata normal form. 62/18486 useless extension candidates. Maximal degree in co-relation 84612. Up to 18065 conditions per place. [2024-06-27 23:25:12,385 INFO L140 encePairwiseOnDemand]: 42/52 looper letters, 207 selfloop transitions, 12 changer transitions 0/235 dead transitions. [2024-06-27 23:25:12,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 235 transitions, 2461 flow [2024-06-27 23:25:12,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 23:25:12,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 23:25:12,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 121 transitions. [2024-06-27 23:25:12,386 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4653846153846154 [2024-06-27 23:25:12,386 INFO L175 Difference]: Start difference. First operand has 114 places, 217 transitions, 1919 flow. Second operand 5 states and 121 transitions. [2024-06-27 23:25:12,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 235 transitions, 2461 flow [2024-06-27 23:25:12,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 235 transitions, 2367 flow, removed 24 selfloop flow, removed 6 redundant places. [2024-06-27 23:25:12,676 INFO L231 Difference]: Finished difference. Result has 113 places, 221 transitions, 1906 flow [2024-06-27 23:25:12,677 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=1825, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1906, PETRI_PLACES=113, PETRI_TRANSITIONS=221} [2024-06-27 23:25:12,677 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 58 predicate places. [2024-06-27 23:25:12,677 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 221 transitions, 1906 flow [2024-06-27 23:25:12,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:25:12,678 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:25:12,678 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:25:12,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-27 23:25:12,678 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:25:12,678 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:25:12,678 INFO L85 PathProgramCache]: Analyzing trace with hash 494235174, now seen corresponding path program 1 times [2024-06-27 23:25:12,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:25:12,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234590892] [2024-06-27 23:25:12,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:25:12,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:25:12,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:25:14,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:25:14,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:25:14,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234590892] [2024-06-27 23:25:14,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234590892] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:25:14,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:25:14,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:25:14,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888334888] [2024-06-27 23:25:14,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:25:14,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:25:14,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:25:14,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:25:14,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:25:14,644 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 52 [2024-06-27 23:25:14,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 221 transitions, 1906 flow. Second operand has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 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-27 23:25:14,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:25:14,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 52 [2024-06-27 23:25:14,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:25:17,725 INFO L124 PetriNetUnfolderBase]: 13941/19168 cut-off events. [2024-06-27 23:25:17,726 INFO L125 PetriNetUnfolderBase]: For 254853/254877 co-relation queries the response was YES. [2024-06-27 23:25:17,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92174 conditions, 19168 events. 13941/19168 cut-off events. For 254853/254877 co-relation queries the response was YES. Maximal size of possible extension queue 638. Compared 105611 event pairs, 7053 based on Foata normal form. 21/19139 useless extension candidates. Maximal degree in co-relation 92131. Up to 18267 conditions per place. [2024-06-27 23:25:17,856 INFO L140 encePairwiseOnDemand]: 35/52 looper letters, 179 selfloop transitions, 115 changer transitions 0/301 dead transitions. [2024-06-27 23:25:17,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 301 transitions, 3126 flow [2024-06-27 23:25:17,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:25:17,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:25:17,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 255 transitions. [2024-06-27 23:25:17,858 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49038461538461536 [2024-06-27 23:25:17,859 INFO L175 Difference]: Start difference. First operand has 113 places, 221 transitions, 1906 flow. Second operand 10 states and 255 transitions. [2024-06-27 23:25:17,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 301 transitions, 3126 flow [2024-06-27 23:25:18,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 301 transitions, 3089 flow, removed 10 selfloop flow, removed 3 redundant places. [2024-06-27 23:25:18,158 INFO L231 Difference]: Finished difference. Result has 123 places, 244 transitions, 2470 flow [2024-06-27 23:25:18,158 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=1869, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2470, PETRI_PLACES=123, PETRI_TRANSITIONS=244} [2024-06-27 23:25:18,158 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 68 predicate places. [2024-06-27 23:25:18,158 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 244 transitions, 2470 flow [2024-06-27 23:25:18,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 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-27 23:25:18,159 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:25:18,159 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:25:18,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-27 23:25:18,159 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:25:18,159 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:25:18,159 INFO L85 PathProgramCache]: Analyzing trace with hash 2051222594, now seen corresponding path program 2 times [2024-06-27 23:25:18,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:25:18,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787087353] [2024-06-27 23:25:18,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:25:18,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:25:18,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:25:20,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:25:20,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:25:20,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787087353] [2024-06-27 23:25:20,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787087353] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:25:20,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:25:20,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:25:20,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662206739] [2024-06-27 23:25:20,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:25:20,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:25:20,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:25:20,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:25:20,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:25:20,815 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 52 [2024-06-27 23:25:20,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 244 transitions, 2470 flow. Second operand has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:25:20,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:25:20,816 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 52 [2024-06-27 23:25:20,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:25:23,962 INFO L124 PetriNetUnfolderBase]: 14033/19285 cut-off events. [2024-06-27 23:25:23,962 INFO L125 PetriNetUnfolderBase]: For 310135/310159 co-relation queries the response was YES. [2024-06-27 23:25:24,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102263 conditions, 19285 events. 14033/19285 cut-off events. For 310135/310159 co-relation queries the response was YES. Maximal size of possible extension queue 638. Compared 106098 event pairs, 7058 based on Foata normal form. 30/19262 useless extension candidates. Maximal degree in co-relation 102215. Up to 18343 conditions per place. [2024-06-27 23:25:24,114 INFO L140 encePairwiseOnDemand]: 39/52 looper letters, 201 selfloop transitions, 114 changer transitions 0/322 dead transitions. [2024-06-27 23:25:24,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 322 transitions, 3932 flow [2024-06-27 23:25:24,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:25:24,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:25:24,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 243 transitions. [2024-06-27 23:25:24,116 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5192307692307693 [2024-06-27 23:25:24,116 INFO L175 Difference]: Start difference. First operand has 123 places, 244 transitions, 2470 flow. Second operand 9 states and 243 transitions. [2024-06-27 23:25:24,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 322 transitions, 3932 flow [2024-06-27 23:25:24,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 322 transitions, 3781 flow, removed 54 selfloop flow, removed 4 redundant places. [2024-06-27 23:25:24,432 INFO L231 Difference]: Finished difference. Result has 129 places, 259 transitions, 2869 flow [2024-06-27 23:25:24,432 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=2357, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2869, PETRI_PLACES=129, PETRI_TRANSITIONS=259} [2024-06-27 23:25:24,432 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 74 predicate places. [2024-06-27 23:25:24,433 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 259 transitions, 2869 flow [2024-06-27 23:25:24,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:25:24,433 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:25:24,433 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:25:24,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-27 23:25:24,433 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:25:24,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:25:24,433 INFO L85 PathProgramCache]: Analyzing trace with hash 2043182744, now seen corresponding path program 3 times [2024-06-27 23:25:24,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:25:24,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814954482] [2024-06-27 23:25:24,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:25:24,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:25:24,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:25:26,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:25:26,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:25:26,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814954482] [2024-06-27 23:25:26,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814954482] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:25:26,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:25:26,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:25:26,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140082827] [2024-06-27 23:25:26,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:25:26,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:25:26,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:25:26,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:25:26,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:25:27,204 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 52 [2024-06-27 23:25:27,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 259 transitions, 2869 flow. Second operand has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:25:27,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:25:27,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 52 [2024-06-27 23:25:27,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:25:30,387 INFO L124 PetriNetUnfolderBase]: 14003/19252 cut-off events. [2024-06-27 23:25:30,388 INFO L125 PetriNetUnfolderBase]: For 312600/312615 co-relation queries the response was YES. [2024-06-27 23:25:30,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103298 conditions, 19252 events. 14003/19252 cut-off events. For 312600/312615 co-relation queries the response was YES. Maximal size of possible extension queue 639. Compared 106104 event pairs, 7146 based on Foata normal form. 21/19219 useless extension candidates. Maximal degree in co-relation 103248. Up to 18468 conditions per place. [2024-06-27 23:25:30,528 INFO L140 encePairwiseOnDemand]: 39/52 looper letters, 206 selfloop transitions, 95 changer transitions 0/308 dead transitions. [2024-06-27 23:25:30,529 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 308 transitions, 3875 flow [2024-06-27 23:25:30,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:25:30,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:25:30,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 211 transitions. [2024-06-27 23:25:30,538 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5072115384615384 [2024-06-27 23:25:30,538 INFO L175 Difference]: Start difference. First operand has 129 places, 259 transitions, 2869 flow. Second operand 8 states and 211 transitions. [2024-06-27 23:25:30,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 308 transitions, 3875 flow [2024-06-27 23:25:30,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 308 transitions, 3629 flow, removed 56 selfloop flow, removed 5 redundant places. [2024-06-27 23:25:30,847 INFO L231 Difference]: Finished difference. Result has 132 places, 259 transitions, 2839 flow [2024-06-27 23:25:30,847 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=2623, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2839, PETRI_PLACES=132, PETRI_TRANSITIONS=259} [2024-06-27 23:25:30,848 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 77 predicate places. [2024-06-27 23:25:30,848 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 259 transitions, 2839 flow [2024-06-27 23:25:30,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:25:30,848 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:25:30,848 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:25:30,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-27 23:25:30,848 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:25:30,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:25:30,849 INFO L85 PathProgramCache]: Analyzing trace with hash 521447728, now seen corresponding path program 1 times [2024-06-27 23:25:30,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:25:30,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251433266] [2024-06-27 23:25:30,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:25:30,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:25:30,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:25:33,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:25:33,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:25:33,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251433266] [2024-06-27 23:25:33,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251433266] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:25:33,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:25:33,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:25:33,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840307788] [2024-06-27 23:25:33,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:25:33,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:25:33,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:25:33,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:25:33,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:25:33,302 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 52 [2024-06-27 23:25:33,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 259 transitions, 2839 flow. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:25:33,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:25:33,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 52 [2024-06-27 23:25:33,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:25:36,745 INFO L124 PetriNetUnfolderBase]: 14553/19902 cut-off events. [2024-06-27 23:25:36,746 INFO L125 PetriNetUnfolderBase]: For 334817/334833 co-relation queries the response was YES. [2024-06-27 23:25:36,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105843 conditions, 19902 events. 14553/19902 cut-off events. For 334817/334833 co-relation queries the response was YES. Maximal size of possible extension queue 619. Compared 106591 event pairs, 7524 based on Foata normal form. 17/19919 useless extension candidates. Maximal degree in co-relation 105792. Up to 19331 conditions per place. [2024-06-27 23:25:36,905 INFO L140 encePairwiseOnDemand]: 36/52 looper letters, 252 selfloop transitions, 69 changer transitions 0/326 dead transitions. [2024-06-27 23:25:36,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 326 transitions, 4139 flow [2024-06-27 23:25:36,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:25:36,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:25:36,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 203 transitions. [2024-06-27 23:25:36,907 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4879807692307692 [2024-06-27 23:25:36,907 INFO L175 Difference]: Start difference. First operand has 132 places, 259 transitions, 2839 flow. Second operand 8 states and 203 transitions. [2024-06-27 23:25:36,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 326 transitions, 4139 flow [2024-06-27 23:25:37,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 326 transitions, 3921 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-27 23:25:37,210 INFO L231 Difference]: Finished difference. Result has 135 places, 280 transitions, 3068 flow [2024-06-27 23:25:37,210 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=2621, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3068, PETRI_PLACES=135, PETRI_TRANSITIONS=280} [2024-06-27 23:25:37,210 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 80 predicate places. [2024-06-27 23:25:37,210 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 280 transitions, 3068 flow [2024-06-27 23:25:37,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:25:37,211 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:25:37,211 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:25:37,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-27 23:25:37,211 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:25:37,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:25:37,211 INFO L85 PathProgramCache]: Analyzing trace with hash 521441776, now seen corresponding path program 4 times [2024-06-27 23:25:37,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:25:37,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672380678] [2024-06-27 23:25:37,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:25:37,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:25:37,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:25:39,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:25:39,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:25:39,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672380678] [2024-06-27 23:25:39,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672380678] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:25:39,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:25:39,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:25:39,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537587463] [2024-06-27 23:25:39,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:25:39,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:25:39,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:25:39,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:25:39,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:25:40,007 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 52 [2024-06-27 23:25:40,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 280 transitions, 3068 flow. Second operand has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:25:40,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:25:40,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 52 [2024-06-27 23:25:40,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:25:43,352 INFO L124 PetriNetUnfolderBase]: 14116/19441 cut-off events. [2024-06-27 23:25:43,352 INFO L125 PetriNetUnfolderBase]: For 379770/379804 co-relation queries the response was YES. [2024-06-27 23:25:43,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110302 conditions, 19441 events. 14116/19441 cut-off events. For 379770/379804 co-relation queries the response was YES. Maximal size of possible extension queue 634. Compared 107469 event pairs, 6773 based on Foata normal form. 37/19443 useless extension candidates. Maximal degree in co-relation 110248. Up to 18206 conditions per place. [2024-06-27 23:25:43,491 INFO L140 encePairwiseOnDemand]: 39/52 looper letters, 188 selfloop transitions, 162 changer transitions 0/358 dead transitions. [2024-06-27 23:25:43,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 358 transitions, 4822 flow [2024-06-27 23:25:43,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:25:43,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:25:43,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 221 transitions. [2024-06-27 23:25:43,492 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.53125 [2024-06-27 23:25:43,493 INFO L175 Difference]: Start difference. First operand has 135 places, 280 transitions, 3068 flow. Second operand 8 states and 221 transitions. [2024-06-27 23:25:43,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 358 transitions, 4822 flow [2024-06-27 23:25:43,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 358 transitions, 4742 flow, removed 33 selfloop flow, removed 2 redundant places. [2024-06-27 23:25:43,841 INFO L231 Difference]: Finished difference. Result has 142 places, 300 transitions, 3747 flow [2024-06-27 23:25:43,841 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=3004, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=146, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3747, PETRI_PLACES=142, PETRI_TRANSITIONS=300} [2024-06-27 23:25:43,842 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 87 predicate places. [2024-06-27 23:25:43,842 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 300 transitions, 3747 flow [2024-06-27 23:25:43,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:25:43,842 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:25:43,842 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:25:43,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-27 23:25:43,842 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:25:43,843 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:25:43,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1970012162, now seen corresponding path program 2 times [2024-06-27 23:25:43,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:25:43,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782568007] [2024-06-27 23:25:43,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:25:43,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:25:43,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:25:46,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:25:46,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:25:46,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782568007] [2024-06-27 23:25:46,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782568007] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:25:46,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:25:46,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:25:46,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819204900] [2024-06-27 23:25:46,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:25:46,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:25:46,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:25:46,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:25:46,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:25:46,618 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 52 [2024-06-27 23:25:46,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 300 transitions, 3747 flow. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:25:46,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:25:46,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 52 [2024-06-27 23:25:46,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:25:49,822 INFO L124 PetriNetUnfolderBase]: 14714/20143 cut-off events. [2024-06-27 23:25:49,822 INFO L125 PetriNetUnfolderBase]: For 435881/435885 co-relation queries the response was YES. [2024-06-27 23:25:49,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119169 conditions, 20143 events. 14714/20143 cut-off events. For 435881/435885 co-relation queries the response was YES. Maximal size of possible extension queue 617. Compared 108223 event pairs, 7775 based on Foata normal form. 9/20137 useless extension candidates. Maximal degree in co-relation 119112. Up to 19590 conditions per place. [2024-06-27 23:25:49,950 INFO L140 encePairwiseOnDemand]: 38/52 looper letters, 278 selfloop transitions, 68 changer transitions 0/351 dead transitions. [2024-06-27 23:25:49,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 351 transitions, 4947 flow [2024-06-27 23:25:49,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:25:49,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:25:49,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 174 transitions. [2024-06-27 23:25:49,952 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47802197802197804 [2024-06-27 23:25:49,952 INFO L175 Difference]: Start difference. First operand has 142 places, 300 transitions, 3747 flow. Second operand 7 states and 174 transitions. [2024-06-27 23:25:49,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 351 transitions, 4947 flow [2024-06-27 23:25:50,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 351 transitions, 4815 flow, removed 35 selfloop flow, removed 3 redundant places. [2024-06-27 23:25:50,378 INFO L231 Difference]: Finished difference. Result has 147 places, 312 transitions, 3947 flow [2024-06-27 23:25:50,378 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=3615, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3947, PETRI_PLACES=147, PETRI_TRANSITIONS=312} [2024-06-27 23:25:50,379 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 92 predicate places. [2024-06-27 23:25:50,379 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 312 transitions, 3947 flow [2024-06-27 23:25:50,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:25:50,379 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:25:50,379 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:25:50,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-27 23:25:50,379 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:25:50,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:25:50,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1667272288, now seen corresponding path program 5 times [2024-06-27 23:25:50,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:25:50,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869765107] [2024-06-27 23:25:50,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:25:50,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:25:50,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:25:52,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:25:52,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:25:52,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869765107] [2024-06-27 23:25:52,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869765107] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:25:52,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:25:52,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:25:52,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176730362] [2024-06-27 23:25:52,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:25:52,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:25:52,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:25:52,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:25:52,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:25:53,000 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 52 [2024-06-27 23:25:53,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 312 transitions, 3947 flow. Second operand has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:25:53,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:25:53,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 52 [2024-06-27 23:25:53,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:25:56,726 INFO L124 PetriNetUnfolderBase]: 14152/19499 cut-off events. [2024-06-27 23:25:56,726 INFO L125 PetriNetUnfolderBase]: For 460370/460378 co-relation queries the response was YES. [2024-06-27 23:25:56,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117476 conditions, 19499 events. 14152/19499 cut-off events. For 460370/460378 co-relation queries the response was YES. Maximal size of possible extension queue 635. Compared 108228 event pairs, 7389 based on Foata normal form. 9/19446 useless extension candidates. Maximal degree in co-relation 117417. Up to 18805 conditions per place. [2024-06-27 23:25:56,872 INFO L140 encePairwiseOnDemand]: 38/52 looper letters, 310 selfloop transitions, 50 changer transitions 0/370 dead transitions. [2024-06-27 23:25:56,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 370 transitions, 5397 flow [2024-06-27 23:25:56,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:25:56,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:25:56,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 215 transitions. [2024-06-27 23:25:56,874 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4594017094017094 [2024-06-27 23:25:56,874 INFO L175 Difference]: Start difference. First operand has 147 places, 312 transitions, 3947 flow. Second operand 9 states and 215 transitions. [2024-06-27 23:25:56,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 370 transitions, 5397 flow [2024-06-27 23:25:57,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 370 transitions, 5074 flow, removed 36 selfloop flow, removed 5 redundant places. [2024-06-27 23:25:57,372 INFO L231 Difference]: Finished difference. Result has 152 places, 320 transitions, 3902 flow [2024-06-27 23:25:57,373 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=3624, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3902, PETRI_PLACES=152, PETRI_TRANSITIONS=320} [2024-06-27 23:25:57,373 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 97 predicate places. [2024-06-27 23:25:57,373 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 320 transitions, 3902 flow [2024-06-27 23:25:57,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:25:57,373 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:25:57,373 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:25:57,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-27 23:25:57,374 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:25:57,374 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:25:57,374 INFO L85 PathProgramCache]: Analyzing trace with hash -766543248, now seen corresponding path program 3 times [2024-06-27 23:25:57,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:25:57,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382490117] [2024-06-27 23:25:57,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:25:57,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:25:57,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:25:59,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-27 23:25:59,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:25:59,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382490117] [2024-06-27 23:25:59,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382490117] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:25:59,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:25:59,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:25:59,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764396780] [2024-06-27 23:25:59,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:25:59,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:25:59,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:25:59,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:25:59,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:25:59,604 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 52 [2024-06-27 23:25:59,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 320 transitions, 3902 flow. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:25:59,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:25:59,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 52 [2024-06-27 23:25:59,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:26:02,809 INFO L124 PetriNetUnfolderBase]: 14792/20251 cut-off events. [2024-06-27 23:26:02,809 INFO L125 PetriNetUnfolderBase]: For 508932/508932 co-relation queries the response was YES. [2024-06-27 23:26:02,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125828 conditions, 20251 events. 14792/20251 cut-off events. For 508932/508932 co-relation queries the response was YES. Maximal size of possible extension queue 617. Compared 108777 event pairs, 7806 based on Foata normal form. 8/20244 useless extension candidates. Maximal degree in co-relation 125768. Up to 19816 conditions per place. [2024-06-27 23:26:03,003 INFO L140 encePairwiseOnDemand]: 36/52 looper letters, 332 selfloop transitions, 40 changer transitions 0/377 dead transitions. [2024-06-27 23:26:03,003 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 377 transitions, 5224 flow [2024-06-27 23:26:03,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:26:03,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:26:03,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 189 transitions. [2024-06-27 23:26:03,005 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4543269230769231 [2024-06-27 23:26:03,005 INFO L175 Difference]: Start difference. First operand has 152 places, 320 transitions, 3902 flow. Second operand 8 states and 189 transitions. [2024-06-27 23:26:03,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 377 transitions, 5224 flow [2024-06-27 23:26:03,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 377 transitions, 4983 flow, removed 49 selfloop flow, removed 6 redundant places. [2024-06-27 23:26:03,579 INFO L231 Difference]: Finished difference. Result has 154 places, 334 transitions, 4069 flow [2024-06-27 23:26:03,579 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=3693, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=320, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4069, PETRI_PLACES=154, PETRI_TRANSITIONS=334} [2024-06-27 23:26:03,580 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 99 predicate places. [2024-06-27 23:26:03,580 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 334 transitions, 4069 flow [2024-06-27 23:26:03,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:26:03,580 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:26:03,580 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:26:03,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-27 23:26:03,580 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:26:03,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:26:03,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1666077044, now seen corresponding path program 4 times [2024-06-27 23:26:03,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:26:03,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727664996] [2024-06-27 23:26:03,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:26:03,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:26:03,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:26:06,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:26:06,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:26:06,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727664996] [2024-06-27 23:26:06,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727664996] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:26:06,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:26:06,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:26:06,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188231163] [2024-06-27 23:26:06,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:26:06,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:26:06,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:26:06,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:26:06,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:26:06,370 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 52 [2024-06-27 23:26:06,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 334 transitions, 4069 flow. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:26:06,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:26:06,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 52 [2024-06-27 23:26:06,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:26:09,732 INFO L124 PetriNetUnfolderBase]: 14832/20303 cut-off events. [2024-06-27 23:26:09,732 INFO L125 PetriNetUnfolderBase]: For 536996/536996 co-relation queries the response was YES. [2024-06-27 23:26:09,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127316 conditions, 20303 events. 14832/20303 cut-off events. For 536996/536996 co-relation queries the response was YES. Maximal size of possible extension queue 617. Compared 109007 event pairs, 7776 based on Foata normal form. 5/20293 useless extension candidates. Maximal degree in co-relation 127255. Up to 19830 conditions per place. [2024-06-27 23:26:09,907 INFO L140 encePairwiseOnDemand]: 38/52 looper letters, 333 selfloop transitions, 60 changer transitions 0/398 dead transitions. [2024-06-27 23:26:09,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 398 transitions, 5561 flow [2024-06-27 23:26:09,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:26:09,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:26:09,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 188 transitions. [2024-06-27 23:26:09,909 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4519230769230769 [2024-06-27 23:26:09,909 INFO L175 Difference]: Start difference. First operand has 154 places, 334 transitions, 4069 flow. Second operand 8 states and 188 transitions. [2024-06-27 23:26:09,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 398 transitions, 5561 flow [2024-06-27 23:26:10,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 398 transitions, 5287 flow, removed 101 selfloop flow, removed 5 redundant places. [2024-06-27 23:26:10,455 INFO L231 Difference]: Finished difference. Result has 158 places, 357 transitions, 4396 flow [2024-06-27 23:26:10,455 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=3865, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4396, PETRI_PLACES=158, PETRI_TRANSITIONS=357} [2024-06-27 23:26:10,456 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 103 predicate places. [2024-06-27 23:26:10,456 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 357 transitions, 4396 flow [2024-06-27 23:26:10,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:26:10,456 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:26:10,456 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:26:10,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-27 23:26:10,457 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:26:10,457 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:26:10,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1766613738, now seen corresponding path program 1 times [2024-06-27 23:26:10,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:26:10,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907151770] [2024-06-27 23:26:10,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:26:10,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:26:10,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:26:12,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:26:12,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:26:12,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907151770] [2024-06-27 23:26:12,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907151770] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:26:12,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:26:12,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:26:12,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383689339] [2024-06-27 23:26:12,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:26:12,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:26:12,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:26:12,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:26:12,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:26:12,593 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 52 [2024-06-27 23:26:12,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 357 transitions, 4396 flow. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 7 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:26:12,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:26:12,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 52 [2024-06-27 23:26:12,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:26:16,248 INFO L124 PetriNetUnfolderBase]: 11793/17446 cut-off events. [2024-06-27 23:26:16,248 INFO L125 PetriNetUnfolderBase]: For 559952/560664 co-relation queries the response was YES. [2024-06-27 23:26:16,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117714 conditions, 17446 events. 11793/17446 cut-off events. For 559952/560664 co-relation queries the response was YES. Maximal size of possible extension queue 653. Compared 111384 event pairs, 4255 based on Foata normal form. 40/16960 useless extension candidates. Maximal degree in co-relation 117651. Up to 14479 conditions per place. [2024-06-27 23:26:16,396 INFO L140 encePairwiseOnDemand]: 37/52 looper letters, 252 selfloop transitions, 136 changer transitions 0/435 dead transitions. [2024-06-27 23:26:16,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 435 transitions, 6004 flow [2024-06-27 23:26:16,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:26:16,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:26:16,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 288 transitions. [2024-06-27 23:26:16,398 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5538461538461539 [2024-06-27 23:26:16,398 INFO L175 Difference]: Start difference. First operand has 158 places, 357 transitions, 4396 flow. Second operand 10 states and 288 transitions. [2024-06-27 23:26:16,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 435 transitions, 6004 flow [2024-06-27 23:26:17,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 435 transitions, 5805 flow, removed 22 selfloop flow, removed 6 redundant places. [2024-06-27 23:26:17,084 INFO L231 Difference]: Finished difference. Result has 165 places, 373 transitions, 4910 flow [2024-06-27 23:26:17,084 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=4197, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=122, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4910, PETRI_PLACES=165, PETRI_TRANSITIONS=373} [2024-06-27 23:26:17,084 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 110 predicate places. [2024-06-27 23:26:17,084 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 373 transitions, 4910 flow [2024-06-27 23:26:17,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 7 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:26:17,084 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:26:17,085 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:26:17,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-27 23:26:17,085 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:26:17,085 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:26:17,085 INFO L85 PathProgramCache]: Analyzing trace with hash 528516388, now seen corresponding path program 2 times [2024-06-27 23:26:17,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:26:17,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693742104] [2024-06-27 23:26:17,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:26:17,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:26:17,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:26:20,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:26:20,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:26:20,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693742104] [2024-06-27 23:26:20,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693742104] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:26:20,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:26:20,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:26:20,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394801787] [2024-06-27 23:26:20,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:26:20,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:26:20,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:26:20,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:26:20,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:26:20,508 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 52 [2024-06-27 23:26:20,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 373 transitions, 4910 flow. Second operand has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:26:20,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:26:20,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 52 [2024-06-27 23:26:20,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:26:24,853 INFO L124 PetriNetUnfolderBase]: 15515/21527 cut-off events. [2024-06-27 23:26:24,853 INFO L125 PetriNetUnfolderBase]: For 725141/725181 co-relation queries the response was YES. [2024-06-27 23:26:24,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150210 conditions, 21527 events. 15515/21527 cut-off events. For 725141/725181 co-relation queries the response was YES. Maximal size of possible extension queue 646. Compared 121619 event pairs, 5869 based on Foata normal form. 79/21556 useless extension candidates. Maximal degree in co-relation 150143. Up to 19433 conditions per place. [2024-06-27 23:26:25,038 INFO L140 encePairwiseOnDemand]: 39/52 looper letters, 323 selfloop transitions, 130 changer transitions 0/464 dead transitions. [2024-06-27 23:26:25,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 464 transitions, 7086 flow [2024-06-27 23:26:25,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:26:25,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:26:25,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 272 transitions. [2024-06-27 23:26:25,040 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5230769230769231 [2024-06-27 23:26:25,040 INFO L175 Difference]: Start difference. First operand has 165 places, 373 transitions, 4910 flow. Second operand 10 states and 272 transitions. [2024-06-27 23:26:25,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 464 transitions, 7086 flow [2024-06-27 23:26:25,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 464 transitions, 6888 flow, removed 86 selfloop flow, removed 4 redundant places. [2024-06-27 23:26:25,893 INFO L231 Difference]: Finished difference. Result has 171 places, 383 transitions, 5332 flow [2024-06-27 23:26:25,893 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=4796, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=124, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5332, PETRI_PLACES=171, PETRI_TRANSITIONS=383} [2024-06-27 23:26:25,894 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 116 predicate places. [2024-06-27 23:26:25,894 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 383 transitions, 5332 flow [2024-06-27 23:26:25,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:26:25,894 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:26:25,894 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:26:25,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-27 23:26:25,895 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:26:25,895 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:26:25,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1088639864, now seen corresponding path program 3 times [2024-06-27 23:26:25,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:26:25,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327938088] [2024-06-27 23:26:25,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:26:25,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:26:25,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:26:28,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:26:28,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:26:28,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327938088] [2024-06-27 23:26:28,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327938088] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:26:28,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:26:28,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:26:28,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176775811] [2024-06-27 23:26:28,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:26:28,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:26:28,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:26:28,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:26:28,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:26:29,153 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 52 [2024-06-27 23:26:29,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 383 transitions, 5332 flow. Second operand has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:26:29,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:26:29,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 52 [2024-06-27 23:26:29,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:26:33,682 INFO L124 PetriNetUnfolderBase]: 15819/22009 cut-off events. [2024-06-27 23:26:33,682 INFO L125 PetriNetUnfolderBase]: For 779826/779863 co-relation queries the response was YES. [2024-06-27 23:26:33,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155644 conditions, 22009 events. 15819/22009 cut-off events. For 779826/779863 co-relation queries the response was YES. Maximal size of possible extension queue 647. Compared 125386 event pairs, 6824 based on Foata normal form. 85/22027 useless extension candidates. Maximal degree in co-relation 155576. Up to 20465 conditions per place. [2024-06-27 23:26:33,866 INFO L140 encePairwiseOnDemand]: 39/52 looper letters, 332 selfloop transitions, 120 changer transitions 0/463 dead transitions. [2024-06-27 23:26:33,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 463 transitions, 7144 flow [2024-06-27 23:26:33,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:26:33,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:26:33,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 267 transitions. [2024-06-27 23:26:33,868 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5134615384615384 [2024-06-27 23:26:33,868 INFO L175 Difference]: Start difference. First operand has 171 places, 383 transitions, 5332 flow. Second operand 10 states and 267 transitions. [2024-06-27 23:26:33,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 463 transitions, 7144 flow [2024-06-27 23:26:34,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 463 transitions, 6854 flow, removed 72 selfloop flow, removed 6 redundant places. [2024-06-27 23:26:34,716 INFO L231 Difference]: Finished difference. Result has 175 places, 387 transitions, 5515 flow [2024-06-27 23:26:34,716 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=5126, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5515, PETRI_PLACES=175, PETRI_TRANSITIONS=387} [2024-06-27 23:26:34,717 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 120 predicate places. [2024-06-27 23:26:34,717 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 387 transitions, 5515 flow [2024-06-27 23:26:34,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:26:34,717 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:26:34,717 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:26:34,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-27 23:26:34,718 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:26:34,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:26:34,718 INFO L85 PathProgramCache]: Analyzing trace with hash -827375894, now seen corresponding path program 4 times [2024-06-27 23:26:34,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:26:34,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425926307] [2024-06-27 23:26:34,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:26:34,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:26:34,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:26:37,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:26:37,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:26:37,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425926307] [2024-06-27 23:26:37,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425926307] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:26:37,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:26:37,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:26:37,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910282697] [2024-06-27 23:26:37,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:26:37,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:26:37,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:26:37,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:26:37,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:26:38,116 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 52 [2024-06-27 23:26:38,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 387 transitions, 5515 flow. Second operand has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:26:38,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:26:38,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 52 [2024-06-27 23:26:38,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand