./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe029_power.opt_pso.opt_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/safe029_power.opt_pso.opt_rmo.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cde23df1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/safe029_power.opt_pso.opt_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-cde23df-m [2024-06-14 16:05:51,556 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-14 16:05:51,621 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-14 16:05:51,627 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-14 16:05:51,627 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-14 16:05:51,655 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-14 16:05:51,655 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-14 16:05:51,656 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-14 16:05:51,656 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-14 16:05:51,659 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-14 16:05:51,659 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-14 16:05:51,660 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-14 16:05:51,660 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-14 16:05:51,661 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-14 16:05:51,662 INFO L153 SettingsManager]: * Use SBE=true [2024-06-14 16:05:51,662 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-14 16:05:51,662 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-14 16:05:51,662 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-14 16:05:51,662 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-14 16:05:51,663 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-14 16:05:51,663 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-14 16:05:51,663 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-14 16:05:51,663 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-14 16:05:51,664 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-14 16:05:51,664 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-14 16:05:51,664 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-14 16:05:51,664 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-14 16:05:51,664 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-14 16:05:51,665 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-14 16:05:51,665 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-14 16:05:51,666 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-14 16:05:51,666 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-14 16:05:51,666 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 16:05:51,666 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-14 16:05:51,667 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-14 16:05:51,667 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-14 16:05:51,667 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-14 16:05:51,667 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-14 16:05:51,667 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-14 16:05:51,667 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-14 16:05:51,668 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-14 16:05:51,668 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-14 16:05:51,668 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-14 16:05:51,668 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-14 16:05:51,876 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-14 16:05:51,895 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-14 16:05:51,897 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-14 16:05:51,898 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-14 16:05:51,899 INFO L274 PluginConnector]: CDTParser initialized [2024-06-14 16:05:51,900 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i [2024-06-14 16:05:52,879 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-14 16:05:53,085 INFO L384 CDTParser]: Found 1 translation units. [2024-06-14 16:05:53,085 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i [2024-06-14 16:05:53,100 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/524de7c4d/577fb15f9b2e485887a694fd0b236a11/FLAG26e351d77 [2024-06-14 16:05:53,110 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/524de7c4d/577fb15f9b2e485887a694fd0b236a11 [2024-06-14 16:05:53,117 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-14 16:05:53,118 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-14 16:05:53,118 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/safe029_power.opt_pso.opt_rmo.opt.yml/witness.yml [2024-06-14 16:05:53,222 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-14 16:05:53,223 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-14 16:05:53,225 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-14 16:05:53,225 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-14 16:05:53,228 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-14 16:05:53,229 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 04:05:53" (1/2) ... [2024-06-14 16:05:53,231 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@359acf0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 04:05:53, skipping insertion in model container [2024-06-14 16:05:53,231 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 04:05:53" (1/2) ... [2024-06-14 16:05:53,233 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7be92ad6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 04:05:53, skipping insertion in model container [2024-06-14 16:05:53,233 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 04:05:53" (2/2) ... [2024-06-14 16:05:53,234 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@359acf0d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 04:05:53, skipping insertion in model container [2024-06-14 16:05:53,234 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 04:05:53" (2/2) ... [2024-06-14 16:05:53,234 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-14 16:05:53,290 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-14 16:05:53,291 INFO L97 edCorrectnessWitness]: Location invariant before [L794-L794] (((((((((((((! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2))) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y >= 0LL) && (2LL + (long long )x) - (long long )y >= 0LL) && (2LL + (long long )x$flush_delayed) - (long long )y >= 0LL) && (2LL + (long long )x$mem_tmp) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd2) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd2) - (long long )y >= 0LL) && (2LL + (long long )x$read_delayed) - (long long )y >= 0LL) && (2LL + (long long )x$w_buff0) - (long long )y >= 0LL) && (2LL + (long long )x$w_buff1) - (long long )y >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (2LL - (long long )x$read_delayed) - (long long )y >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || (((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && y <= 2) && y <= 127) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && x$w_buff0 % 2 == 0) && x$w_buff1 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2)))) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-14 16:05:53,292 INFO L97 edCorrectnessWitness]: Location invariant before [L793-L793] (((((((((((((! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2))) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y >= 0LL) && (2LL + (long long )x) - (long long )y >= 0LL) && (2LL + (long long )x$flush_delayed) - (long long )y >= 0LL) && (2LL + (long long )x$mem_tmp) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd2) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd2) - (long long )y >= 0LL) && (2LL + (long long )x$read_delayed) - (long long )y >= 0LL) && (2LL + (long long )x$w_buff0) - (long long )y >= 0LL) && (2LL + (long long )x$w_buff1) - (long long )y >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (2LL - (long long )x$read_delayed) - (long long )y >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || (((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && y <= 2) && y <= 127) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && x$w_buff0 % 2 == 0) && x$w_buff1 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2)))) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-14 16:05:53,292 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-14 16:05:53,292 INFO L106 edCorrectnessWitness]: ghost_update [L791-L791] multithreaded = 1; [2024-06-14 16:05:53,331 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-14 16:05:53,652 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 16:05:53,659 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-14 16:05:53,916 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 16:05:53,966 INFO L206 MainTranslator]: Completed translation [2024-06-14 16:05:53,966 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 04:05:53 WrapperNode [2024-06-14 16:05:53,966 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-14 16:05:53,967 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-14 16:05:53,967 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-14 16:05:53,967 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-14 16:05:53,972 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 04:05:53" (1/1) ... [2024-06-14 16:05:53,993 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 04:05:53" (1/1) ... [2024-06-14 16:05:54,047 INFO L138 Inliner]: procedures = 174, calls = 34, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 130 [2024-06-14 16:05:54,047 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-14 16:05:54,048 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-14 16:05:54,048 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-14 16:05:54,048 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-14 16:05:54,058 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 04:05:53" (1/1) ... [2024-06-14 16:05:54,059 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 04:05:53" (1/1) ... [2024-06-14 16:05:54,077 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 04:05:53" (1/1) ... [2024-06-14 16:05:54,105 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-14 16:05:54,105 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 04:05:53" (1/1) ... [2024-06-14 16:05:54,105 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 04:05:53" (1/1) ... [2024-06-14 16:05:54,128 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 04:05:53" (1/1) ... [2024-06-14 16:05:54,129 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 04:05:53" (1/1) ... [2024-06-14 16:05:54,136 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 04:05:53" (1/1) ... [2024-06-14 16:05:54,141 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 04:05:53" (1/1) ... [2024-06-14 16:05:54,153 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-14 16:05:54,154 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-14 16:05:54,154 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-14 16:05:54,154 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-14 16:05:54,155 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 04:05:53" (1/1) ... [2024-06-14 16:05:54,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 16:05:54,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 16:05:54,177 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-14 16:05:54,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-14 16:05:54,206 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-14 16:05:54,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-14 16:05:54,206 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-14 16:05:54,206 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-14 16:05:54,206 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-14 16:05:54,206 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-14 16:05:54,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-14 16:05:54,207 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-14 16:05:54,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-14 16:05:54,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-14 16:05:54,208 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-14 16:05:54,326 INFO L244 CfgBuilder]: Building ICFG [2024-06-14 16:05:54,328 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-14 16:05:54,911 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-14 16:05:54,912 INFO L293 CfgBuilder]: Performing block encoding [2024-06-14 16:05:55,058 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-14 16:05:55,058 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-14 16:05:55,061 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 04:05:55 BoogieIcfgContainer [2024-06-14 16:05:55,061 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-14 16:05:55,063 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-14 16:05:55,063 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-14 16:05:55,066 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-14 16:05:55,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.06 04:05:53" (1/4) ... [2024-06-14 16:05:55,067 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56532a44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 04:05:55, skipping insertion in model container [2024-06-14 16:05:55,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 04:05:53" (2/4) ... [2024-06-14 16:05:55,067 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56532a44 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 04:05:55, skipping insertion in model container [2024-06-14 16:05:55,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 04:05:53" (3/4) ... [2024-06-14 16:05:55,068 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56532a44 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 04:05:55, skipping insertion in model container [2024-06-14 16:05:55,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 04:05:55" (4/4) ... [2024-06-14 16:05:55,069 INFO L112 eAbstractionObserver]: Analyzing ICFG safe029_power.opt_pso.opt_rmo.opt.i [2024-06-14 16:05:55,083 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-14 16:05:55,084 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-14 16:05:55,084 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-14 16:05:55,152 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-14 16:05:55,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 30 transitions, 68 flow [2024-06-14 16:05:55,211 INFO L124 PetriNetUnfolderBase]: 0/28 cut-off events. [2024-06-14 16:05:55,211 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 16:05:55,213 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 38 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-14 16:05:55,213 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 30 transitions, 68 flow [2024-06-14 16:05:55,216 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 22 transitions, 50 flow [2024-06-14 16:05:55,228 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-14 16:05:55,267 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;@3a98108d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-14 16:05:55,267 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-14 16:05:55,280 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-14 16:05:55,280 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-14 16:05:55,280 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 16:05:55,281 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:05:55,281 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-14 16:05:55,282 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-14 16:05:55,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:05:55,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1322329521, now seen corresponding path program 1 times [2024-06-14 16:05:55,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:05:55,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143413347] [2024-06-14 16:05:55,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:05:55,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:05:55,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:05:57,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:05:57,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:05:57,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143413347] [2024-06-14 16:05:57,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143413347] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:05:57,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:05:57,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-14 16:05:57,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063554212] [2024-06-14 16:05:57,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:05:57,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-14 16:05:57,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:05:57,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-14 16:05:57,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-14 16:05:57,955 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 16:05:57,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 22 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:05:57,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:05:57,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 16:05:57,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:05:58,125 INFO L124 PetriNetUnfolderBase]: 162/297 cut-off events. [2024-06-14 16:05:58,126 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-06-14 16:05:58,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 610 conditions, 297 events. 162/297 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1013 event pairs, 97 based on Foata normal form. 1/291 useless extension candidates. Maximal degree in co-relation 596. Up to 288 conditions per place. [2024-06-14 16:05:58,130 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 23 selfloop transitions, 3 changer transitions 0/28 dead transitions. [2024-06-14 16:05:58,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 28 transitions, 117 flow [2024-06-14 16:05:58,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-14 16:05:58,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-14 16:05:58,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2024-06-14 16:05:58,138 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5111111111111111 [2024-06-14 16:05:58,140 INFO L175 Difference]: Start difference. First operand has 29 places, 22 transitions, 50 flow. Second operand 3 states and 46 transitions. [2024-06-14 16:05:58,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 28 transitions, 117 flow [2024-06-14 16:05:58,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 28 transitions, 114 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-14 16:05:58,143 INFO L231 Difference]: Finished difference. Result has 30 places, 24 transitions, 69 flow [2024-06-14 16:05:58,145 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-14 16:05:58,147 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 1 predicate places. [2024-06-14 16:05:58,147 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 24 transitions, 69 flow [2024-06-14 16:05:58,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:05:58,148 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:05:58,148 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:05:58,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-14 16:05:58,148 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-14 16:05:58,149 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:05:58,149 INFO L85 PathProgramCache]: Analyzing trace with hash -551185454, now seen corresponding path program 1 times [2024-06-14 16:05:58,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:05:58,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575694660] [2024-06-14 16:05:58,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:05:58,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:05:58,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:05:59,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:05:59,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:05:59,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575694660] [2024-06-14 16:05:59,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575694660] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:05:59,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:05:59,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-14 16:05:59,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20205883] [2024-06-14 16:05:59,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:05:59,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 16:05:59,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:05:59,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 16:05:59,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-14 16:05:59,786 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 16:05:59,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 69 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:05:59,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:05:59,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 16:05:59,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:05:59,937 INFO L124 PetriNetUnfolderBase]: 159/292 cut-off events. [2024-06-14 16:05:59,938 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2024-06-14 16:05:59,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 682 conditions, 292 events. 159/292 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 991 event pairs, 79 based on Foata normal form. 2/292 useless extension candidates. Maximal degree in co-relation 667. Up to 274 conditions per place. [2024-06-14 16:05:59,940 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 27 selfloop transitions, 5 changer transitions 0/34 dead transitions. [2024-06-14 16:05:59,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 34 transitions, 159 flow [2024-06-14 16:05:59,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-14 16:05:59,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-14 16:05:59,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2024-06-14 16:05:59,942 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2024-06-14 16:05:59,942 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 69 flow. Second operand 4 states and 58 transitions. [2024-06-14 16:05:59,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 34 transitions, 159 flow [2024-06-14 16:05:59,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 34 transitions, 156 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-14 16:05:59,943 INFO L231 Difference]: Finished difference. Result has 33 places, 26 transitions, 93 flow [2024-06-14 16:05:59,943 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-14 16:05:59,944 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 4 predicate places. [2024-06-14 16:05:59,944 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 26 transitions, 93 flow [2024-06-14 16:05:59,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:05:59,945 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:05:59,945 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:05:59,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-14 16:05:59,945 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-14 16:05:59,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:05:59,946 INFO L85 PathProgramCache]: Analyzing trace with hash 79715222, now seen corresponding path program 1 times [2024-06-14 16:05:59,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:05:59,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504589425] [2024-06-14 16:05:59,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:05:59,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:05:59,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:06:01,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:06:01,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:06:01,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504589425] [2024-06-14 16:06:01,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504589425] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:06:01,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:06:01,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 16:06:01,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971113621] [2024-06-14 16:06:01,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:06:01,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 16:06:01,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:06:01,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 16:06:01,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 16:06:01,576 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 16:06:01,577 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-14 16:06:01,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:06:01,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 16:06:01,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:06:01,722 INFO L124 PetriNetUnfolderBase]: 153/282 cut-off events. [2024-06-14 16:06:01,723 INFO L125 PetriNetUnfolderBase]: For 171/171 co-relation queries the response was YES. [2024-06-14 16:06:01,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 731 conditions, 282 events. 153/282 cut-off events. For 171/171 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 940 event pairs, 43 based on Foata normal form. 4/284 useless extension candidates. Maximal degree in co-relation 714. Up to 246 conditions per place. [2024-06-14 16:06:01,727 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 32 selfloop transitions, 7 changer transitions 0/41 dead transitions. [2024-06-14 16:06:01,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 41 transitions, 211 flow [2024-06-14 16:06:01,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 16:06:01,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 16:06:01,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2024-06-14 16:06:01,730 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47333333333333333 [2024-06-14 16:06:01,730 INFO L175 Difference]: Start difference. First operand has 33 places, 26 transitions, 93 flow. Second operand 5 states and 71 transitions. [2024-06-14 16:06:01,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 41 transitions, 211 flow [2024-06-14 16:06:01,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 41 transitions, 202 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-14 16:06:01,734 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 117 flow [2024-06-14 16:06:01,734 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=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=117, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2024-06-14 16:06:01,735 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 7 predicate places. [2024-06-14 16:06:01,736 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 117 flow [2024-06-14 16:06:01,736 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-14 16:06:01,736 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:06:01,736 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:06:01,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-14 16:06:01,736 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-14 16:06:01,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:06:01,737 INFO L85 PathProgramCache]: Analyzing trace with hash -703047979, now seen corresponding path program 1 times [2024-06-14 16:06:01,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:06:01,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237167414] [2024-06-14 16:06:01,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:06:01,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:06:01,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:06:03,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:06:03,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:06:03,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237167414] [2024-06-14 16:06:03,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237167414] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:06:03,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:06:03,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 16:06:03,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908108974] [2024-06-14 16:06:03,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:06:03,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 16:06:03,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:06:03,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 16:06:03,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-14 16:06:03,900 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 16:06:03,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 117 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-14 16:06:03,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:06:03,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 16:06:03,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:06:04,074 INFO L124 PetriNetUnfolderBase]: 149/274 cut-off events. [2024-06-14 16:06:04,074 INFO L125 PetriNetUnfolderBase]: For 269/269 co-relation queries the response was YES. [2024-06-14 16:06:04,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 774 conditions, 274 events. 149/274 cut-off events. For 269/269 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 907 event pairs, 24 based on Foata normal form. 4/276 useless extension candidates. Maximal degree in co-relation 756. Up to 220 conditions per place. [2024-06-14 16:06:04,077 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 32 selfloop transitions, 8 changer transitions 0/42 dead transitions. [2024-06-14 16:06:04,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 42 transitions, 225 flow [2024-06-14 16:06:04,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 16:06:04,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 16:06:04,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2024-06-14 16:06:04,079 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2024-06-14 16:06:04,080 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 117 flow. Second operand 6 states and 78 transitions. [2024-06-14 16:06:04,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 42 transitions, 225 flow [2024-06-14 16:06:04,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 42 transitions, 210 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-14 16:06:04,083 INFO L231 Difference]: Finished difference. Result has 38 places, 27 transitions, 114 flow [2024-06-14 16:06:04,083 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=114, PETRI_PLACES=38, PETRI_TRANSITIONS=27} [2024-06-14 16:06:04,085 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 9 predicate places. [2024-06-14 16:06:04,085 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 114 flow [2024-06-14 16:06:04,085 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-14 16:06:04,085 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:06:04,085 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:06:04,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-14 16:06:04,086 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 16:06:04,086 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:06:04,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1322578618, now seen corresponding path program 1 times [2024-06-14 16:06:04,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:06:04,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291019720] [2024-06-14 16:06:04,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:06:04,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:06:04,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:06:06,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:06:06,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:06:06,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291019720] [2024-06-14 16:06:06,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291019720] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:06:06,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:06:06,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 16:06:06,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281381951] [2024-06-14 16:06:06,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:06:06,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 16:06:06,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:06:06,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 16:06:06,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-14 16:06:06,995 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-14 16:06:06,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 114 flow. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:06:06,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:06:06,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-14 16:06:06,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:06:07,141 INFO L124 PetriNetUnfolderBase]: 147/271 cut-off events. [2024-06-14 16:06:07,142 INFO L125 PetriNetUnfolderBase]: For 377/377 co-relation queries the response was YES. [2024-06-14 16:06:07,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 799 conditions, 271 events. 147/271 cut-off events. For 377/377 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 886 event pairs, 53 based on Foata normal form. 1/270 useless extension candidates. Maximal degree in co-relation 780. Up to 259 conditions per place. [2024-06-14 16:06:07,144 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 26 selfloop transitions, 6 changer transitions 0/34 dead transitions. [2024-06-14 16:06:07,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 34 transitions, 196 flow [2024-06-14 16:06:07,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 16:06:07,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 16:06:07,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2024-06-14 16:06:07,148 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36 [2024-06-14 16:06:07,148 INFO L175 Difference]: Start difference. First operand has 38 places, 27 transitions, 114 flow. Second operand 5 states and 54 transitions. [2024-06-14 16:06:07,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 34 transitions, 196 flow [2024-06-14 16:06:07,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 34 transitions, 176 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-14 16:06:07,153 INFO L231 Difference]: Finished difference. Result has 39 places, 29 transitions, 121 flow [2024-06-14 16:06:07,153 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=121, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2024-06-14 16:06:07,155 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 10 predicate places. [2024-06-14 16:06:07,157 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 121 flow [2024-06-14 16:06:07,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:06:07,157 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:06:07,157 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:06:07,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-14 16:06:07,162 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-14 16:06:07,163 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:06:07,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1949736420, now seen corresponding path program 1 times [2024-06-14 16:06:07,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:06:07,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532325663] [2024-06-14 16:06:07,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:06:07,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:06:07,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:06:10,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:06:10,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:06:10,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532325663] [2024-06-14 16:06:10,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532325663] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:06:10,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:06:10,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 16:06:10,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860341060] [2024-06-14 16:06:10,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:06:10,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 16:06:10,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:06:10,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 16:06:10,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-14 16:06:10,063 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-14 16:06:10,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 121 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-14 16:06:10,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:06:10,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-14 16:06:10,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:06:10,199 INFO L124 PetriNetUnfolderBase]: 149/276 cut-off events. [2024-06-14 16:06:10,199 INFO L125 PetriNetUnfolderBase]: For 498/501 co-relation queries the response was YES. [2024-06-14 16:06:10,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 843 conditions, 276 events. 149/276 cut-off events. For 498/501 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 922 event pairs, 52 based on Foata normal form. 4/277 useless extension candidates. Maximal degree in co-relation 822. Up to 237 conditions per place. [2024-06-14 16:06:10,201 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 28 selfloop transitions, 12 changer transitions 0/42 dead transitions. [2024-06-14 16:06:10,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 42 transitions, 249 flow [2024-06-14 16:06:10,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 16:06:10,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 16:06:10,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 67 transitions. [2024-06-14 16:06:10,202 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37222222222222223 [2024-06-14 16:06:10,202 INFO L175 Difference]: Start difference. First operand has 39 places, 29 transitions, 121 flow. Second operand 6 states and 67 transitions. [2024-06-14 16:06:10,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 42 transitions, 249 flow [2024-06-14 16:06:10,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 42 transitions, 238 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-14 16:06:10,204 INFO L231 Difference]: Finished difference. Result has 43 places, 35 transitions, 178 flow [2024-06-14 16:06:10,204 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=178, PETRI_PLACES=43, PETRI_TRANSITIONS=35} [2024-06-14 16:06:10,205 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 14 predicate places. [2024-06-14 16:06:10,205 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 35 transitions, 178 flow [2024-06-14 16:06:10,205 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-14 16:06:10,205 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:06:10,205 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:06:10,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-14 16:06:10,206 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-14 16:06:10,206 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:06:10,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1382704549, now seen corresponding path program 1 times [2024-06-14 16:06:10,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:06:10,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252996764] [2024-06-14 16:06:10,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:06:10,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:06:10,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:06:12,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:06:12,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:06:12,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252996764] [2024-06-14 16:06:12,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252996764] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:06:12,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:06:12,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 16:06:12,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96043568] [2024-06-14 16:06:12,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:06:12,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 16:06:12,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:06:12,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 16:06:12,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-14 16:06:12,759 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-14 16:06:12,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 35 transitions, 178 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-14 16:06:12,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:06:12,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-14 16:06:12,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:06:12,915 INFO L124 PetriNetUnfolderBase]: 156/288 cut-off events. [2024-06-14 16:06:12,915 INFO L125 PetriNetUnfolderBase]: For 702/702 co-relation queries the response was YES. [2024-06-14 16:06:12,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1012 conditions, 288 events. 156/288 cut-off events. For 702/702 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 959 event pairs, 51 based on Foata normal form. 1/287 useless extension candidates. Maximal degree in co-relation 989. Up to 264 conditions per place. [2024-06-14 16:06:12,918 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 37 selfloop transitions, 11 changer transitions 0/50 dead transitions. [2024-06-14 16:06:12,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 50 transitions, 332 flow [2024-06-14 16:06:12,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 16:06:12,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 16:06:12,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2024-06-14 16:06:12,920 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3523809523809524 [2024-06-14 16:06:12,920 INFO L175 Difference]: Start difference. First operand has 43 places, 35 transitions, 178 flow. Second operand 7 states and 74 transitions. [2024-06-14 16:06:12,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 50 transitions, 332 flow [2024-06-14 16:06:12,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 50 transitions, 318 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-06-14 16:06:12,923 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 233 flow [2024-06-14 16:06:12,923 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=233, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2024-06-14 16:06:12,924 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 20 predicate places. [2024-06-14 16:06:12,924 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 233 flow [2024-06-14 16:06:12,924 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-14 16:06:12,924 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:06:12,925 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:06:12,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-14 16:06:12,925 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-14 16:06:12,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:06:12,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1164690619, now seen corresponding path program 2 times [2024-06-14 16:06:12,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:06:12,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958022814] [2024-06-14 16:06:12,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:06:12,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:06:12,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:06:15,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:06:15,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:06:15,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958022814] [2024-06-14 16:06:15,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958022814] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:06:15,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:06:15,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 16:06:15,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044097137] [2024-06-14 16:06:15,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:06:15,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 16:06:15,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:06:15,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 16:06:15,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-14 16:06:15,532 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-14 16:06:15,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 233 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-14 16:06:15,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:06:15,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-14 16:06:15,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:06:15,710 INFO L124 PetriNetUnfolderBase]: 159/293 cut-off events. [2024-06-14 16:06:15,710 INFO L125 PetriNetUnfolderBase]: For 952/952 co-relation queries the response was YES. [2024-06-14 16:06:15,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1112 conditions, 293 events. 159/293 cut-off events. For 952/952 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 982 event pairs, 50 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1086. Up to 266 conditions per place. [2024-06-14 16:06:15,712 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 36 selfloop transitions, 12 changer transitions 0/50 dead transitions. [2024-06-14 16:06:15,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 50 transitions, 370 flow [2024-06-14 16:06:15,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 16:06:15,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 16:06:15,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2024-06-14 16:06:15,715 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3611111111111111 [2024-06-14 16:06:15,715 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 233 flow. Second operand 6 states and 65 transitions. [2024-06-14 16:06:15,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 50 transitions, 370 flow [2024-06-14 16:06:15,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 50 transitions, 349 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-14 16:06:15,718 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 267 flow [2024-06-14 16:06:15,718 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=267, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2024-06-14 16:06:15,720 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 22 predicate places. [2024-06-14 16:06:15,720 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 267 flow [2024-06-14 16:06:15,720 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-14 16:06:15,720 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:06:15,720 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:06:15,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-14 16:06:15,720 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-14 16:06:15,721 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:06:15,721 INFO L85 PathProgramCache]: Analyzing trace with hash 312279589, now seen corresponding path program 3 times [2024-06-14 16:06:15,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:06:15,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134231597] [2024-06-14 16:06:15,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:06:15,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:06:15,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:06:18,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:06:18,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:06:18,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134231597] [2024-06-14 16:06:18,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134231597] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:06:18,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:06:18,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 16:06:18,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426335233] [2024-06-14 16:06:18,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:06:18,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 16:06:18,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:06:18,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 16:06:18,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-14 16:06:18,361 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-14 16:06:18,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 267 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-14 16:06:18,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:06:18,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-14 16:06:18,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:06:18,496 INFO L124 PetriNetUnfolderBase]: 154/286 cut-off events. [2024-06-14 16:06:18,496 INFO L125 PetriNetUnfolderBase]: For 1202/1205 co-relation queries the response was YES. [2024-06-14 16:06:18,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1108 conditions, 286 events. 154/286 cut-off events. For 1202/1205 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 960 event pairs, 53 based on Foata normal form. 4/286 useless extension candidates. Maximal degree in co-relation 1081. Up to 239 conditions per place. [2024-06-14 16:06:18,498 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 30 selfloop transitions, 16 changer transitions 0/48 dead transitions. [2024-06-14 16:06:18,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 48 transitions, 375 flow [2024-06-14 16:06:18,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 16:06:18,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 16:06:18,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2024-06-14 16:06:18,499 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2024-06-14 16:06:18,499 INFO L175 Difference]: Start difference. First operand has 51 places, 42 transitions, 267 flow. Second operand 6 states and 66 transitions. [2024-06-14 16:06:18,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 48 transitions, 375 flow [2024-06-14 16:06:18,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 48 transitions, 345 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-14 16:06:18,501 INFO L231 Difference]: Finished difference. Result has 53 places, 42 transitions, 276 flow [2024-06-14 16:06:18,502 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=276, PETRI_PLACES=53, PETRI_TRANSITIONS=42} [2024-06-14 16:06:18,502 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 24 predicate places. [2024-06-14 16:06:18,502 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 42 transitions, 276 flow [2024-06-14 16:06:18,502 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-14 16:06:18,502 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:06:18,503 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:06:18,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-14 16:06:18,503 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-14 16:06:18,503 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:06:18,503 INFO L85 PathProgramCache]: Analyzing trace with hash 312287525, now seen corresponding path program 1 times [2024-06-14 16:06:18,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:06:18,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2615871] [2024-06-14 16:06:18,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:06:18,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:06:18,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:06:21,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:06:21,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:06:21,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2615871] [2024-06-14 16:06:21,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2615871] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:06:21,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:06:21,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 16:06:21,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785600183] [2024-06-14 16:06:21,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:06:21,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 16:06:21,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:06:21,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 16:06:21,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-14 16:06:21,474 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-14 16:06:21,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 42 transitions, 276 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-14 16:06:21,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:06:21,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-14 16:06:21,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:06:21,671 INFO L124 PetriNetUnfolderBase]: 173/319 cut-off events. [2024-06-14 16:06:21,672 INFO L125 PetriNetUnfolderBase]: For 1243/1243 co-relation queries the response was YES. [2024-06-14 16:06:21,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1202 conditions, 319 events. 173/319 cut-off events. For 1243/1243 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1115 event pairs, 38 based on Foata normal form. 4/318 useless extension candidates. Maximal degree in co-relation 1174. Up to 192 conditions per place. [2024-06-14 16:06:21,674 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 39 selfloop transitions, 23 changer transitions 0/64 dead transitions. [2024-06-14 16:06:21,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 64 transitions, 504 flow [2024-06-14 16:06:21,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 16:06:21,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 16:06:21,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 85 transitions. [2024-06-14 16:06:21,675 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40476190476190477 [2024-06-14 16:06:21,675 INFO L175 Difference]: Start difference. First operand has 53 places, 42 transitions, 276 flow. Second operand 7 states and 85 transitions. [2024-06-14 16:06:21,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 64 transitions, 504 flow [2024-06-14 16:06:21,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 64 transitions, 459 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-14 16:06:21,678 INFO L231 Difference]: Finished difference. Result has 56 places, 51 transitions, 352 flow [2024-06-14 16:06:21,678 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=352, PETRI_PLACES=56, PETRI_TRANSITIONS=51} [2024-06-14 16:06:21,678 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 27 predicate places. [2024-06-14 16:06:21,678 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 51 transitions, 352 flow [2024-06-14 16:06:21,679 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-14 16:06:21,679 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:06:21,679 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:06:21,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-14 16:06:21,679 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-14 16:06:21,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:06:21,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1229324189, now seen corresponding path program 1 times [2024-06-14 16:06:21,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:06:21,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042692841] [2024-06-14 16:06:21,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:06:21,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:06:21,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:06:24,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:06:24,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:06:24,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042692841] [2024-06-14 16:06:24,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042692841] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:06:24,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:06:24,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 16:06:24,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474412098] [2024-06-14 16:06:24,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:06:24,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 16:06:24,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:06:24,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 16:06:24,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-14 16:06:24,117 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-14 16:06:24,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 51 transitions, 352 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-14 16:06:24,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:06:24,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-14 16:06:24,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:06:24,306 INFO L124 PetriNetUnfolderBase]: 183/335 cut-off events. [2024-06-14 16:06:24,307 INFO L125 PetriNetUnfolderBase]: For 1468/1468 co-relation queries the response was YES. [2024-06-14 16:06:24,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1415 conditions, 335 events. 183/335 cut-off events. For 1468/1468 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1178 event pairs, 33 based on Foata normal form. 2/335 useless extension candidates. Maximal degree in co-relation 1385. Up to 281 conditions per place. [2024-06-14 16:06:24,309 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 54 selfloop transitions, 17 changer transitions 0/73 dead transitions. [2024-06-14 16:06:24,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 73 transitions, 574 flow [2024-06-14 16:06:24,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:06:24,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:06:24,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 87 transitions. [2024-06-14 16:06:24,310 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3625 [2024-06-14 16:06:24,311 INFO L175 Difference]: Start difference. First operand has 56 places, 51 transitions, 352 flow. Second operand 8 states and 87 transitions. [2024-06-14 16:06:24,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 73 transitions, 574 flow [2024-06-14 16:06:24,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 73 transitions, 550 flow, removed 7 selfloop flow, removed 2 redundant places. [2024-06-14 16:06:24,314 INFO L231 Difference]: Finished difference. Result has 64 places, 58 transitions, 423 flow [2024-06-14 16:06:24,314 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=423, PETRI_PLACES=64, PETRI_TRANSITIONS=58} [2024-06-14 16:06:24,314 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 35 predicate places. [2024-06-14 16:06:24,314 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 58 transitions, 423 flow [2024-06-14 16:06:24,315 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-14 16:06:24,315 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:06:24,315 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:06:24,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-14 16:06:24,315 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-14 16:06:24,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:06:24,315 INFO L85 PathProgramCache]: Analyzing trace with hash -584554399, now seen corresponding path program 2 times [2024-06-14 16:06:24,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:06:24,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531765661] [2024-06-14 16:06:24,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:06:24,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:06:24,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:06:26,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:06:26,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:06:26,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531765661] [2024-06-14 16:06:26,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531765661] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:06:26,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:06:26,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 16:06:26,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545339809] [2024-06-14 16:06:26,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:06:26,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 16:06:26,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:06:26,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 16:06:26,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-14 16:06:27,002 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-14 16:06:27,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 58 transitions, 423 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-14 16:06:27,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:06:27,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-14 16:06:27,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:06:27,209 INFO L124 PetriNetUnfolderBase]: 189/345 cut-off events. [2024-06-14 16:06:27,209 INFO L125 PetriNetUnfolderBase]: For 1876/1876 co-relation queries the response was YES. [2024-06-14 16:06:27,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1605 conditions, 345 events. 189/345 cut-off events. For 1876/1876 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1212 event pairs, 32 based on Foata normal form. 2/345 useless extension candidates. Maximal degree in co-relation 1571. Up to 285 conditions per place. [2024-06-14 16:06:27,211 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 53 selfloop transitions, 18 changer transitions 0/73 dead transitions. [2024-06-14 16:06:27,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 73 transitions, 629 flow [2024-06-14 16:06:27,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 16:06:27,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 16:06:27,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 78 transitions. [2024-06-14 16:06:27,213 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37142857142857144 [2024-06-14 16:06:27,213 INFO L175 Difference]: Start difference. First operand has 64 places, 58 transitions, 423 flow. Second operand 7 states and 78 transitions. [2024-06-14 16:06:27,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 73 transitions, 629 flow [2024-06-14 16:06:27,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 73 transitions, 607 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-14 16:06:27,217 INFO L231 Difference]: Finished difference. Result has 68 places, 60 transitions, 469 flow [2024-06-14 16:06:27,217 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=401, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=469, PETRI_PLACES=68, PETRI_TRANSITIONS=60} [2024-06-14 16:06:27,217 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 39 predicate places. [2024-06-14 16:06:27,217 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 60 transitions, 469 flow [2024-06-14 16:06:27,217 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-14 16:06:27,218 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:06:27,218 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:06:27,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-14 16:06:27,218 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-14 16:06:27,218 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:06:27,218 INFO L85 PathProgramCache]: Analyzing trace with hash 913601579, now seen corresponding path program 3 times [2024-06-14 16:06:27,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:06:27,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070172661] [2024-06-14 16:06:27,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:06:27,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:06:27,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:06:29,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:06:29,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:06:29,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070172661] [2024-06-14 16:06:29,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070172661] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:06:29,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:06:29,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 16:06:29,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715341684] [2024-06-14 16:06:29,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:06:29,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 16:06:29,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:06:29,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 16:06:29,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 16:06:30,037 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-14 16:06:30,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 60 transitions, 469 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-14 16:06:30,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:06:30,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-14 16:06:30,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:06:30,235 INFO L124 PetriNetUnfolderBase]: 200/363 cut-off events. [2024-06-14 16:06:30,235 INFO L125 PetriNetUnfolderBase]: For 2422/2422 co-relation queries the response was YES. [2024-06-14 16:06:30,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1793 conditions, 363 events. 200/363 cut-off events. For 2422/2422 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1299 event pairs, 32 based on Foata normal form. 2/363 useless extension candidates. Maximal degree in co-relation 1758. Up to 285 conditions per place. [2024-06-14 16:06:30,237 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 53 selfloop transitions, 22 changer transitions 0/77 dead transitions. [2024-06-14 16:06:30,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 77 transitions, 735 flow [2024-06-14 16:06:30,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 16:06:30,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 16:06:30,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2024-06-14 16:06:30,240 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3761904761904762 [2024-06-14 16:06:30,240 INFO L175 Difference]: Start difference. First operand has 68 places, 60 transitions, 469 flow. Second operand 7 states and 79 transitions. [2024-06-14 16:06:30,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 77 transitions, 735 flow [2024-06-14 16:06:30,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 77 transitions, 683 flow, removed 11 selfloop flow, removed 5 redundant places. [2024-06-14 16:06:30,244 INFO L231 Difference]: Finished difference. Result has 70 places, 64 transitions, 521 flow [2024-06-14 16:06:30,244 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=427, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=521, PETRI_PLACES=70, PETRI_TRANSITIONS=64} [2024-06-14 16:06:30,245 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 41 predicate places. [2024-06-14 16:06:30,245 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 64 transitions, 521 flow [2024-06-14 16:06:30,245 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-14 16:06:30,245 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:06:30,245 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:06:30,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-14 16:06:30,245 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-14 16:06:30,246 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:06:30,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1090733099, now seen corresponding path program 4 times [2024-06-14 16:06:30,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:06:30,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600166146] [2024-06-14 16:06:30,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:06:30,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:06:30,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:06:32,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:06:32,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:06:32,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600166146] [2024-06-14 16:06:32,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600166146] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:06:32,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:06:32,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 16:06:32,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604780447] [2024-06-14 16:06:32,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:06:32,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 16:06:32,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:06:32,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 16:06:32,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 16:06:33,017 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-14 16:06:33,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 64 transitions, 521 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-14 16:06:33,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:06:33,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-14 16:06:33,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:06:33,219 INFO L124 PetriNetUnfolderBase]: 210/383 cut-off events. [2024-06-14 16:06:33,219 INFO L125 PetriNetUnfolderBase]: For 2702/2708 co-relation queries the response was YES. [2024-06-14 16:06:33,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1806 conditions, 383 events. 210/383 cut-off events. For 2702/2708 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1420 event pairs, 39 based on Foata normal form. 7/384 useless extension candidates. Maximal degree in co-relation 1770. Up to 193 conditions per place. [2024-06-14 16:06:33,223 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 50 selfloop transitions, 31 changer transitions 0/83 dead transitions. [2024-06-14 16:06:33,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 83 transitions, 807 flow [2024-06-14 16:06:33,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 16:06:33,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 16:06:33,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2024-06-14 16:06:33,224 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4142857142857143 [2024-06-14 16:06:33,224 INFO L175 Difference]: Start difference. First operand has 70 places, 64 transitions, 521 flow. Second operand 7 states and 87 transitions. [2024-06-14 16:06:33,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 83 transitions, 807 flow [2024-06-14 16:06:33,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 83 transitions, 785 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-14 16:06:33,229 INFO L231 Difference]: Finished difference. Result has 75 places, 71 transitions, 623 flow [2024-06-14 16:06:33,229 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=499, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=623, PETRI_PLACES=75, PETRI_TRANSITIONS=71} [2024-06-14 16:06:33,230 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 46 predicate places. [2024-06-14 16:06:33,230 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 71 transitions, 623 flow [2024-06-14 16:06:33,230 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-14 16:06:33,230 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:06:33,230 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:06:33,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-14 16:06:33,231 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-14 16:06:33,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:06:33,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1090979363, now seen corresponding path program 1 times [2024-06-14 16:06:33,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:06:33,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763074916] [2024-06-14 16:06:33,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:06:33,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:06:33,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:06:36,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:06:36,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:06:36,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763074916] [2024-06-14 16:06:36,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763074916] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:06:36,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:06:36,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:06:36,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685771102] [2024-06-14 16:06:36,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:06:36,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:06:36,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:06:36,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:06:36,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:06:36,268 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-14 16:06:36,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 71 transitions, 623 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-14 16:06:36,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:06:36,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-14 16:06:36,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:06:36,502 INFO L124 PetriNetUnfolderBase]: 230/435 cut-off events. [2024-06-14 16:06:36,502 INFO L125 PetriNetUnfolderBase]: For 3545/3551 co-relation queries the response was YES. [2024-06-14 16:06:36,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2103 conditions, 435 events. 230/435 cut-off events. For 3545/3551 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1714 event pairs, 42 based on Foata normal form. 15/444 useless extension candidates. Maximal degree in co-relation 2064. Up to 209 conditions per place. [2024-06-14 16:06:36,505 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 53 selfloop transitions, 35 changer transitions 0/90 dead transitions. [2024-06-14 16:06:36,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 90 transitions, 925 flow [2024-06-14 16:06:36,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:06:36,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:06:36,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 97 transitions. [2024-06-14 16:06:36,506 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4041666666666667 [2024-06-14 16:06:36,507 INFO L175 Difference]: Start difference. First operand has 75 places, 71 transitions, 623 flow. Second operand 8 states and 97 transitions. [2024-06-14 16:06:36,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 90 transitions, 925 flow [2024-06-14 16:06:36,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 90 transitions, 882 flow, removed 10 selfloop flow, removed 3 redundant places. [2024-06-14 16:06:36,514 INFO L231 Difference]: Finished difference. Result has 80 places, 72 transitions, 668 flow [2024-06-14 16:06:36,514 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=580, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=668, PETRI_PLACES=80, PETRI_TRANSITIONS=72} [2024-06-14 16:06:36,515 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 51 predicate places. [2024-06-14 16:06:36,516 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 72 transitions, 668 flow [2024-06-14 16:06:36,516 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-14 16:06:36,516 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:06:36,516 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:06:36,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-14 16:06:36,516 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-14 16:06:36,517 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:06:36,517 INFO L85 PathProgramCache]: Analyzing trace with hash 289667238, now seen corresponding path program 1 times [2024-06-14 16:06:36,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:06:36,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504866468] [2024-06-14 16:06:36,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:06:36,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:06:36,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:06:39,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:06:39,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:06:39,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504866468] [2024-06-14 16:06:39,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504866468] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:06:39,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:06:39,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:06:39,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302754785] [2024-06-14 16:06:39,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:06:39,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:06:39,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:06:39,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:06:39,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:06:39,254 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-14 16:06:39,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 72 transitions, 668 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-14 16:06:39,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:06:39,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-14 16:06:39,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:06:39,508 INFO L124 PetriNetUnfolderBase]: 237/446 cut-off events. [2024-06-14 16:06:39,508 INFO L125 PetriNetUnfolderBase]: For 2968/2968 co-relation queries the response was YES. [2024-06-14 16:06:39,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2243 conditions, 446 events. 237/446 cut-off events. For 2968/2968 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1797 event pairs, 44 based on Foata normal form. 1/445 useless extension candidates. Maximal degree in co-relation 2203. Up to 386 conditions per place. [2024-06-14 16:06:39,511 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 69 selfloop transitions, 20 changer transitions 0/91 dead transitions. [2024-06-14 16:06:39,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 91 transitions, 946 flow [2024-06-14 16:06:39,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:06:39,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:06:39,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2024-06-14 16:06:39,513 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2024-06-14 16:06:39,513 INFO L175 Difference]: Start difference. First operand has 80 places, 72 transitions, 668 flow. Second operand 8 states and 88 transitions. [2024-06-14 16:06:39,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 91 transitions, 946 flow [2024-06-14 16:06:39,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 91 transitions, 860 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-14 16:06:39,520 INFO L231 Difference]: Finished difference. Result has 83 places, 77 transitions, 699 flow [2024-06-14 16:06:39,520 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=590, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=699, PETRI_PLACES=83, PETRI_TRANSITIONS=77} [2024-06-14 16:06:39,520 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 54 predicate places. [2024-06-14 16:06:39,521 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 77 transitions, 699 flow [2024-06-14 16:06:39,521 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-14 16:06:39,521 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:06:39,521 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:06:39,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-14 16:06:39,521 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-14 16:06:39,522 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:06:39,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1746930940, now seen corresponding path program 2 times [2024-06-14 16:06:39,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:06:39,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251618911] [2024-06-14 16:06:39,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:06:39,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:06:39,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:06:42,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:06:42,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:06:42,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251618911] [2024-06-14 16:06:42,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251618911] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:06:42,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:06:42,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:06:42,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970854000] [2024-06-14 16:06:42,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:06:42,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:06:42,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:06:42,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:06:42,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:06:42,384 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-14 16:06:42,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 77 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-14 16:06:42,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:06:42,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-14 16:06:42,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:06:42,634 INFO L124 PetriNetUnfolderBase]: 235/443 cut-off events. [2024-06-14 16:06:42,634 INFO L125 PetriNetUnfolderBase]: For 3092/3092 co-relation queries the response was YES. [2024-06-14 16:06:42,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2191 conditions, 443 events. 235/443 cut-off events. For 3092/3092 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1766 event pairs, 44 based on Foata normal form. 1/442 useless extension candidates. Maximal degree in co-relation 2149. Up to 374 conditions per place. [2024-06-14 16:06:42,637 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 65 selfloop transitions, 22 changer transitions 0/89 dead transitions. [2024-06-14 16:06:42,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 89 transitions, 913 flow [2024-06-14 16:06:42,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 16:06:42,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 16:06:42,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 78 transitions. [2024-06-14 16:06:42,639 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37142857142857144 [2024-06-14 16:06:42,639 INFO L175 Difference]: Start difference. First operand has 83 places, 77 transitions, 699 flow. Second operand 7 states and 78 transitions. [2024-06-14 16:06:42,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 89 transitions, 913 flow [2024-06-14 16:06:42,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 89 transitions, 871 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-14 16:06:42,646 INFO L231 Difference]: Finished difference. Result has 85 places, 77 transitions, 715 flow [2024-06-14 16:06:42,647 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=657, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=715, PETRI_PLACES=85, PETRI_TRANSITIONS=77} [2024-06-14 16:06:42,647 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 56 predicate places. [2024-06-14 16:06:42,647 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 77 transitions, 715 flow [2024-06-14 16:06:42,647 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-14 16:06:42,647 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:06:42,648 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:06:42,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-14 16:06:42,648 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-14 16:06:42,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:06:42,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1718909537, now seen corresponding path program 1 times [2024-06-14 16:06:42,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:06:42,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121025163] [2024-06-14 16:06:42,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:06:42,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:06:42,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:06:45,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:06:45,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:06:45,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121025163] [2024-06-14 16:06:45,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121025163] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:06:45,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:06:45,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 16:06:45,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293286101] [2024-06-14 16:06:45,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:06:45,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 16:06:45,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:06:45,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 16:06:45,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 16:06:45,366 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-14 16:06:45,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 77 transitions, 715 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-14 16:06:45,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:06:45,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-14 16:06:45,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:06:45,588 INFO L124 PetriNetUnfolderBase]: 241/454 cut-off events. [2024-06-14 16:06:45,588 INFO L125 PetriNetUnfolderBase]: For 3739/3745 co-relation queries the response was YES. [2024-06-14 16:06:45,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2277 conditions, 454 events. 241/454 cut-off events. For 3739/3745 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1850 event pairs, 50 based on Foata normal form. 6/455 useless extension candidates. Maximal degree in co-relation 2234. Up to 378 conditions per place. [2024-06-14 16:06:45,591 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 67 selfloop transitions, 20 changer transitions 1/90 dead transitions. [2024-06-14 16:06:45,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 90 transitions, 946 flow [2024-06-14 16:06:45,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 16:06:45,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 16:06:45,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 77 transitions. [2024-06-14 16:06:45,593 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2024-06-14 16:06:45,594 INFO L175 Difference]: Start difference. First operand has 85 places, 77 transitions, 715 flow. Second operand 7 states and 77 transitions. [2024-06-14 16:06:45,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 90 transitions, 946 flow [2024-06-14 16:06:45,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 90 transitions, 878 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-14 16:06:45,603 INFO L231 Difference]: Finished difference. Result has 85 places, 78 transitions, 704 flow [2024-06-14 16:06:45,603 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=647, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=704, PETRI_PLACES=85, PETRI_TRANSITIONS=78} [2024-06-14 16:06:45,603 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 56 predicate places. [2024-06-14 16:06:45,604 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 78 transitions, 704 flow [2024-06-14 16:06:45,605 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-14 16:06:45,605 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:06:45,606 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:06:45,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-14 16:06:45,606 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-14 16:06:45,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:06:45,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1163541781, now seen corresponding path program 2 times [2024-06-14 16:06:45,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:06:45,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022061531] [2024-06-14 16:06:45,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:06:45,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:06:45,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:06:48,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-14 16:06:48,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:06:48,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022061531] [2024-06-14 16:06:48,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022061531] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:06:48,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:06:48,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 16:06:48,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471399542] [2024-06-14 16:06:48,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:06:48,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 16:06:48,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:06:48,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 16:06:48,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 16:06:48,393 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-14 16:06:48,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 78 transitions, 704 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-14 16:06:48,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:06:48,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-14 16:06:48,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:06:48,572 INFO L124 PetriNetUnfolderBase]: 239/454 cut-off events. [2024-06-14 16:06:48,572 INFO L125 PetriNetUnfolderBase]: For 3469/3475 co-relation queries the response was YES. [2024-06-14 16:06:48,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2217 conditions, 454 events. 239/454 cut-off events. For 3469/3475 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1863 event pairs, 52 based on Foata normal form. 5/453 useless extension candidates. Maximal degree in co-relation 2174. Up to 250 conditions per place. [2024-06-14 16:06:48,575 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 47 selfloop transitions, 42 changer transitions 1/92 dead transitions. [2024-06-14 16:06:48,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 92 transitions, 1003 flow [2024-06-14 16:06:48,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 16:06:48,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 16:06:48,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 86 transitions. [2024-06-14 16:06:48,578 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2024-06-14 16:06:48,578 INFO L175 Difference]: Start difference. First operand has 85 places, 78 transitions, 704 flow. Second operand 7 states and 86 transitions. [2024-06-14 16:06:48,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 92 transitions, 1003 flow [2024-06-14 16:06:48,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 92 transitions, 964 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-06-14 16:06:48,585 INFO L231 Difference]: Finished difference. Result has 87 places, 79 transitions, 768 flow [2024-06-14 16:06:48,585 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=665, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=768, PETRI_PLACES=87, PETRI_TRANSITIONS=79} [2024-06-14 16:06:48,586 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 58 predicate places. [2024-06-14 16:06:48,586 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 79 transitions, 768 flow [2024-06-14 16:06:48,586 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-14 16:06:48,586 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:06:48,586 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:06:48,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-14 16:06:48,586 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-14 16:06:48,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:06:48,587 INFO L85 PathProgramCache]: Analyzing trace with hash -332378461, now seen corresponding path program 3 times [2024-06-14 16:06:48,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:06:48,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280729922] [2024-06-14 16:06:48,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:06:48,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:06:48,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:06:51,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:06:51,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:06:51,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280729922] [2024-06-14 16:06:51,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280729922] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:06:51,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:06:51,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 16:06:51,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789020607] [2024-06-14 16:06:51,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:06:51,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 16:06:51,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:06:51,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 16:06:51,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 16:06:51,339 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-14 16:06:51,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 79 transitions, 768 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-14 16:06:51,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:06:51,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-14 16:06:51,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:06:51,515 INFO L124 PetriNetUnfolderBase]: 234/447 cut-off events. [2024-06-14 16:06:51,515 INFO L125 PetriNetUnfolderBase]: For 3666/3672 co-relation queries the response was YES. [2024-06-14 16:06:51,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2286 conditions, 447 events. 234/447 cut-off events. For 3666/3672 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1857 event pairs, 49 based on Foata normal form. 3/444 useless extension candidates. Maximal degree in co-relation 2242. Up to 248 conditions per place. [2024-06-14 16:06:51,518 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 51 selfloop transitions, 38 changer transitions 1/92 dead transitions. [2024-06-14 16:06:51,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 92 transitions, 1043 flow [2024-06-14 16:06:51,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 16:06:51,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 16:06:51,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 83 transitions. [2024-06-14 16:06:51,520 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3952380952380952 [2024-06-14 16:06:51,520 INFO L175 Difference]: Start difference. First operand has 87 places, 79 transitions, 768 flow. Second operand 7 states and 83 transitions. [2024-06-14 16:06:51,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 92 transitions, 1043 flow [2024-06-14 16:06:51,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 92 transitions, 948 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-14 16:06:51,527 INFO L231 Difference]: Finished difference. Result has 89 places, 80 transitions, 768 flow [2024-06-14 16:06:51,527 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=675, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=768, PETRI_PLACES=89, PETRI_TRANSITIONS=80} [2024-06-14 16:06:51,528 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 60 predicate places. [2024-06-14 16:06:51,528 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 80 transitions, 768 flow [2024-06-14 16:06:51,528 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-14 16:06:51,528 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:06:51,528 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:06:51,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-14 16:06:51,528 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-14 16:06:51,529 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:06:51,529 INFO L85 PathProgramCache]: Analyzing trace with hash -539654234, now seen corresponding path program 1 times [2024-06-14 16:06:51,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:06:51,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818493661] [2024-06-14 16:06:51,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:06:51,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:06:51,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:06:54,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:06:54,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:06:54,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818493661] [2024-06-14 16:06:54,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818493661] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:06:54,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:06:54,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 16:06:54,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62441328] [2024-06-14 16:06:54,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:06:54,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 16:06:54,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:06:54,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 16:06:54,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-14 16:06:54,433 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-14 16:06:54,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 80 transitions, 768 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-14 16:06:54,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:06:54,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-14 16:06:54,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:06:54,600 INFO L124 PetriNetUnfolderBase]: 222/429 cut-off events. [2024-06-14 16:06:54,601 INFO L125 PetriNetUnfolderBase]: For 3728/3734 co-relation queries the response was YES. [2024-06-14 16:06:54,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2204 conditions, 429 events. 222/429 cut-off events. For 3728/3734 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1762 event pairs, 52 based on Foata normal form. 4/427 useless extension candidates. Maximal degree in co-relation 2159. Up to 267 conditions per place. [2024-06-14 16:06:54,604 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 59 selfloop transitions, 32 changer transitions 0/93 dead transitions. [2024-06-14 16:06:54,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 93 transitions, 1047 flow [2024-06-14 16:06:54,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 16:06:54,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 16:06:54,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 83 transitions. [2024-06-14 16:06:54,605 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3952380952380952 [2024-06-14 16:06:54,605 INFO L175 Difference]: Start difference. First operand has 89 places, 80 transitions, 768 flow. Second operand 7 states and 83 transitions. [2024-06-14 16:06:54,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 93 transitions, 1047 flow [2024-06-14 16:06:54,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 93 transitions, 992 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-14 16:06:54,613 INFO L231 Difference]: Finished difference. Result has 92 places, 82 transitions, 811 flow [2024-06-14 16:06:54,613 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=715, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=811, PETRI_PLACES=92, PETRI_TRANSITIONS=82} [2024-06-14 16:06:54,613 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 63 predicate places. [2024-06-14 16:06:54,614 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 82 transitions, 811 flow [2024-06-14 16:06:54,614 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-14 16:06:54,614 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:06:54,614 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:06:54,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-14 16:06:54,614 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-14 16:06:54,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:06:54,615 INFO L85 PathProgramCache]: Analyzing trace with hash -539387324, now seen corresponding path program 2 times [2024-06-14 16:06:54,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:06:54,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701616870] [2024-06-14 16:06:54,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:06:54,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:06:54,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:06:57,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:06:57,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:06:57,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701616870] [2024-06-14 16:06:57,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701616870] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:06:57,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:06:57,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 16:06:57,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908737401] [2024-06-14 16:06:57,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:06:57,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 16:06:57,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:06:57,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 16:06:57,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-14 16:06:57,498 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-14 16:06:57,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 82 transitions, 811 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-14 16:06:57,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:06:57,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-14 16:06:57,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:06:57,684 INFO L124 PetriNetUnfolderBase]: 218/422 cut-off events. [2024-06-14 16:06:57,684 INFO L125 PetriNetUnfolderBase]: For 3722/3728 co-relation queries the response was YES. [2024-06-14 16:06:57,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2179 conditions, 422 events. 218/422 cut-off events. For 3722/3728 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1722 event pairs, 51 based on Foata normal form. 2/418 useless extension candidates. Maximal degree in co-relation 2133. Up to 247 conditions per place. [2024-06-14 16:06:57,687 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 56 selfloop transitions, 34 changer transitions 0/92 dead transitions. [2024-06-14 16:06:57,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 92 transitions, 1061 flow [2024-06-14 16:06:57,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 16:06:57,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 16:06:57,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 81 transitions. [2024-06-14 16:06:57,691 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38571428571428573 [2024-06-14 16:06:57,691 INFO L175 Difference]: Start difference. First operand has 92 places, 82 transitions, 811 flow. Second operand 7 states and 81 transitions. [2024-06-14 16:06:57,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 92 transitions, 1061 flow [2024-06-14 16:06:57,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 92 transitions, 965 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-06-14 16:06:57,699 INFO L231 Difference]: Finished difference. Result has 94 places, 82 transitions, 788 flow [2024-06-14 16:06:57,699 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=715, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=788, PETRI_PLACES=94, PETRI_TRANSITIONS=82} [2024-06-14 16:06:57,699 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 65 predicate places. [2024-06-14 16:06:57,699 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 82 transitions, 788 flow [2024-06-14 16:06:57,699 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-14 16:06:57,699 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:06:57,699 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:06:57,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-14 16:06:57,700 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-14 16:06:57,700 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:06:57,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1298332010, now seen corresponding path program 1 times [2024-06-14 16:06:57,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:06:57,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211083389] [2024-06-14 16:06:57,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:06:57,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:06:57,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:07:00,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:07:00,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:07:00,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211083389] [2024-06-14 16:07:00,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211083389] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:07:00,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:07:00,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 16:07:00,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814268863] [2024-06-14 16:07:00,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:07:00,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 16:07:00,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:07:00,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 16:07:00,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 16:07:00,684 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-14 16:07:00,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 82 transitions, 788 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-14 16:07:00,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:07:00,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-14 16:07:00,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:07:00,943 INFO L124 PetriNetUnfolderBase]: 222/429 cut-off events. [2024-06-14 16:07:00,944 INFO L125 PetriNetUnfolderBase]: For 4017/4017 co-relation queries the response was YES. [2024-06-14 16:07:00,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2204 conditions, 429 events. 222/429 cut-off events. For 4017/4017 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1746 event pairs, 31 based on Foata normal form. 2/429 useless extension candidates. Maximal degree in co-relation 2157. Up to 349 conditions per place. [2024-06-14 16:07:00,947 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 79 selfloop transitions, 16 changer transitions 0/97 dead transitions. [2024-06-14 16:07:00,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 97 transitions, 1024 flow [2024-06-14 16:07:00,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:07:00,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:07:00,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 84 transitions. [2024-06-14 16:07:00,948 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35 [2024-06-14 16:07:00,948 INFO L175 Difference]: Start difference. First operand has 94 places, 82 transitions, 788 flow. Second operand 8 states and 84 transitions. [2024-06-14 16:07:00,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 97 transitions, 1024 flow [2024-06-14 16:07:00,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 97 transitions, 942 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-14 16:07:00,956 INFO L231 Difference]: Finished difference. Result has 96 places, 83 transitions, 750 flow [2024-06-14 16:07:00,957 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=706, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=750, PETRI_PLACES=96, PETRI_TRANSITIONS=83} [2024-06-14 16:07:00,957 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 67 predicate places. [2024-06-14 16:07:00,957 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 83 transitions, 750 flow [2024-06-14 16:07:00,957 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-14 16:07:00,957 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:07:00,957 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:07:00,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-14 16:07:00,958 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-14 16:07:00,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:07:00,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1746707726, now seen corresponding path program 2 times [2024-06-14 16:07:00,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:07:00,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446101972] [2024-06-14 16:07:00,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:07:00,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:07:00,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:07:03,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:07:03,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:07:03,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446101972] [2024-06-14 16:07:03,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446101972] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:07:03,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:07:03,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 16:07:03,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047303927] [2024-06-14 16:07:03,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:07:03,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 16:07:03,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:07:03,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 16:07:03,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-14 16:07:04,051 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-14 16:07:04,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 83 transitions, 750 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-14 16:07:04,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:07:04,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-14 16:07:04,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:07:04,292 INFO L124 PetriNetUnfolderBase]: 226/437 cut-off events. [2024-06-14 16:07:04,292 INFO L125 PetriNetUnfolderBase]: For 4287/4287 co-relation queries the response was YES. [2024-06-14 16:07:04,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2203 conditions, 437 events. 226/437 cut-off events. For 4287/4287 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1799 event pairs, 40 based on Foata normal form. 2/437 useless extension candidates. Maximal degree in co-relation 2155. Up to 356 conditions per place. [2024-06-14 16:07:04,295 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 73 selfloop transitions, 23 changer transitions 0/98 dead transitions. [2024-06-14 16:07:04,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 98 transitions, 994 flow [2024-06-14 16:07:04,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:07:04,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:07:04,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 86 transitions. [2024-06-14 16:07:04,297 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35833333333333334 [2024-06-14 16:07:04,297 INFO L175 Difference]: Start difference. First operand has 96 places, 83 transitions, 750 flow. Second operand 8 states and 86 transitions. [2024-06-14 16:07:04,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 98 transitions, 994 flow [2024-06-14 16:07:04,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 98 transitions, 960 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-14 16:07:04,304 INFO L231 Difference]: Finished difference. Result has 98 places, 84 transitions, 779 flow [2024-06-14 16:07:04,304 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=716, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=779, PETRI_PLACES=98, PETRI_TRANSITIONS=84} [2024-06-14 16:07:04,305 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 69 predicate places. [2024-06-14 16:07:04,305 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 84 transitions, 779 flow [2024-06-14 16:07:04,305 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-14 16:07:04,305 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:07:04,305 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:07:04,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-14 16:07:04,306 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-14 16:07:04,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:07:04,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1679716326, now seen corresponding path program 1 times [2024-06-14 16:07:04,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:07:04,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087615378] [2024-06-14 16:07:04,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:07:04,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:07:04,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:07:07,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:07:07,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:07:07,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087615378] [2024-06-14 16:07:07,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087615378] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:07:07,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:07:07,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:07:07,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053302893] [2024-06-14 16:07:07,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:07:07,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:07:07,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:07:07,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:07:07,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:07:07,141 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-14 16:07:07,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 84 transitions, 779 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-14 16:07:07,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:07:07,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-14 16:07:07,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:07:07,344 INFO L124 PetriNetUnfolderBase]: 221/423 cut-off events. [2024-06-14 16:07:07,344 INFO L125 PetriNetUnfolderBase]: For 4451/4457 co-relation queries the response was YES. [2024-06-14 16:07:07,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2167 conditions, 423 events. 221/423 cut-off events. For 4451/4457 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1716 event pairs, 41 based on Foata normal form. 5/424 useless extension candidates. Maximal degree in co-relation 2118. Up to 336 conditions per place. [2024-06-14 16:07:07,347 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 68 selfloop transitions, 23 changer transitions 2/95 dead transitions. [2024-06-14 16:07:07,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 95 transitions, 1005 flow [2024-06-14 16:07:07,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 16:07:07,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 16:07:07,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 77 transitions. [2024-06-14 16:07:07,348 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2024-06-14 16:07:07,348 INFO L175 Difference]: Start difference. First operand has 98 places, 84 transitions, 779 flow. Second operand 7 states and 77 transitions. [2024-06-14 16:07:07,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 95 transitions, 1005 flow [2024-06-14 16:07:07,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 95 transitions, 956 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-14 16:07:07,356 INFO L231 Difference]: Finished difference. Result has 99 places, 82 transitions, 761 flow [2024-06-14 16:07:07,356 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=730, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=761, PETRI_PLACES=99, PETRI_TRANSITIONS=82} [2024-06-14 16:07:07,356 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 70 predicate places. [2024-06-14 16:07:07,357 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 82 transitions, 761 flow [2024-06-14 16:07:07,357 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-14 16:07:07,357 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:07:07,357 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:07:07,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-14 16:07:07,357 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-14 16:07:07,357 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:07:07,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1710234134, now seen corresponding path program 3 times [2024-06-14 16:07:07,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:07:07,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111427490] [2024-06-14 16:07:07,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:07:07,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:07:07,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:07:10,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:07:10,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:07:10,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111427490] [2024-06-14 16:07:10,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111427490] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:07:10,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:07:10,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 16:07:10,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522934353] [2024-06-14 16:07:10,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:07:10,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 16:07:10,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:07:10,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 16:07:10,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 16:07:10,506 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-14 16:07:10,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 82 transitions, 761 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-14 16:07:10,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:07:10,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-14 16:07:10,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:07:10,754 INFO L124 PetriNetUnfolderBase]: 208/395 cut-off events. [2024-06-14 16:07:10,755 INFO L125 PetriNetUnfolderBase]: For 4902/4902 co-relation queries the response was YES. [2024-06-14 16:07:10,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2092 conditions, 395 events. 208/395 cut-off events. For 4902/4902 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1568 event pairs, 32 based on Foata normal form. 2/395 useless extension candidates. Maximal degree in co-relation 2042. Up to 306 conditions per place. [2024-06-14 16:07:10,758 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 67 selfloop transitions, 27 changer transitions 0/96 dead transitions. [2024-06-14 16:07:10,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 96 transitions, 1003 flow [2024-06-14 16:07:10,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:07:10,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:07:10,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 86 transitions. [2024-06-14 16:07:10,759 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35833333333333334 [2024-06-14 16:07:10,760 INFO L175 Difference]: Start difference. First operand has 99 places, 82 transitions, 761 flow. Second operand 8 states and 86 transitions. [2024-06-14 16:07:10,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 96 transitions, 1003 flow [2024-06-14 16:07:10,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 96 transitions, 914 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-14 16:07:10,768 INFO L231 Difference]: Finished difference. Result has 100 places, 83 transitions, 742 flow [2024-06-14 16:07:10,768 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=672, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=742, PETRI_PLACES=100, PETRI_TRANSITIONS=83} [2024-06-14 16:07:10,769 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2024-06-14 16:07:10,769 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 83 transitions, 742 flow [2024-06-14 16:07:10,769 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-14 16:07:10,769 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:07:10,769 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:07:10,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-14 16:07:10,769 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-14 16:07:10,770 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:07:10,770 INFO L85 PathProgramCache]: Analyzing trace with hash 458862820, now seen corresponding path program 1 times [2024-06-14 16:07:10,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:07:10,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467207894] [2024-06-14 16:07:10,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:07:10,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:07:10,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:07:14,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:07:14,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:07:14,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467207894] [2024-06-14 16:07:14,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467207894] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:07:14,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:07:14,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:07:14,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245966344] [2024-06-14 16:07:14,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:07:14,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:07:14,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:07:14,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:07:14,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:07:14,089 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-14 16:07:14,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 83 transitions, 742 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-14 16:07:14,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:07:14,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-14 16:07:14,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:07:14,316 INFO L124 PetriNetUnfolderBase]: 212/404 cut-off events. [2024-06-14 16:07:14,316 INFO L125 PetriNetUnfolderBase]: For 5070/5076 co-relation queries the response was YES. [2024-06-14 16:07:14,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2109 conditions, 404 events. 212/404 cut-off events. For 5070/5076 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1614 event pairs, 44 based on Foata normal form. 6/406 useless extension candidates. Maximal degree in co-relation 2058. Up to 335 conditions per place. [2024-06-14 16:07:14,320 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 69 selfloop transitions, 24 changer transitions 0/95 dead transitions. [2024-06-14 16:07:14,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 95 transitions, 974 flow [2024-06-14 16:07:14,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 16:07:14,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 16:07:14,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 91 transitions. [2024-06-14 16:07:14,323 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.337037037037037 [2024-06-14 16:07:14,323 INFO L175 Difference]: Start difference. First operand has 100 places, 83 transitions, 742 flow. Second operand 9 states and 91 transitions. [2024-06-14 16:07:14,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 95 transitions, 974 flow [2024-06-14 16:07:14,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 95 transitions, 914 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-14 16:07:14,333 INFO L231 Difference]: Finished difference. Result has 104 places, 85 transitions, 763 flow [2024-06-14 16:07:14,333 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=682, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=763, PETRI_PLACES=104, PETRI_TRANSITIONS=85} [2024-06-14 16:07:14,333 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 75 predicate places. [2024-06-14 16:07:14,333 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 85 transitions, 763 flow [2024-06-14 16:07:14,334 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-14 16:07:14,334 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:07:14,334 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:07:14,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-14 16:07:14,334 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-14 16:07:14,334 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:07:14,334 INFO L85 PathProgramCache]: Analyzing trace with hash 459159490, now seen corresponding path program 2 times [2024-06-14 16:07:14,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:07:14,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893581853] [2024-06-14 16:07:14,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:07:14,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:07:14,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:07:17,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:07:17,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:07:17,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893581853] [2024-06-14 16:07:17,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893581853] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:07:17,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:07:17,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:07:17,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096343696] [2024-06-14 16:07:17,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:07:17,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:07:17,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:07:17,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:07:17,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:07:17,411 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-14 16:07:17,411 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 85 transitions, 763 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-14 16:07:17,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:07:17,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-14 16:07:17,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:07:17,655 INFO L124 PetriNetUnfolderBase]: 238/458 cut-off events. [2024-06-14 16:07:17,656 INFO L125 PetriNetUnfolderBase]: For 7294/7300 co-relation queries the response was YES. [2024-06-14 16:07:17,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2440 conditions, 458 events. 238/458 cut-off events. For 7294/7300 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1889 event pairs, 49 based on Foata normal form. 3/455 useless extension candidates. Maximal degree in co-relation 2387. Up to 195 conditions per place. [2024-06-14 16:07:17,660 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 64 selfloop transitions, 36 changer transitions 0/102 dead transitions. [2024-06-14 16:07:17,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 102 transitions, 1071 flow [2024-06-14 16:07:17,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:07:17,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:07:17,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2024-06-14 16:07:17,661 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38333333333333336 [2024-06-14 16:07:17,661 INFO L175 Difference]: Start difference. First operand has 104 places, 85 transitions, 763 flow. Second operand 8 states and 92 transitions. [2024-06-14 16:07:17,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 102 transitions, 1071 flow [2024-06-14 16:07:17,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 102 transitions, 1022 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-14 16:07:17,672 INFO L231 Difference]: Finished difference. Result has 106 places, 85 transitions, 790 flow [2024-06-14 16:07:17,673 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=714, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=790, PETRI_PLACES=106, PETRI_TRANSITIONS=85} [2024-06-14 16:07:17,673 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 77 predicate places. [2024-06-14 16:07:17,673 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 85 transitions, 790 flow [2024-06-14 16:07:17,673 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-14 16:07:17,673 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:07:17,673 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:07:17,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-14 16:07:17,674 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-14 16:07:17,674 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:07:17,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1164883488, now seen corresponding path program 4 times [2024-06-14 16:07:17,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:07:17,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477387901] [2024-06-14 16:07:17,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:07:17,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:07:17,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:07:20,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:07:20,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:07:20,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477387901] [2024-06-14 16:07:20,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477387901] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:07:20,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:07:20,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 16:07:20,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546382483] [2024-06-14 16:07:20,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:07:20,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 16:07:20,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:07:20,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 16:07:20,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 16:07:20,741 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-14 16:07:20,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 85 transitions, 790 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-14 16:07:20,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:07:20,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-14 16:07:20,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:07:20,975 INFO L124 PetriNetUnfolderBase]: 255/497 cut-off events. [2024-06-14 16:07:20,975 INFO L125 PetriNetUnfolderBase]: For 10692/10698 co-relation queries the response was YES. [2024-06-14 16:07:20,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2549 conditions, 497 events. 255/497 cut-off events. For 10692/10698 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2151 event pairs, 60 based on Foata normal form. 15/506 useless extension candidates. Maximal degree in co-relation 2495. Up to 259 conditions per place. [2024-06-14 16:07:20,979 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 55 selfloop transitions, 37 changer transitions 8/102 dead transitions. [2024-06-14 16:07:20,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 102 transitions, 1062 flow [2024-06-14 16:07:20,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:07:20,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:07:20,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 98 transitions. [2024-06-14 16:07:20,980 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4083333333333333 [2024-06-14 16:07:20,980 INFO L175 Difference]: Start difference. First operand has 106 places, 85 transitions, 790 flow. Second operand 8 states and 98 transitions. [2024-06-14 16:07:20,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 102 transitions, 1062 flow [2024-06-14 16:07:20,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 102 transitions, 968 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-14 16:07:20,992 INFO L231 Difference]: Finished difference. Result has 107 places, 82 transitions, 755 flow [2024-06-14 16:07:20,992 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=696, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=755, PETRI_PLACES=107, PETRI_TRANSITIONS=82} [2024-06-14 16:07:20,993 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 78 predicate places. [2024-06-14 16:07:20,993 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 82 transitions, 755 flow [2024-06-14 16:07:20,993 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-14 16:07:20,993 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:07:20,993 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:07:20,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-14 16:07:20,993 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-14 16:07:20,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:07:20,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1593587264, now seen corresponding path program 1 times [2024-06-14 16:07:20,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:07:20,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455052344] [2024-06-14 16:07:20,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:07:20,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:07:21,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:07:24,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:07:24,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:07:24,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455052344] [2024-06-14 16:07:24,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455052344] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:07:24,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:07:24,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 16:07:24,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604491389] [2024-06-14 16:07:24,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:07:24,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 16:07:24,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:07:24,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 16:07:24,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 16:07:24,242 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-14 16:07:24,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 82 transitions, 755 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-14 16:07:24,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:07:24,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-14 16:07:24,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:07:24,443 INFO L124 PetriNetUnfolderBase]: 204/396 cut-off events. [2024-06-14 16:07:24,443 INFO L125 PetriNetUnfolderBase]: For 5025/5031 co-relation queries the response was YES. [2024-06-14 16:07:24,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2017 conditions, 396 events. 204/396 cut-off events. For 5025/5031 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1602 event pairs, 27 based on Foata normal form. 6/398 useless extension candidates. Maximal degree in co-relation 1963. Up to 307 conditions per place. [2024-06-14 16:07:24,446 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 78 selfloop transitions, 16 changer transitions 0/96 dead transitions. [2024-06-14 16:07:24,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 96 transitions, 987 flow [2024-06-14 16:07:24,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:07:24,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:07:24,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 82 transitions. [2024-06-14 16:07:24,449 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3416666666666667 [2024-06-14 16:07:24,449 INFO L175 Difference]: Start difference. First operand has 107 places, 82 transitions, 755 flow. Second operand 8 states and 82 transitions. [2024-06-14 16:07:24,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 96 transitions, 987 flow [2024-06-14 16:07:24,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 96 transitions, 856 flow, removed 9 selfloop flow, removed 9 redundant places. [2024-06-14 16:07:24,458 INFO L231 Difference]: Finished difference. Result has 106 places, 83 transitions, 670 flow [2024-06-14 16:07:24,459 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=626, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=670, PETRI_PLACES=106, PETRI_TRANSITIONS=83} [2024-06-14 16:07:24,459 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 77 predicate places. [2024-06-14 16:07:24,459 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 83 transitions, 670 flow [2024-06-14 16:07:24,459 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-14 16:07:24,459 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:07:24,460 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:07:24,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-14 16:07:24,460 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-14 16:07:24,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:07:24,460 INFO L85 PathProgramCache]: Analyzing trace with hash -843400768, now seen corresponding path program 2 times [2024-06-14 16:07:24,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:07:24,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952459649] [2024-06-14 16:07:24,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:07:24,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:07:24,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:07:27,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-14 16:07:27,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:07:27,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952459649] [2024-06-14 16:07:27,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952459649] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:07:27,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:07:27,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 16:07:27,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731057396] [2024-06-14 16:07:27,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:07:27,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 16:07:27,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:07:27,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 16:07:27,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 16:07:27,422 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-14 16:07:27,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 83 transitions, 670 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-14 16:07:27,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:07:27,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-14 16:07:27,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:07:27,620 INFO L124 PetriNetUnfolderBase]: 215/417 cut-off events. [2024-06-14 16:07:27,621 INFO L125 PetriNetUnfolderBase]: For 5683/5689 co-relation queries the response was YES. [2024-06-14 16:07:27,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2000 conditions, 417 events. 215/417 cut-off events. For 5683/5689 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1724 event pairs, 38 based on Foata normal form. 6/419 useless extension candidates. Maximal degree in co-relation 1947. Up to 299 conditions per place. [2024-06-14 16:07:27,623 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 75 selfloop transitions, 22 changer transitions 0/99 dead transitions. [2024-06-14 16:07:27,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 99 transitions, 972 flow [2024-06-14 16:07:27,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:07:27,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:07:27,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 86 transitions. [2024-06-14 16:07:27,644 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35833333333333334 [2024-06-14 16:07:27,644 INFO L175 Difference]: Start difference. First operand has 106 places, 83 transitions, 670 flow. Second operand 8 states and 86 transitions. [2024-06-14 16:07:27,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 99 transitions, 972 flow [2024-06-14 16:07:27,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 99 transitions, 938 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-14 16:07:27,655 INFO L231 Difference]: Finished difference. Result has 108 places, 85 transitions, 702 flow [2024-06-14 16:07:27,655 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=702, PETRI_PLACES=108, PETRI_TRANSITIONS=85} [2024-06-14 16:07:27,656 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 79 predicate places. [2024-06-14 16:07:27,656 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 85 transitions, 702 flow [2024-06-14 16:07:27,656 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-14 16:07:27,656 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:07:27,656 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:07:27,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-14 16:07:27,656 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-14 16:07:27,656 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:07:27,656 INFO L85 PathProgramCache]: Analyzing trace with hash -843397048, now seen corresponding path program 3 times [2024-06-14 16:07:27,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:07:27,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037907335] [2024-06-14 16:07:27,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:07:27,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:07:27,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:07:30,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:07:30,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:07:30,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037907335] [2024-06-14 16:07:30,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037907335] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:07:30,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:07:30,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 16:07:30,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934747371] [2024-06-14 16:07:30,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:07:30,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 16:07:30,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:07:30,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 16:07:30,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 16:07:30,816 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-14 16:07:30,816 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 85 transitions, 702 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-14 16:07:30,816 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:07:30,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-14 16:07:30,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:07:31,028 INFO L124 PetriNetUnfolderBase]: 212/412 cut-off events. [2024-06-14 16:07:31,029 INFO L125 PetriNetUnfolderBase]: For 5525/5531 co-relation queries the response was YES. [2024-06-14 16:07:31,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1965 conditions, 412 events. 212/412 cut-off events. For 5525/5531 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1694 event pairs, 37 based on Foata normal form. 6/414 useless extension candidates. Maximal degree in co-relation 1911. Up to 317 conditions per place. [2024-06-14 16:07:31,031 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 72 selfloop transitions, 24 changer transitions 0/98 dead transitions. [2024-06-14 16:07:31,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 98 transitions, 938 flow [2024-06-14 16:07:31,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:07:31,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:07:31,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 84 transitions. [2024-06-14 16:07:31,033 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35 [2024-06-14 16:07:31,033 INFO L175 Difference]: Start difference. First operand has 108 places, 85 transitions, 702 flow. Second operand 8 states and 84 transitions. [2024-06-14 16:07:31,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 98 transitions, 938 flow [2024-06-14 16:07:31,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 98 transitions, 900 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-14 16:07:31,044 INFO L231 Difference]: Finished difference. Result has 112 places, 85 transitions, 717 flow [2024-06-14 16:07:31,044 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=664, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=717, PETRI_PLACES=112, PETRI_TRANSITIONS=85} [2024-06-14 16:07:31,044 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 83 predicate places. [2024-06-14 16:07:31,044 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 85 transitions, 717 flow [2024-06-14 16:07:31,045 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-14 16:07:31,045 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:07:31,045 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:07:31,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-14 16:07:31,045 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-14 16:07:31,045 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:07:31,045 INFO L85 PathProgramCache]: Analyzing trace with hash 203800926, now seen corresponding path program 1 times [2024-06-14 16:07:31,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:07:31,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366123991] [2024-06-14 16:07:31,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:07:31,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:07:31,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:07:34,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:07:34,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:07:34,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366123991] [2024-06-14 16:07:34,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366123991] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:07:34,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:07:34,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:07:34,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032064446] [2024-06-14 16:07:34,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:07:34,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:07:34,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:07:34,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:07:34,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:07:34,308 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-14 16:07:34,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 85 transitions, 717 flow. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:07:34,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:07:34,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-14 16:07:34,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:07:34,559 INFO L124 PetriNetUnfolderBase]: 260/512 cut-off events. [2024-06-14 16:07:34,559 INFO L125 PetriNetUnfolderBase]: For 12538/12544 co-relation queries the response was YES. [2024-06-14 16:07:34,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2611 conditions, 512 events. 260/512 cut-off events. For 12538/12544 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2261 event pairs, 51 based on Foata normal form. 9/515 useless extension candidates. Maximal degree in co-relation 2555. Up to 198 conditions per place. [2024-06-14 16:07:34,563 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 57 selfloop transitions, 41 changer transitions 6/106 dead transitions. [2024-06-14 16:07:34,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 106 transitions, 1069 flow [2024-06-14 16:07:34,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:07:34,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:07:34,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 98 transitions. [2024-06-14 16:07:34,578 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4083333333333333 [2024-06-14 16:07:34,578 INFO L175 Difference]: Start difference. First operand has 112 places, 85 transitions, 717 flow. Second operand 8 states and 98 transitions. [2024-06-14 16:07:34,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 106 transitions, 1069 flow [2024-06-14 16:07:34,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 106 transitions, 1016 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-14 16:07:34,596 INFO L231 Difference]: Finished difference. Result has 113 places, 84 transitions, 744 flow [2024-06-14 16:07:34,597 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=664, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=744, PETRI_PLACES=113, PETRI_TRANSITIONS=84} [2024-06-14 16:07:34,597 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 84 predicate places. [2024-06-14 16:07:34,597 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 84 transitions, 744 flow [2024-06-14 16:07:34,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:07:34,597 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:07:34,597 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:07:34,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-14 16:07:34,598 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-14 16:07:34,598 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:07:34,598 INFO L85 PathProgramCache]: Analyzing trace with hash 203793486, now seen corresponding path program 2 times [2024-06-14 16:07:34,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:07:34,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965787650] [2024-06-14 16:07:34,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:07:34,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:07:34,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:07:37,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:07:37,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:07:37,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965787650] [2024-06-14 16:07:37,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965787650] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:07:37,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:07:37,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:07:37,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085757565] [2024-06-14 16:07:37,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:07:37,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:07:37,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:07:37,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:07:37,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:07:37,836 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-14 16:07:37,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 84 transitions, 744 flow. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:07:37,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:07:37,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-14 16:07:37,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:07:38,064 INFO L124 PetriNetUnfolderBase]: 250/498 cut-off events. [2024-06-14 16:07:38,064 INFO L125 PetriNetUnfolderBase]: For 13417/13423 co-relation queries the response was YES. [2024-06-14 16:07:38,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2520 conditions, 498 events. 250/498 cut-off events. For 13417/13423 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2203 event pairs, 61 based on Foata normal form. 13/505 useless extension candidates. Maximal degree in co-relation 2463. Up to 274 conditions per place. [2024-06-14 16:07:38,067 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 52 selfloop transitions, 40 changer transitions 7/101 dead transitions. [2024-06-14 16:07:38,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 101 transitions, 1018 flow [2024-06-14 16:07:38,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:07:38,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:07:38,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 95 transitions. [2024-06-14 16:07:38,077 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2024-06-14 16:07:38,077 INFO L175 Difference]: Start difference. First operand has 113 places, 84 transitions, 744 flow. Second operand 8 states and 95 transitions. [2024-06-14 16:07:38,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 101 transitions, 1018 flow [2024-06-14 16:07:38,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 101 transitions, 934 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-14 16:07:38,095 INFO L231 Difference]: Finished difference. Result has 113 places, 82 transitions, 737 flow [2024-06-14 16:07:38,095 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=660, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=737, PETRI_PLACES=113, PETRI_TRANSITIONS=82} [2024-06-14 16:07:38,096 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 84 predicate places. [2024-06-14 16:07:38,096 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 82 transitions, 737 flow [2024-06-14 16:07:38,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:07:38,096 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:07:38,096 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:07:38,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-14 16:07:38,096 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-14 16:07:38,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:07:38,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1477646264, now seen corresponding path program 4 times [2024-06-14 16:07:38,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:07:38,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035611767] [2024-06-14 16:07:38,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:07:38,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:07:38,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:07:41,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:07:41,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:07:41,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035611767] [2024-06-14 16:07:41,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035611767] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:07:41,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:07:41,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:07:41,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69560053] [2024-06-14 16:07:41,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:07:41,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:07:41,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:07:41,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:07:41,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:07:41,209 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-14 16:07:41,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 82 transitions, 737 flow. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:07:41,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:07:41,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-14 16:07:41,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:07:41,406 INFO L124 PetriNetUnfolderBase]: 208/412 cut-off events. [2024-06-14 16:07:41,406 INFO L125 PetriNetUnfolderBase]: For 6393/6399 co-relation queries the response was YES. [2024-06-14 16:07:41,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2062 conditions, 412 events. 208/412 cut-off events. For 6393/6399 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1728 event pairs, 43 based on Foata normal form. 3/409 useless extension candidates. Maximal degree in co-relation 2005. Up to 236 conditions per place. [2024-06-14 16:07:41,408 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 59 selfloop transitions, 34 changer transitions 0/95 dead transitions. [2024-06-14 16:07:41,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 95 transitions, 979 flow [2024-06-14 16:07:41,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:07:41,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:07:41,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2024-06-14 16:07:41,409 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2024-06-14 16:07:41,409 INFO L175 Difference]: Start difference. First operand has 113 places, 82 transitions, 737 flow. Second operand 8 states and 88 transitions. [2024-06-14 16:07:41,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 95 transitions, 979 flow [2024-06-14 16:07:41,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 95 transitions, 877 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-14 16:07:41,423 INFO L231 Difference]: Finished difference. Result has 114 places, 83 transitions, 721 flow [2024-06-14 16:07:41,423 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=635, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=721, PETRI_PLACES=114, PETRI_TRANSITIONS=83} [2024-06-14 16:07:41,423 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 85 predicate places. [2024-06-14 16:07:41,423 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 83 transitions, 721 flow [2024-06-14 16:07:41,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:07:41,423 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:07:41,424 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:07:41,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-14 16:07:41,424 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-14 16:07:41,424 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:07:41,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1477649984, now seen corresponding path program 5 times [2024-06-14 16:07:41,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:07:41,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232008563] [2024-06-14 16:07:41,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:07:41,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:07:41,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:07:44,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:07:44,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:07:44,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232008563] [2024-06-14 16:07:44,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232008563] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:07:44,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:07:44,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:07:44,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937997590] [2024-06-14 16:07:44,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:07:44,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:07:44,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:07:44,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:07:44,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:07:44,458 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-14 16:07:44,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 83 transitions, 721 flow. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:07:44,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:07:44,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-14 16:07:44,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:07:44,620 INFO L124 PetriNetUnfolderBase]: 205/407 cut-off events. [2024-06-14 16:07:44,620 INFO L125 PetriNetUnfolderBase]: For 5919/5925 co-relation queries the response was YES. [2024-06-14 16:07:44,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1951 conditions, 407 events. 205/407 cut-off events. For 5919/5925 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1698 event pairs, 36 based on Foata normal form. 3/404 useless extension candidates. Maximal degree in co-relation 1893. Up to 195 conditions per place. [2024-06-14 16:07:44,623 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 56 selfloop transitions, 37 changer transitions 0/95 dead transitions. [2024-06-14 16:07:44,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 95 transitions, 947 flow [2024-06-14 16:07:44,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:07:44,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:07:44,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2024-06-14 16:07:44,626 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37083333333333335 [2024-06-14 16:07:44,626 INFO L175 Difference]: Start difference. First operand has 114 places, 83 transitions, 721 flow. Second operand 8 states and 89 transitions. [2024-06-14 16:07:44,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 95 transitions, 947 flow [2024-06-14 16:07:44,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 95 transitions, 871 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-14 16:07:44,638 INFO L231 Difference]: Finished difference. Result has 116 places, 83 transitions, 724 flow [2024-06-14 16:07:44,639 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=645, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=724, PETRI_PLACES=116, PETRI_TRANSITIONS=83} [2024-06-14 16:07:44,639 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 87 predicate places. [2024-06-14 16:07:44,639 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 83 transitions, 724 flow [2024-06-14 16:07:44,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:07:44,639 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:07:44,639 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:07:44,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-14 16:07:44,640 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-14 16:07:44,640 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:07:44,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1083136204, now seen corresponding path program 3 times [2024-06-14 16:07:44,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:07:44,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099756721] [2024-06-14 16:07:44,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:07:44,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:07:44,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:07:47,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:07:47,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:07:47,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099756721] [2024-06-14 16:07:47,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099756721] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:07:47,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:07:47,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 16:07:47,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989205660] [2024-06-14 16:07:47,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:07:47,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 16:07:47,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:07:47,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 16:07:47,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 16:07:47,997 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-14 16:07:47,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 83 transitions, 724 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-14 16:07:47,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:07:47,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-14 16:07:47,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:07:48,211 INFO L124 PetriNetUnfolderBase]: 221/439 cut-off events. [2024-06-14 16:07:48,211 INFO L125 PetriNetUnfolderBase]: For 8126/8132 co-relation queries the response was YES. [2024-06-14 16:07:48,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2056 conditions, 439 events. 221/439 cut-off events. For 8126/8132 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1889 event pairs, 42 based on Foata normal form. 7/440 useless extension candidates. Maximal degree in co-relation 1997. Up to 250 conditions per place. [2024-06-14 16:07:48,214 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 64 selfloop transitions, 35 changer transitions 0/101 dead transitions. [2024-06-14 16:07:48,214 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 101 transitions, 994 flow [2024-06-14 16:07:48,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 16:07:48,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 16:07:48,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2024-06-14 16:07:48,215 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37407407407407406 [2024-06-14 16:07:48,215 INFO L175 Difference]: Start difference. First operand has 116 places, 83 transitions, 724 flow. Second operand 9 states and 101 transitions. [2024-06-14 16:07:48,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 101 transitions, 994 flow [2024-06-14 16:07:48,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 101 transitions, 903 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-14 16:07:48,228 INFO L231 Difference]: Finished difference. Result has 118 places, 86 transitions, 735 flow [2024-06-14 16:07:48,228 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=633, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=735, PETRI_PLACES=118, PETRI_TRANSITIONS=86} [2024-06-14 16:07:48,228 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 89 predicate places. [2024-06-14 16:07:48,229 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 86 transitions, 735 flow [2024-06-14 16:07:48,229 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-14 16:07:48,229 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:07:48,229 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:07:48,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-14 16:07:48,229 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-14 16:07:48,230 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:07:48,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1083345454, now seen corresponding path program 4 times [2024-06-14 16:07:48,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:07:48,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162593501] [2024-06-14 16:07:48,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:07:48,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:07:48,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:07:51,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:07:51,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:07:51,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162593501] [2024-06-14 16:07:51,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162593501] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:07:51,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:07:51,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:07:51,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037900217] [2024-06-14 16:07:51,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:07:51,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:07:51,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:07:51,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:07:51,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:07:51,417 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-14 16:07:51,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 86 transitions, 735 flow. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:07:51,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:07:51,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-14 16:07:51,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:07:51,605 INFO L124 PetriNetUnfolderBase]: 248/500 cut-off events. [2024-06-14 16:07:51,606 INFO L125 PetriNetUnfolderBase]: For 12143/12149 co-relation queries the response was YES. [2024-06-14 16:07:51,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2398 conditions, 500 events. 248/500 cut-off events. For 12143/12149 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2237 event pairs, 57 based on Foata normal form. 9/503 useless extension candidates. Maximal degree in co-relation 2339. Up to 203 conditions per place. [2024-06-14 16:07:51,609 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 63 selfloop transitions, 29 changer transitions 11/105 dead transitions. [2024-06-14 16:07:51,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 105 transitions, 1079 flow [2024-06-14 16:07:51,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:07:51,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:07:51,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 99 transitions. [2024-06-14 16:07:51,610 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4125 [2024-06-14 16:07:51,610 INFO L175 Difference]: Start difference. First operand has 118 places, 86 transitions, 735 flow. Second operand 8 states and 99 transitions. [2024-06-14 16:07:51,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 105 transitions, 1079 flow [2024-06-14 16:07:51,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 105 transitions, 984 flow, removed 7 selfloop flow, removed 8 redundant places. [2024-06-14 16:07:51,628 INFO L231 Difference]: Finished difference. Result has 118 places, 80 transitions, 654 flow [2024-06-14 16:07:51,628 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=642, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=654, PETRI_PLACES=118, PETRI_TRANSITIONS=80} [2024-06-14 16:07:51,629 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 89 predicate places. [2024-06-14 16:07:51,629 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 80 transitions, 654 flow [2024-06-14 16:07:51,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:07:51,629 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:07:51,629 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:07:51,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-14 16:07:51,629 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-14 16:07:51,629 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:07:51,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1349042734, now seen corresponding path program 5 times [2024-06-14 16:07:51,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:07:51,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344286448] [2024-06-14 16:07:51,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:07:51,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:07:51,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:07:54,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:07:54,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:07:54,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344286448] [2024-06-14 16:07:54,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344286448] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:07:54,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:07:54,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:07:54,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31052818] [2024-06-14 16:07:54,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:07:54,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:07:54,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:07:54,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:07:54,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:07:54,935 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-14 16:07:54,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 80 transitions, 654 flow. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:07:54,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:07:54,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-14 16:07:54,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:07:55,124 INFO L124 PetriNetUnfolderBase]: 235/481 cut-off events. [2024-06-14 16:07:55,125 INFO L125 PetriNetUnfolderBase]: For 13867/13873 co-relation queries the response was YES. [2024-06-14 16:07:55,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2298 conditions, 481 events. 235/481 cut-off events. For 13867/13873 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2138 event pairs, 60 based on Foata normal form. 9/484 useless extension candidates. Maximal degree in co-relation 2239. Up to 202 conditions per place. [2024-06-14 16:07:55,128 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 61 selfloop transitions, 23 changer transitions 11/97 dead transitions. [2024-06-14 16:07:55,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 97 transitions, 964 flow [2024-06-14 16:07:55,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:07:55,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:07:55,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 91 transitions. [2024-06-14 16:07:55,130 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37916666666666665 [2024-06-14 16:07:55,130 INFO L175 Difference]: Start difference. First operand has 118 places, 80 transitions, 654 flow. Second operand 8 states and 91 transitions. [2024-06-14 16:07:55,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 97 transitions, 964 flow [2024-06-14 16:07:55,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 97 transitions, 892 flow, removed 7 selfloop flow, removed 10 redundant places. [2024-06-14 16:07:55,148 INFO L231 Difference]: Finished difference. Result has 112 places, 75 transitions, 605 flow [2024-06-14 16:07:55,148 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=588, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=605, PETRI_PLACES=112, PETRI_TRANSITIONS=75} [2024-06-14 16:07:55,149 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 83 predicate places. [2024-06-14 16:07:55,149 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 75 transitions, 605 flow [2024-06-14 16:07:55,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:07:55,149 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:07:55,149 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:07:55,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-14 16:07:55,150 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-14 16:07:55,150 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:07:55,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1748683931, now seen corresponding path program 1 times [2024-06-14 16:07:55,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:07:55,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901544364] [2024-06-14 16:07:55,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:07:55,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:07:55,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:07:58,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:07:58,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:07:58,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901544364] [2024-06-14 16:07:58,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901544364] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:07:58,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:07:58,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 16:07:58,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221782153] [2024-06-14 16:07:58,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:07:58,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 16:07:58,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:07:58,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 16:07:58,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 16:07:58,809 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-14 16:07:58,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 75 transitions, 605 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-14 16:07:58,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:07:58,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-14 16:07:58,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:07:59,054 INFO L124 PetriNetUnfolderBase]: 187/377 cut-off events. [2024-06-14 16:07:59,054 INFO L125 PetriNetUnfolderBase]: For 6010/6016 co-relation queries the response was YES. [2024-06-14 16:07:59,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1593 conditions, 377 events. 187/377 cut-off events. For 6010/6016 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1528 event pairs, 31 based on Foata normal form. 10/383 useless extension candidates. Maximal degree in co-relation 1537. Up to 264 conditions per place. [2024-06-14 16:07:59,057 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 61 selfloop transitions, 11 changer transitions 18/92 dead transitions. [2024-06-14 16:07:59,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 92 transitions, 835 flow [2024-06-14 16:07:59,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 16:07:59,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 16:07:59,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 91 transitions. [2024-06-14 16:07:59,058 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.337037037037037 [2024-06-14 16:07:59,058 INFO L175 Difference]: Start difference. First operand has 112 places, 75 transitions, 605 flow. Second operand 9 states and 91 transitions. [2024-06-14 16:07:59,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 92 transitions, 835 flow [2024-06-14 16:07:59,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 92 transitions, 789 flow, removed 6 selfloop flow, removed 8 redundant places. [2024-06-14 16:07:59,067 INFO L231 Difference]: Finished difference. Result has 108 places, 70 transitions, 552 flow [2024-06-14 16:07:59,068 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=561, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=552, PETRI_PLACES=108, PETRI_TRANSITIONS=70} [2024-06-14 16:07:59,068 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 79 predicate places. [2024-06-14 16:07:59,068 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 70 transitions, 552 flow [2024-06-14 16:07:59,068 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-14 16:07:59,068 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:07:59,069 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:07:59,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-14 16:07:59,069 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-14 16:07:59,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:07:59,069 INFO L85 PathProgramCache]: Analyzing trace with hash 32262263, now seen corresponding path program 2 times [2024-06-14 16:07:59,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:07:59,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438619010] [2024-06-14 16:07:59,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:07:59,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:07:59,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:08:02,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:08:02,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:08:02,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438619010] [2024-06-14 16:08:02,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438619010] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:08:02,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:08:02,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:08:02,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415925266] [2024-06-14 16:08:02,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:08:02,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:08:02,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:08:02,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:08:02,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:08:02,193 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-14 16:08:02,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 70 transitions, 552 flow. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:08:02,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:08:02,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-14 16:08:02,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:08:02,329 INFO L124 PetriNetUnfolderBase]: 164/336 cut-off events. [2024-06-14 16:08:02,329 INFO L125 PetriNetUnfolderBase]: For 4982/4988 co-relation queries the response was YES. [2024-06-14 16:08:02,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1421 conditions, 336 events. 164/336 cut-off events. For 4982/4988 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1318 event pairs, 17 based on Foata normal form. 7/337 useless extension candidates. Maximal degree in co-relation 1368. Up to 98 conditions per place. [2024-06-14 16:08:02,331 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 44 selfloop transitions, 19 changer transitions 16/81 dead transitions. [2024-06-14 16:08:02,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 81 transitions, 740 flow [2024-06-14 16:08:02,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:08:02,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:08:02,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 78 transitions. [2024-06-14 16:08:02,332 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.325 [2024-06-14 16:08:02,332 INFO L175 Difference]: Start difference. First operand has 108 places, 70 transitions, 552 flow. Second operand 8 states and 78 transitions. [2024-06-14 16:08:02,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 81 transitions, 740 flow [2024-06-14 16:08:02,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 81 transitions, 710 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-14 16:08:02,338 INFO L231 Difference]: Finished difference. Result has 101 places, 60 transitions, 478 flow [2024-06-14 16:08:02,338 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=478, PETRI_PLACES=101, PETRI_TRANSITIONS=60} [2024-06-14 16:08:02,338 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 72 predicate places. [2024-06-14 16:08:02,338 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 60 transitions, 478 flow [2024-06-14 16:08:02,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:08:02,339 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:08:02,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-14 16:08:02,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-14 16:08:02,339 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-14 16:08:02,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:08:02,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1338213465, now seen corresponding path program 3 times [2024-06-14 16:08:02,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:08:02,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086059460] [2024-06-14 16:08:02,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:08:02,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:08:02,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:08:05,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:08:05,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:08:05,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086059460] [2024-06-14 16:08:05,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086059460] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:08:05,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:08:05,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:08:05,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523985733] [2024-06-14 16:08:05,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:08:05,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:08:05,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:08:05,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:08:05,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:08:05,497 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-14 16:08:05,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 60 transitions, 478 flow. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:08:05,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:08:05,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-14 16:08:05,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:08:05,637 INFO L124 PetriNetUnfolderBase]: 134/290 cut-off events. [2024-06-14 16:08:05,637 INFO L125 PetriNetUnfolderBase]: For 4001/4007 co-relation queries the response was YES. [2024-06-14 16:08:05,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1242 conditions, 290 events. 134/290 cut-off events. For 4001/4007 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1110 event pairs, 22 based on Foata normal form. 7/291 useless extension candidates. Maximal degree in co-relation 1192. Up to 88 conditions per place. [2024-06-14 16:08:05,638 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 21 selfloop transitions, 7 changer transitions 41/71 dead transitions. [2024-06-14 16:08:05,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 71 transitions, 650 flow [2024-06-14 16:08:05,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:08:05,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:08:05,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 80 transitions. [2024-06-14 16:08:05,639 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2024-06-14 16:08:05,639 INFO L175 Difference]: Start difference. First operand has 101 places, 60 transitions, 478 flow. Second operand 8 states and 80 transitions. [2024-06-14 16:08:05,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 71 transitions, 650 flow [2024-06-14 16:08:05,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 71 transitions, 602 flow, removed 5 selfloop flow, removed 10 redundant places. [2024-06-14 16:08:05,644 INFO L231 Difference]: Finished difference. Result has 93 places, 26 transitions, 171 flow [2024-06-14 16:08:05,644 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=430, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=171, PETRI_PLACES=93, PETRI_TRANSITIONS=26} [2024-06-14 16:08:05,645 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 64 predicate places. [2024-06-14 16:08:05,645 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 26 transitions, 171 flow [2024-06-14 16:08:05,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:08:05,645 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:08:05,645 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:08:05,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-14 16:08:05,646 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-14 16:08:05,646 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:08:05,646 INFO L85 PathProgramCache]: Analyzing trace with hash -782699907, now seen corresponding path program 4 times [2024-06-14 16:08:05,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:08:05,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510271628] [2024-06-14 16:08:05,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:08:05,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:08:05,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:08:09,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:08:09,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:08:09,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510271628] [2024-06-14 16:08:09,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510271628] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:08:09,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:08:09,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 16:08:09,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278673472] [2024-06-14 16:08:09,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:08:09,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 16:08:09,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:08:09,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 16:08:09,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 16:08:09,257 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-14 16:08:09,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 26 transitions, 171 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-14 16:08:09,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:08:09,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-14 16:08:09,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:08:09,387 INFO L124 PetriNetUnfolderBase]: 49/113 cut-off events. [2024-06-14 16:08:09,387 INFO L125 PetriNetUnfolderBase]: For 2053/2053 co-relation queries the response was YES. [2024-06-14 16:08:09,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 451 conditions, 113 events. 49/113 cut-off events. For 2053/2053 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 286 event pairs, 8 based on Foata normal form. 6/118 useless extension candidates. Maximal degree in co-relation 418. Up to 59 conditions per place. [2024-06-14 16:08:09,388 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 20 selfloop transitions, 5 changer transitions 8/35 dead transitions. [2024-06-14 16:08:09,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 35 transitions, 259 flow [2024-06-14 16:08:09,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:08:09,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:08:09,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 72 transitions. [2024-06-14 16:08:09,389 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3 [2024-06-14 16:08:09,389 INFO L175 Difference]: Start difference. First operand has 93 places, 26 transitions, 171 flow. Second operand 8 states and 72 transitions. [2024-06-14 16:08:09,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 35 transitions, 259 flow [2024-06-14 16:08:09,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 35 transitions, 198 flow, removed 19 selfloop flow, removed 25 redundant places. [2024-06-14 16:08:09,390 INFO L231 Difference]: Finished difference. Result has 53 places, 23 transitions, 109 flow [2024-06-14 16:08:09,391 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=45, 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=8, PETRI_FLOW=109, PETRI_PLACES=53, PETRI_TRANSITIONS=23} [2024-06-14 16:08:09,391 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 24 predicate places. [2024-06-14 16:08:09,391 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 23 transitions, 109 flow [2024-06-14 16:08:09,391 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-14 16:08:09,391 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:08:09,391 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:08:09,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-14 16:08:09,391 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-14 16:08:09,391 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:08:09,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1652830443, now seen corresponding path program 1 times [2024-06-14 16:08:09,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:08:09,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309427658] [2024-06-14 16:08:09,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:08:09,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:08:09,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:08:13,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:08:13,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:08:13,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309427658] [2024-06-14 16:08:13,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309427658] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:08:13,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:08:13,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 16:08:13,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613335400] [2024-06-14 16:08:13,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:08:13,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 16:08:13,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:08:13,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 16:08:13,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 16:08:13,308 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-14 16:08:13,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 23 transitions, 109 flow. Second operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:08:13,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:08:13,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-14 16:08:13,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:08:13,447 INFO L124 PetriNetUnfolderBase]: 31/75 cut-off events. [2024-06-14 16:08:13,447 INFO L125 PetriNetUnfolderBase]: For 188/188 co-relation queries the response was YES. [2024-06-14 16:08:13,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 230 conditions, 75 events. 31/75 cut-off events. For 188/188 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 133 event pairs, 0 based on Foata normal form. 4/78 useless extension candidates. Maximal degree in co-relation 212. Up to 22 conditions per place. [2024-06-14 16:08:13,447 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 0 selfloop transitions, 0 changer transitions 32/32 dead transitions. [2024-06-14 16:08:13,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 32 transitions, 169 flow [2024-06-14 16:08:13,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 16:08:13,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 16:08:13,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 81 transitions. [2024-06-14 16:08:13,448 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.27 [2024-06-14 16:08:13,448 INFO L175 Difference]: Start difference. First operand has 53 places, 23 transitions, 109 flow. Second operand 10 states and 81 transitions. [2024-06-14 16:08:13,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 32 transitions, 169 flow [2024-06-14 16:08:13,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 32 transitions, 139 flow, removed 0 selfloop flow, removed 13 redundant places. [2024-06-14 16:08:13,449 INFO L231 Difference]: Finished difference. Result has 45 places, 0 transitions, 0 flow [2024-06-14 16:08:13,449 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=59, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=0, PETRI_PLACES=45, PETRI_TRANSITIONS=0} [2024-06-14 16:08:13,450 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 16 predicate places. [2024-06-14 16:08:13,450 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 0 transitions, 0 flow [2024-06-14 16:08:13,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:08:13,452 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 4 remaining) [2024-06-14 16:08:13,460 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 4 remaining) [2024-06-14 16:08:13,461 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-06-14 16:08:13,464 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-06-14 16:08:13,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-14 16:08:13,465 INFO L445 BasicCegarLoop]: Path program histogram: [5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:08:13,468 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-14 16:08:13,468 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-14 16:08:13,471 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-06-14 16:08:13,471 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-06-14 16:08:13,472 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.06 04:08:13 BasicIcfg [2024-06-14 16:08:13,472 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-14 16:08:13,472 INFO L158 Benchmark]: Toolchain (without parser) took 140249.01ms. Allocated memory was 157.3MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 80.3MB in the beginning and 976.7MB in the end (delta: -896.4MB). Peak memory consumption was 451.7MB. Max. memory is 16.1GB. [2024-06-14 16:08:13,472 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 157.3MB. Free memory is still 121.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-14 16:08:13,473 INFO L158 Benchmark]: Witness Parser took 1.43ms. Allocated memory is still 157.3MB. Free memory is still 87.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-14 16:08:13,473 INFO L158 Benchmark]: CACSL2BoogieTranslator took 741.59ms. Allocated memory is still 157.3MB. Free memory was 80.1MB in the beginning and 111.2MB in the end (delta: -31.1MB). Peak memory consumption was 43.1MB. Max. memory is 16.1GB. [2024-06-14 16:08:13,473 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.70ms. Allocated memory is still 157.3MB. Free memory was 111.2MB in the beginning and 97.6MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-06-14 16:08:13,473 INFO L158 Benchmark]: Boogie Preprocessor took 105.37ms. Allocated memory is still 157.3MB. Free memory was 97.6MB in the beginning and 90.8MB in the end (delta: 6.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-06-14 16:08:13,473 INFO L158 Benchmark]: RCFGBuilder took 906.80ms. Allocated memory was 157.3MB in the beginning and 226.5MB in the end (delta: 69.2MB). Free memory was 90.8MB in the beginning and 135.6MB in the end (delta: -44.8MB). Peak memory consumption was 61.7MB. Max. memory is 16.1GB. [2024-06-14 16:08:13,474 INFO L158 Benchmark]: TraceAbstraction took 138409.01ms. Allocated memory was 226.5MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 135.6MB in the beginning and 976.7MB in the end (delta: -841.1MB). Peak memory consumption was 435.0MB. Max. memory is 16.1GB. [2024-06-14 16:08:13,478 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.16ms. Allocated memory is still 157.3MB. Free memory is still 121.4MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 1.43ms. Allocated memory is still 157.3MB. Free memory is still 87.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 741.59ms. Allocated memory is still 157.3MB. Free memory was 80.1MB in the beginning and 111.2MB in the end (delta: -31.1MB). Peak memory consumption was 43.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.70ms. Allocated memory is still 157.3MB. Free memory was 111.2MB in the beginning and 97.6MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 105.37ms. Allocated memory is still 157.3MB. Free memory was 97.6MB in the beginning and 90.8MB in the end (delta: 6.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 906.80ms. Allocated memory was 157.3MB in the beginning and 226.5MB in the end (delta: 69.2MB). Free memory was 90.8MB in the beginning and 135.6MB in the end (delta: -44.8MB). Peak memory consumption was 61.7MB. Max. memory is 16.1GB. * TraceAbstraction took 138409.01ms. Allocated memory was 226.5MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 135.6MB in the beginning and 976.7MB in the end (delta: -841.1MB). Peak memory consumption was 435.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 793]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 794]: 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: 138.3s, OverallIterations: 44, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 12.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1942 SdHoareTripleChecker+Valid, 8.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1597 mSDsluCounter, 1234 SdHoareTripleChecker+Invalid, 7.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1059 mSDsCounter, 398 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8755 IncrementalHoareTripleChecker+Invalid, 9153 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 398 mSolverCounterUnsat, 175 mSDtfsCounter, 8755 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 351 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 342 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 6.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=811occurred in iteration=21, InterpolantAutomatonStates: 322, 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.0s SatisfiabilityAnalysisTime, 123.9s InterpolantComputationTime, 657 NumberOfCodeBlocks, 657 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 613 ConstructedInterpolants, 0 QuantifiedInterpolants, 25075 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 44 InterpolantComputations, 44 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-14 16:08:13,524 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