./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/mutex-meet/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version bcb38a6f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-bcb38a6-m [2024-06-03 22:31:34,687 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-03 22:31:34,758 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-03 22:31:34,764 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-03 22:31:34,765 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-03 22:31:34,793 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-03 22:31:34,794 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-03 22:31:34,795 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-03 22:31:34,795 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-03 22:31:34,798 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-03 22:31:34,799 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-03 22:31:34,799 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-03 22:31:34,800 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-03 22:31:34,801 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-03 22:31:34,801 INFO L153 SettingsManager]: * Use SBE=true [2024-06-03 22:31:34,801 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-03 22:31:34,801 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-03 22:31:34,801 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-03 22:31:34,802 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-03 22:31:34,802 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-03 22:31:34,802 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-03 22:31:34,802 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-03 22:31:34,802 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-03 22:31:34,803 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-03 22:31:34,803 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-03 22:31:34,803 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-03 22:31:34,803 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-03 22:31:34,803 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-03 22:31:34,804 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-03 22:31:34,804 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-03 22:31:34,805 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-03 22:31:34,805 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-03 22:31:34,805 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 22:31:34,805 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-03 22:31:34,806 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-03 22:31:34,806 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-03 22:31:34,806 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-03 22:31:34,806 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-03 22:31:34,806 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-03 22:31:34,806 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-03 22:31:34,807 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-03 22:31:34,807 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-03 22:31:34,807 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-03 22:31:34,807 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-03 22:31:35,030 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-03 22:31:35,056 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-03 22:31:35,058 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-03 22:31:35,059 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-03 22:31:35,060 INFO L274 PluginConnector]: CDTParser initialized [2024-06-03 22:31:35,061 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-03 22:31:36,322 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-03 22:31:36,571 INFO L384 CDTParser]: Found 1 translation units. [2024-06-03 22:31:36,572 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-03 22:31:36,590 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d8ac175e/86d04c74a04d4a428d60e55e1a631320/FLAG508b5f867 [2024-06-03 22:31:36,601 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d8ac175e/86d04c74a04d4a428d60e55e1a631320 [2024-06-03 22:31:36,604 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-03 22:31:36,604 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-03 22:31:36,605 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-21_14-57-05.files/mutex-meet/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml [2024-06-03 22:31:36,736 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-03 22:31:36,738 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-03 22:31:36,739 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-03 22:31:36,739 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-03 22:31:36,743 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-03 22:31:36,743 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 10:31:36" (1/2) ... [2024-06-03 22:31:36,744 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@641376c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:31:36, skipping insertion in model container [2024-06-03 22:31:36,745 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 10:31:36" (1/2) ... [2024-06-03 22:31:36,746 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1ab5789b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:31:36, skipping insertion in model container [2024-06-03 22:31:36,746 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 10:31:36" (2/2) ... [2024-06-03 22:31:36,747 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@641376c4 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:31:36, skipping insertion in model container [2024-06-03 22:31:36,747 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 10:31:36" (2/2) ... [2024-06-03 22:31:36,747 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-03 22:31:36,803 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-03 22:31:36,804 INFO L97 edCorrectnessWitness]: Location invariant before [L795-L795] ((((((((((((((! multithreaded || ((((0 <= y$w_buff1 && y$w_buff1 <= 2) && y$w_buff1 <= 127) && y$w_buff1 % 2 == 0) && (y$w_buff1 == 0 || y$w_buff1 == 2))) && (! multithreaded || ((((0 <= y$w_buff0 && y$w_buff0 <= 2) && y$w_buff0 <= 127) && y$w_buff0 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$w_buff0) + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_p1_EAX) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_p1_EAX) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )x) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )x) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$flush_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$flush_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$mem_tmp) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$mem_tmp) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (4LL - (long long )y$w_buff0) - (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || (((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && __unbuffered_p1_EAX <= 1) && x <= 1) && y <= 127) && y$mem_tmp <= 127) && y$w_buff0 <= 2) && y$w_buff0 <= 127) && y$w_buff1 <= 2) && y$w_buff1 <= 127) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && y$w_buff0 % 2 == 0) && y$w_buff1 % 2 == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (x == 0 || x == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 127) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-03 22:31:36,805 INFO L97 edCorrectnessWitness]: Location invariant before [L796-L796] ((((((((((((((! multithreaded || ((((0 <= y$w_buff1 && y$w_buff1 <= 2) && y$w_buff1 <= 127) && y$w_buff1 % 2 == 0) && (y$w_buff1 == 0 || y$w_buff1 == 2))) && (! multithreaded || ((((0 <= y$w_buff0 && y$w_buff0 <= 2) && y$w_buff0 <= 127) && y$w_buff0 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$w_buff0) + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_p1_EAX) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_p1_EAX) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )x) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )x) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$flush_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$flush_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$mem_tmp) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$mem_tmp) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (4LL - (long long )y$w_buff0) - (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || (((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && __unbuffered_p1_EAX <= 1) && x <= 1) && y <= 127) && y$mem_tmp <= 127) && y$w_buff0 <= 2) && y$w_buff0 <= 127) && y$w_buff1 <= 2) && y$w_buff1 <= 127) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && y$w_buff0 % 2 == 0) && y$w_buff1 % 2 == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (x == 0 || x == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 127) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-03 22:31:36,805 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-03 22:31:36,805 INFO L106 edCorrectnessWitness]: ghost_update [L793-L793] multithreaded = 1; [2024-06-03 22:31:36,846 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-03 22:31:37,154 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 22:31:37,169 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-03 22:31:37,447 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 22:31:37,522 INFO L206 MainTranslator]: Completed translation [2024-06-03 22:31:37,523 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:31:37 WrapperNode [2024-06-03 22:31:37,523 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-03 22:31:37,525 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-03 22:31:37,525 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-03 22:31:37,525 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-03 22:31:37,531 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:31:37" (1/1) ... [2024-06-03 22:31:37,601 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:31:37" (1/1) ... [2024-06-03 22:31:37,651 INFO L138 Inliner]: procedures = 174, calls = 34, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 131 [2024-06-03 22:31:37,651 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-03 22:31:37,652 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-03 22:31:37,652 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-03 22:31:37,652 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-03 22:31:37,661 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:31:37" (1/1) ... [2024-06-03 22:31:37,661 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:31:37" (1/1) ... [2024-06-03 22:31:37,680 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:31:37" (1/1) ... [2024-06-03 22:31:37,709 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-03 22:31:37,710 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:31:37" (1/1) ... [2024-06-03 22:31:37,710 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:31:37" (1/1) ... [2024-06-03 22:31:37,735 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:31:37" (1/1) ... [2024-06-03 22:31:37,738 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:31:37" (1/1) ... [2024-06-03 22:31:37,744 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:31:37" (1/1) ... [2024-06-03 22:31:37,749 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:31:37" (1/1) ... [2024-06-03 22:31:37,759 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-03 22:31:37,760 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-03 22:31:37,760 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-03 22:31:37,760 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-03 22:31:37,760 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:31:37" (1/1) ... [2024-06-03 22:31:37,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 22:31:37,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-03 22:31:37,784 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-03 22:31:37,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-03 22:31:37,814 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-03 22:31:37,815 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-03 22:31:37,815 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-03 22:31:37,815 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-03 22:31:37,815 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-03 22:31:37,815 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-03 22:31:37,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-03 22:31:37,816 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-03 22:31:37,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-03 22:31:37,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-03 22:31:37,817 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-03 22:31:37,934 INFO L244 CfgBuilder]: Building ICFG [2024-06-03 22:31:37,937 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-03 22:31:38,570 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-03 22:31:38,571 INFO L293 CfgBuilder]: Performing block encoding [2024-06-03 22:31:38,712 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-03 22:31:38,712 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-03 22:31:38,714 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 10:31:38 BoogieIcfgContainer [2024-06-03 22:31:38,714 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-03 22:31:38,717 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-03 22:31:38,717 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-03 22:31:38,720 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-03 22:31:38,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.06 10:31:36" (1/4) ... [2024-06-03 22:31:38,721 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12409b35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 10:31:38, skipping insertion in model container [2024-06-03 22:31:38,721 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 10:31:36" (2/4) ... [2024-06-03 22:31:38,721 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12409b35 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 10:31:38, skipping insertion in model container [2024-06-03 22:31:38,722 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:31:37" (3/4) ... [2024-06-03 22:31:38,726 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12409b35 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 10:31:38, skipping insertion in model container [2024-06-03 22:31:38,726 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 10:31:38" (4/4) ... [2024-06-03 22:31:38,727 INFO L112 eAbstractionObserver]: Analyzing ICFG safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-03 22:31:38,740 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-03 22:31:38,740 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-03 22:31:38,740 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-03 22:31:38,806 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-03 22:31:38,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 30 transitions, 68 flow [2024-06-03 22:31:38,861 INFO L124 PetriNetUnfolderBase]: 0/28 cut-off events. [2024-06-03 22:31:38,861 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 22:31:38,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 28 events. 0/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 39 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-03 22:31:38,864 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 30 transitions, 68 flow [2024-06-03 22:31:38,866 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 22 transitions, 50 flow [2024-06-03 22:31:38,872 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-03 22:31:38,877 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;@1efaf5ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-03 22:31:38,877 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-03 22:31:38,882 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-03 22:31:38,882 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-03 22:31:38,882 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 22:31:38,882 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:31:38,883 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-03 22:31:38,883 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:31:38,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:31:38,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1451147604, now seen corresponding path program 1 times [2024-06-03 22:31:38,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:31:38,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424843118] [2024-06-03 22:31:38,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:31:38,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:31:39,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:31:41,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:31:41,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:31:41,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424843118] [2024-06-03 22:31:41,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424843118] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:31:41,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:31:41,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-03 22:31:41,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731667769] [2024-06-03 22:31:41,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:31:41,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-03 22:31:41,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:31:41,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-03 22:31:41,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-03 22:31:41,807 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 30 [2024-06-03 22:31:41,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 22 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:31:41,810 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:31:41,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 30 [2024-06-03 22:31:41,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:31:41,946 INFO L124 PetriNetUnfolderBase]: 135/253 cut-off events. [2024-06-03 22:31:41,946 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-06-03 22:31:41,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 521 conditions, 253 events. 135/253 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 870 event pairs, 79 based on Foata normal form. 1/248 useless extension candidates. Maximal degree in co-relation 507. Up to 243 conditions per place. [2024-06-03 22:31:41,950 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 22 selfloop transitions, 3 changer transitions 0/28 dead transitions. [2024-06-03 22:31:41,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 28 transitions, 115 flow [2024-06-03 22:31:41,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-03 22:31:41,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-03 22:31:41,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2024-06-03 22:31:41,958 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2024-06-03 22:31:41,960 INFO L175 Difference]: Start difference. First operand has 29 places, 22 transitions, 50 flow. Second operand 3 states and 48 transitions. [2024-06-03 22:31:41,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 28 transitions, 115 flow [2024-06-03 22:31:41,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 28 transitions, 112 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-03 22:31:41,963 INFO L231 Difference]: Finished difference. Result has 30 places, 24 transitions, 69 flow [2024-06-03 22:31:41,964 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=69, PETRI_PLACES=30, PETRI_TRANSITIONS=24} [2024-06-03 22:31:41,966 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 1 predicate places. [2024-06-03 22:31:41,967 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 24 transitions, 69 flow [2024-06-03 22:31:41,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:31:41,967 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:31:41,967 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:31:41,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-03 22:31:41,968 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:31:41,968 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:31:41,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1311490701, now seen corresponding path program 1 times [2024-06-03 22:31:41,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:31:41,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741899573] [2024-06-03 22:31:41,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:31:41,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:31:42,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:31:43,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:31:43,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:31:43,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741899573] [2024-06-03 22:31:43,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741899573] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:31:43,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:31:43,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-03 22:31:43,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756461314] [2024-06-03 22:31:43,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:31:43,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-03 22:31:43,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:31:43,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-03 22:31:43,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-03 22:31:44,014 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 30 [2024-06-03 22:31:44,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 69 flow. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:31:44,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:31:44,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 30 [2024-06-03 22:31:44,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:31:44,168 INFO L124 PetriNetUnfolderBase]: 132/248 cut-off events. [2024-06-03 22:31:44,169 INFO L125 PetriNetUnfolderBase]: For 50/53 co-relation queries the response was YES. [2024-06-03 22:31:44,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 584 conditions, 248 events. 132/248 cut-off events. For 50/53 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 840 event pairs, 64 based on Foata normal form. 4/251 useless extension candidates. Maximal degree in co-relation 569. Up to 229 conditions per place. [2024-06-03 22:31:44,172 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 26 selfloop transitions, 5 changer transitions 0/34 dead transitions. [2024-06-03 22:31:44,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 34 transitions, 157 flow [2024-06-03 22:31:44,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-03 22:31:44,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-03 22:31:44,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2024-06-03 22:31:44,175 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5083333333333333 [2024-06-03 22:31:44,175 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 69 flow. Second operand 4 states and 61 transitions. [2024-06-03 22:31:44,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 34 transitions, 157 flow [2024-06-03 22:31:44,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 34 transitions, 154 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-03 22:31:44,178 INFO L231 Difference]: Finished difference. Result has 33 places, 26 transitions, 93 flow [2024-06-03 22:31:44,178 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=93, PETRI_PLACES=33, PETRI_TRANSITIONS=26} [2024-06-03 22:31:44,180 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 4 predicate places. [2024-06-03 22:31:44,180 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 26 transitions, 93 flow [2024-06-03 22:31:44,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:31:44,180 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:31:44,180 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:31:44,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-03 22:31:44,181 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:31:44,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:31:44,185 INFO L85 PathProgramCache]: Analyzing trace with hash -2001504973, now seen corresponding path program 1 times [2024-06-03 22:31:44,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:31:44,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787350819] [2024-06-03 22:31:44,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:31:44,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:31:44,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:31:46,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:31:46,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:31:46,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787350819] [2024-06-03 22:31:46,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787350819] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:31:46,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:31:46,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-03 22:31:46,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277480461] [2024-06-03 22:31:46,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:31:46,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-03 22:31:46,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:31:46,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-03 22:31:46,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-03 22:31:46,105 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:31:46,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 26 transitions, 93 flow. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:31:46,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:31:46,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:31:46,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:31:46,264 INFO L124 PetriNetUnfolderBase]: 152/281 cut-off events. [2024-06-03 22:31:46,264 INFO L125 PetriNetUnfolderBase]: For 159/159 co-relation queries the response was YES. [2024-06-03 22:31:46,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 735 conditions, 281 events. 152/281 cut-off events. For 159/159 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 963 event pairs, 59 based on Foata normal form. 2/282 useless extension candidates. Maximal degree in co-relation 718. Up to 254 conditions per place. [2024-06-03 22:31:46,268 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 35 selfloop transitions, 7 changer transitions 0/44 dead transitions. [2024-06-03 22:31:46,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 44 transitions, 227 flow [2024-06-03 22:31:46,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 22:31:46,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 22:31:46,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2024-06-03 22:31:46,271 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2024-06-03 22:31:46,271 INFO L175 Difference]: Start difference. First operand has 33 places, 26 transitions, 93 flow. Second operand 5 states and 70 transitions. [2024-06-03 22:31:46,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 44 transitions, 227 flow [2024-06-03 22:31:46,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 44 transitions, 216 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-03 22:31:46,274 INFO L231 Difference]: Finished difference. Result has 38 places, 32 transitions, 137 flow [2024-06-03 22:31:46,275 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=137, PETRI_PLACES=38, PETRI_TRANSITIONS=32} [2024-06-03 22:31:46,276 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 9 predicate places. [2024-06-03 22:31:46,276 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 32 transitions, 137 flow [2024-06-03 22:31:46,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:31:46,277 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:31:46,277 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:31:46,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-03 22:31:46,277 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:31:46,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:31:46,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1917110894, now seen corresponding path program 1 times [2024-06-03 22:31:46,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:31:46,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606125929] [2024-06-03 22:31:46,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:31:46,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:31:46,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:31:48,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-03 22:31:48,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:31:48,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606125929] [2024-06-03 22:31:48,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606125929] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:31:48,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:31:48,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 22:31:48,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511507148] [2024-06-03 22:31:48,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:31:48,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 22:31:48,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:31:48,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 22:31:48,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-03 22:31:48,441 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:31:48,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 137 flow. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:31:48,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:31:48,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:31:48,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:31:48,592 INFO L124 PetriNetUnfolderBase]: 149/276 cut-off events. [2024-06-03 22:31:48,592 INFO L125 PetriNetUnfolderBase]: For 273/273 co-relation queries the response was YES. [2024-06-03 22:31:48,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 812 conditions, 276 events. 149/276 cut-off events. For 273/273 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 929 event pairs, 41 based on Foata normal form. 2/277 useless extension candidates. Maximal degree in co-relation 792. Up to 240 conditions per place. [2024-06-03 22:31:48,594 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 39 selfloop transitions, 9 changer transitions 0/50 dead transitions. [2024-06-03 22:31:48,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 50 transitions, 279 flow [2024-06-03 22:31:48,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:31:48,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:31:48,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2024-06-03 22:31:48,596 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45555555555555555 [2024-06-03 22:31:48,596 INFO L175 Difference]: Start difference. First operand has 38 places, 32 transitions, 137 flow. Second operand 6 states and 82 transitions. [2024-06-03 22:31:48,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 50 transitions, 279 flow [2024-06-03 22:31:48,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 50 transitions, 279 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-03 22:31:48,598 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 172 flow [2024-06-03 22:31:48,598 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=172, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2024-06-03 22:31:48,599 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 15 predicate places. [2024-06-03 22:31:48,599 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 172 flow [2024-06-03 22:31:48,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:31:48,600 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:31:48,600 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:31:48,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-03 22:31:48,600 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:31:48,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:31:48,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1555601532, now seen corresponding path program 1 times [2024-06-03 22:31:48,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:31:48,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481798894] [2024-06-03 22:31:48,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:31:48,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:31:48,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:31:50,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:31:50,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:31:50,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481798894] [2024-06-03 22:31:50,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481798894] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:31:50,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:31:50,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 22:31:50,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010667857] [2024-06-03 22:31:50,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:31:50,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 22:31:50,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:31:50,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 22:31:50,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-03 22:31:50,991 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:31:50,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 172 flow. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:31:50,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:31:50,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:31:50,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:31:51,207 INFO L124 PetriNetUnfolderBase]: 145/268 cut-off events. [2024-06-03 22:31:51,207 INFO L125 PetriNetUnfolderBase]: For 405/405 co-relation queries the response was YES. [2024-06-03 22:31:51,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 867 conditions, 268 events. 145/268 cut-off events. For 405/405 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 884 event pairs, 22 based on Foata normal form. 4/271 useless extension candidates. Maximal degree in co-relation 844. Up to 214 conditions per place. [2024-06-03 22:31:51,209 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 39 selfloop transitions, 10 changer transitions 0/51 dead transitions. [2024-06-03 22:31:51,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 51 transitions, 304 flow [2024-06-03 22:31:51,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:31:51,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:31:51,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 89 transitions. [2024-06-03 22:31:51,212 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4238095238095238 [2024-06-03 22:31:51,212 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 172 flow. Second operand 7 states and 89 transitions. [2024-06-03 22:31:51,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 51 transitions, 304 flow [2024-06-03 22:31:51,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 51 transitions, 287 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-06-03 22:31:51,216 INFO L231 Difference]: Finished difference. Result has 46 places, 33 transitions, 169 flow [2024-06-03 22:31:51,216 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=169, PETRI_PLACES=46, PETRI_TRANSITIONS=33} [2024-06-03 22:31:51,220 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 17 predicate places. [2024-06-03 22:31:51,220 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 33 transitions, 169 flow [2024-06-03 22:31:51,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:31:51,221 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:31:51,221 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:31:51,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-03 22:31:51,222 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:31:51,222 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:31:51,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1606489710, now seen corresponding path program 1 times [2024-06-03 22:31:51,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:31:51,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105872474] [2024-06-03 22:31:51,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:31:51,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:31:51,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:31:55,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:31:55,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:31:55,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105872474] [2024-06-03 22:31:55,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105872474] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:31:55,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:31:55,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 22:31:55,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090080440] [2024-06-03 22:31:55,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:31:55,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 22:31:55,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:31:55,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 22:31:55,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-03 22:31:55,396 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:31:55,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 33 transitions, 169 flow. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:31:55,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:31:55,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:31:55,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:31:55,626 INFO L124 PetriNetUnfolderBase]: 141/262 cut-off events. [2024-06-03 22:31:55,626 INFO L125 PetriNetUnfolderBase]: For 495/495 co-relation queries the response was YES. [2024-06-03 22:31:55,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 883 conditions, 262 events. 141/262 cut-off events. For 495/495 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 854 event pairs, 36 based on Foata normal form. 2/263 useless extension candidates. Maximal degree in co-relation 859. Up to 244 conditions per place. [2024-06-03 22:31:55,629 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 32 selfloop transitions, 7 changer transitions 0/41 dead transitions. [2024-06-03 22:31:55,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 41 transitions, 267 flow [2024-06-03 22:31:55,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 22:31:55,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 22:31:55,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2024-06-03 22:31:55,632 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37333333333333335 [2024-06-03 22:31:55,632 INFO L175 Difference]: Start difference. First operand has 46 places, 33 transitions, 169 flow. Second operand 5 states and 56 transitions. [2024-06-03 22:31:55,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 41 transitions, 267 flow [2024-06-03 22:31:55,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 41 transitions, 240 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-03 22:31:55,634 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 171 flow [2024-06-03 22:31:55,635 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=171, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2024-06-03 22:31:55,637 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 16 predicate places. [2024-06-03 22:31:55,637 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 171 flow [2024-06-03 22:31:55,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:31:55,637 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:31:55,638 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:31:55,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-03 22:31:55,638 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:31:55,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:31:55,638 INFO L85 PathProgramCache]: Analyzing trace with hash -808955857, now seen corresponding path program 1 times [2024-06-03 22:31:55,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:31:55,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073758544] [2024-06-03 22:31:55,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:31:55,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:31:55,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:31:59,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:31:59,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:31:59,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073758544] [2024-06-03 22:31:59,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073758544] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:31:59,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:31:59,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:31:59,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662564946] [2024-06-03 22:31:59,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:31:59,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:31:59,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:31:59,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:31:59,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:31:59,438 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:31:59,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 171 flow. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:31:59,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:31:59,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:31:59,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:31:59,639 INFO L124 PetriNetUnfolderBase]: 144/267 cut-off events. [2024-06-03 22:31:59,639 INFO L125 PetriNetUnfolderBase]: For 602/602 co-relation queries the response was YES. [2024-06-03 22:31:59,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 922 conditions, 267 events. 144/267 cut-off events. For 602/602 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 873 event pairs, 34 based on Foata normal form. 1/267 useless extension candidates. Maximal degree in co-relation 897. Up to 225 conditions per place. [2024-06-03 22:31:59,641 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 37 selfloop transitions, 15 changer transitions 0/54 dead transitions. [2024-06-03 22:31:59,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 54 transitions, 343 flow [2024-06-03 22:31:59,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:31:59,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:31:59,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 87 transitions. [2024-06-03 22:31:59,643 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3625 [2024-06-03 22:31:59,643 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 171 flow. Second operand 8 states and 87 transitions. [2024-06-03 22:31:59,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 54 transitions, 343 flow [2024-06-03 22:31:59,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 54 transitions, 330 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-03 22:31:59,645 INFO L231 Difference]: Finished difference. Result has 50 places, 39 transitions, 217 flow [2024-06-03 22:31:59,645 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=217, PETRI_PLACES=50, PETRI_TRANSITIONS=39} [2024-06-03 22:31:59,646 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 21 predicate places. [2024-06-03 22:31:59,646 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 39 transitions, 217 flow [2024-06-03 22:31:59,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:31:59,646 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:31:59,646 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:31:59,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-03 22:31:59,647 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:31:59,647 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:31:59,647 INFO L85 PathProgramCache]: Analyzing trace with hash -808835701, now seen corresponding path program 1 times [2024-06-03 22:31:59,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:31:59,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418310492] [2024-06-03 22:31:59,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:31:59,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:31:59,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:32:03,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:32:03,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:32:03,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418310492] [2024-06-03 22:32:03,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418310492] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:32:03,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:32:03,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:32:03,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337699347] [2024-06-03 22:32:03,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:32:03,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:32:03,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:32:03,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:32:03,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:32:03,193 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:32:03,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 39 transitions, 217 flow. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:32:03,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:32:03,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:32:03,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:32:03,385 INFO L124 PetriNetUnfolderBase]: 150/277 cut-off events. [2024-06-03 22:32:03,385 INFO L125 PetriNetUnfolderBase]: For 830/830 co-relation queries the response was YES. [2024-06-03 22:32:03,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1020 conditions, 277 events. 150/277 cut-off events. For 830/830 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 913 event pairs, 35 based on Foata normal form. 2/278 useless extension candidates. Maximal degree in co-relation 994. Up to 228 conditions per place. [2024-06-03 22:32:03,387 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 41 selfloop transitions, 13 changer transitions 0/56 dead transitions. [2024-06-03 22:32:03,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 56 transitions, 385 flow [2024-06-03 22:32:03,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:32:03,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:32:03,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2024-06-03 22:32:03,389 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40555555555555556 [2024-06-03 22:32:03,389 INFO L175 Difference]: Start difference. First operand has 50 places, 39 transitions, 217 flow. Second operand 6 states and 73 transitions. [2024-06-03 22:32:03,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 56 transitions, 385 flow [2024-06-03 22:32:03,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 56 transitions, 360 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-03 22:32:03,391 INFO L231 Difference]: Finished difference. Result has 51 places, 43 transitions, 243 flow [2024-06-03 22:32:03,392 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=243, PETRI_PLACES=51, PETRI_TRANSITIONS=43} [2024-06-03 22:32:03,392 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 22 predicate places. [2024-06-03 22:32:03,392 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 243 flow [2024-06-03 22:32:03,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:32:03,393 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:32:03,393 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:32:03,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-03 22:32:03,393 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:32:03,393 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:32:03,394 INFO L85 PathProgramCache]: Analyzing trace with hash -808835887, now seen corresponding path program 2 times [2024-06-03 22:32:03,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:32:03,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616840734] [2024-06-03 22:32:03,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:32:03,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:32:03,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:32:07,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-03 22:32:07,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:32:07,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616840734] [2024-06-03 22:32:07,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616840734] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:32:07,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:32:07,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:32:07,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319761539] [2024-06-03 22:32:07,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:32:07,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:32:07,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:32:07,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:32:07,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:32:07,088 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:32:07,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 243 flow. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:32:07,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:32:07,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:32:07,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:32:07,330 INFO L124 PetriNetUnfolderBase]: 148/274 cut-off events. [2024-06-03 22:32:07,331 INFO L125 PetriNetUnfolderBase]: For 972/972 co-relation queries the response was YES. [2024-06-03 22:32:07,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1066 conditions, 274 events. 148/274 cut-off events. For 972/972 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 898 event pairs, 36 based on Foata normal form. 1/274 useless extension candidates. Maximal degree in co-relation 1040. Up to 236 conditions per place. [2024-06-03 22:32:07,334 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 41 selfloop transitions, 12 changer transitions 0/55 dead transitions. [2024-06-03 22:32:07,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 55 transitions, 379 flow [2024-06-03 22:32:07,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:32:07,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:32:07,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2024-06-03 22:32:07,335 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39444444444444443 [2024-06-03 22:32:07,335 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 243 flow. Second operand 6 states and 71 transitions. [2024-06-03 22:32:07,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 55 transitions, 379 flow [2024-06-03 22:32:07,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 55 transitions, 364 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-06-03 22:32:07,339 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 260 flow [2024-06-03 22:32:07,339 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=260, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2024-06-03 22:32:07,340 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 26 predicate places. [2024-06-03 22:32:07,340 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 260 flow [2024-06-03 22:32:07,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:32:07,340 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:32:07,340 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:32:07,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-03 22:32:07,340 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:32:07,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:32:07,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1825187705, now seen corresponding path program 2 times [2024-06-03 22:32:07,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:32:07,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996392009] [2024-06-03 22:32:07,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:32:07,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:32:07,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:32:10,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:32:10,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:32:10,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996392009] [2024-06-03 22:32:10,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996392009] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:32:10,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:32:10,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:32:10,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752582398] [2024-06-03 22:32:10,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:32:10,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:32:10,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:32:10,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:32:10,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:32:10,578 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:32:10,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 260 flow. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:32:10,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:32:10,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:32:10,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:32:10,797 INFO L124 PetriNetUnfolderBase]: 149/276 cut-off events. [2024-06-03 22:32:10,797 INFO L125 PetriNetUnfolderBase]: For 1223/1223 co-relation queries the response was YES. [2024-06-03 22:32:10,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1124 conditions, 276 events. 149/276 cut-off events. For 1223/1223 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 909 event pairs, 34 based on Foata normal form. 2/277 useless extension candidates. Maximal degree in co-relation 1096. Up to 252 conditions per place. [2024-06-03 22:32:10,799 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 41 selfloop transitions, 11 changer transitions 0/54 dead transitions. [2024-06-03 22:32:10,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 54 transitions, 399 flow [2024-06-03 22:32:10,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:32:10,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:32:10,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2024-06-03 22:32:10,801 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3611111111111111 [2024-06-03 22:32:10,802 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 260 flow. Second operand 6 states and 65 transitions. [2024-06-03 22:32:10,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 54 transitions, 399 flow [2024-06-03 22:32:10,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 54 transitions, 375 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-06-03 22:32:10,805 INFO L231 Difference]: Finished difference. Result has 57 places, 47 transitions, 291 flow [2024-06-03 22:32:10,806 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=291, PETRI_PLACES=57, PETRI_TRANSITIONS=47} [2024-06-03 22:32:10,807 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 28 predicate places. [2024-06-03 22:32:10,808 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 291 flow [2024-06-03 22:32:10,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:32:10,809 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:32:10,809 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:32:10,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-03 22:32:10,809 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:32:10,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:32:10,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1825178777, now seen corresponding path program 1 times [2024-06-03 22:32:10,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:32:10,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344062841] [2024-06-03 22:32:10,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:32:10,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:32:10,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:32:14,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:32:14,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:32:14,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344062841] [2024-06-03 22:32:14,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344062841] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:32:14,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:32:14,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:32:14,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558976926] [2024-06-03 22:32:14,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:32:14,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:32:14,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:32:14,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:32:14,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:32:14,808 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:32:14,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 47 transitions, 291 flow. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:32:14,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:32:14,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:32:14,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:32:14,980 INFO L124 PetriNetUnfolderBase]: 146/271 cut-off events. [2024-06-03 22:32:14,980 INFO L125 PetriNetUnfolderBase]: For 1379/1379 co-relation queries the response was YES. [2024-06-03 22:32:14,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1142 conditions, 271 events. 146/271 cut-off events. For 1379/1379 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 876 event pairs, 32 based on Foata normal form. 2/272 useless extension candidates. Maximal degree in co-relation 1112. Up to 247 conditions per place. [2024-06-03 22:32:14,982 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 43 selfloop transitions, 9 changer transitions 0/54 dead transitions. [2024-06-03 22:32:14,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 54 transitions, 411 flow [2024-06-03 22:32:14,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:32:14,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:32:14,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2024-06-03 22:32:14,983 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35 [2024-06-03 22:32:14,984 INFO L175 Difference]: Start difference. First operand has 57 places, 47 transitions, 291 flow. Second operand 6 states and 63 transitions. [2024-06-03 22:32:14,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 54 transitions, 411 flow [2024-06-03 22:32:14,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 54 transitions, 398 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-03 22:32:14,987 INFO L231 Difference]: Finished difference. Result has 61 places, 47 transitions, 300 flow [2024-06-03 22:32:14,987 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=300, PETRI_PLACES=61, PETRI_TRANSITIONS=47} [2024-06-03 22:32:14,987 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 32 predicate places. [2024-06-03 22:32:14,987 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 47 transitions, 300 flow [2024-06-03 22:32:14,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:32:14,988 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:32:14,988 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:32:14,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-03 22:32:14,989 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:32:14,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:32:14,989 INFO L85 PathProgramCache]: Analyzing trace with hash 692082734, now seen corresponding path program 1 times [2024-06-03 22:32:14,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:32:14,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16003779] [2024-06-03 22:32:14,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:32:14,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:32:15,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:32:18,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:32:18,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:32:18,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16003779] [2024-06-03 22:32:18,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16003779] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:32:18,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:32:18,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:32:18,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082925291] [2024-06-03 22:32:18,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:32:18,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:32:18,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:32:18,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:32:18,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:32:18,815 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:32:18,816 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 47 transitions, 300 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:32:18,816 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:32:18,816 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:32:18,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:32:19,036 INFO L124 PetriNetUnfolderBase]: 149/276 cut-off events. [2024-06-03 22:32:19,036 INFO L125 PetriNetUnfolderBase]: For 1610/1610 co-relation queries the response was YES. [2024-06-03 22:32:19,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1184 conditions, 276 events. 149/276 cut-off events. For 1610/1610 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 903 event pairs, 31 based on Foata normal form. 1/276 useless extension candidates. Maximal degree in co-relation 1152. Up to 217 conditions per place. [2024-06-03 22:32:19,038 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 48 selfloop transitions, 19 changer transitions 0/69 dead transitions. [2024-06-03 22:32:19,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 69 transitions, 524 flow [2024-06-03 22:32:19,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:32:19,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:32:19,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2024-06-03 22:32:19,040 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38333333333333336 [2024-06-03 22:32:19,040 INFO L175 Difference]: Start difference. First operand has 61 places, 47 transitions, 300 flow. Second operand 8 states and 92 transitions. [2024-06-03 22:32:19,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 69 transitions, 524 flow [2024-06-03 22:32:19,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 69 transitions, 504 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-03 22:32:19,043 INFO L231 Difference]: Finished difference. Result has 65 places, 51 transitions, 351 flow [2024-06-03 22:32:19,044 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=351, PETRI_PLACES=65, PETRI_TRANSITIONS=51} [2024-06-03 22:32:19,044 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 36 predicate places. [2024-06-03 22:32:19,044 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 51 transitions, 351 flow [2024-06-03 22:32:19,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:32:19,044 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:32:19,045 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:32:19,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-03 22:32:19,045 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:32:19,045 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:32:19,045 INFO L85 PathProgramCache]: Analyzing trace with hash 692172944, now seen corresponding path program 2 times [2024-06-03 22:32:19,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:32:19,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151976138] [2024-06-03 22:32:19,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:32:19,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:32:19,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:32:22,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:32:22,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:32:22,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151976138] [2024-06-03 22:32:22,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151976138] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:32:22,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:32:22,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:32:22,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161413511] [2024-06-03 22:32:22,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:32:22,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:32:22,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:32:22,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:32:22,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:32:22,620 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:32:22,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 51 transitions, 351 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:32:22,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:32:22,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:32:22,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:32:22,850 INFO L124 PetriNetUnfolderBase]: 152/281 cut-off events. [2024-06-03 22:32:22,851 INFO L125 PetriNetUnfolderBase]: For 1889/1889 co-relation queries the response was YES. [2024-06-03 22:32:22,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1274 conditions, 281 events. 152/281 cut-off events. For 1889/1889 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 921 event pairs, 31 based on Foata normal form. 1/281 useless extension candidates. Maximal degree in co-relation 1241. Up to 237 conditions per place. [2024-06-03 22:32:22,853 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 49 selfloop transitions, 16 changer transitions 0/67 dead transitions. [2024-06-03 22:32:22,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 67 transitions, 531 flow [2024-06-03 22:32:22,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:32:22,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:32:22,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 87 transitions. [2024-06-03 22:32:22,855 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3625 [2024-06-03 22:32:22,855 INFO L175 Difference]: Start difference. First operand has 65 places, 51 transitions, 351 flow. Second operand 8 states and 87 transitions. [2024-06-03 22:32:22,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 67 transitions, 531 flow [2024-06-03 22:32:22,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 67 transitions, 501 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-03 22:32:22,859 INFO L231 Difference]: Finished difference. Result has 69 places, 53 transitions, 378 flow [2024-06-03 22:32:22,859 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=378, PETRI_PLACES=69, PETRI_TRANSITIONS=53} [2024-06-03 22:32:22,860 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 40 predicate places. [2024-06-03 22:32:22,860 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 53 transitions, 378 flow [2024-06-03 22:32:22,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:32:22,860 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:32:22,860 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:32:22,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-03 22:32:22,861 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:32:22,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:32:22,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1624766409, now seen corresponding path program 1 times [2024-06-03 22:32:22,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:32:22,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663697734] [2024-06-03 22:32:22,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:32:22,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:32:22,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:32:26,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:32:26,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:32:26,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663697734] [2024-06-03 22:32:26,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663697734] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:32:26,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:32:26,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:32:26,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339422050] [2024-06-03 22:32:26,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:32:26,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:32:26,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:32:26,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:32:26,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:32:26,283 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:32:26,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 53 transitions, 378 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:32:26,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:32:26,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:32:26,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:32:26,537 INFO L124 PetriNetUnfolderBase]: 174/317 cut-off events. [2024-06-03 22:32:26,538 INFO L125 PetriNetUnfolderBase]: For 2610/2610 co-relation queries the response was YES. [2024-06-03 22:32:26,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1465 conditions, 317 events. 174/317 cut-off events. For 2610/2610 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1089 event pairs, 29 based on Foata normal form. 4/320 useless extension candidates. Maximal degree in co-relation 1430. Up to 174 conditions per place. [2024-06-03 22:32:26,540 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 49 selfloop transitions, 32 changer transitions 0/83 dead transitions. [2024-06-03 22:32:26,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 83 transitions, 724 flow [2024-06-03 22:32:26,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:32:26,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:32:26,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2024-06-03 22:32:26,541 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40370370370370373 [2024-06-03 22:32:26,541 INFO L175 Difference]: Start difference. First operand has 69 places, 53 transitions, 378 flow. Second operand 9 states and 109 transitions. [2024-06-03 22:32:26,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 83 transitions, 724 flow [2024-06-03 22:32:26,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 83 transitions, 689 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-03 22:32:26,547 INFO L231 Difference]: Finished difference. Result has 72 places, 60 transitions, 463 flow [2024-06-03 22:32:26,547 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=343, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=463, PETRI_PLACES=72, PETRI_TRANSITIONS=60} [2024-06-03 22:32:26,548 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 43 predicate places. [2024-06-03 22:32:26,548 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 60 transitions, 463 flow [2024-06-03 22:32:26,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:32:26,548 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:32:26,549 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:32:26,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-03 22:32:26,549 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:32:26,549 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:32:26,549 INFO L85 PathProgramCache]: Analyzing trace with hash 695897749, now seen corresponding path program 2 times [2024-06-03 22:32:26,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:32:26,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953372662] [2024-06-03 22:32:26,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:32:26,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:32:26,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:32:29,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:32:29,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:32:29,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953372662] [2024-06-03 22:32:29,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953372662] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:32:29,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:32:29,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:32:29,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987910445] [2024-06-03 22:32:29,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:32:29,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:32:29,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:32:29,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:32:29,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:32:29,952 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:32:29,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 60 transitions, 463 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:32:29,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:32:29,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:32:29,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:32:30,318 INFO L124 PetriNetUnfolderBase]: 227/403 cut-off events. [2024-06-03 22:32:30,319 INFO L125 PetriNetUnfolderBase]: For 3630/3630 co-relation queries the response was YES. [2024-06-03 22:32:30,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2036 conditions, 403 events. 227/403 cut-off events. For 3630/3630 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1491 event pairs, 38 based on Foata normal form. 2/404 useless extension candidates. Maximal degree in co-relation 2000. Up to 297 conditions per place. [2024-06-03 22:32:30,322 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 64 selfloop transitions, 31 changer transitions 0/97 dead transitions. [2024-06-03 22:32:30,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 97 transitions, 920 flow [2024-06-03 22:32:30,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:32:30,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:32:30,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 120 transitions. [2024-06-03 22:32:30,324 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2024-06-03 22:32:30,324 INFO L175 Difference]: Start difference. First operand has 72 places, 60 transitions, 463 flow. Second operand 11 states and 120 transitions. [2024-06-03 22:32:30,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 97 transitions, 920 flow [2024-06-03 22:32:30,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 97 transitions, 873 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-06-03 22:32:30,330 INFO L231 Difference]: Finished difference. Result has 81 places, 74 transitions, 625 flow [2024-06-03 22:32:30,330 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=425, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=625, PETRI_PLACES=81, PETRI_TRANSITIONS=74} [2024-06-03 22:32:30,331 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 52 predicate places. [2024-06-03 22:32:30,331 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 74 transitions, 625 flow [2024-06-03 22:32:30,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:32:30,332 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:32:30,332 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:32:30,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-03 22:32:30,332 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:32:30,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:32:30,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1692700203, now seen corresponding path program 3 times [2024-06-03 22:32:30,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:32:30,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180438650] [2024-06-03 22:32:30,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:32:30,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:32:30,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:32:33,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:32:33,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:32:33,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180438650] [2024-06-03 22:32:33,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180438650] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:32:33,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:32:33,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:32:33,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821746051] [2024-06-03 22:32:33,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:32:33,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:32:33,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:32:33,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:32:33,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:32:33,654 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:32:33,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 74 transitions, 625 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:32:33,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:32:33,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:32:33,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:32:33,939 INFO L124 PetriNetUnfolderBase]: 221/395 cut-off events. [2024-06-03 22:32:33,939 INFO L125 PetriNetUnfolderBase]: For 3941/3941 co-relation queries the response was YES. [2024-06-03 22:32:33,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2080 conditions, 395 events. 221/395 cut-off events. For 3941/3941 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1457 event pairs, 32 based on Foata normal form. 4/398 useless extension candidates. Maximal degree in co-relation 2040. Up to 296 conditions per place. [2024-06-03 22:32:33,941 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 62 selfloop transitions, 29 changer transitions 0/93 dead transitions. [2024-06-03 22:32:33,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 93 transitions, 923 flow [2024-06-03 22:32:33,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:32:33,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:32:33,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 103 transitions. [2024-06-03 22:32:33,943 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3814814814814815 [2024-06-03 22:32:33,943 INFO L175 Difference]: Start difference. First operand has 81 places, 74 transitions, 625 flow. Second operand 9 states and 103 transitions. [2024-06-03 22:32:33,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 93 transitions, 923 flow [2024-06-03 22:32:33,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 93 transitions, 891 flow, removed 11 selfloop flow, removed 3 redundant places. [2024-06-03 22:32:33,954 INFO L231 Difference]: Finished difference. Result has 87 places, 74 transitions, 658 flow [2024-06-03 22:32:33,954 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=593, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=658, PETRI_PLACES=87, PETRI_TRANSITIONS=74} [2024-06-03 22:32:33,954 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 58 predicate places. [2024-06-03 22:32:33,954 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 74 transitions, 658 flow [2024-06-03 22:32:33,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:32:33,955 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:32:33,955 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:32:33,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-03 22:32:33,955 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:32:33,955 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:32:33,955 INFO L85 PathProgramCache]: Analyzing trace with hash 695892014, now seen corresponding path program 3 times [2024-06-03 22:32:33,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:32:33,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98532386] [2024-06-03 22:32:33,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:32:33,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:32:33,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:32:37,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:32:37,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:32:37,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98532386] [2024-06-03 22:32:37,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98532386] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:32:37,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:32:37,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:32:37,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300125140] [2024-06-03 22:32:37,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:32:37,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:32:37,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:32:37,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:32:37,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:32:37,785 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:32:37,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 74 transitions, 658 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:32:37,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:32:37,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:32:37,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:32:38,031 INFO L124 PetriNetUnfolderBase]: 217/388 cut-off events. [2024-06-03 22:32:38,032 INFO L125 PetriNetUnfolderBase]: For 4008/4008 co-relation queries the response was YES. [2024-06-03 22:32:38,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2104 conditions, 388 events. 217/388 cut-off events. For 4008/4008 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1423 event pairs, 41 based on Foata normal form. 1/388 useless extension candidates. Maximal degree in co-relation 2062. Up to 355 conditions per place. [2024-06-03 22:32:38,034 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 69 selfloop transitions, 15 changer transitions 0/86 dead transitions. [2024-06-03 22:32:38,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 86 transitions, 860 flow [2024-06-03 22:32:38,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:32:38,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:32:38,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 83 transitions. [2024-06-03 22:32:38,036 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3458333333333333 [2024-06-03 22:32:38,036 INFO L175 Difference]: Start difference. First operand has 87 places, 74 transitions, 658 flow. Second operand 8 states and 83 transitions. [2024-06-03 22:32:38,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 86 transitions, 860 flow [2024-06-03 22:32:38,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 86 transitions, 802 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-03 22:32:38,045 INFO L231 Difference]: Finished difference. Result has 88 places, 75 transitions, 648 flow [2024-06-03 22:32:38,045 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=600, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=648, PETRI_PLACES=88, PETRI_TRANSITIONS=75} [2024-06-03 22:32:38,051 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 59 predicate places. [2024-06-03 22:32:38,051 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 75 transitions, 648 flow [2024-06-03 22:32:38,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:32:38,051 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:32:38,052 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:32:38,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-03 22:32:38,052 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:32:38,052 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:32:38,052 INFO L85 PathProgramCache]: Analyzing trace with hash -753600533, now seen corresponding path program 4 times [2024-06-03 22:32:38,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:32:38,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114941565] [2024-06-03 22:32:38,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:32:38,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:32:38,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:32:41,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:32:41,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:32:41,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114941565] [2024-06-03 22:32:41,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114941565] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:32:41,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:32:41,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:32:41,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272056980] [2024-06-03 22:32:41,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:32:41,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:32:41,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:32:41,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:32:41,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:32:41,455 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:32:41,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 75 transitions, 648 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:32:41,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:32:41,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:32:41,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:32:41,743 INFO L124 PetriNetUnfolderBase]: 231/412 cut-off events. [2024-06-03 22:32:41,744 INFO L125 PetriNetUnfolderBase]: For 4818/4818 co-relation queries the response was YES. [2024-06-03 22:32:41,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2203 conditions, 412 events. 231/412 cut-off events. For 4818/4818 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1542 event pairs, 37 based on Foata normal form. 4/415 useless extension candidates. Maximal degree in co-relation 2159. Up to 292 conditions per place. [2024-06-03 22:32:41,747 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 68 selfloop transitions, 28 changer transitions 0/98 dead transitions. [2024-06-03 22:32:41,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 98 transitions, 996 flow [2024-06-03 22:32:41,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:32:41,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:32:41,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 97 transitions. [2024-06-03 22:32:41,748 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4041666666666667 [2024-06-03 22:32:41,748 INFO L175 Difference]: Start difference. First operand has 88 places, 75 transitions, 648 flow. Second operand 8 states and 97 transitions. [2024-06-03 22:32:41,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 98 transitions, 996 flow [2024-06-03 22:32:41,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 98 transitions, 954 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-03 22:32:41,756 INFO L231 Difference]: Finished difference. Result has 90 places, 78 transitions, 699 flow [2024-06-03 22:32:41,756 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=606, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=699, PETRI_PLACES=90, PETRI_TRANSITIONS=78} [2024-06-03 22:32:41,757 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 61 predicate places. [2024-06-03 22:32:41,757 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 78 transitions, 699 flow [2024-06-03 22:32:41,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:32:41,757 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:32:41,757 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:32:41,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-03 22:32:41,758 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:32:41,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:32:41,758 INFO L85 PathProgramCache]: Analyzing trace with hash -753594953, now seen corresponding path program 5 times [2024-06-03 22:32:41,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:32:41,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307193730] [2024-06-03 22:32:41,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:32:41,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:32:41,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:32:44,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:32:44,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:32:44,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307193730] [2024-06-03 22:32:44,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307193730] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:32:44,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:32:44,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:32:44,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145679050] [2024-06-03 22:32:44,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:32:44,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:32:44,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:32:44,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:32:44,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:32:45,028 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:32:45,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 78 transitions, 699 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:32:45,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:32:45,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:32:45,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:32:45,333 INFO L124 PetriNetUnfolderBase]: 237/422 cut-off events. [2024-06-03 22:32:45,333 INFO L125 PetriNetUnfolderBase]: For 5145/5145 co-relation queries the response was YES. [2024-06-03 22:32:45,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2346 conditions, 422 events. 237/422 cut-off events. For 5145/5145 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1592 event pairs, 38 based on Foata normal form. 2/423 useless extension candidates. Maximal degree in co-relation 2302. Up to 294 conditions per place. [2024-06-03 22:32:45,336 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 67 selfloop transitions, 27 changer transitions 0/96 dead transitions. [2024-06-03 22:32:45,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 96 transitions, 997 flow [2024-06-03 22:32:45,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:32:45,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:32:45,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 93 transitions. [2024-06-03 22:32:45,337 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3875 [2024-06-03 22:32:45,338 INFO L175 Difference]: Start difference. First operand has 90 places, 78 transitions, 699 flow. Second operand 8 states and 93 transitions. [2024-06-03 22:32:45,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 96 transitions, 997 flow [2024-06-03 22:32:45,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 96 transitions, 905 flow, removed 12 selfloop flow, removed 7 redundant places. [2024-06-03 22:32:45,347 INFO L231 Difference]: Finished difference. Result has 91 places, 80 transitions, 690 flow [2024-06-03 22:32:45,347 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=609, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=690, PETRI_PLACES=91, PETRI_TRANSITIONS=80} [2024-06-03 22:32:45,347 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 62 predicate places. [2024-06-03 22:32:45,347 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 80 transitions, 690 flow [2024-06-03 22:32:45,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:32:45,348 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:32:45,348 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:32:45,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-03 22:32:45,348 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:32:45,348 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:32:45,349 INFO L85 PathProgramCache]: Analyzing trace with hash -745976176, now seen corresponding path program 1 times [2024-06-03 22:32:45,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:32:45,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526352029] [2024-06-03 22:32:45,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:32:45,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:32:45,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:32:48,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:32:48,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:32:48,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526352029] [2024-06-03 22:32:48,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526352029] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:32:48,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:32:48,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:32:48,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607225897] [2024-06-03 22:32:48,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:32:48,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:32:48,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:32:48,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:32:48,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:32:48,528 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:32:48,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 80 transitions, 690 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:32:48,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:32:48,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:32:48,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:32:48,760 INFO L124 PetriNetUnfolderBase]: 235/419 cut-off events. [2024-06-03 22:32:48,761 INFO L125 PetriNetUnfolderBase]: For 5286/5286 co-relation queries the response was YES. [2024-06-03 22:32:48,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2282 conditions, 419 events. 235/419 cut-off events. For 5286/5286 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1569 event pairs, 41 based on Foata normal form. 1/419 useless extension candidates. Maximal degree in co-relation 2238. Up to 392 conditions per place. [2024-06-03 22:32:48,764 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 73 selfloop transitions, 12 changer transitions 0/87 dead transitions. [2024-06-03 22:32:48,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 87 transitions, 878 flow [2024-06-03 22:32:48,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:32:48,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:32:48,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2024-06-03 22:32:48,766 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3611111111111111 [2024-06-03 22:32:48,766 INFO L175 Difference]: Start difference. First operand has 91 places, 80 transitions, 690 flow. Second operand 6 states and 65 transitions. [2024-06-03 22:32:48,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 87 transitions, 878 flow [2024-06-03 22:32:48,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 87 transitions, 837 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-06-03 22:32:48,775 INFO L231 Difference]: Finished difference. Result has 93 places, 80 transitions, 681 flow [2024-06-03 22:32:48,775 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=649, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=681, PETRI_PLACES=93, PETRI_TRANSITIONS=80} [2024-06-03 22:32:48,775 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 64 predicate places. [2024-06-03 22:32:48,775 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 80 transitions, 681 flow [2024-06-03 22:32:48,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:32:48,776 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:32:48,776 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:32:48,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-03 22:32:48,777 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:32:48,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:32:48,778 INFO L85 PathProgramCache]: Analyzing trace with hash -753600688, now seen corresponding path program 4 times [2024-06-03 22:32:48,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:32:48,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912944746] [2024-06-03 22:32:48,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:32:48,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:32:48,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:32:52,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:32:52,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:32:52,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912944746] [2024-06-03 22:32:52,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912944746] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:32:52,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:32:52,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:32:52,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605527277] [2024-06-03 22:32:52,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:32:52,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:32:52,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:32:52,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:32:52,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:32:52,488 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:32:52,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 80 transitions, 681 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:32:52,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:32:52,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:32:52,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:32:52,728 INFO L124 PetriNetUnfolderBase]: 231/412 cut-off events. [2024-06-03 22:32:52,728 INFO L125 PetriNetUnfolderBase]: For 5493/5493 co-relation queries the response was YES. [2024-06-03 22:32:52,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2217 conditions, 412 events. 231/412 cut-off events. For 5493/5493 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1535 event pairs, 43 based on Foata normal form. 1/412 useless extension candidates. Maximal degree in co-relation 2172. Up to 364 conditions per place. [2024-06-03 22:32:52,731 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 77 selfloop transitions, 17 changer transitions 0/96 dead transitions. [2024-06-03 22:32:52,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 96 transitions, 909 flow [2024-06-03 22:32:52,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:32:52,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:32:52,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 83 transitions. [2024-06-03 22:32:52,732 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3952380952380952 [2024-06-03 22:32:52,732 INFO L175 Difference]: Start difference. First operand has 93 places, 80 transitions, 681 flow. Second operand 7 states and 83 transitions. [2024-06-03 22:32:52,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 96 transitions, 909 flow [2024-06-03 22:32:52,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 96 transitions, 870 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-03 22:32:52,742 INFO L231 Difference]: Finished difference. Result has 95 places, 80 transitions, 684 flow [2024-06-03 22:32:52,742 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=642, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=684, PETRI_PLACES=95, PETRI_TRANSITIONS=80} [2024-06-03 22:32:52,742 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 66 predicate places. [2024-06-03 22:32:52,742 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 80 transitions, 684 flow [2024-06-03 22:32:52,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:32:52,743 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:32:52,743 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:32:52,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-03 22:32:52,743 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:32:52,743 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:32:52,743 INFO L85 PathProgramCache]: Analyzing trace with hash -746243303, now seen corresponding path program 6 times [2024-06-03 22:32:52,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:32:52,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92984498] [2024-06-03 22:32:52,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:32:52,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:32:52,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:32:55,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:32:55,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:32:55,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92984498] [2024-06-03 22:32:55,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92984498] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:32:55,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:32:55,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:32:55,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591231825] [2024-06-03 22:32:55,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:32:55,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:32:55,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:32:55,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:32:55,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:32:55,913 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:32:55,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 80 transitions, 684 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:32:55,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:32:55,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:32:55,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:32:56,166 INFO L124 PetriNetUnfolderBase]: 232/414 cut-off events. [2024-06-03 22:32:56,166 INFO L125 PetriNetUnfolderBase]: For 5525/5525 co-relation queries the response was YES. [2024-06-03 22:32:56,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2228 conditions, 414 events. 232/414 cut-off events. For 5525/5525 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1551 event pairs, 38 based on Foata normal form. 2/415 useless extension candidates. Maximal degree in co-relation 2182. Up to 382 conditions per place. [2024-06-03 22:32:56,169 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 77 selfloop transitions, 13 changer transitions 0/92 dead transitions. [2024-06-03 22:32:56,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 92 transitions, 913 flow [2024-06-03 22:32:56,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:32:56,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:32:56,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2024-06-03 22:32:56,172 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3375 [2024-06-03 22:32:56,172 INFO L175 Difference]: Start difference. First operand has 95 places, 80 transitions, 684 flow. Second operand 8 states and 81 transitions. [2024-06-03 22:32:56,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 92 transitions, 913 flow [2024-06-03 22:32:56,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 92 transitions, 861 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-03 22:32:56,180 INFO L231 Difference]: Finished difference. Result has 96 places, 82 transitions, 690 flow [2024-06-03 22:32:56,180 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=632, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=690, PETRI_PLACES=96, PETRI_TRANSITIONS=82} [2024-06-03 22:32:56,180 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 67 predicate places. [2024-06-03 22:32:56,180 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 82 transitions, 690 flow [2024-06-03 22:32:56,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:32:56,181 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:32:56,181 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:32:56,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-03 22:32:56,181 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:32:56,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:32:56,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1449251018, now seen corresponding path program 1 times [2024-06-03 22:32:56,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:32:56,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642810601] [2024-06-03 22:32:56,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:32:56,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:32:56,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:32:59,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:32:59,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:32:59,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642810601] [2024-06-03 22:32:59,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642810601] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:32:59,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:32:59,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:32:59,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184433830] [2024-06-03 22:32:59,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:32:59,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:32:59,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:32:59,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:32:59,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:33:00,019 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:33:00,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 82 transitions, 690 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:33:00,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:33:00,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:33:00,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:33:00,364 INFO L124 PetriNetUnfolderBase]: 236/422 cut-off events. [2024-06-03 22:33:00,364 INFO L125 PetriNetUnfolderBase]: For 5984/5984 co-relation queries the response was YES. [2024-06-03 22:33:00,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2275 conditions, 422 events. 236/422 cut-off events. For 5984/5984 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1605 event pairs, 25 based on Foata normal form. 2/423 useless extension candidates. Maximal degree in co-relation 2229. Up to 315 conditions per place. [2024-06-03 22:33:00,367 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 73 selfloop transitions, 30 changer transitions 0/105 dead transitions. [2024-06-03 22:33:00,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 105 transitions, 1000 flow [2024-06-03 22:33:00,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:33:00,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:33:00,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 106 transitions. [2024-06-03 22:33:00,369 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35333333333333333 [2024-06-03 22:33:00,369 INFO L175 Difference]: Start difference. First operand has 96 places, 82 transitions, 690 flow. Second operand 10 states and 106 transitions. [2024-06-03 22:33:00,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 105 transitions, 1000 flow [2024-06-03 22:33:00,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 105 transitions, 953 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-03 22:33:00,379 INFO L231 Difference]: Finished difference. Result has 99 places, 83 transitions, 717 flow [2024-06-03 22:33:00,379 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=643, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=717, PETRI_PLACES=99, PETRI_TRANSITIONS=83} [2024-06-03 22:33:00,380 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 70 predicate places. [2024-06-03 22:33:00,380 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 83 transitions, 717 flow [2024-06-03 22:33:00,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:33:00,380 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:33:00,380 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:33:00,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-03 22:33:00,381 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:33:00,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:33:00,381 INFO L85 PathProgramCache]: Analyzing trace with hash 200506150, now seen corresponding path program 2 times [2024-06-03 22:33:00,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:33:00,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672769422] [2024-06-03 22:33:00,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:33:00,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:33:00,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:33:04,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:33:04,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:33:04,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672769422] [2024-06-03 22:33:04,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672769422] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:33:04,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:33:04,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:33:04,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330242615] [2024-06-03 22:33:04,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:33:04,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:33:04,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:33:04,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:33:04,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:33:04,259 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:33:04,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 83 transitions, 717 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:33:04,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:33:04,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:33:04,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:33:04,541 INFO L124 PetriNetUnfolderBase]: 240/430 cut-off events. [2024-06-03 22:33:04,541 INFO L125 PetriNetUnfolderBase]: For 6646/6646 co-relation queries the response was YES. [2024-06-03 22:33:04,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2359 conditions, 430 events. 240/430 cut-off events. For 6646/6646 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1655 event pairs, 39 based on Foata normal form. 2/431 useless extension candidates. Maximal degree in co-relation 2313. Up to 358 conditions per place. [2024-06-03 22:33:04,544 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 73 selfloop transitions, 29 changer transitions 0/104 dead transitions. [2024-06-03 22:33:04,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 104 transitions, 981 flow [2024-06-03 22:33:04,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:33:04,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:33:04,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 106 transitions. [2024-06-03 22:33:04,561 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35333333333333333 [2024-06-03 22:33:04,561 INFO L175 Difference]: Start difference. First operand has 99 places, 83 transitions, 717 flow. Second operand 10 states and 106 transitions. [2024-06-03 22:33:04,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 104 transitions, 981 flow [2024-06-03 22:33:04,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 104 transitions, 913 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-03 22:33:04,573 INFO L231 Difference]: Finished difference. Result has 102 places, 84 transitions, 725 flow [2024-06-03 22:33:04,574 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=654, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=725, PETRI_PLACES=102, PETRI_TRANSITIONS=84} [2024-06-03 22:33:04,574 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 73 predicate places. [2024-06-03 22:33:04,574 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 84 transitions, 725 flow [2024-06-03 22:33:04,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:33:04,574 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:33:04,574 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:33:04,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-03 22:33:04,575 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:33:04,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:33:04,580 INFO L85 PathProgramCache]: Analyzing trace with hash -17469676, now seen corresponding path program 1 times [2024-06-03 22:33:04,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:33:04,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128102306] [2024-06-03 22:33:04,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:33:04,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:33:04,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:33:08,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:33:08,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:33:08,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128102306] [2024-06-03 22:33:08,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128102306] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:33:08,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:33:08,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:33:08,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409625157] [2024-06-03 22:33:08,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:33:08,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:33:08,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:33:08,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:33:08,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:33:08,424 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:33:08,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 84 transitions, 725 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:33:08,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:33:08,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:33:08,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:33:08,636 INFO L124 PetriNetUnfolderBase]: 236/424 cut-off events. [2024-06-03 22:33:08,636 INFO L125 PetriNetUnfolderBase]: For 6688/6688 co-relation queries the response was YES. [2024-06-03 22:33:08,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2295 conditions, 424 events. 236/424 cut-off events. For 6688/6688 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1616 event pairs, 24 based on Foata normal form. 2/425 useless extension candidates. Maximal degree in co-relation 2248. Up to 295 conditions per place. [2024-06-03 22:33:08,639 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 65 selfloop transitions, 43 changer transitions 0/110 dead transitions. [2024-06-03 22:33:08,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 110 transitions, 1087 flow [2024-06-03 22:33:08,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:33:08,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:33:08,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2024-06-03 22:33:08,656 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37333333333333335 [2024-06-03 22:33:08,656 INFO L175 Difference]: Start difference. First operand has 102 places, 84 transitions, 725 flow. Second operand 10 states and 112 transitions. [2024-06-03 22:33:08,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 110 transitions, 1087 flow [2024-06-03 22:33:08,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 110 transitions, 1021 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-03 22:33:08,667 INFO L231 Difference]: Finished difference. Result has 106 places, 89 transitions, 833 flow [2024-06-03 22:33:08,667 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=659, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=833, PETRI_PLACES=106, PETRI_TRANSITIONS=89} [2024-06-03 22:33:08,667 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 77 predicate places. [2024-06-03 22:33:08,667 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 89 transitions, 833 flow [2024-06-03 22:33:08,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:33:08,668 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:33:08,668 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:33:08,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-03 22:33:08,668 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:33:08,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:33:08,668 INFO L85 PathProgramCache]: Analyzing trace with hash -17474450, now seen corresponding path program 3 times [2024-06-03 22:33:08,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:33:08,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103325787] [2024-06-03 22:33:08,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:33:08,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:33:08,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:33:12,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:33:12,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:33:12,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103325787] [2024-06-03 22:33:12,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103325787] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:33:12,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:33:12,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:33:12,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180911212] [2024-06-03 22:33:12,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:33:12,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:33:12,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:33:12,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:33:12,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:33:12,632 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:33:12,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 89 transitions, 833 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:33:12,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:33:12,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:33:12,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:33:12,900 INFO L124 PetriNetUnfolderBase]: 240/432 cut-off events. [2024-06-03 22:33:12,901 INFO L125 PetriNetUnfolderBase]: For 7417/7417 co-relation queries the response was YES. [2024-06-03 22:33:12,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2452 conditions, 432 events. 240/432 cut-off events. For 7417/7417 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1676 event pairs, 38 based on Foata normal form. 2/433 useless extension candidates. Maximal degree in co-relation 2402. Up to 378 conditions per place. [2024-06-03 22:33:12,905 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 83 selfloop transitions, 22 changer transitions 0/107 dead transitions. [2024-06-03 22:33:12,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 107 transitions, 1092 flow [2024-06-03 22:33:12,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:33:12,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:33:12,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 102 transitions. [2024-06-03 22:33:12,906 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34 [2024-06-03 22:33:12,906 INFO L175 Difference]: Start difference. First operand has 106 places, 89 transitions, 833 flow. Second operand 10 states and 102 transitions. [2024-06-03 22:33:12,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 107 transitions, 1092 flow [2024-06-03 22:33:12,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 107 transitions, 1023 flow, removed 1 selfloop flow, removed 8 redundant places. [2024-06-03 22:33:12,919 INFO L231 Difference]: Finished difference. Result has 108 places, 90 transitions, 823 flow [2024-06-03 22:33:12,920 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=764, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=823, PETRI_PLACES=108, PETRI_TRANSITIONS=90} [2024-06-03 22:33:12,920 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 79 predicate places. [2024-06-03 22:33:12,920 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 90 transitions, 823 flow [2024-06-03 22:33:12,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:33:12,920 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:33:12,920 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:33:12,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-03 22:33:12,921 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:33:12,921 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:33:12,921 INFO L85 PathProgramCache]: Analyzing trace with hash 318593830, now seen corresponding path program 4 times [2024-06-03 22:33:12,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:33:12,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750803690] [2024-06-03 22:33:12,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:33:12,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:33:12,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:33:17,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:33:17,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:33:17,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750803690] [2024-06-03 22:33:17,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750803690] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:33:17,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:33:17,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:33:17,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022466282] [2024-06-03 22:33:17,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:33:17,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:33:17,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:33:17,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:33:17,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:33:17,178 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:33:17,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 90 transitions, 823 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:33:17,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:33:17,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:33:17,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:33:17,485 INFO L124 PetriNetUnfolderBase]: 237/427 cut-off events. [2024-06-03 22:33:17,486 INFO L125 PetriNetUnfolderBase]: For 6840/6840 co-relation queries the response was YES. [2024-06-03 22:33:17,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2353 conditions, 427 events. 237/427 cut-off events. For 6840/6840 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1656 event pairs, 24 based on Foata normal form. 2/428 useless extension candidates. Maximal degree in co-relation 2303. Up to 344 conditions per place. [2024-06-03 22:33:17,489 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 82 selfloop transitions, 24 changer transitions 0/108 dead transitions. [2024-06-03 22:33:17,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 108 transitions, 1079 flow [2024-06-03 22:33:17,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:33:17,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:33:17,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 91 transitions. [2024-06-03 22:33:17,490 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37916666666666665 [2024-06-03 22:33:17,490 INFO L175 Difference]: Start difference. First operand has 108 places, 90 transitions, 823 flow. Second operand 8 states and 91 transitions. [2024-06-03 22:33:17,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 108 transitions, 1079 flow [2024-06-03 22:33:17,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 108 transitions, 1027 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-03 22:33:17,501 INFO L231 Difference]: Finished difference. Result has 108 places, 90 transitions, 826 flow [2024-06-03 22:33:17,502 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=771, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=826, PETRI_PLACES=108, PETRI_TRANSITIONS=90} [2024-06-03 22:33:17,502 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 79 predicate places. [2024-06-03 22:33:17,502 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 90 transitions, 826 flow [2024-06-03 22:33:17,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:33:17,502 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:33:17,503 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:33:17,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-03 22:33:17,503 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:33:17,503 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:33:17,503 INFO L85 PathProgramCache]: Analyzing trace with hash 97821494, now seen corresponding path program 2 times [2024-06-03 22:33:17,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:33:17,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700578781] [2024-06-03 22:33:17,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:33:17,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:33:17,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:33:21,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:33:21,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:33:21,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700578781] [2024-06-03 22:33:21,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700578781] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:33:21,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:33:21,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:33:21,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282351289] [2024-06-03 22:33:21,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:33:21,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:33:21,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:33:21,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:33:21,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:33:21,133 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:33:21,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 90 transitions, 826 flow. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:33:21,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:33:21,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:33:21,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:33:21,517 INFO L124 PetriNetUnfolderBase]: 239/431 cut-off events. [2024-06-03 22:33:21,517 INFO L125 PetriNetUnfolderBase]: For 7330/7330 co-relation queries the response was YES. [2024-06-03 22:33:21,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2346 conditions, 431 events. 239/431 cut-off events. For 7330/7330 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1687 event pairs, 26 based on Foata normal form. 4/434 useless extension candidates. Maximal degree in co-relation 2295. Up to 295 conditions per place. [2024-06-03 22:33:21,521 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 71 selfloop transitions, 41 changer transitions 0/114 dead transitions. [2024-06-03 22:33:21,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 114 transitions, 1134 flow [2024-06-03 22:33:21,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:33:21,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:33:21,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 107 transitions. [2024-06-03 22:33:21,522 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3962962962962963 [2024-06-03 22:33:21,522 INFO L175 Difference]: Start difference. First operand has 108 places, 90 transitions, 826 flow. Second operand 9 states and 107 transitions. [2024-06-03 22:33:21,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 114 transitions, 1134 flow [2024-06-03 22:33:21,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 114 transitions, 1070 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-03 22:33:21,538 INFO L231 Difference]: Finished difference. Result has 109 places, 92 transitions, 891 flow [2024-06-03 22:33:21,539 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=762, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=891, PETRI_PLACES=109, PETRI_TRANSITIONS=92} [2024-06-03 22:33:21,545 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 80 predicate places. [2024-06-03 22:33:21,545 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 92 transitions, 891 flow [2024-06-03 22:33:21,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:33:21,545 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:33:21,545 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:33:21,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-03 22:33:21,546 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:33:21,546 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:33:21,546 INFO L85 PathProgramCache]: Analyzing trace with hash 98001418, now seen corresponding path program 1 times [2024-06-03 22:33:21,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:33:21,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533834883] [2024-06-03 22:33:21,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:33:21,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:33:21,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:33:25,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:33:25,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:33:25,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533834883] [2024-06-03 22:33:25,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533834883] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:33:25,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:33:25,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:33:25,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587056441] [2024-06-03 22:33:25,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:33:25,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:33:25,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:33:25,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:33:25,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:33:25,896 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:33:25,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 92 transitions, 891 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:33:25,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:33:25,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:33:25,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:33:26,154 INFO L124 PetriNetUnfolderBase]: 243/439 cut-off events. [2024-06-03 22:33:26,154 INFO L125 PetriNetUnfolderBase]: For 6880/6880 co-relation queries the response was YES. [2024-06-03 22:33:26,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2432 conditions, 439 events. 243/439 cut-off events. For 6880/6880 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1735 event pairs, 30 based on Foata normal form. 2/440 useless extension candidates. Maximal degree in co-relation 2381. Up to 377 conditions per place. [2024-06-03 22:33:26,162 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 84 selfloop transitions, 22 changer transitions 0/108 dead transitions. [2024-06-03 22:33:26,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 108 transitions, 1147 flow [2024-06-03 22:33:26,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:33:26,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:33:26,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2024-06-03 22:33:26,163 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34814814814814815 [2024-06-03 22:33:26,163 INFO L175 Difference]: Start difference. First operand has 109 places, 92 transitions, 891 flow. Second operand 9 states and 94 transitions. [2024-06-03 22:33:26,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 108 transitions, 1147 flow [2024-06-03 22:33:26,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 108 transitions, 1080 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-03 22:33:26,196 INFO L231 Difference]: Finished difference. Result has 110 places, 93 transitions, 881 flow [2024-06-03 22:33:26,196 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=824, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=881, PETRI_PLACES=110, PETRI_TRANSITIONS=93} [2024-06-03 22:33:26,198 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 81 predicate places. [2024-06-03 22:33:26,198 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 93 transitions, 881 flow [2024-06-03 22:33:26,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:33:26,198 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:33:26,198 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:33:26,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-03 22:33:26,199 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:33:26,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:33:26,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1658705178, now seen corresponding path program 3 times [2024-06-03 22:33:26,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:33:26,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534367753] [2024-06-03 22:33:26,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:33:26,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:33:26,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:33:29,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:33:29,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:33:29,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534367753] [2024-06-03 22:33:29,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534367753] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:33:29,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:33:29,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:33:29,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239462959] [2024-06-03 22:33:29,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:33:29,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:33:29,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:33:29,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:33:29,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:33:29,849 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:33:29,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 93 transitions, 881 flow. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:33:29,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:33:29,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:33:29,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:33:30,163 INFO L124 PetriNetUnfolderBase]: 240/435 cut-off events. [2024-06-03 22:33:30,163 INFO L125 PetriNetUnfolderBase]: For 5857/5857 co-relation queries the response was YES. [2024-06-03 22:33:30,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2329 conditions, 435 events. 240/435 cut-off events. For 5857/5857 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1717 event pairs, 30 based on Foata normal form. 2/436 useless extension candidates. Maximal degree in co-relation 2279. Up to 317 conditions per place. [2024-06-03 22:33:30,167 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 76 selfloop transitions, 36 changer transitions 0/114 dead transitions. [2024-06-03 22:33:30,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 114 transitions, 1209 flow [2024-06-03 22:33:30,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:33:30,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:33:30,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 99 transitions. [2024-06-03 22:33:30,168 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4125 [2024-06-03 22:33:30,168 INFO L175 Difference]: Start difference. First operand has 110 places, 93 transitions, 881 flow. Second operand 8 states and 99 transitions. [2024-06-03 22:33:30,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 114 transitions, 1209 flow [2024-06-03 22:33:30,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 114 transitions, 1164 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-06-03 22:33:30,183 INFO L231 Difference]: Finished difference. Result has 111 places, 93 transitions, 924 flow [2024-06-03 22:33:30,183 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=836, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=924, PETRI_PLACES=111, PETRI_TRANSITIONS=93} [2024-06-03 22:33:30,184 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 82 predicate places. [2024-06-03 22:33:30,184 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 93 transitions, 924 flow [2024-06-03 22:33:30,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:33:30,184 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:33:30,184 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:33:30,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-03 22:33:30,184 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:33:30,185 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:33:30,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1658698234, now seen corresponding path program 2 times [2024-06-03 22:33:30,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:33:30,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943406650] [2024-06-03 22:33:30,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:33:30,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:33:30,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:33:33,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:33:33,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:33:33,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943406650] [2024-06-03 22:33:33,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943406650] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:33:33,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:33:33,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:33:33,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400133585] [2024-06-03 22:33:33,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:33:33,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:33:33,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:33:33,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:33:33,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:33:33,928 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:33:33,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 93 transitions, 924 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:33:33,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:33:33,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:33:33,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:33:34,130 INFO L124 PetriNetUnfolderBase]: 244/443 cut-off events. [2024-06-03 22:33:34,131 INFO L125 PetriNetUnfolderBase]: For 6343/6343 co-relation queries the response was YES. [2024-06-03 22:33:34,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2438 conditions, 443 events. 244/443 cut-off events. For 6343/6343 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1762 event pairs, 38 based on Foata normal form. 2/444 useless extension candidates. Maximal degree in co-relation 2387. Up to 413 conditions per place. [2024-06-03 22:33:34,136 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 90 selfloop transitions, 12 changer transitions 0/104 dead transitions. [2024-06-03 22:33:34,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 104 transitions, 1160 flow [2024-06-03 22:33:34,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:33:34,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:33:34,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 80 transitions. [2024-06-03 22:33:34,138 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2024-06-03 22:33:34,138 INFO L175 Difference]: Start difference. First operand has 111 places, 93 transitions, 924 flow. Second operand 8 states and 80 transitions. [2024-06-03 22:33:34,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 104 transitions, 1160 flow [2024-06-03 22:33:34,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 104 transitions, 1077 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-06-03 22:33:34,151 INFO L231 Difference]: Finished difference. Result has 113 places, 94 transitions, 879 flow [2024-06-03 22:33:34,152 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=841, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=879, PETRI_PLACES=113, PETRI_TRANSITIONS=94} [2024-06-03 22:33:34,152 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 84 predicate places. [2024-06-03 22:33:34,152 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 94 transitions, 879 flow [2024-06-03 22:33:34,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:33:34,152 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:33:34,153 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:33:34,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-03 22:33:34,153 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:33:34,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:33:34,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1650127354, now seen corresponding path program 3 times [2024-06-03 22:33:34,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:33:34,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078774993] [2024-06-03 22:33:34,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:33:34,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:33:34,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:33:37,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:33:37,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:33:37,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078774993] [2024-06-03 22:33:37,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078774993] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:33:37,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:33:37,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:33:37,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023542643] [2024-06-03 22:33:37,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:33:37,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:33:37,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:33:37,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:33:37,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:33:37,684 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:33:37,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 94 transitions, 879 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:33:37,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:33:37,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:33:37,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:33:37,891 INFO L124 PetriNetUnfolderBase]: 248/451 cut-off events. [2024-06-03 22:33:37,891 INFO L125 PetriNetUnfolderBase]: For 6647/6647 co-relation queries the response was YES. [2024-06-03 22:33:37,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2412 conditions, 451 events. 248/451 cut-off events. For 6647/6647 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1810 event pairs, 36 based on Foata normal form. 2/452 useless extension candidates. Maximal degree in co-relation 2360. Up to 419 conditions per place. [2024-06-03 22:33:37,896 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 92 selfloop transitions, 10 changer transitions 0/104 dead transitions. [2024-06-03 22:33:37,896 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 104 transitions, 1113 flow [2024-06-03 22:33:37,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:33:37,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:33:37,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 71 transitions. [2024-06-03 22:33:37,897 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3380952380952381 [2024-06-03 22:33:37,897 INFO L175 Difference]: Start difference. First operand has 113 places, 94 transitions, 879 flow. Second operand 7 states and 71 transitions. [2024-06-03 22:33:37,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 104 transitions, 1113 flow [2024-06-03 22:33:37,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 104 transitions, 1085 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-03 22:33:37,911 INFO L231 Difference]: Finished difference. Result has 114 places, 95 transitions, 887 flow [2024-06-03 22:33:37,911 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=851, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=887, PETRI_PLACES=114, PETRI_TRANSITIONS=95} [2024-06-03 22:33:37,912 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 85 predicate places. [2024-06-03 22:33:37,912 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 95 transitions, 887 flow [2024-06-03 22:33:37,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:33:37,913 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:33:37,913 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:33:37,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-03 22:33:37,913 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:33:37,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:33:37,913 INFO L85 PathProgramCache]: Analyzing trace with hash 2140269182, now seen corresponding path program 4 times [2024-06-03 22:33:37,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:33:37,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193494861] [2024-06-03 22:33:37,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:33:37,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:33:37,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:33:41,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:33:41,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:33:41,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193494861] [2024-06-03 22:33:41,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193494861] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:33:41,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:33:41,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:33:41,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492641261] [2024-06-03 22:33:41,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:33:41,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:33:41,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:33:41,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:33:41,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:33:41,504 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:33:41,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 95 transitions, 887 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:33:41,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:33:41,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:33:41,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:33:41,724 INFO L124 PetriNetUnfolderBase]: 245/446 cut-off events. [2024-06-03 22:33:41,724 INFO L125 PetriNetUnfolderBase]: For 6404/6404 co-relation queries the response was YES. [2024-06-03 22:33:41,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2350 conditions, 446 events. 245/446 cut-off events. For 6404/6404 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1792 event pairs, 35 based on Foata normal form. 2/447 useless extension candidates. Maximal degree in co-relation 2297. Up to 407 conditions per place. [2024-06-03 22:33:41,727 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 88 selfloop transitions, 14 changer transitions 0/104 dead transitions. [2024-06-03 22:33:41,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 104 transitions, 1113 flow [2024-06-03 22:33:41,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:33:41,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:33:41,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2024-06-03 22:33:41,728 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3476190476190476 [2024-06-03 22:33:41,728 INFO L175 Difference]: Start difference. First operand has 114 places, 95 transitions, 887 flow. Second operand 7 states and 73 transitions. [2024-06-03 22:33:41,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 104 transitions, 1113 flow [2024-06-03 22:33:41,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 104 transitions, 1087 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-03 22:33:41,743 INFO L231 Difference]: Finished difference. Result has 116 places, 95 transitions, 895 flow [2024-06-03 22:33:41,743 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=861, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=895, PETRI_PLACES=116, PETRI_TRANSITIONS=95} [2024-06-03 22:33:41,743 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 87 predicate places. [2024-06-03 22:33:41,743 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 95 transitions, 895 flow [2024-06-03 22:33:41,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:33:41,744 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:33:41,744 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:33:41,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-03 22:33:41,744 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:33:41,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:33:41,745 INFO L85 PathProgramCache]: Analyzing trace with hash 2140268934, now seen corresponding path program 1 times [2024-06-03 22:33:41,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:33:41,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883630703] [2024-06-03 22:33:41,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:33:41,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:33:41,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:33:45,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:33:45,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:33:45,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883630703] [2024-06-03 22:33:45,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883630703] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:33:45,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:33:45,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:33:45,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19516364] [2024-06-03 22:33:45,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:33:45,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:33:45,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:33:45,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:33:45,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:33:45,390 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:33:45,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 95 transitions, 895 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:33:45,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:33:45,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:33:45,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:33:45,647 INFO L124 PetriNetUnfolderBase]: 242/441 cut-off events. [2024-06-03 22:33:45,647 INFO L125 PetriNetUnfolderBase]: For 6033/6033 co-relation queries the response was YES. [2024-06-03 22:33:45,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2312 conditions, 441 events. 242/441 cut-off events. For 6033/6033 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 1761 event pairs, 35 based on Foata normal form. 1/441 useless extension candidates. Maximal degree in co-relation 2258. Up to 403 conditions per place. [2024-06-03 22:33:45,650 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 86 selfloop transitions, 16 changer transitions 0/104 dead transitions. [2024-06-03 22:33:45,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 104 transitions, 1123 flow [2024-06-03 22:33:45,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:33:45,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:33:45,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2024-06-03 22:33:45,651 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3523809523809524 [2024-06-03 22:33:45,651 INFO L175 Difference]: Start difference. First operand has 116 places, 95 transitions, 895 flow. Second operand 7 states and 74 transitions. [2024-06-03 22:33:45,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 104 transitions, 1123 flow [2024-06-03 22:33:45,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 104 transitions, 1069 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-03 22:33:45,665 INFO L231 Difference]: Finished difference. Result has 117 places, 95 transitions, 881 flow [2024-06-03 22:33:45,665 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=841, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=881, PETRI_PLACES=117, PETRI_TRANSITIONS=95} [2024-06-03 22:33:45,665 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 88 predicate places. [2024-06-03 22:33:45,665 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 95 transitions, 881 flow [2024-06-03 22:33:45,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:33:45,665 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:33:45,666 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:33:45,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-03 22:33:45,666 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:33:45,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:33:45,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1918850294, now seen corresponding path program 1 times [2024-06-03 22:33:45,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:33:45,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113838125] [2024-06-03 22:33:45,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:33:45,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:33:45,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:33:49,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:33:49,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:33:49,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113838125] [2024-06-03 22:33:49,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113838125] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:33:49,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:33:49,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:33:49,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775575979] [2024-06-03 22:33:49,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:33:49,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:33:49,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:33:49,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:33:49,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:33:49,563 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:33:49,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 95 transitions, 881 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:33:49,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:33:49,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:33:49,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:33:49,840 INFO L124 PetriNetUnfolderBase]: 302/561 cut-off events. [2024-06-03 22:33:49,840 INFO L125 PetriNetUnfolderBase]: For 13569/13569 co-relation queries the response was YES. [2024-06-03 22:33:49,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3022 conditions, 561 events. 302/561 cut-off events. For 13569/13569 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2446 event pairs, 60 based on Foata normal form. 8/568 useless extension candidates. Maximal degree in co-relation 2967. Up to 229 conditions per place. [2024-06-03 22:33:49,844 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 80 selfloop transitions, 37 changer transitions 13/132 dead transitions. [2024-06-03 22:33:49,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 132 transitions, 1347 flow [2024-06-03 22:33:49,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:33:49,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:33:49,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 124 transitions. [2024-06-03 22:33:49,849 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37575757575757573 [2024-06-03 22:33:49,850 INFO L175 Difference]: Start difference. First operand has 117 places, 95 transitions, 881 flow. Second operand 11 states and 124 transitions. [2024-06-03 22:33:49,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 132 transitions, 1347 flow [2024-06-03 22:33:49,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 132 transitions, 1249 flow, removed 7 selfloop flow, removed 8 redundant places. [2024-06-03 22:33:49,869 INFO L231 Difference]: Finished difference. Result has 121 places, 96 transitions, 910 flow [2024-06-03 22:33:49,869 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=791, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=910, PETRI_PLACES=121, PETRI_TRANSITIONS=96} [2024-06-03 22:33:49,869 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 92 predicate places. [2024-06-03 22:33:49,871 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 96 transitions, 910 flow [2024-06-03 22:33:49,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:33:49,871 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:33:49,871 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:33:49,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-03 22:33:49,872 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:33:49,872 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:33:49,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1920724244, now seen corresponding path program 2 times [2024-06-03 22:33:49,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:33:49,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102578211] [2024-06-03 22:33:49,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:33:49,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:33:49,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:33:54,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:33:54,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:33:54,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102578211] [2024-06-03 22:33:54,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102578211] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:33:54,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:33:54,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:33:54,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707914927] [2024-06-03 22:33:54,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:33:54,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:33:54,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:33:54,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:33:54,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:33:54,412 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:33:54,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 96 transitions, 910 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:33:54,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:33:54,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:33:54,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:33:54,770 INFO L124 PetriNetUnfolderBase]: 322/603 cut-off events. [2024-06-03 22:33:54,771 INFO L125 PetriNetUnfolderBase]: For 19664/19664 co-relation queries the response was YES. [2024-06-03 22:33:54,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3533 conditions, 603 events. 322/603 cut-off events. For 19664/19664 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2736 event pairs, 72 based on Foata normal form. 8/610 useless extension candidates. Maximal degree in co-relation 3477. Up to 341 conditions per place. [2024-06-03 22:33:54,774 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 79 selfloop transitions, 37 changer transitions 9/127 dead transitions. [2024-06-03 22:33:54,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 127 transitions, 1322 flow [2024-06-03 22:33:54,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 22:33:54,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 22:33:54,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 132 transitions. [2024-06-03 22:33:54,775 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2024-06-03 22:33:54,775 INFO L175 Difference]: Start difference. First operand has 121 places, 96 transitions, 910 flow. Second operand 12 states and 132 transitions. [2024-06-03 22:33:54,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 127 transitions, 1322 flow [2024-06-03 22:33:54,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 127 transitions, 1285 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-03 22:33:54,792 INFO L231 Difference]: Finished difference. Result has 121 places, 92 transitions, 922 flow [2024-06-03 22:33:54,793 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=877, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=922, PETRI_PLACES=121, PETRI_TRANSITIONS=92} [2024-06-03 22:33:54,793 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 92 predicate places. [2024-06-03 22:33:54,793 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 92 transitions, 922 flow [2024-06-03 22:33:54,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:33:54,793 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:33:54,793 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:33:54,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-03 22:33:54,794 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:33:54,794 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:33:54,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1920727964, now seen corresponding path program 3 times [2024-06-03 22:33:54,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:33:54,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347547387] [2024-06-03 22:33:54,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:33:54,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:33:54,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:33:58,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:33:58,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:33:58,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347547387] [2024-06-03 22:33:58,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347547387] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:33:58,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:33:58,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:33:58,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179516551] [2024-06-03 22:33:58,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:33:58,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:33:58,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:33:58,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:33:58,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:33:58,891 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:33:58,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 92 transitions, 922 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:33:58,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:33:58,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:33:58,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:33:59,234 INFO L124 PetriNetUnfolderBase]: 311/586 cut-off events. [2024-06-03 22:33:59,235 INFO L125 PetriNetUnfolderBase]: For 19315/19315 co-relation queries the response was YES. [2024-06-03 22:33:59,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3433 conditions, 586 events. 311/586 cut-off events. For 19315/19315 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2652 event pairs, 77 based on Foata normal form. 12/597 useless extension candidates. Maximal degree in co-relation 3378. Up to 410 conditions per place. [2024-06-03 22:33:59,239 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 69 selfloop transitions, 34 changer transitions 14/119 dead transitions. [2024-06-03 22:33:59,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 119 transitions, 1248 flow [2024-06-03 22:33:59,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 22:33:59,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 22:33:59,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 129 transitions. [2024-06-03 22:33:59,243 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35833333333333334 [2024-06-03 22:33:59,243 INFO L175 Difference]: Start difference. First operand has 121 places, 92 transitions, 922 flow. Second operand 12 states and 129 transitions. [2024-06-03 22:33:59,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 119 transitions, 1248 flow [2024-06-03 22:33:59,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 119 transitions, 1167 flow, removed 3 selfloop flow, removed 12 redundant places. [2024-06-03 22:33:59,261 INFO L231 Difference]: Finished difference. Result has 118 places, 86 transitions, 860 flow [2024-06-03 22:33:59,261 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=841, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=860, PETRI_PLACES=118, PETRI_TRANSITIONS=86} [2024-06-03 22:33:59,262 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 89 predicate places. [2024-06-03 22:33:59,262 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 86 transitions, 860 flow [2024-06-03 22:33:59,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:33:59,262 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:33:59,262 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:33:59,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-03 22:33:59,263 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:33:59,263 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:33:59,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1967553144, now seen corresponding path program 4 times [2024-06-03 22:33:59,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:33:59,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746252921] [2024-06-03 22:33:59,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:33:59,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:33:59,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:34:02,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:34:02,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:34:02,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746252921] [2024-06-03 22:34:02,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746252921] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:34:02,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:34:02,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:34:02,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109279504] [2024-06-03 22:34:02,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:34:02,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:34:02,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:34:02,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:34:02,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:34:03,004 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:34:03,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 86 transitions, 860 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 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-03 22:34:03,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:34:03,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:34:03,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:34:03,215 INFO L124 PetriNetUnfolderBase]: 281/531 cut-off events. [2024-06-03 22:34:03,215 INFO L125 PetriNetUnfolderBase]: For 14443/14443 co-relation queries the response was YES. [2024-06-03 22:34:03,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3041 conditions, 531 events. 281/531 cut-off events. For 14443/14443 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2348 event pairs, 50 based on Foata normal form. 10/540 useless extension candidates. Maximal degree in co-relation 2988. Up to 364 conditions per place. [2024-06-03 22:34:03,219 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 60 selfloop transitions, 34 changer transitions 11/107 dead transitions. [2024-06-03 22:34:03,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 107 transitions, 1134 flow [2024-06-03 22:34:03,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:34:03,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:34:03,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 103 transitions. [2024-06-03 22:34:03,220 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3814814814814815 [2024-06-03 22:34:03,220 INFO L175 Difference]: Start difference. First operand has 118 places, 86 transitions, 860 flow. Second operand 9 states and 103 transitions. [2024-06-03 22:34:03,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 107 transitions, 1134 flow [2024-06-03 22:34:03,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 107 transitions, 1034 flow, removed 14 selfloop flow, removed 13 redundant places. [2024-06-03 22:34:03,234 INFO L231 Difference]: Finished difference. Result has 111 places, 83 transitions, 808 flow [2024-06-03 22:34:03,235 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=760, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=808, PETRI_PLACES=111, PETRI_TRANSITIONS=83} [2024-06-03 22:34:03,235 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 82 predicate places. [2024-06-03 22:34:03,235 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 83 transitions, 808 flow [2024-06-03 22:34:03,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 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-03 22:34:03,235 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:34:03,235 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:34:03,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-03 22:34:03,236 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:34:03,236 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:34:03,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1292193040, now seen corresponding path program 1 times [2024-06-03 22:34:03,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:34:03,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227791308] [2024-06-03 22:34:03,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:34:03,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:34:03,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:34:07,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:34:07,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:34:07,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227791308] [2024-06-03 22:34:07,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227791308] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:34:07,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:34:07,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:34:07,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758563062] [2024-06-03 22:34:07,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:34:07,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:34:07,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:34:07,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:34:07,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:34:07,118 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:34:07,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 83 transitions, 808 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 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-03 22:34:07,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:34:07,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:34:07,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:34:07,428 INFO L124 PetriNetUnfolderBase]: 259/489 cut-off events. [2024-06-03 22:34:07,429 INFO L125 PetriNetUnfolderBase]: For 11931/11931 co-relation queries the response was YES. [2024-06-03 22:34:07,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2878 conditions, 489 events. 259/489 cut-off events. For 11931/11931 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2094 event pairs, 50 based on Foata normal form. 2/490 useless extension candidates. Maximal degree in co-relation 2826. Up to 334 conditions per place. [2024-06-03 22:34:07,432 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 54 selfloop transitions, 49 changer transitions 0/105 dead transitions. [2024-06-03 22:34:07,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 105 transitions, 1090 flow [2024-06-03 22:34:07,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 22:34:07,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 22:34:07,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 124 transitions. [2024-06-03 22:34:07,434 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34444444444444444 [2024-06-03 22:34:07,434 INFO L175 Difference]: Start difference. First operand has 111 places, 83 transitions, 808 flow. Second operand 12 states and 124 transitions. [2024-06-03 22:34:07,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 105 transitions, 1090 flow [2024-06-03 22:34:07,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 105 transitions, 1018 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-03 22:34:07,447 INFO L231 Difference]: Finished difference. Result has 112 places, 84 transitions, 861 flow [2024-06-03 22:34:07,447 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=736, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=861, PETRI_PLACES=112, PETRI_TRANSITIONS=84} [2024-06-03 22:34:07,447 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 83 predicate places. [2024-06-03 22:34:07,448 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 84 transitions, 861 flow [2024-06-03 22:34:07,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 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-03 22:34:07,448 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:34:07,448 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:34:07,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-03 22:34:07,448 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:34:07,448 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:34:07,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1286628850, now seen corresponding path program 2 times [2024-06-03 22:34:07,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:34:07,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965638023] [2024-06-03 22:34:07,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:34:07,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:34:07,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:34:11,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:34:11,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:34:11,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965638023] [2024-06-03 22:34:11,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965638023] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:34:11,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:34:11,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:34:11,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107380254] [2024-06-03 22:34:11,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:34:11,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:34:11,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:34:11,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:34:11,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:34:11,245 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:34:11,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 84 transitions, 861 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 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-03 22:34:11,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:34:11,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:34:11,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:34:11,526 INFO L124 PetriNetUnfolderBase]: 272/520 cut-off events. [2024-06-03 22:34:11,526 INFO L125 PetriNetUnfolderBase]: For 13736/13736 co-relation queries the response was YES. [2024-06-03 22:34:11,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2917 conditions, 520 events. 272/520 cut-off events. For 13736/13736 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2307 event pairs, 53 based on Foata normal form. 12/531 useless extension candidates. Maximal degree in co-relation 2866. Up to 317 conditions per place. [2024-06-03 22:34:11,530 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 56 selfloop transitions, 39 changer transitions 10/107 dead transitions. [2024-06-03 22:34:11,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 107 transitions, 1159 flow [2024-06-03 22:34:11,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:34:11,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:34:11,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2024-06-03 22:34:11,531 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37333333333333335 [2024-06-03 22:34:11,531 INFO L175 Difference]: Start difference. First operand has 112 places, 84 transitions, 861 flow. Second operand 10 states and 112 transitions. [2024-06-03 22:34:11,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 107 transitions, 1159 flow [2024-06-03 22:34:11,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 107 transitions, 1046 flow, removed 9 selfloop flow, removed 10 redundant places. [2024-06-03 22:34:11,544 INFO L231 Difference]: Finished difference. Result has 112 places, 79 transitions, 795 flow [2024-06-03 22:34:11,544 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=748, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=795, PETRI_PLACES=112, PETRI_TRANSITIONS=79} [2024-06-03 22:34:11,544 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 83 predicate places. [2024-06-03 22:34:11,544 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 79 transitions, 795 flow [2024-06-03 22:34:11,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 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-03 22:34:11,545 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:34:11,545 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:34:11,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-03 22:34:11,545 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:34:11,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:34:11,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1286622898, now seen corresponding path program 5 times [2024-06-03 22:34:11,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:34:11,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414092199] [2024-06-03 22:34:11,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:34:11,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:34:11,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:34:15,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:34:15,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:34:15,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414092199] [2024-06-03 22:34:15,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414092199] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:34:15,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:34:15,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:34:15,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578763683] [2024-06-03 22:34:15,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:34:15,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:34:15,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:34:15,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:34:15,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:34:15,876 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:34:15,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 79 transitions, 795 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:34:15,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:34:15,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:34:15,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:34:16,320 INFO L124 PetriNetUnfolderBase]: 256/496 cut-off events. [2024-06-03 22:34:16,320 INFO L125 PetriNetUnfolderBase]: For 13787/13787 co-relation queries the response was YES. [2024-06-03 22:34:16,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2770 conditions, 496 events. 256/496 cut-off events. For 13787/13787 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2175 event pairs, 55 based on Foata normal form. 10/505 useless extension candidates. Maximal degree in co-relation 2718. Up to 305 conditions per place. [2024-06-03 22:34:16,323 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 56 selfloop transitions, 33 changer transitions 12/103 dead transitions. [2024-06-03 22:34:16,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 103 transitions, 1069 flow [2024-06-03 22:34:16,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:34:16,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:34:16,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 120 transitions. [2024-06-03 22:34:16,325 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2024-06-03 22:34:16,325 INFO L175 Difference]: Start difference. First operand has 112 places, 79 transitions, 795 flow. Second operand 11 states and 120 transitions. [2024-06-03 22:34:16,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 103 transitions, 1069 flow [2024-06-03 22:34:16,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 103 transitions, 943 flow, removed 10 selfloop flow, removed 10 redundant places. [2024-06-03 22:34:16,340 INFO L231 Difference]: Finished difference. Result has 113 places, 73 transitions, 678 flow [2024-06-03 22:34:16,340 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=669, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=678, PETRI_PLACES=113, PETRI_TRANSITIONS=73} [2024-06-03 22:34:16,341 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 84 predicate places. [2024-06-03 22:34:16,341 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 73 transitions, 678 flow [2024-06-03 22:34:16,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:34:16,341 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:34:16,341 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:34:16,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-03 22:34:16,341 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:34:16,342 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:34:16,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1262648086, now seen corresponding path program 6 times [2024-06-03 22:34:16,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:34:16,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951854748] [2024-06-03 22:34:16,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:34:16,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:34:16,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:34:20,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:34:20,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:34:20,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951854748] [2024-06-03 22:34:20,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951854748] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:34:20,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:34:20,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:34:20,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745598504] [2024-06-03 22:34:20,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:34:20,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:34:20,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:34:20,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:34:20,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:34:20,446 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:34:20,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 73 transitions, 678 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:34:20,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:34:20,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:34:20,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:34:20,730 INFO L124 PetriNetUnfolderBase]: 218/434 cut-off events. [2024-06-03 22:34:20,730 INFO L125 PetriNetUnfolderBase]: For 12349/12349 co-relation queries the response was YES. [2024-06-03 22:34:20,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2351 conditions, 434 events. 218/434 cut-off events. For 12349/12349 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1854 event pairs, 61 based on Foata normal form. 8/441 useless extension candidates. Maximal degree in co-relation 2298. Up to 289 conditions per place. [2024-06-03 22:34:20,745 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 67 selfloop transitions, 15 changer transitions 10/94 dead transitions. [2024-06-03 22:34:20,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 94 transitions, 974 flow [2024-06-03 22:34:20,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:34:20,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:34:20,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2024-06-03 22:34:20,746 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.362962962962963 [2024-06-03 22:34:20,747 INFO L175 Difference]: Start difference. First operand has 113 places, 73 transitions, 678 flow. Second operand 9 states and 98 transitions. [2024-06-03 22:34:20,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 94 transitions, 974 flow [2024-06-03 22:34:20,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 94 transitions, 893 flow, removed 2 selfloop flow, removed 11 redundant places. [2024-06-03 22:34:20,763 INFO L231 Difference]: Finished difference. Result has 110 places, 68 transitions, 577 flow [2024-06-03 22:34:20,763 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=599, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=577, PETRI_PLACES=110, PETRI_TRANSITIONS=68} [2024-06-03 22:34:20,763 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 81 predicate places. [2024-06-03 22:34:20,763 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 68 transitions, 577 flow [2024-06-03 22:34:20,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:34:20,764 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:34:20,764 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:34:20,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-03 22:34:20,764 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:34:20,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:34:20,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1292200480, now seen corresponding path program 3 times [2024-06-03 22:34:20,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:34:20,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231773027] [2024-06-03 22:34:20,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:34:20,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:34:20,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:34:24,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:34:24,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:34:24,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231773027] [2024-06-03 22:34:24,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231773027] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:34:24,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:34:24,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:34:24,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596143555] [2024-06-03 22:34:24,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:34:24,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:34:24,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:34:24,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:34:24,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:34:24,606 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:34:24,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 68 transitions, 577 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 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-03 22:34:24,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:34:24,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:34:24,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:34:24,872 INFO L124 PetriNetUnfolderBase]: 200/396 cut-off events. [2024-06-03 22:34:24,872 INFO L125 PetriNetUnfolderBase]: For 10228/10228 co-relation queries the response was YES. [2024-06-03 22:34:24,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2191 conditions, 396 events. 200/396 cut-off events. For 10228/10228 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1623 event pairs, 41 based on Foata normal form. 2/397 useless extension candidates. Maximal degree in co-relation 2138. Up to 251 conditions per place. [2024-06-03 22:34:24,875 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 50 selfloop transitions, 38 changer transitions 0/90 dead transitions. [2024-06-03 22:34:24,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 90 transitions, 831 flow [2024-06-03 22:34:24,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 22:34:24,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 22:34:24,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 122 transitions. [2024-06-03 22:34:24,876 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3388888888888889 [2024-06-03 22:34:24,876 INFO L175 Difference]: Start difference. First operand has 110 places, 68 transitions, 577 flow. Second operand 12 states and 122 transitions. [2024-06-03 22:34:24,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 90 transitions, 831 flow [2024-06-03 22:34:24,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 90 transitions, 772 flow, removed 9 selfloop flow, removed 10 redundant places. [2024-06-03 22:34:24,890 INFO L231 Difference]: Finished difference. Result has 108 places, 69 transitions, 624 flow [2024-06-03 22:34:24,890 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=624, PETRI_PLACES=108, PETRI_TRANSITIONS=69} [2024-06-03 22:34:24,890 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 79 predicate places. [2024-06-03 22:34:24,890 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 69 transitions, 624 flow [2024-06-03 22:34:24,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 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-03 22:34:24,891 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:34:24,891 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:34:24,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-03 22:34:24,891 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:34:24,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:34:24,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1291985278, now seen corresponding path program 7 times [2024-06-03 22:34:24,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:34:24,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178561863] [2024-06-03 22:34:24,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:34:24,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:34:24,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:34:29,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:34:29,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:34:29,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178561863] [2024-06-03 22:34:29,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178561863] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:34:29,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:34:29,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:34:29,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251884611] [2024-06-03 22:34:29,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:34:29,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:34:29,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:34:29,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:34:29,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:34:29,313 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:34:29,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 69 transitions, 624 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:34:29,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:34:29,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:34:29,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:34:29,687 INFO L124 PetriNetUnfolderBase]: 216/432 cut-off events. [2024-06-03 22:34:29,688 INFO L125 PetriNetUnfolderBase]: For 12304/12304 co-relation queries the response was YES. [2024-06-03 22:34:29,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2296 conditions, 432 events. 216/432 cut-off events. For 12304/12304 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1843 event pairs, 49 based on Foata normal form. 10/441 useless extension candidates. Maximal degree in co-relation 2246. Up to 263 conditions per place. [2024-06-03 22:34:29,696 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 52 selfloop transitions, 29 changer transitions 12/95 dead transitions. [2024-06-03 22:34:29,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 95 transitions, 886 flow [2024-06-03 22:34:29,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-03 22:34:29,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-03 22:34:29,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 131 transitions. [2024-06-03 22:34:29,698 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33589743589743587 [2024-06-03 22:34:29,698 INFO L175 Difference]: Start difference. First operand has 108 places, 69 transitions, 624 flow. Second operand 13 states and 131 transitions. [2024-06-03 22:34:29,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 95 transitions, 886 flow [2024-06-03 22:34:29,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 95 transitions, 790 flow, removed 11 selfloop flow, removed 10 redundant places. [2024-06-03 22:34:29,713 INFO L231 Difference]: Finished difference. Result has 111 places, 63 transitions, 546 flow [2024-06-03 22:34:29,713 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=528, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=546, PETRI_PLACES=111, PETRI_TRANSITIONS=63} [2024-06-03 22:34:29,714 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 82 predicate places. [2024-06-03 22:34:29,714 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 63 transitions, 546 flow [2024-06-03 22:34:29,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:34:29,714 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:34:29,714 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:34:29,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-03 22:34:29,714 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:34:29,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:34:29,715 INFO L85 PathProgramCache]: Analyzing trace with hash 119955562, now seen corresponding path program 4 times [2024-06-03 22:34:29,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:34:29,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817846999] [2024-06-03 22:34:29,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:34:29,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:34:29,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:34:33,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:34:33,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:34:33,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817846999] [2024-06-03 22:34:33,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817846999] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:34:33,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:34:33,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:34:33,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701107940] [2024-06-03 22:34:33,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:34:33,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:34:33,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:34:33,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:34:33,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:34:33,357 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:34:33,357 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 63 transitions, 546 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:34:33,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:34:33,357 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:34:33,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:34:33,688 INFO L124 PetriNetUnfolderBase]: 184/376 cut-off events. [2024-06-03 22:34:33,688 INFO L125 PetriNetUnfolderBase]: For 10190/10190 co-relation queries the response was YES. [2024-06-03 22:34:33,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2097 conditions, 376 events. 184/376 cut-off events. For 10190/10190 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1548 event pairs, 54 based on Foata normal form. 2/377 useless extension candidates. Maximal degree in co-relation 2046. Up to 338 conditions per place. [2024-06-03 22:34:33,691 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 59 selfloop transitions, 14 changer transitions 0/75 dead transitions. [2024-06-03 22:34:33,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 75 transitions, 746 flow [2024-06-03 22:34:33,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:34:33,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:34:33,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 82 transitions. [2024-06-03 22:34:33,692 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3416666666666667 [2024-06-03 22:34:33,692 INFO L175 Difference]: Start difference. First operand has 111 places, 63 transitions, 546 flow. Second operand 8 states and 82 transitions. [2024-06-03 22:34:33,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 75 transitions, 746 flow [2024-06-03 22:34:33,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 75 transitions, 675 flow, removed 4 selfloop flow, removed 14 redundant places. [2024-06-03 22:34:33,706 INFO L231 Difference]: Finished difference. Result has 103 places, 64 transitions, 535 flow [2024-06-03 22:34:33,706 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=535, PETRI_PLACES=103, PETRI_TRANSITIONS=64} [2024-06-03 22:34:33,706 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 74 predicate places. [2024-06-03 22:34:33,706 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 64 transitions, 535 flow [2024-06-03 22:34:33,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:34:33,707 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:34:33,707 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:34:33,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-03 22:34:33,707 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:34:33,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:34:33,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1924095376, now seen corresponding path program 5 times [2024-06-03 22:34:33,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:34:33,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224072841] [2024-06-03 22:34:33,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:34:33,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:34:33,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:34:37,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:34:37,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:34:37,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224072841] [2024-06-03 22:34:37,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224072841] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:34:37,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:34:37,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:34:37,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444861168] [2024-06-03 22:34:37,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:34:37,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:34:37,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:34:37,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:34:37,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:34:37,458 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:34:37,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 64 transitions, 535 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:34:37,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:34:37,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:34:37,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:34:37,696 INFO L124 PetriNetUnfolderBase]: 188/384 cut-off events. [2024-06-03 22:34:37,697 INFO L125 PetriNetUnfolderBase]: For 9931/9931 co-relation queries the response was YES. [2024-06-03 22:34:37,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2103 conditions, 384 events. 188/384 cut-off events. For 9931/9931 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1581 event pairs, 53 based on Foata normal form. 2/385 useless extension candidates. Maximal degree in co-relation 2053. Up to 344 conditions per place. [2024-06-03 22:34:37,699 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 63 selfloop transitions, 11 changer transitions 0/76 dead transitions. [2024-06-03 22:34:37,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 76 transitions, 735 flow [2024-06-03 22:34:37,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:34:37,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:34:37,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2024-06-03 22:34:37,700 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32916666666666666 [2024-06-03 22:34:37,701 INFO L175 Difference]: Start difference. First operand has 103 places, 64 transitions, 535 flow. Second operand 8 states and 79 transitions. [2024-06-03 22:34:37,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 76 transitions, 735 flow [2024-06-03 22:34:37,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 76 transitions, 685 flow, removed 12 selfloop flow, removed 6 redundant places. [2024-06-03 22:34:37,717 INFO L231 Difference]: Finished difference. Result has 105 places, 65 transitions, 541 flow [2024-06-03 22:34:37,717 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=485, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=541, PETRI_PLACES=105, PETRI_TRANSITIONS=65} [2024-06-03 22:34:37,718 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 76 predicate places. [2024-06-03 22:34:37,718 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 65 transitions, 541 flow [2024-06-03 22:34:37,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:34:37,718 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:34:37,718 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:34:37,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-03 22:34:37,719 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:34:37,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:34:37,719 INFO L85 PathProgramCache]: Analyzing trace with hash 376463512, now seen corresponding path program 6 times [2024-06-03 22:34:37,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:34:37,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524055802] [2024-06-03 22:34:37,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:34:37,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:34:37,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:34:41,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:34:41,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:34:41,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524055802] [2024-06-03 22:34:41,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524055802] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:34:41,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:34:41,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:34:41,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240171489] [2024-06-03 22:34:41,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:34:41,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:34:41,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:34:41,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:34:41,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:34:41,343 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:34:41,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 65 transitions, 541 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:34:41,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:34:41,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:34:41,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:34:41,625 INFO L124 PetriNetUnfolderBase]: 192/392 cut-off events. [2024-06-03 22:34:41,626 INFO L125 PetriNetUnfolderBase]: For 10748/10748 co-relation queries the response was YES. [2024-06-03 22:34:41,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2158 conditions, 392 events. 192/392 cut-off events. For 10748/10748 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1643 event pairs, 55 based on Foata normal form. 2/393 useless extension candidates. Maximal degree in co-relation 2107. Up to 315 conditions per place. [2024-06-03 22:34:41,628 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 57 selfloop transitions, 19 changer transitions 0/78 dead transitions. [2024-06-03 22:34:41,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 78 transitions, 805 flow [2024-06-03 22:34:41,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:34:41,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:34:41,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 84 transitions. [2024-06-03 22:34:41,631 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35 [2024-06-03 22:34:41,631 INFO L175 Difference]: Start difference. First operand has 105 places, 65 transitions, 541 flow. Second operand 8 states and 84 transitions. [2024-06-03 22:34:41,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 78 transitions, 805 flow [2024-06-03 22:34:41,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 78 transitions, 759 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-03 22:34:41,646 INFO L231 Difference]: Finished difference. Result has 107 places, 66 transitions, 568 flow [2024-06-03 22:34:41,646 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=495, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=568, PETRI_PLACES=107, PETRI_TRANSITIONS=66} [2024-06-03 22:34:41,646 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 78 predicate places. [2024-06-03 22:34:41,647 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 66 transitions, 568 flow [2024-06-03 22:34:41,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:34:41,648 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:34:41,648 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:34:41,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-03 22:34:41,651 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:34:41,651 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:34:41,651 INFO L85 PathProgramCache]: Analyzing trace with hash 376456072, now seen corresponding path program 7 times [2024-06-03 22:34:41,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:34:41,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711009236] [2024-06-03 22:34:41,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:34:41,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:34:41,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:34:45,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:34:45,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:34:45,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711009236] [2024-06-03 22:34:45,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711009236] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:34:45,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:34:45,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:34:45,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566638944] [2024-06-03 22:34:45,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:34:45,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:34:45,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:34:45,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:34:45,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:34:45,271 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:34:45,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 66 transitions, 568 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:34:45,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:34:45,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:34:45,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:34:45,524 INFO L124 PetriNetUnfolderBase]: 189/387 cut-off events. [2024-06-03 22:34:45,525 INFO L125 PetriNetUnfolderBase]: For 10442/10442 co-relation queries the response was YES. [2024-06-03 22:34:45,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2067 conditions, 387 events. 189/387 cut-off events. For 10442/10442 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1629 event pairs, 60 based on Foata normal form. 2/388 useless extension candidates. Maximal degree in co-relation 2015. Up to 337 conditions per place. [2024-06-03 22:34:45,527 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 57 selfloop transitions, 18 changer transitions 0/77 dead transitions. [2024-06-03 22:34:45,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 77 transitions, 746 flow [2024-06-03 22:34:45,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:34:45,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:34:45,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 82 transitions. [2024-06-03 22:34:45,528 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3416666666666667 [2024-06-03 22:34:45,529 INFO L175 Difference]: Start difference. First operand has 107 places, 66 transitions, 568 flow. Second operand 8 states and 82 transitions. [2024-06-03 22:34:45,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 77 transitions, 746 flow [2024-06-03 22:34:45,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 77 transitions, 629 flow, removed 27 selfloop flow, removed 8 redundant places. [2024-06-03 22:34:45,545 INFO L231 Difference]: Finished difference. Result has 107 places, 66 transitions, 493 flow [2024-06-03 22:34:45,545 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=451, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=493, PETRI_PLACES=107, PETRI_TRANSITIONS=66} [2024-06-03 22:34:45,546 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 78 predicate places. [2024-06-03 22:34:45,546 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 66 transitions, 493 flow [2024-06-03 22:34:45,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:34:45,546 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:34:45,546 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:34:45,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-03 22:34:45,546 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:34:45,547 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:34:45,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1916470864, now seen corresponding path program 8 times [2024-06-03 22:34:45,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:34:45,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838579691] [2024-06-03 22:34:45,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:34:45,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:34:45,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:34:49,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:34:49,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:34:49,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838579691] [2024-06-03 22:34:49,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838579691] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:34:49,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:34:49,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:34:49,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484840109] [2024-06-03 22:34:49,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:34:49,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:34:49,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:34:49,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:34:49,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:34:49,535 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:34:49,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 66 transitions, 493 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:34:49,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:34:49,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:34:49,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:34:49,866 INFO L124 PetriNetUnfolderBase]: 201/415 cut-off events. [2024-06-03 22:34:49,867 INFO L125 PetriNetUnfolderBase]: For 12893/12893 co-relation queries the response was YES. [2024-06-03 22:34:49,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1954 conditions, 415 events. 201/415 cut-off events. For 12893/12893 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1801 event pairs, 57 based on Foata normal form. 10/424 useless extension candidates. Maximal degree in co-relation 1904. Up to 327 conditions per place. [2024-06-03 22:34:49,869 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 62 selfloop transitions, 13 changer transitions 9/86 dead transitions. [2024-06-03 22:34:49,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 86 transitions, 725 flow [2024-06-03 22:34:49,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:34:49,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:34:49,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 102 transitions. [2024-06-03 22:34:49,871 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34 [2024-06-03 22:34:49,871 INFO L175 Difference]: Start difference. First operand has 107 places, 66 transitions, 493 flow. Second operand 10 states and 102 transitions. [2024-06-03 22:34:49,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 86 transitions, 725 flow [2024-06-03 22:34:49,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 86 transitions, 656 flow, removed 3 selfloop flow, removed 9 redundant places. [2024-06-03 22:34:49,885 INFO L231 Difference]: Finished difference. Result has 109 places, 65 transitions, 451 flow [2024-06-03 22:34:49,886 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=451, PETRI_PLACES=109, PETRI_TRANSITIONS=65} [2024-06-03 22:34:49,886 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 80 predicate places. [2024-06-03 22:34:49,886 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 65 transitions, 451 flow [2024-06-03 22:34:49,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:34:49,886 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:34:49,886 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:34:49,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-03 22:34:49,887 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:34:49,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:34:49,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1279124911, now seen corresponding path program 1 times [2024-06-03 22:34:49,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:34:49,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121789068] [2024-06-03 22:34:49,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:34:49,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:34:49,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:34:54,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:34:54,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:34:54,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121789068] [2024-06-03 22:34:54,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121789068] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:34:54,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:34:54,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:34:54,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454932735] [2024-06-03 22:34:54,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:34:54,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:34:54,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:34:54,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:34:54,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:34:54,596 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:34:54,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 65 transitions, 451 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:34:54,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:34:54,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:34:54,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:34:54,851 INFO L124 PetriNetUnfolderBase]: 168/352 cut-off events. [2024-06-03 22:34:54,852 INFO L125 PetriNetUnfolderBase]: For 7501/7501 co-relation queries the response was YES. [2024-06-03 22:34:54,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1526 conditions, 352 events. 168/352 cut-off events. For 7501/7501 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1442 event pairs, 35 based on Foata normal form. 6/357 useless extension candidates. Maximal degree in co-relation 1475. Up to 205 conditions per place. [2024-06-03 22:34:54,854 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 41 selfloop transitions, 25 changer transitions 17/85 dead transitions. [2024-06-03 22:34:54,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 85 transitions, 669 flow [2024-06-03 22:34:54,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:34:54,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:34:54,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 110 transitions. [2024-06-03 22:34:54,855 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2024-06-03 22:34:54,855 INFO L175 Difference]: Start difference. First operand has 109 places, 65 transitions, 451 flow. Second operand 11 states and 110 transitions. [2024-06-03 22:34:54,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 85 transitions, 669 flow [2024-06-03 22:34:54,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 85 transitions, 635 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-03 22:34:54,868 INFO L231 Difference]: Finished difference. Result has 109 places, 60 transitions, 436 flow [2024-06-03 22:34:54,868 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=417, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=436, PETRI_PLACES=109, PETRI_TRANSITIONS=60} [2024-06-03 22:34:54,868 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 80 predicate places. [2024-06-03 22:34:54,869 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 60 transitions, 436 flow [2024-06-03 22:34:54,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:34:54,869 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:34:54,869 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:34:54,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-03 22:34:54,869 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:34:54,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:34:54,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1230789421, now seen corresponding path program 2 times [2024-06-03 22:34:54,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:34:54,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973552811] [2024-06-03 22:34:54,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:34:54,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:34:54,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:34:58,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:34:58,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:34:58,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973552811] [2024-06-03 22:34:58,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973552811] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:34:58,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:34:58,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:34:58,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5440370] [2024-06-03 22:34:58,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:34:58,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:34:58,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:34:58,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:34:58,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:34:59,058 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:34:59,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 60 transitions, 436 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:34:59,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:34:59,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:34:59,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:34:59,322 INFO L124 PetriNetUnfolderBase]: 148/311 cut-off events. [2024-06-03 22:34:59,323 INFO L125 PetriNetUnfolderBase]: For 7547/7547 co-relation queries the response was YES. [2024-06-03 22:34:59,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1254 conditions, 311 events. 148/311 cut-off events. For 7547/7547 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1250 event pairs, 23 based on Foata normal form. 12/322 useless extension candidates. Maximal degree in co-relation 1204. Up to 159 conditions per place. [2024-06-03 22:34:59,324 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 41 selfloop transitions, 14 changer transitions 20/77 dead transitions. [2024-06-03 22:34:59,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 77 transitions, 632 flow [2024-06-03 22:34:59,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:34:59,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:34:59,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 100 transitions. [2024-06-03 22:34:59,331 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2024-06-03 22:34:59,331 INFO L175 Difference]: Start difference. First operand has 109 places, 60 transitions, 436 flow. Second operand 10 states and 100 transitions. [2024-06-03 22:34:59,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 77 transitions, 632 flow [2024-06-03 22:34:59,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 77 transitions, 574 flow, removed 4 selfloop flow, removed 10 redundant places. [2024-06-03 22:34:59,338 INFO L231 Difference]: Finished difference. Result has 100 places, 48 transitions, 334 flow [2024-06-03 22:34:59,338 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=334, PETRI_PLACES=100, PETRI_TRANSITIONS=48} [2024-06-03 22:34:59,338 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2024-06-03 22:34:59,338 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 48 transitions, 334 flow [2024-06-03 22:34:59,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:34:59,339 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:34:59,339 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:34:59,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-03 22:34:59,339 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:34:59,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:34:59,339 INFO L85 PathProgramCache]: Analyzing trace with hash -309895255, now seen corresponding path program 3 times [2024-06-03 22:34:59,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:34:59,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777743985] [2024-06-03 22:34:59,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:34:59,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:34:59,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:35:03,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:35:03,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:35:03,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777743985] [2024-06-03 22:35:03,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777743985] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:35:03,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:35:03,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:35:03,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613482344] [2024-06-03 22:35:03,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:35:03,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:35:03,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:35:03,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:35:03,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:35:03,459 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:35:03,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 48 transitions, 334 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:35:03,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:35:03,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:35:03,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:35:03,680 INFO L124 PetriNetUnfolderBase]: 118/249 cut-off events. [2024-06-03 22:35:03,680 INFO L125 PetriNetUnfolderBase]: For 4244/4244 co-relation queries the response was YES. [2024-06-03 22:35:03,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1005 conditions, 249 events. 118/249 cut-off events. For 4244/4244 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 911 event pairs, 25 based on Foata normal form. 6/254 useless extension candidates. Maximal degree in co-relation 958. Up to 157 conditions per place. [2024-06-03 22:35:03,681 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 34 selfloop transitions, 11 changer transitions 20/67 dead transitions. [2024-06-03 22:35:03,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 67 transitions, 515 flow [2024-06-03 22:35:03,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:35:03,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:35:03,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 98 transitions. [2024-06-03 22:35:03,682 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32666666666666666 [2024-06-03 22:35:03,682 INFO L175 Difference]: Start difference. First operand has 100 places, 48 transitions, 334 flow. Second operand 10 states and 98 transitions. [2024-06-03 22:35:03,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 67 transitions, 515 flow [2024-06-03 22:35:03,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 67 transitions, 455 flow, removed 8 selfloop flow, removed 17 redundant places. [2024-06-03 22:35:03,686 INFO L231 Difference]: Finished difference. Result has 82 places, 44 transitions, 278 flow [2024-06-03 22:35:03,686 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=278, PETRI_PLACES=82, PETRI_TRANSITIONS=44} [2024-06-03 22:35:03,687 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 53 predicate places. [2024-06-03 22:35:03,687 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 44 transitions, 278 flow [2024-06-03 22:35:03,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:35:03,687 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:35:03,688 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:35:03,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-03 22:35:03,688 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:35:03,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:35:03,688 INFO L85 PathProgramCache]: Analyzing trace with hash -929432411, now seen corresponding path program 4 times [2024-06-03 22:35:03,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:35:03,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477832033] [2024-06-03 22:35:03,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:35:03,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:35:03,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:35:07,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:35:07,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:35:07,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477832033] [2024-06-03 22:35:07,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477832033] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:35:07,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:35:07,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:35:07,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517073100] [2024-06-03 22:35:07,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:35:07,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:35:07,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:35:07,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:35:07,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:35:07,590 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:35:07,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 44 transitions, 278 flow. Second operand has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:35:07,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:35:07,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:35:07,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:35:07,801 INFO L124 PetriNetUnfolderBase]: 101/213 cut-off events. [2024-06-03 22:35:07,801 INFO L125 PetriNetUnfolderBase]: For 2155/2155 co-relation queries the response was YES. [2024-06-03 22:35:07,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 819 conditions, 213 events. 101/213 cut-off events. For 2155/2155 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 725 event pairs, 21 based on Foata normal form. 6/218 useless extension candidates. Maximal degree in co-relation 778. Up to 149 conditions per place. [2024-06-03 22:35:07,802 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 34 selfloop transitions, 6 changer transitions 14/56 dead transitions. [2024-06-03 22:35:07,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 56 transitions, 414 flow [2024-06-03 22:35:07,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:35:07,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:35:07,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 84 transitions. [2024-06-03 22:35:07,803 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3111111111111111 [2024-06-03 22:35:07,803 INFO L175 Difference]: Start difference. First operand has 82 places, 44 transitions, 278 flow. Second operand 9 states and 84 transitions. [2024-06-03 22:35:07,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 56 transitions, 414 flow [2024-06-03 22:35:07,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 56 transitions, 381 flow, removed 3 selfloop flow, removed 9 redundant places. [2024-06-03 22:35:07,807 INFO L231 Difference]: Finished difference. Result has 74 places, 40 transitions, 240 flow [2024-06-03 22:35:07,807 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=240, PETRI_PLACES=74, PETRI_TRANSITIONS=40} [2024-06-03 22:35:07,808 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 45 predicate places. [2024-06-03 22:35:07,808 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 40 transitions, 240 flow [2024-06-03 22:35:07,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:35:07,808 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:35:07,808 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:35:07,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-03 22:35:07,808 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:35:07,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:35:07,809 INFO L85 PathProgramCache]: Analyzing trace with hash -576344139, now seen corresponding path program 5 times [2024-06-03 22:35:07,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:35:07,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642991182] [2024-06-03 22:35:07,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:35:07,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:35:07,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:35:11,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:35:11,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:35:11,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642991182] [2024-06-03 22:35:11,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642991182] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:35:11,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:35:11,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:35:11,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445551147] [2024-06-03 22:35:11,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:35:11,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:35:11,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:35:11,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:35:11,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:35:11,969 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:35:11,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 40 transitions, 240 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:35:11,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:35:11,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:35:11,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:35:12,153 INFO L124 PetriNetUnfolderBase]: 87/187 cut-off events. [2024-06-03 22:35:12,154 INFO L125 PetriNetUnfolderBase]: For 2111/2111 co-relation queries the response was YES. [2024-06-03 22:35:12,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 724 conditions, 187 events. 87/187 cut-off events. For 2111/2111 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 602 event pairs, 21 based on Foata normal form. 6/192 useless extension candidates. Maximal degree in co-relation 686. Up to 100 conditions per place. [2024-06-03 22:35:12,155 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 26 selfloop transitions, 10 changer transitions 12/50 dead transitions. [2024-06-03 22:35:12,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 50 transitions, 362 flow [2024-06-03 22:35:12,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:35:12,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:35:12,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 77 transitions. [2024-06-03 22:35:12,156 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32083333333333336 [2024-06-03 22:35:12,156 INFO L175 Difference]: Start difference. First operand has 74 places, 40 transitions, 240 flow. Second operand 8 states and 77 transitions. [2024-06-03 22:35:12,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 50 transitions, 362 flow [2024-06-03 22:35:12,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 50 transitions, 342 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-03 22:35:12,158 INFO L231 Difference]: Finished difference. Result has 67 places, 35 transitions, 204 flow [2024-06-03 22:35:12,159 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=204, PETRI_PLACES=67, PETRI_TRANSITIONS=35} [2024-06-03 22:35:12,159 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 38 predicate places. [2024-06-03 22:35:12,159 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 35 transitions, 204 flow [2024-06-03 22:35:12,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:35:12,159 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:35:12,159 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:35:12,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-03 22:35:12,160 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:35:12,160 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:35:12,160 INFO L85 PathProgramCache]: Analyzing trace with hash -576113499, now seen corresponding path program 6 times [2024-06-03 22:35:12,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:35:12,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935856381] [2024-06-03 22:35:12,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:35:12,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:35:12,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:35:16,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:35:16,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:35:16,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935856381] [2024-06-03 22:35:16,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935856381] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:35:16,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:35:16,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:35:16,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704846356] [2024-06-03 22:35:16,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:35:16,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:35:16,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:35:16,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:35:16,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:35:16,181 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:35:16,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 35 transitions, 204 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:35:16,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:35:16,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:35:16,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:35:16,405 INFO L124 PetriNetUnfolderBase]: 75/167 cut-off events. [2024-06-03 22:35:16,405 INFO L125 PetriNetUnfolderBase]: For 1447/1447 co-relation queries the response was YES. [2024-06-03 22:35:16,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 621 conditions, 167 events. 75/167 cut-off events. For 1447/1447 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 514 event pairs, 20 based on Foata normal form. 6/172 useless extension candidates. Maximal degree in co-relation 598. Up to 105 conditions per place. [2024-06-03 22:35:16,406 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 26 selfloop transitions, 6 changer transitions 14/48 dead transitions. [2024-06-03 22:35:16,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 48 transitions, 329 flow [2024-06-03 22:35:16,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:35:16,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:35:16,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 83 transitions. [2024-06-03 22:35:16,407 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3074074074074074 [2024-06-03 22:35:16,407 INFO L175 Difference]: Start difference. First operand has 67 places, 35 transitions, 204 flow. Second operand 9 states and 83 transitions. [2024-06-03 22:35:16,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 48 transitions, 329 flow [2024-06-03 22:35:16,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 48 transitions, 303 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-06-03 22:35:16,409 INFO L231 Difference]: Finished difference. Result has 64 places, 32 transitions, 169 flow [2024-06-03 22:35:16,409 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=169, PETRI_PLACES=64, PETRI_TRANSITIONS=32} [2024-06-03 22:35:16,409 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 35 predicate places. [2024-06-03 22:35:16,409 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 32 transitions, 169 flow [2024-06-03 22:35:16,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:35:16,410 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:35:16,410 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:35:16,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-03 22:35:16,410 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:35:16,410 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:35:16,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1865539519, now seen corresponding path program 7 times [2024-06-03 22:35:16,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:35:16,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820263690] [2024-06-03 22:35:16,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:35:16,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:35:16,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:35:20,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-03 22:35:20,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:35:20,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820263690] [2024-06-03 22:35:20,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820263690] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:35:20,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:35:20,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:35:20,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069102367] [2024-06-03 22:35:20,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:35:20,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:35:20,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:35:20,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:35:20,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:35:20,925 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:35:20,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 32 transitions, 169 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:35:20,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:35:20,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:35:20,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:35:21,126 INFO L124 PetriNetUnfolderBase]: 63/143 cut-off events. [2024-06-03 22:35:21,126 INFO L125 PetriNetUnfolderBase]: For 1236/1236 co-relation queries the response was YES. [2024-06-03 22:35:21,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 528 conditions, 143 events. 63/143 cut-off events. For 1236/1236 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 414 event pairs, 15 based on Foata normal form. 6/148 useless extension candidates. Maximal degree in co-relation 506. Up to 69 conditions per place. [2024-06-03 22:35:21,127 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 20 selfloop transitions, 7 changer transitions 15/44 dead transitions. [2024-06-03 22:35:21,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 44 transitions, 281 flow [2024-06-03 22:35:21,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:35:21,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:35:21,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 92 transitions. [2024-06-03 22:35:21,128 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30666666666666664 [2024-06-03 22:35:21,128 INFO L175 Difference]: Start difference. First operand has 64 places, 32 transitions, 169 flow. Second operand 10 states and 92 transitions. [2024-06-03 22:35:21,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 44 transitions, 281 flow [2024-06-03 22:35:21,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 44 transitions, 259 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-03 22:35:21,130 INFO L231 Difference]: Finished difference. Result has 60 places, 26 transitions, 135 flow [2024-06-03 22:35:21,130 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=135, PETRI_PLACES=60, PETRI_TRANSITIONS=26} [2024-06-03 22:35:21,130 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 31 predicate places. [2024-06-03 22:35:21,130 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 26 transitions, 135 flow [2024-06-03 22:35:21,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:35:21,131 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:35:21,131 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:35:21,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-03 22:35:21,131 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:35:21,131 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:35:21,131 INFO L85 PathProgramCache]: Analyzing trace with hash -354705609, now seen corresponding path program 8 times [2024-06-03 22:35:21,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:35:21,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833728718] [2024-06-03 22:35:21,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:35:21,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:35:21,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:35:25,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:35:25,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:35:25,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833728718] [2024-06-03 22:35:25,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833728718] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:35:25,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:35:25,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:35:25,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075088698] [2024-06-03 22:35:25,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:35:25,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:35:25,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:35:25,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:35:25,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:35:25,264 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:35:25,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 26 transitions, 135 flow. Second operand has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:35:25,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:35:25,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:35:25,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:35:25,430 INFO L124 PetriNetUnfolderBase]: 47/111 cut-off events. [2024-06-03 22:35:25,430 INFO L125 PetriNetUnfolderBase]: For 1213/1213 co-relation queries the response was YES. [2024-06-03 22:35:25,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 399 conditions, 111 events. 47/111 cut-off events. For 1213/1213 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 279 event pairs, 20 based on Foata normal form. 8/118 useless extension candidates. Maximal degree in co-relation 380. Up to 52 conditions per place. [2024-06-03 22:35:25,430 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 17 selfloop transitions, 5 changer transitions 11/35 dead transitions. [2024-06-03 22:35:25,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 35 transitions, 223 flow [2024-06-03 22:35:25,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:35:25,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:35:25,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 79 transitions. [2024-06-03 22:35:25,431 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29259259259259257 [2024-06-03 22:35:25,431 INFO L175 Difference]: Start difference. First operand has 60 places, 26 transitions, 135 flow. Second operand 9 states and 79 transitions. [2024-06-03 22:35:25,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 35 transitions, 223 flow [2024-06-03 22:35:25,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 35 transitions, 195 flow, removed 5 selfloop flow, removed 12 redundant places. [2024-06-03 22:35:25,435 INFO L231 Difference]: Finished difference. Result has 49 places, 21 transitions, 94 flow [2024-06-03 22:35:25,435 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=94, PETRI_PLACES=49, PETRI_TRANSITIONS=21} [2024-06-03 22:35:25,435 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 20 predicate places. [2024-06-03 22:35:25,435 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 21 transitions, 94 flow [2024-06-03 22:35:25,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:35:25,436 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:35:25,436 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:35:25,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-03 22:35:25,436 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:35:25,436 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:35:25,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1214532281, now seen corresponding path program 9 times [2024-06-03 22:35:25,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:35:25,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361282720] [2024-06-03 22:35:25,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:35:25,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:35:25,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:35:29,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:35:29,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:35:29,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361282720] [2024-06-03 22:35:29,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361282720] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:35:29,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:35:29,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:35:29,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540458135] [2024-06-03 22:35:29,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:35:29,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:35:29,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:35:29,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:35:29,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:35:29,719 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:35:29,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 21 transitions, 94 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:35:29,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:35:29,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:35:29,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:35:29,904 INFO L124 PetriNetUnfolderBase]: 22/60 cut-off events. [2024-06-03 22:35:29,904 INFO L125 PetriNetUnfolderBase]: For 252/252 co-relation queries the response was YES. [2024-06-03 22:35:29,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 60 events. 22/60 cut-off events. For 252/252 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 87 event pairs, 1 based on Foata normal form. 6/65 useless extension candidates. Maximal degree in co-relation 158. Up to 24 conditions per place. [2024-06-03 22:35:29,905 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 0 selfloop transitions, 0 changer transitions 27/27 dead transitions. [2024-06-03 22:35:29,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 27 transitions, 138 flow [2024-06-03 22:35:29,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:35:29,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:35:29,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 71 transitions. [2024-06-03 22:35:29,905 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.26296296296296295 [2024-06-03 22:35:29,905 INFO L175 Difference]: Start difference. First operand has 49 places, 21 transitions, 94 flow. Second operand 9 states and 71 transitions. [2024-06-03 22:35:29,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 27 transitions, 138 flow [2024-06-03 22:35:29,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 27 transitions, 110 flow, removed 2 selfloop flow, removed 13 redundant places. [2024-06-03 22:35:29,906 INFO L231 Difference]: Finished difference. Result has 38 places, 0 transitions, 0 flow [2024-06-03 22:35:29,906 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=0, PETRI_PLACES=38, PETRI_TRANSITIONS=0} [2024-06-03 22:35:29,906 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 9 predicate places. [2024-06-03 22:35:29,906 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 0 transitions, 0 flow [2024-06-03 22:35:29,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:35:29,909 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 4 remaining) [2024-06-03 22:35:29,911 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 4 remaining) [2024-06-03 22:35:29,920 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-06-03 22:35:29,921 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-06-03 22:35:29,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-03 22:35:29,921 INFO L445 BasicCegarLoop]: Path program histogram: [9, 8, 7, 6, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:35:29,927 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-03 22:35:29,927 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-03 22:35:29,930 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-06-03 22:35:29,930 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-06-03 22:35:29,930 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.06 10:35:29 BasicIcfg [2024-06-03 22:35:29,931 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-03 22:35:29,931 INFO L158 Benchmark]: Toolchain (without parser) took 233193.34ms. Allocated memory was 157.3MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 117.4MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 107.8MB. Max. memory is 16.1GB. [2024-06-03 22:35:29,931 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 121.6MB. Free memory is still 85.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-03 22:35:29,931 INFO L158 Benchmark]: Witness Parser took 4.71ms. Allocated memory is still 157.3MB. Free memory is still 124.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-03 22:35:29,931 INFO L158 Benchmark]: CACSL2BoogieTranslator took 785.12ms. Allocated memory is still 157.3MB. Free memory was 116.7MB in the beginning and 117.5MB in the end (delta: -774.5kB). Peak memory consumption was 51.6MB. Max. memory is 16.1GB. [2024-06-03 22:35:29,932 INFO L158 Benchmark]: Boogie Procedure Inliner took 126.46ms. Allocated memory is still 157.3MB. Free memory was 117.5MB in the beginning and 103.8MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-06-03 22:35:29,932 INFO L158 Benchmark]: Boogie Preprocessor took 107.03ms. Allocated memory is still 157.3MB. Free memory was 103.8MB in the beginning and 97.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-06-03 22:35:29,932 INFO L158 Benchmark]: RCFGBuilder took 954.81ms. Allocated memory was 157.3MB in the beginning and 218.1MB in the end (delta: 60.8MB). Free memory was 97.5MB in the beginning and 146.6MB in the end (delta: -49.1MB). Peak memory consumption was 70.4MB. Max. memory is 16.1GB. [2024-06-03 22:35:29,932 INFO L158 Benchmark]: TraceAbstraction took 231213.39ms. Allocated memory was 218.1MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 145.6MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 76.0MB. Max. memory is 16.1GB. [2024-06-03 22:35:29,933 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 121.6MB. Free memory is still 85.0MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 4.71ms. Allocated memory is still 157.3MB. Free memory is still 124.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 785.12ms. Allocated memory is still 157.3MB. Free memory was 116.7MB in the beginning and 117.5MB in the end (delta: -774.5kB). Peak memory consumption was 51.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 126.46ms. Allocated memory is still 157.3MB. Free memory was 117.5MB in the beginning and 103.8MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 107.03ms. Allocated memory is still 157.3MB. Free memory was 103.8MB in the beginning and 97.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 954.81ms. Allocated memory was 157.3MB in the beginning and 218.1MB in the end (delta: 60.8MB). Free memory was 97.5MB in the beginning and 146.6MB in the end (delta: -49.1MB). Peak memory consumption was 70.4MB. Max. memory is 16.1GB. * TraceAbstraction took 231213.39ms. Allocated memory was 218.1MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 145.6MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 76.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 795]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 796]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 47 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 231.1s, OverallIterations: 58, TraceHistogramMax: 1, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 21.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3010 SdHoareTripleChecker+Valid, 13.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2611 mSDsluCounter, 843 SdHoareTripleChecker+Invalid, 11.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 596 mSDsCounter, 571 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16250 IncrementalHoareTripleChecker+Invalid, 16821 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 571 mSolverCounterUnsat, 247 mSDtfsCounter, 16250 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 585 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 578 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 877 ImplicationChecksByTransitivity, 14.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=924occurred in iteration=30, InterpolantAutomatonStates: 493, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 207.5s InterpolantComputationTime, 900 NumberOfCodeBlocks, 900 NumberOfCodeBlocksAsserted, 58 NumberOfCheckSat, 842 ConstructedInterpolants, 0 QuantifiedInterpolants, 39897 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 58 InterpolantComputations, 58 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-06-03 22:35:29,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE