./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version bcb38a6f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-bcb38a6-m [2024-06-03 22:08:47,098 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-03 22:08:47,161 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-03 22:08:47,165 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-03 22:08:47,166 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-03 22:08:47,187 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-03 22:08:47,188 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-03 22:08:47,188 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-03 22:08:47,189 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-03 22:08:47,192 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-03 22:08:47,192 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-03 22:08:47,192 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-03 22:08:47,193 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-03 22:08:47,194 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-03 22:08:47,194 INFO L153 SettingsManager]: * Use SBE=true [2024-06-03 22:08:47,194 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-03 22:08:47,194 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-03 22:08:47,194 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-03 22:08:47,194 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-03 22:08:47,195 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-03 22:08:47,195 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-03 22:08:47,195 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-03 22:08:47,195 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-03 22:08:47,196 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-03 22:08:47,196 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-03 22:08:47,196 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-03 22:08:47,196 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-03 22:08:47,196 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-03 22:08:47,197 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-03 22:08:47,197 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-03 22:08:47,198 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-03 22:08:47,198 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-03 22:08:47,198 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 22:08:47,198 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-03 22:08:47,199 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-03 22:08:47,199 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-03 22:08:47,199 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-03 22:08:47,199 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-03 22:08:47,199 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-03 22:08:47,199 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-03 22:08:47,200 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-03 22:08:47,200 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-03 22:08:47,200 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-03 22:08:47,200 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-03 22:08:47,391 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-03 22:08:47,412 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-03 22:08:47,414 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-03 22:08:47,415 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-03 22:08:47,416 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-03 22:08:47,416 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/mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.yml/witness.yml [2024-06-03 22:08:47,578 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-03 22:08:47,579 INFO L274 PluginConnector]: CDTParser initialized [2024-06-03 22:08:47,579 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2024-06-03 22:08:48,641 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-03 22:08:48,934 INFO L384 CDTParser]: Found 1 translation units. [2024-06-03 22:08:48,938 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2024-06-03 22:08:48,953 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50cbe4d0f/fe0b627275a84e399e8c3d10995b8cf2/FLAGd338591ac [2024-06-03 22:08:48,967 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50cbe4d0f/fe0b627275a84e399e8c3d10995b8cf2 [2024-06-03 22:08:48,968 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-03 22:08:48,969 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-03 22:08:48,971 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-03 22:08:48,971 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-03 22:08:48,975 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-03 22:08:48,976 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 10:08:47" (1/2) ... [2024-06-03 22:08:48,976 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e164366 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:08:48, skipping insertion in model container [2024-06-03 22:08:48,977 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 10:08:47" (1/2) ... [2024-06-03 22:08:48,978 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@25842c28 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:08:48, skipping insertion in model container [2024-06-03 22:08:48,978 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 10:08:48" (2/2) ... [2024-06-03 22:08:48,979 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e164366 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:08:48, skipping insertion in model container [2024-06-03 22:08:48,980 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 10:08:48" (2/2) ... [2024-06-03 22:08:48,980 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-03 22:08:49,031 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-03 22:08:49,033 INFO L97 edCorrectnessWitness]: Location invariant before [L808-L808] ((((((((((((((! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1))) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$w_buff0) + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )x) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )x) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )x) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )x) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )y) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (2LL - (long long )y$r_buff0_thd1) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd1) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd1) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd1) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$w_buff0) - (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || ((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && __unbuffered_p1_EAX <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-03 22:08:49,034 INFO L97 edCorrectnessWitness]: Location invariant before [L809-L809] ((((((((((((((! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1))) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$w_buff0) + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )x) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )x) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )x) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )x) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )y) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (2LL - (long long )y$r_buff0_thd1) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd1) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd1) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd1) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$w_buff0) - (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || ((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && __unbuffered_p1_EAX <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-03 22:08:49,034 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-03 22:08:49,034 INFO L106 edCorrectnessWitness]: ghost_update [L806-L806] multithreaded = 1; [2024-06-03 22:08:49,072 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-03 22:08:49,365 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 22:08:49,378 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-03 22:08:49,568 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 22:08:49,596 INFO L206 MainTranslator]: Completed translation [2024-06-03 22:08:49,597 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:08:49 WrapperNode [2024-06-03 22:08:49,597 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-03 22:08:49,598 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-03 22:08:49,598 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-03 22:08:49,598 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-03 22:08:49,604 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:08:49" (1/1) ... [2024-06-03 22:08:49,643 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:08:49" (1/1) ... [2024-06-03 22:08:49,706 INFO L138 Inliner]: procedures = 174, calls = 34, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 112 [2024-06-03 22:08:49,706 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-03 22:08:49,707 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-03 22:08:49,707 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-03 22:08:49,707 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-03 22:08:49,716 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:08:49" (1/1) ... [2024-06-03 22:08:49,717 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:08:49" (1/1) ... [2024-06-03 22:08:49,737 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:08:49" (1/1) ... [2024-06-03 22:08:49,770 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-03 22:08:49,770 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:08:49" (1/1) ... [2024-06-03 22:08:49,771 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:08:49" (1/1) ... [2024-06-03 22:08:49,795 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:08:49" (1/1) ... [2024-06-03 22:08:49,797 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:08:49" (1/1) ... [2024-06-03 22:08:49,803 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:08:49" (1/1) ... [2024-06-03 22:08:49,812 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:08:49" (1/1) ... [2024-06-03 22:08:49,826 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-03 22:08:49,828 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-03 22:08:49,828 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-03 22:08:49,828 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-03 22:08:49,829 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:08:49" (1/1) ... [2024-06-03 22:08:49,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 22:08:49,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-03 22:08:49,874 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-03 22:08:49,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-03 22:08:49,961 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-03 22:08:49,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-03 22:08:49,961 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-03 22:08:49,962 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-03 22:08:49,962 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-03 22:08:49,962 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-03 22:08:49,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-03 22:08:49,962 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-03 22:08:49,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-03 22:08:49,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-03 22:08:49,963 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-03 22:08:50,057 INFO L244 CfgBuilder]: Building ICFG [2024-06-03 22:08:50,059 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-03 22:08:50,697 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-03 22:08:50,698 INFO L293 CfgBuilder]: Performing block encoding [2024-06-03 22:08:50,839 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-03 22:08:50,845 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-03 22:08:50,846 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 10:08:50 BoogieIcfgContainer [2024-06-03 22:08:50,846 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-03 22:08:50,849 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-03 22:08:50,849 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-03 22:08:50,852 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-03 22:08:50,852 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 10:08:47" (1/4) ... [2024-06-03 22:08:50,853 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36e4b1be and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 10:08:50, skipping insertion in model container [2024-06-03 22:08:50,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.06 10:08:48" (2/4) ... [2024-06-03 22:08:50,854 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36e4b1be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 10:08:50, skipping insertion in model container [2024-06-03 22:08:50,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:08:49" (3/4) ... [2024-06-03 22:08:50,858 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36e4b1be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 10:08:50, skipping insertion in model container [2024-06-03 22:08:50,858 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 10:08:50" (4/4) ... [2024-06-03 22:08:50,859 INFO L112 eAbstractionObserver]: Analyzing ICFG mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2024-06-03 22:08:50,872 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-03 22:08:50,873 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-03 22:08:50,873 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-03 22:08:50,944 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-03 22:08:50,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 30 transitions, 68 flow [2024-06-03 22:08:51,009 INFO L124 PetriNetUnfolderBase]: 0/28 cut-off events. [2024-06-03 22:08:51,009 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 22:08:51,011 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 37 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-03 22:08:51,011 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 30 transitions, 68 flow [2024-06-03 22:08:51,013 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 22 transitions, 50 flow [2024-06-03 22:08:51,025 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-03 22:08:51,031 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;@597c13da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-03 22:08:51,031 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-03 22:08:51,038 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-03 22:08:51,038 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-03 22:08:51,038 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 22:08:51,039 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:08:51,039 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-03 22:08:51,040 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:08:51,044 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:08:51,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1415696832, now seen corresponding path program 1 times [2024-06-03 22:08:51,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:08:51,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849065218] [2024-06-03 22:08:51,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:08:51,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:08:51,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:08:54,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:08:54,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:08:54,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849065218] [2024-06-03 22:08:54,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849065218] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:08:54,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:08:54,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-03 22:08:54,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933631729] [2024-06-03 22:08:54,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:08:54,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-03 22:08:54,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:08:54,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-03 22:08:54,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-03 22:08:54,168 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 30 [2024-06-03 22:08:54,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 22 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:08:54,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:08:54,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 30 [2024-06-03 22:08:54,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:08:54,334 INFO L124 PetriNetUnfolderBase]: 162/297 cut-off events. [2024-06-03 22:08:54,334 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-06-03 22:08:54,336 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 1009 event pairs, 97 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 596. Up to 288 conditions per place. [2024-06-03 22:08:54,338 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 23 selfloop transitions, 3 changer transitions 0/28 dead transitions. [2024-06-03 22:08:54,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 28 transitions, 117 flow [2024-06-03 22:08:54,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-03 22:08:54,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-03 22:08:54,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2024-06-03 22:08:54,346 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5444444444444444 [2024-06-03 22:08:54,348 INFO L175 Difference]: Start difference. First operand has 29 places, 22 transitions, 50 flow. Second operand 3 states and 49 transitions. [2024-06-03 22:08:54,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 28 transitions, 117 flow [2024-06-03 22:08:54,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 28 transitions, 114 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-03 22:08:54,351 INFO L231 Difference]: Finished difference. Result has 30 places, 24 transitions, 69 flow [2024-06-03 22:08:54,352 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=69, PETRI_PLACES=30, PETRI_TRANSITIONS=24} [2024-06-03 22:08:54,354 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 1 predicate places. [2024-06-03 22:08:54,354 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 24 transitions, 69 flow [2024-06-03 22:08:54,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:08:54,355 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:08:54,355 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:08:54,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-03 22:08:54,355 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:08:54,356 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:08:54,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1019821195, now seen corresponding path program 1 times [2024-06-03 22:08:54,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:08:54,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342278851] [2024-06-03 22:08:54,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:08:54,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:08:54,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:08:56,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:08:56,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:08:56,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342278851] [2024-06-03 22:08:56,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342278851] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:08:56,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:08:56,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-03 22:08:56,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964719340] [2024-06-03 22:08:56,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:08:56,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-03 22:08:56,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:08:56,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-03 22:08:56,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-03 22:08:56,583 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 30 [2024-06-03 22:08:56,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 69 flow. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:08:56,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:08:56,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 30 [2024-06-03 22:08:56,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:08:56,756 INFO L124 PetriNetUnfolderBase]: 159/292 cut-off events. [2024-06-03 22:08:56,756 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2024-06-03 22:08:56,759 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 996 event pairs, 79 based on Foata normal form. 2/293 useless extension candidates. Maximal degree in co-relation 667. Up to 274 conditions per place. [2024-06-03 22:08:56,761 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 27 selfloop transitions, 5 changer transitions 0/34 dead transitions. [2024-06-03 22:08:56,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 34 transitions, 159 flow [2024-06-03 22:08:56,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-03 22:08:56,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-03 22:08:56,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2024-06-03 22:08:56,764 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5166666666666667 [2024-06-03 22:08:56,765 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 69 flow. Second operand 4 states and 62 transitions. [2024-06-03 22:08:56,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 34 transitions, 159 flow [2024-06-03 22:08:56,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 34 transitions, 156 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-03 22:08:56,768 INFO L231 Difference]: Finished difference. Result has 33 places, 26 transitions, 93 flow [2024-06-03 22:08:56,768 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=93, PETRI_PLACES=33, PETRI_TRANSITIONS=26} [2024-06-03 22:08:56,769 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 4 predicate places. [2024-06-03 22:08:56,770 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 26 transitions, 93 flow [2024-06-03 22:08:56,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:08:56,770 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:08:56,771 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:08:56,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-03 22:08:56,771 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:08:56,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:08:56,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1554154189, now seen corresponding path program 1 times [2024-06-03 22:08:56,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:08:56,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320771649] [2024-06-03 22:08:56,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:08:56,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:08:56,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:08:58,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:08:58,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:08:58,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320771649] [2024-06-03 22:08:58,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320771649] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:08:58,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:08:58,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-03 22:08:58,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005831226] [2024-06-03 22:08:58,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:08:58,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-03 22:08:58,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:08:58,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-03 22:08:58,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-03 22:08:58,903 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 30 [2024-06-03 22:08:58,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 26 transitions, 93 flow. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:08:58,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:08:58,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 30 [2024-06-03 22:08:58,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:08:59,115 INFO L124 PetriNetUnfolderBase]: 188/340 cut-off events. [2024-06-03 22:08:59,115 INFO L125 PetriNetUnfolderBase]: For 179/179 co-relation queries the response was YES. [2024-06-03 22:08:59,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 867 conditions, 340 events. 188/340 cut-off events. For 179/179 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1231 event pairs, 62 based on Foata normal form. 5/344 useless extension candidates. Maximal degree in co-relation 850. Up to 260 conditions per place. [2024-06-03 22:08:59,118 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 39 selfloop transitions, 11 changer transitions 0/52 dead transitions. [2024-06-03 22:08:59,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 52 transitions, 267 flow [2024-06-03 22:08:59,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 22:08:59,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 22:08:59,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2024-06-03 22:08:59,121 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2024-06-03 22:08:59,122 INFO L175 Difference]: Start difference. First operand has 33 places, 26 transitions, 93 flow. Second operand 5 states and 85 transitions. [2024-06-03 22:08:59,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 52 transitions, 267 flow [2024-06-03 22:08:59,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 52 transitions, 258 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-03 22:08:59,124 INFO L231 Difference]: Finished difference. Result has 38 places, 34 transitions, 162 flow [2024-06-03 22:08:59,125 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=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=162, PETRI_PLACES=38, PETRI_TRANSITIONS=34} [2024-06-03 22:08:59,126 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 9 predicate places. [2024-06-03 22:08:59,126 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 34 transitions, 162 flow [2024-06-03 22:08:59,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:08:59,126 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:08:59,126 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:08:59,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-03 22:08:59,127 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:08:59,127 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:08:59,127 INFO L85 PathProgramCache]: Analyzing trace with hash -934139138, now seen corresponding path program 1 times [2024-06-03 22:08:59,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:08:59,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81088980] [2024-06-03 22:08:59,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:08:59,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:08:59,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:09:01,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:09:01,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:09:01,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81088980] [2024-06-03 22:09:01,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81088980] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:09:01,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:09:01,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 22:09:01,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760199871] [2024-06-03 22:09:01,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:09:01,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 22:09:01,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:09:01,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 22:09:01,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-03 22:09:01,614 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 30 [2024-06-03 22:09:01,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 34 transitions, 162 flow. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:09:01,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:09:01,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 30 [2024-06-03 22:09:01,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:09:01,819 INFO L124 PetriNetUnfolderBase]: 189/342 cut-off events. [2024-06-03 22:09:01,819 INFO L125 PetriNetUnfolderBase]: For 407/407 co-relation queries the response was YES. [2024-06-03 22:09:01,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1096 conditions, 342 events. 189/342 cut-off events. For 407/407 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1222 event pairs, 44 based on Foata normal form. 3/344 useless extension candidates. Maximal degree in co-relation 1076. Up to 283 conditions per place. [2024-06-03 22:09:01,821 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 44 selfloop transitions, 14 changer transitions 0/60 dead transitions. [2024-06-03 22:09:01,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 60 transitions, 374 flow [2024-06-03 22:09:01,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:09:01,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:09:01,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions. [2024-06-03 22:09:01,823 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2024-06-03 22:09:01,823 INFO L175 Difference]: Start difference. First operand has 38 places, 34 transitions, 162 flow. Second operand 6 states and 95 transitions. [2024-06-03 22:09:01,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 60 transitions, 374 flow [2024-06-03 22:09:01,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 60 transitions, 370 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-06-03 22:09:01,826 INFO L231 Difference]: Finished difference. Result has 46 places, 42 transitions, 258 flow [2024-06-03 22:09:01,827 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=258, PETRI_PLACES=46, PETRI_TRANSITIONS=42} [2024-06-03 22:09:01,827 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 17 predicate places. [2024-06-03 22:09:01,827 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 42 transitions, 258 flow [2024-06-03 22:09:01,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:09:01,828 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:09:01,828 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:09:01,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-03 22:09:01,828 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:09:01,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:09:01,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1106458290, now seen corresponding path program 1 times [2024-06-03 22:09:01,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:09:01,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313057383] [2024-06-03 22:09:01,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:09:01,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:09:01,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:09:04,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:09:04,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:09:04,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313057383] [2024-06-03 22:09:04,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313057383] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:09:04,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:09:04,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 22:09:04,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582284487] [2024-06-03 22:09:04,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:09:04,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 22:09:04,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:09:04,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 22:09:04,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-03 22:09:04,411 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 30 [2024-06-03 22:09:04,411 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 42 transitions, 258 flow. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:09:04,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:09:04,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 30 [2024-06-03 22:09:04,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:09:04,679 INFO L124 PetriNetUnfolderBase]: 190/345 cut-off events. [2024-06-03 22:09:04,680 INFO L125 PetriNetUnfolderBase]: For 713/713 co-relation queries the response was YES. [2024-06-03 22:09:04,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1274 conditions, 345 events. 190/345 cut-off events. For 713/713 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1240 event pairs, 28 based on Foata normal form. 6/350 useless extension candidates. Maximal degree in co-relation 1249. Up to 260 conditions per place. [2024-06-03 22:09:04,683 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 44 selfloop transitions, 16 changer transitions 0/62 dead transitions. [2024-06-03 22:09:04,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 62 transitions, 438 flow [2024-06-03 22:09:04,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:09:04,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:09:04,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 104 transitions. [2024-06-03 22:09:04,686 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49523809523809526 [2024-06-03 22:09:04,686 INFO L175 Difference]: Start difference. First operand has 46 places, 42 transitions, 258 flow. Second operand 7 states and 104 transitions. [2024-06-03 22:09:04,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 62 transitions, 438 flow [2024-06-03 22:09:04,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 62 transitions, 422 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-06-03 22:09:04,692 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 277 flow [2024-06-03 22:09:04,693 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=277, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2024-06-03 22:09:04,694 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 22 predicate places. [2024-06-03 22:09:04,694 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 277 flow [2024-06-03 22:09:04,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:09:04,694 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:09:04,695 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:09:04,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-03 22:09:04,695 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:09:04,695 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:09:04,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1089033521, now seen corresponding path program 1 times [2024-06-03 22:09:04,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:09:04,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971504617] [2024-06-03 22:09:04,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:09:04,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:09:04,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:09:09,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:09:09,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:09:09,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971504617] [2024-06-03 22:09:09,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971504617] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:09:09,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:09:09,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 22:09:09,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046646030] [2024-06-03 22:09:09,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:09:09,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 22:09:09,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:09:09,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 22:09:09,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-03 22:09:09,263 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:09:09,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 277 flow. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:09:09,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:09:09,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:09:09,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:09:09,529 INFO L124 PetriNetUnfolderBase]: 184/336 cut-off events. [2024-06-03 22:09:09,529 INFO L125 PetriNetUnfolderBase]: For 813/813 co-relation queries the response was YES. [2024-06-03 22:09:09,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1328 conditions, 336 events. 184/336 cut-off events. For 813/813 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1190 event pairs, 41 based on Foata normal form. 3/338 useless extension candidates. Maximal degree in co-relation 1301. Up to 318 conditions per place. [2024-06-03 22:09:09,534 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 41 selfloop transitions, 7 changer transitions 0/50 dead transitions. [2024-06-03 22:09:09,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 50 transitions, 397 flow [2024-06-03 22:09:09,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 22:09:09,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 22:09:09,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2024-06-03 22:09:09,535 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4066666666666667 [2024-06-03 22:09:09,538 INFO L175 Difference]: Start difference. First operand has 51 places, 42 transitions, 277 flow. Second operand 5 states and 61 transitions. [2024-06-03 22:09:09,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 50 transitions, 397 flow [2024-06-03 22:09:09,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 50 transitions, 356 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-03 22:09:09,541 INFO L231 Difference]: Finished difference. Result has 51 places, 44 transitions, 270 flow [2024-06-03 22:09:09,542 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=270, PETRI_PLACES=51, PETRI_TRANSITIONS=44} [2024-06-03 22:09:09,544 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 22 predicate places. [2024-06-03 22:09:09,545 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 44 transitions, 270 flow [2024-06-03 22:09:09,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:09:09,545 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:09:09,545 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:09:09,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-03 22:09:09,545 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:09:09,546 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:09:09,546 INFO L85 PathProgramCache]: Analyzing trace with hash 2019593838, now seen corresponding path program 1 times [2024-06-03 22:09:09,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:09:09,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772912959] [2024-06-03 22:09:09,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:09:09,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:09:09,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:09:13,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:09:13,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:09:13,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772912959] [2024-06-03 22:09:13,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772912959] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:09:13,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:09:13,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 22:09:13,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858061891] [2024-06-03 22:09:13,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:09:13,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 22:09:13,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:09:13,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 22:09:13,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-03 22:09:13,532 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:09:13,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 44 transitions, 270 flow. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:09:13,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:09:13,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:09:13,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:09:13,747 INFO L124 PetriNetUnfolderBase]: 187/342 cut-off events. [2024-06-03 22:09:13,747 INFO L125 PetriNetUnfolderBase]: For 970/970 co-relation queries the response was YES. [2024-06-03 22:09:13,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1337 conditions, 342 events. 187/342 cut-off events. For 970/970 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1222 event pairs, 42 based on Foata normal form. 6/347 useless extension candidates. Maximal degree in co-relation 1308. Up to 256 conditions per place. [2024-06-03 22:09:13,750 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 42 selfloop transitions, 16 changer transitions 0/60 dead transitions. [2024-06-03 22:09:13,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 60 transitions, 458 flow [2024-06-03 22:09:13,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:09:13,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:09:13,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2024-06-03 22:09:13,752 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-06-03 22:09:13,752 INFO L175 Difference]: Start difference. First operand has 51 places, 44 transitions, 270 flow. Second operand 6 states and 80 transitions. [2024-06-03 22:09:13,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 60 transitions, 458 flow [2024-06-03 22:09:13,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 60 transitions, 444 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-03 22:09:13,756 INFO L231 Difference]: Finished difference. Result has 54 places, 47 transitions, 328 flow [2024-06-03 22:09:13,757 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=328, PETRI_PLACES=54, PETRI_TRANSITIONS=47} [2024-06-03 22:09:13,758 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 25 predicate places. [2024-06-03 22:09:13,758 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 47 transitions, 328 flow [2024-06-03 22:09:13,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:09:13,758 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:09:13,759 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:09:13,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-03 22:09:13,759 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:09:13,759 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:09:13,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1410785008, now seen corresponding path program 2 times [2024-06-03 22:09:13,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:09:13,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240928738] [2024-06-03 22:09:13,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:09:13,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:09:13,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:09:17,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:09:17,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:09:17,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240928738] [2024-06-03 22:09:17,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240928738] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:09:17,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:09:17,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 22:09:17,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423856224] [2024-06-03 22:09:17,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:09:17,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 22:09:17,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:09:17,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 22:09:17,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-03 22:09:17,515 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:09:17,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 47 transitions, 328 flow. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:09:17,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:09:17,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:09:17,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:09:17,775 INFO L124 PetriNetUnfolderBase]: 176/322 cut-off events. [2024-06-03 22:09:17,775 INFO L125 PetriNetUnfolderBase]: For 1103/1103 co-relation queries the response was YES. [2024-06-03 22:09:17,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1314 conditions, 322 events. 176/322 cut-off events. For 1103/1103 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1122 event pairs, 38 based on Foata normal form. 3/324 useless extension candidates. Maximal degree in co-relation 1284. Up to 301 conditions per place. [2024-06-03 22:09:17,779 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 44 selfloop transitions, 9 changer transitions 0/55 dead transitions. [2024-06-03 22:09:17,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 55 transitions, 455 flow [2024-06-03 22:09:17,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:09:17,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:09:17,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2024-06-03 22:09:17,780 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2024-06-03 22:09:17,780 INFO L175 Difference]: Start difference. First operand has 54 places, 47 transitions, 328 flow. Second operand 6 states and 70 transitions. [2024-06-03 22:09:17,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 55 transitions, 455 flow [2024-06-03 22:09:17,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 55 transitions, 436 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-03 22:09:17,784 INFO L231 Difference]: Finished difference. Result has 57 places, 47 transitions, 333 flow [2024-06-03 22:09:17,784 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=333, PETRI_PLACES=57, PETRI_TRANSITIONS=47} [2024-06-03 22:09:17,786 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 28 predicate places. [2024-06-03 22:09:17,786 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 333 flow [2024-06-03 22:09:17,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:09:17,786 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:09:17,787 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:09:17,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-03 22:09:17,787 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:09:17,787 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:09:17,787 INFO L85 PathProgramCache]: Analyzing trace with hash 132257820, now seen corresponding path program 1 times [2024-06-03 22:09:17,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:09:17,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163736532] [2024-06-03 22:09:17,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:09:17,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:09:17,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:09:21,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:09:21,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:09:21,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163736532] [2024-06-03 22:09:21,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163736532] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:09:21,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:09:21,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 22:09:21,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684292376] [2024-06-03 22:09:21,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:09:21,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 22:09:21,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:09:21,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 22:09:21,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-03 22:09:21,389 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 30 [2024-06-03 22:09:21,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 47 transitions, 333 flow. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:09:21,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:09:21,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 30 [2024-06-03 22:09:21,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:09:21,558 INFO L124 PetriNetUnfolderBase]: 177/324 cut-off events. [2024-06-03 22:09:21,559 INFO L125 PetriNetUnfolderBase]: For 1258/1258 co-relation queries the response was YES. [2024-06-03 22:09:21,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1336 conditions, 324 events. 177/324 cut-off events. For 1258/1258 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1134 event pairs, 31 based on Foata normal form. 2/325 useless extension candidates. Maximal degree in co-relation 1305. Up to 303 conditions per place. [2024-06-03 22:09:21,561 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 48 selfloop transitions, 9 changer transitions 0/59 dead transitions. [2024-06-03 22:09:21,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 59 transitions, 485 flow [2024-06-03 22:09:21,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:09:21,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:09:21,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2024-06-03 22:09:21,563 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2024-06-03 22:09:21,563 INFO L175 Difference]: Start difference. First operand has 57 places, 47 transitions, 333 flow. Second operand 6 states and 78 transitions. [2024-06-03 22:09:21,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 59 transitions, 485 flow [2024-06-03 22:09:21,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 59 transitions, 440 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-03 22:09:21,569 INFO L231 Difference]: Finished difference. Result has 58 places, 51 transitions, 342 flow [2024-06-03 22:09:21,569 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=342, PETRI_PLACES=58, PETRI_TRANSITIONS=51} [2024-06-03 22:09:21,570 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 29 predicate places. [2024-06-03 22:09:21,570 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 51 transitions, 342 flow [2024-06-03 22:09:21,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:09:21,571 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:09:21,571 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:09:21,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-03 22:09:21,572 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:09:21,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:09:21,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1643289820, now seen corresponding path program 1 times [2024-06-03 22:09:21,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:09:21,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202897734] [2024-06-03 22:09:21,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:09:21,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:09:21,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:09:26,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:09:26,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:09:26,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202897734] [2024-06-03 22:09:26,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202897734] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:09:26,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:09:26,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:09:26,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834536655] [2024-06-03 22:09:26,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:09:26,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:09:26,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:09:26,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:09:26,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:09:27,037 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:09:27,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 51 transitions, 342 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 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-03 22:09:27,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:09:27,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:09:27,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:09:27,302 INFO L124 PetriNetUnfolderBase]: 174/319 cut-off events. [2024-06-03 22:09:27,303 INFO L125 PetriNetUnfolderBase]: For 1238/1238 co-relation queries the response was YES. [2024-06-03 22:09:27,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1356 conditions, 319 events. 174/319 cut-off events. For 1238/1238 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1096 event pairs, 32 based on Foata normal form. 2/320 useless extension candidates. Maximal degree in co-relation 1325. Up to 295 conditions per place. [2024-06-03 22:09:27,305 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 47 selfloop transitions, 10 changer transitions 0/59 dead transitions. [2024-06-03 22:09:27,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 59 transitions, 474 flow [2024-06-03 22:09:27,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:09:27,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:09:27,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 77 transitions. [2024-06-03 22:09:27,306 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2024-06-03 22:09:27,306 INFO L175 Difference]: Start difference. First operand has 58 places, 51 transitions, 342 flow. Second operand 7 states and 77 transitions. [2024-06-03 22:09:27,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 59 transitions, 474 flow [2024-06-03 22:09:27,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 59 transitions, 452 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-03 22:09:27,309 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 344 flow [2024-06-03 22:09:27,309 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=344, PETRI_PLACES=62, PETRI_TRANSITIONS=51} [2024-06-03 22:09:27,310 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 33 predicate places. [2024-06-03 22:09:27,310 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 344 flow [2024-06-03 22:09:27,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 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-03 22:09:27,310 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:09:27,310 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:09:27,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-03 22:09:27,310 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:09:27,311 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:09:27,311 INFO L85 PathProgramCache]: Analyzing trace with hash -499325235, now seen corresponding path program 1 times [2024-06-03 22:09:27,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:09:27,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34278644] [2024-06-03 22:09:27,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:09:27,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:09:27,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:09:31,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:09:31,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:09:31,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34278644] [2024-06-03 22:09:31,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34278644] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:09:31,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:09:31,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:09:31,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878865664] [2024-06-03 22:09:31,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:09:31,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:09:31,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:09:31,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:09:31,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:09:31,830 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:09:31,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 344 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 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-03 22:09:31,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:09:31,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:09:31,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:09:32,097 INFO L124 PetriNetUnfolderBase]: 177/324 cut-off events. [2024-06-03 22:09:32,097 INFO L125 PetriNetUnfolderBase]: For 1439/1439 co-relation queries the response was YES. [2024-06-03 22:09:32,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1392 conditions, 324 events. 177/324 cut-off events. For 1439/1439 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1116 event pairs, 30 based on Foata normal form. 1/324 useless extension candidates. Maximal degree in co-relation 1359. Up to 261 conditions per place. [2024-06-03 22:09:32,099 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 51 selfloop transitions, 16 changer transitions 0/69 dead transitions. [2024-06-03 22:09:32,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 69 transitions, 556 flow [2024-06-03 22:09:32,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:09:32,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:09:32,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 88 transitions. [2024-06-03 22:09:32,101 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41904761904761906 [2024-06-03 22:09:32,102 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 344 flow. Second operand 7 states and 88 transitions. [2024-06-03 22:09:32,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 69 transitions, 556 flow [2024-06-03 22:09:32,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 69 transitions, 527 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-06-03 22:09:32,105 INFO L231 Difference]: Finished difference. Result has 64 places, 55 transitions, 380 flow [2024-06-03 22:09:32,105 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=380, PETRI_PLACES=64, PETRI_TRANSITIONS=55} [2024-06-03 22:09:32,106 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 35 predicate places. [2024-06-03 22:09:32,106 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 55 transitions, 380 flow [2024-06-03 22:09:32,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 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-03 22:09:32,106 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:09:32,106 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:09:32,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-03 22:09:32,107 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:09:32,107 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:09:32,107 INFO L85 PathProgramCache]: Analyzing trace with hash -335648491, now seen corresponding path program 2 times [2024-06-03 22:09:32,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:09:32,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222726777] [2024-06-03 22:09:32,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:09:32,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:09:32,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:09:36,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:09:36,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:09:36,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222726777] [2024-06-03 22:09:36,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222726777] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:09:36,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:09:36,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:09:36,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641170612] [2024-06-03 22:09:36,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:09:36,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:09:36,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:09:36,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:09:36,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:09:36,511 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:09:36,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 55 transitions, 380 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 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-03 22:09:36,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:09:36,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:09:36,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:09:36,721 INFO L124 PetriNetUnfolderBase]: 175/321 cut-off events. [2024-06-03 22:09:36,721 INFO L125 PetriNetUnfolderBase]: For 1605/1605 co-relation queries the response was YES. [2024-06-03 22:09:36,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1426 conditions, 321 events. 175/321 cut-off events. For 1605/1605 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1112 event pairs, 32 based on Foata normal form. 1/321 useless extension candidates. Maximal degree in co-relation 1392. Up to 274 conditions per place. [2024-06-03 22:09:36,723 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 49 selfloop transitions, 15 changer transitions 0/66 dead transitions. [2024-06-03 22:09:36,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 66 transitions, 539 flow [2024-06-03 22:09:36,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:09:36,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:09:36,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 84 transitions. [2024-06-03 22:09:36,725 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-03 22:09:36,725 INFO L175 Difference]: Start difference. First operand has 64 places, 55 transitions, 380 flow. Second operand 7 states and 84 transitions. [2024-06-03 22:09:36,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 66 transitions, 539 flow [2024-06-03 22:09:36,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 66 transitions, 506 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-06-03 22:09:36,728 INFO L231 Difference]: Finished difference. Result has 67 places, 56 transitions, 389 flow [2024-06-03 22:09:36,728 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=389, PETRI_PLACES=67, PETRI_TRANSITIONS=56} [2024-06-03 22:09:36,729 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 38 predicate places. [2024-06-03 22:09:36,729 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 56 transitions, 389 flow [2024-06-03 22:09:36,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 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-03 22:09:36,729 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:09:36,729 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:09:36,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-03 22:09:36,729 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:09:36,730 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:09:36,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1452653752, now seen corresponding path program 1 times [2024-06-03 22:09:36,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:09:36,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402538060] [2024-06-03 22:09:36,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:09:36,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:09:36,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:09:40,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:09:40,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:09:40,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402538060] [2024-06-03 22:09:40,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402538060] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:09:40,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:09:40,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:09:40,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158266733] [2024-06-03 22:09:40,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:09:40,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:09:40,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:09:40,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:09:40,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:09:40,965 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:09:40,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 56 transitions, 389 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 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-03 22:09:40,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:09:40,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:09:40,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:09:41,199 INFO L124 PetriNetUnfolderBase]: 172/317 cut-off events. [2024-06-03 22:09:41,200 INFO L125 PetriNetUnfolderBase]: For 1767/1767 co-relation queries the response was YES. [2024-06-03 22:09:41,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1414 conditions, 317 events. 172/317 cut-off events. For 1767/1767 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1106 event pairs, 31 based on Foata normal form. 2/318 useless extension candidates. Maximal degree in co-relation 1379. Up to 214 conditions per place. [2024-06-03 22:09:41,202 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 47 selfloop transitions, 26 changer transitions 0/75 dead transitions. [2024-06-03 22:09:41,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 75 transitions, 627 flow [2024-06-03 22:09:41,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:09:41,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:09:41,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 85 transitions. [2024-06-03 22:09:41,203 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2024-06-03 22:09:41,203 INFO L175 Difference]: Start difference. First operand has 67 places, 56 transitions, 389 flow. Second operand 6 states and 85 transitions. [2024-06-03 22:09:41,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 75 transitions, 627 flow [2024-06-03 22:09:41,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 75 transitions, 593 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-06-03 22:09:41,208 INFO L231 Difference]: Finished difference. Result has 69 places, 60 transitions, 474 flow [2024-06-03 22:09:41,208 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=355, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=474, PETRI_PLACES=69, PETRI_TRANSITIONS=60} [2024-06-03 22:09:41,209 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 40 predicate places. [2024-06-03 22:09:41,209 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 60 transitions, 474 flow [2024-06-03 22:09:41,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 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-03 22:09:41,209 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:09:41,209 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:09:41,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-03 22:09:41,210 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:09:41,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:09:41,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1452920879, now seen corresponding path program 1 times [2024-06-03 22:09:41,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:09:41,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780253122] [2024-06-03 22:09:41,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:09:41,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:09:41,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:09:45,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:09:45,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:09:45,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780253122] [2024-06-03 22:09:45,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780253122] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:09:45,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:09:45,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:09:45,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794723101] [2024-06-03 22:09:45,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:09:45,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:09:45,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:09:45,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:09:45,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:09:45,592 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:09:45,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 60 transitions, 474 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:09:45,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:09:45,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:09:45,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:09:45,845 INFO L124 PetriNetUnfolderBase]: 169/312 cut-off events. [2024-06-03 22:09:45,846 INFO L125 PetriNetUnfolderBase]: For 2095/2095 co-relation queries the response was YES. [2024-06-03 22:09:45,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1498 conditions, 312 events. 169/312 cut-off events. For 2095/2095 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1070 event pairs, 30 based on Foata normal form. 1/312 useless extension candidates. Maximal degree in co-relation 1462. Up to 285 conditions per place. [2024-06-03 22:09:45,848 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 53 selfloop transitions, 13 changer transitions 0/68 dead transitions. [2024-06-03 22:09:45,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 68 transitions, 626 flow [2024-06-03 22:09:45,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:09:45,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:09:45,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2024-06-03 22:09:45,849 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3761904761904762 [2024-06-03 22:09:45,849 INFO L175 Difference]: Start difference. First operand has 69 places, 60 transitions, 474 flow. Second operand 7 states and 79 transitions. [2024-06-03 22:09:45,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 68 transitions, 626 flow [2024-06-03 22:09:45,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 68 transitions, 599 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-03 22:09:45,854 INFO L231 Difference]: Finished difference. Result has 73 places, 60 transitions, 481 flow [2024-06-03 22:09:45,854 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=447, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=481, PETRI_PLACES=73, PETRI_TRANSITIONS=60} [2024-06-03 22:09:45,854 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 44 predicate places. [2024-06-03 22:09:45,854 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 60 transitions, 481 flow [2024-06-03 22:09:45,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:09:45,855 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:09:45,855 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:09:45,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-03 22:09:45,855 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:09:45,855 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:09:45,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1700727245, now seen corresponding path program 1 times [2024-06-03 22:09:45,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:09:45,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330121918] [2024-06-03 22:09:45,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:09:45,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:09:45,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:09:50,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:09:50,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:09:50,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330121918] [2024-06-03 22:09:50,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330121918] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:09:50,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:09:50,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:09:50,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716417782] [2024-06-03 22:09:50,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:09:50,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:09:50,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:09:50,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:09:50,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:09:50,643 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:09:50,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 60 transitions, 481 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:09:50,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:09:50,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:09:50,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:09:50,923 INFO L124 PetriNetUnfolderBase]: 173/320 cut-off events. [2024-06-03 22:09:50,923 INFO L125 PetriNetUnfolderBase]: For 2155/2155 co-relation queries the response was YES. [2024-06-03 22:09:50,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1533 conditions, 320 events. 173/320 cut-off events. For 2155/2155 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1119 event pairs, 15 based on Foata normal form. 2/321 useless extension candidates. Maximal degree in co-relation 1496. Up to 215 conditions per place. [2024-06-03 22:09:50,925 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 56 selfloop transitions, 20 changer transitions 0/78 dead transitions. [2024-06-03 22:09:50,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 78 transitions, 705 flow [2024-06-03 22:09:50,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:09:50,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:09:50,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2024-06-03 22:09:50,926 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-03 22:09:50,926 INFO L175 Difference]: Start difference. First operand has 73 places, 60 transitions, 481 flow. Second operand 8 states and 96 transitions. [2024-06-03 22:09:50,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 78 transitions, 705 flow [2024-06-03 22:09:50,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 78 transitions, 649 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-03 22:09:50,931 INFO L231 Difference]: Finished difference. Result has 74 places, 61 transitions, 475 flow [2024-06-03 22:09:50,931 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=425, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=475, PETRI_PLACES=74, PETRI_TRANSITIONS=61} [2024-06-03 22:09:50,931 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 45 predicate places. [2024-06-03 22:09:50,931 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 61 transitions, 475 flow [2024-06-03 22:09:50,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:09:50,932 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:09:50,932 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:09:50,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-03 22:09:50,932 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:09:50,932 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:09:50,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1928786739, now seen corresponding path program 1 times [2024-06-03 22:09:50,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:09:50,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566527742] [2024-06-03 22:09:50,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:09:50,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:09:50,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:09:55,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:09:55,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:09:55,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566527742] [2024-06-03 22:09:55,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566527742] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:09:55,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:09:55,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:09:55,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413894501] [2024-06-03 22:09:55,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:09:55,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:09:55,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:09:55,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:09:55,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:09:55,361 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:09:55,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 61 transitions, 475 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:09:55,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:09:55,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:09:55,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:09:55,668 INFO L124 PetriNetUnfolderBase]: 179/330 cut-off events. [2024-06-03 22:09:55,668 INFO L125 PetriNetUnfolderBase]: For 2322/2322 co-relation queries the response was YES. [2024-06-03 22:09:55,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1583 conditions, 330 events. 179/330 cut-off events. For 2322/2322 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1165 event pairs, 31 based on Foata normal form. 2/331 useless extension candidates. Maximal degree in co-relation 1546. Up to 182 conditions per place. [2024-06-03 22:09:55,670 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 54 selfloop transitions, 27 changer transitions 0/83 dead transitions. [2024-06-03 22:09:55,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 83 transitions, 745 flow [2024-06-03 22:09:55,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:09:55,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:09:55,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 104 transitions. [2024-06-03 22:09:55,672 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2024-06-03 22:09:55,672 INFO L175 Difference]: Start difference. First operand has 74 places, 61 transitions, 475 flow. Second operand 8 states and 104 transitions. [2024-06-03 22:09:55,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 83 transitions, 745 flow [2024-06-03 22:09:55,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 83 transitions, 707 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-03 22:09:55,677 INFO L231 Difference]: Finished difference. Result has 77 places, 65 transitions, 532 flow [2024-06-03 22:09:55,677 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=532, PETRI_PLACES=77, PETRI_TRANSITIONS=65} [2024-06-03 22:09:55,677 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 48 predicate places. [2024-06-03 22:09:55,678 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 65 transitions, 532 flow [2024-06-03 22:09:55,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:09:55,678 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:09:55,678 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:09:55,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-03 22:09:55,678 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:09:55,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:09:55,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1703468885, now seen corresponding path program 2 times [2024-06-03 22:09:55,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:09:55,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873442442] [2024-06-03 22:09:55,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:09:55,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:09:55,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:10:00,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:10:00,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:10:00,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873442442] [2024-06-03 22:10:00,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873442442] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:10:00,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:10:00,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:10:00,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094012978] [2024-06-03 22:10:00,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:10:00,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:10:00,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:10:00,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:10:00,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:10:00,650 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:10:00,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 65 transitions, 532 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:10:00,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:10:00,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:10:00,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:10:00,938 INFO L124 PetriNetUnfolderBase]: 183/338 cut-off events. [2024-06-03 22:10:00,938 INFO L125 PetriNetUnfolderBase]: For 2718/2718 co-relation queries the response was YES. [2024-06-03 22:10:00,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1658 conditions, 338 events. 183/338 cut-off events. For 2718/2718 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1224 event pairs, 32 based on Foata normal form. 2/339 useless extension candidates. Maximal degree in co-relation 1620. Up to 270 conditions per place. [2024-06-03 22:10:00,940 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 61 selfloop transitions, 18 changer transitions 0/81 dead transitions. [2024-06-03 22:10:00,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 81 transitions, 731 flow [2024-06-03 22:10:00,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:10:00,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:10:00,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2024-06-03 22:10:00,944 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-03 22:10:00,944 INFO L175 Difference]: Start difference. First operand has 77 places, 65 transitions, 532 flow. Second operand 8 states and 96 transitions. [2024-06-03 22:10:00,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 81 transitions, 731 flow [2024-06-03 22:10:00,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 81 transitions, 672 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-06-03 22:10:00,949 INFO L231 Difference]: Finished difference. Result has 80 places, 66 transitions, 520 flow [2024-06-03 22:10:00,950 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=473, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=520, PETRI_PLACES=80, PETRI_TRANSITIONS=66} [2024-06-03 22:10:00,950 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 51 predicate places. [2024-06-03 22:10:00,950 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 66 transitions, 520 flow [2024-06-03 22:10:00,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:10:00,950 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:10:00,951 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:10:00,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-03 22:10:00,951 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:10:00,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:10:00,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1925985579, now seen corresponding path program 2 times [2024-06-03 22:10:00,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:10:00,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586447821] [2024-06-03 22:10:00,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:10:00,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:10:00,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:10:05,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:10:05,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:10:05,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586447821] [2024-06-03 22:10:05,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586447821] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:10:05,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:10:05,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:10:05,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554973627] [2024-06-03 22:10:05,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:10:05,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:10:05,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:10:05,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:10:05,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:10:05,845 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:10:05,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 66 transitions, 520 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:10:05,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:10:05,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:10:05,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:10:06,155 INFO L124 PetriNetUnfolderBase]: 189/348 cut-off events. [2024-06-03 22:10:06,155 INFO L125 PetriNetUnfolderBase]: For 2971/2971 co-relation queries the response was YES. [2024-06-03 22:10:06,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1692 conditions, 348 events. 189/348 cut-off events. For 2971/2971 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1272 event pairs, 28 based on Foata normal form. 2/349 useless extension candidates. Maximal degree in co-relation 1653. Up to 264 conditions per place. [2024-06-03 22:10:06,158 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 61 selfloop transitions, 19 changer transitions 0/82 dead transitions. [2024-06-03 22:10:06,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 82 transitions, 734 flow [2024-06-03 22:10:06,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:10:06,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:10:06,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 98 transitions. [2024-06-03 22:10:06,159 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4083333333333333 [2024-06-03 22:10:06,159 INFO L175 Difference]: Start difference. First operand has 80 places, 66 transitions, 520 flow. Second operand 8 states and 98 transitions. [2024-06-03 22:10:06,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 82 transitions, 734 flow [2024-06-03 22:10:06,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 82 transitions, 698 flow, removed 1 selfloop flow, removed 6 redundant places. [2024-06-03 22:10:06,166 INFO L231 Difference]: Finished difference. Result has 82 places, 68 transitions, 547 flow [2024-06-03 22:10:06,167 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=484, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=547, PETRI_PLACES=82, PETRI_TRANSITIONS=68} [2024-06-03 22:10:06,167 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 53 predicate places. [2024-06-03 22:10:06,167 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 68 transitions, 547 flow [2024-06-03 22:10:06,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:10:06,167 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:10:06,168 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:10:06,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-03 22:10:06,168 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:10:06,168 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:10:06,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1925990229, now seen corresponding path program 3 times [2024-06-03 22:10:06,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:10:06,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367280082] [2024-06-03 22:10:06,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:10:06,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:10:06,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:10:10,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:10:10,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:10:10,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367280082] [2024-06-03 22:10:10,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367280082] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:10:10,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:10:10,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:10:10,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319281599] [2024-06-03 22:10:10,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:10:10,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:10:10,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:10:10,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:10:10,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:10:10,571 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:10:10,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 68 transitions, 547 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:10:10,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:10:10,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:10:10,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:10:10,871 INFO L124 PetriNetUnfolderBase]: 195/358 cut-off events. [2024-06-03 22:10:10,872 INFO L125 PetriNetUnfolderBase]: For 3411/3411 co-relation queries the response was YES. [2024-06-03 22:10:10,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1775 conditions, 358 events. 195/358 cut-off events. For 3411/3411 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1315 event pairs, 30 based on Foata normal form. 2/359 useless extension candidates. Maximal degree in co-relation 1735. Up to 240 conditions per place. [2024-06-03 22:10:10,874 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 55 selfloop transitions, 28 changer transitions 0/85 dead transitions. [2024-06-03 22:10:10,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 85 transitions, 775 flow [2024-06-03 22:10:10,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:10:10,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:10:10,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 102 transitions. [2024-06-03 22:10:10,876 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.425 [2024-06-03 22:10:10,876 INFO L175 Difference]: Start difference. First operand has 82 places, 68 transitions, 547 flow. Second operand 8 states and 102 transitions. [2024-06-03 22:10:10,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 85 transitions, 775 flow [2024-06-03 22:10:10,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 85 transitions, 725 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-03 22:10:10,886 INFO L231 Difference]: Finished difference. Result has 84 places, 70 transitions, 582 flow [2024-06-03 22:10:10,886 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=497, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=582, PETRI_PLACES=84, PETRI_TRANSITIONS=70} [2024-06-03 22:10:10,886 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 55 predicate places. [2024-06-03 22:10:10,887 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 70 transitions, 582 flow [2024-06-03 22:10:10,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:10:10,887 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:10:10,887 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:10:10,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-03 22:10:10,887 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:10:10,888 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:10:10,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1925990353, now seen corresponding path program 3 times [2024-06-03 22:10:10,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:10:10,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165302434] [2024-06-03 22:10:10,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:10:10,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:10:10,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:10:15,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:10:15,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:10:15,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165302434] [2024-06-03 22:10:15,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165302434] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:10:15,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:10:15,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:10:15,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279063226] [2024-06-03 22:10:15,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:10:15,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:10:15,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:10:15,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:10:15,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:10:15,549 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:10:15,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 70 transitions, 582 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:10:15,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:10:15,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:10:15,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:10:15,799 INFO L124 PetriNetUnfolderBase]: 192/353 cut-off events. [2024-06-03 22:10:15,800 INFO L125 PetriNetUnfolderBase]: For 3443/3443 co-relation queries the response was YES. [2024-06-03 22:10:15,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1763 conditions, 353 events. 192/353 cut-off events. For 3443/3443 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1293 event pairs, 31 based on Foata normal form. 2/354 useless extension candidates. Maximal degree in co-relation 1722. Up to 300 conditions per place. [2024-06-03 22:10:15,802 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 64 selfloop transitions, 16 changer transitions 0/82 dead transitions. [2024-06-03 22:10:15,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 82 transitions, 770 flow [2024-06-03 22:10:15,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:10:15,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:10:15,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 93 transitions. [2024-06-03 22:10:15,804 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3875 [2024-06-03 22:10:15,805 INFO L175 Difference]: Start difference. First operand has 84 places, 70 transitions, 582 flow. Second operand 8 states and 93 transitions. [2024-06-03 22:10:15,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 82 transitions, 770 flow [2024-06-03 22:10:15,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 82 transitions, 705 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-03 22:10:15,810 INFO L231 Difference]: Finished difference. Result has 86 places, 70 transitions, 553 flow [2024-06-03 22:10:15,810 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=517, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=553, PETRI_PLACES=86, PETRI_TRANSITIONS=70} [2024-06-03 22:10:15,811 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 57 predicate places. [2024-06-03 22:10:15,811 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 70 transitions, 553 flow [2024-06-03 22:10:15,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:10:15,811 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:10:15,811 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:10:15,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-03 22:10:15,812 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:10:15,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:10:15,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1810699059, now seen corresponding path program 4 times [2024-06-03 22:10:15,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:10:15,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10764234] [2024-06-03 22:10:15,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:10:15,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:10:15,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:10:20,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:10:20,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:10:20,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10764234] [2024-06-03 22:10:20,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10764234] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:10:20,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:10:20,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:10:20,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456806886] [2024-06-03 22:10:20,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:10:20,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:10:20,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:10:20,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:10:20,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:10:20,326 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:10:20,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 70 transitions, 553 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:10:20,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:10:20,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:10:20,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:10:20,628 INFO L124 PetriNetUnfolderBase]: 208/379 cut-off events. [2024-06-03 22:10:20,629 INFO L125 PetriNetUnfolderBase]: For 4099/4099 co-relation queries the response was YES. [2024-06-03 22:10:20,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1904 conditions, 379 events. 208/379 cut-off events. For 4099/4099 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1403 event pairs, 29 based on Foata normal form. 2/380 useless extension candidates. Maximal degree in co-relation 1862. Up to 274 conditions per place. [2024-06-03 22:10:20,631 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 69 selfloop transitions, 25 changer transitions 0/96 dead transitions. [2024-06-03 22:10:20,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 96 transitions, 887 flow [2024-06-03 22:10:20,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:10:20,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:10:20,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 108 transitions. [2024-06-03 22:10:20,633 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45 [2024-06-03 22:10:20,633 INFO L175 Difference]: Start difference. First operand has 86 places, 70 transitions, 553 flow. Second operand 8 states and 108 transitions. [2024-06-03 22:10:20,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 96 transitions, 887 flow [2024-06-03 22:10:20,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 96 transitions, 846 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-06-03 22:10:20,639 INFO L231 Difference]: Finished difference. Result has 87 places, 74 transitions, 619 flow [2024-06-03 22:10:20,639 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=619, PETRI_PLACES=87, PETRI_TRANSITIONS=74} [2024-06-03 22:10:20,640 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 58 predicate places. [2024-06-03 22:10:20,640 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 74 transitions, 619 flow [2024-06-03 22:10:20,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:10:20,640 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:10:20,640 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:10:20,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-03 22:10:20,640 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:10:20,641 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:10:20,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1819053129, now seen corresponding path program 5 times [2024-06-03 22:10:20,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:10:20,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890524171] [2024-06-03 22:10:20,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:10:20,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:10:20,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:10:25,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:10:25,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:10:25,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890524171] [2024-06-03 22:10:25,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890524171] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:10:25,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:10:25,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:10:25,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952135410] [2024-06-03 22:10:25,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:10:25,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:10:25,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:10:25,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:10:25,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:10:25,505 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:10:25,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 74 transitions, 619 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:10:25,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:10:25,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:10:25,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:10:25,786 INFO L124 PetriNetUnfolderBase]: 220/399 cut-off events. [2024-06-03 22:10:25,786 INFO L125 PetriNetUnfolderBase]: For 4609/4609 co-relation queries the response was YES. [2024-06-03 22:10:25,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2068 conditions, 399 events. 220/399 cut-off events. For 4609/4609 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1520 event pairs, 29 based on Foata normal form. 2/400 useless extension candidates. Maximal degree in co-relation 2025. Up to 311 conditions per place. [2024-06-03 22:10:25,789 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 69 selfloop transitions, 21 changer transitions 0/92 dead transitions. [2024-06-03 22:10:25,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 92 transitions, 885 flow [2024-06-03 22:10:25,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:10:25,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:10:25,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2024-06-03 22:10:25,790 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-03 22:10:25,790 INFO L175 Difference]: Start difference. First operand has 87 places, 74 transitions, 619 flow. Second operand 8 states and 96 transitions. [2024-06-03 22:10:25,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 92 transitions, 885 flow [2024-06-03 22:10:25,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 92 transitions, 840 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-06-03 22:10:25,797 INFO L231 Difference]: Finished difference. Result has 91 places, 78 transitions, 673 flow [2024-06-03 22:10:25,797 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=576, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=673, PETRI_PLACES=91, PETRI_TRANSITIONS=78} [2024-06-03 22:10:25,798 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 62 predicate places. [2024-06-03 22:10:25,798 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 78 transitions, 673 flow [2024-06-03 22:10:25,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:10:25,798 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:10:25,798 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:10:25,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-03 22:10:25,799 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:10:25,799 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:10:25,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1819060073, now seen corresponding path program 1 times [2024-06-03 22:10:25,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:10:25,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872389496] [2024-06-03 22:10:25,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:10:25,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:10:25,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:10:30,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:10:30,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:10:30,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872389496] [2024-06-03 22:10:30,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872389496] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:10:30,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:10:30,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:10:30,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242732362] [2024-06-03 22:10:30,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:10:30,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:10:30,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:10:30,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:10:30,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:10:30,788 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:10:30,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 78 transitions, 673 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:10:30,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:10:30,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:10:30,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:10:31,075 INFO L124 PetriNetUnfolderBase]: 228/415 cut-off events. [2024-06-03 22:10:31,076 INFO L125 PetriNetUnfolderBase]: For 5493/5493 co-relation queries the response was YES. [2024-06-03 22:10:31,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2167 conditions, 415 events. 228/415 cut-off events. For 5493/5493 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1610 event pairs, 30 based on Foata normal form. 4/418 useless extension candidates. Maximal degree in co-relation 2122. Up to 323 conditions per place. [2024-06-03 22:10:31,079 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 71 selfloop transitions, 21 changer transitions 0/94 dead transitions. [2024-06-03 22:10:31,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 94 transitions, 907 flow [2024-06-03 22:10:31,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:10:31,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:10:31,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 98 transitions. [2024-06-03 22:10:31,094 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4083333333333333 [2024-06-03 22:10:31,094 INFO L175 Difference]: Start difference. First operand has 91 places, 78 transitions, 673 flow. Second operand 8 states and 98 transitions. [2024-06-03 22:10:31,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 94 transitions, 907 flow [2024-06-03 22:10:31,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 94 transitions, 845 flow, removed 11 selfloop flow, removed 6 redundant places. [2024-06-03 22:10:31,102 INFO L231 Difference]: Finished difference. Result has 93 places, 80 transitions, 676 flow [2024-06-03 22:10:31,103 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=611, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=676, PETRI_PLACES=93, PETRI_TRANSITIONS=80} [2024-06-03 22:10:31,103 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 64 predicate places. [2024-06-03 22:10:31,103 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 80 transitions, 676 flow [2024-06-03 22:10:31,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:10:31,103 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:10:31,104 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:10:31,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-03 22:10:31,104 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:10:31,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:10:31,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1818880149, now seen corresponding path program 6 times [2024-06-03 22:10:31,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:10:31,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188122296] [2024-06-03 22:10:31,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:10:31,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:10:31,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:10:35,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:10:35,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:10:35,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188122296] [2024-06-03 22:10:35,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188122296] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:10:35,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:10:35,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:10:35,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526325519] [2024-06-03 22:10:35,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:10:35,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:10:35,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:10:35,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:10:35,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:10:35,679 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:10:35,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 80 transitions, 676 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:10:35,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:10:35,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:10:35,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:10:36,022 INFO L124 PetriNetUnfolderBase]: 224/409 cut-off events. [2024-06-03 22:10:36,023 INFO L125 PetriNetUnfolderBase]: For 4887/4887 co-relation queries the response was YES. [2024-06-03 22:10:36,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2082 conditions, 409 events. 224/409 cut-off events. For 4887/4887 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1594 event pairs, 29 based on Foata normal form. 2/410 useless extension candidates. Maximal degree in co-relation 2038. Up to 321 conditions per place. [2024-06-03 22:10:36,026 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 73 selfloop transitions, 23 changer transitions 0/98 dead transitions. [2024-06-03 22:10:36,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 98 transitions, 918 flow [2024-06-03 22:10:36,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:10:36,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:10:36,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 102 transitions. [2024-06-03 22:10:36,028 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.425 [2024-06-03 22:10:36,028 INFO L175 Difference]: Start difference. First operand has 93 places, 80 transitions, 676 flow. Second operand 8 states and 102 transitions. [2024-06-03 22:10:36,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 98 transitions, 918 flow [2024-06-03 22:10:36,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 98 transitions, 857 flow, removed 11 selfloop flow, removed 6 redundant places. [2024-06-03 22:10:36,038 INFO L231 Difference]: Finished difference. Result has 95 places, 80 transitions, 666 flow [2024-06-03 22:10:36,038 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=615, PETRI_DIFFERENCE_MINUEND_PLACES=87, 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=666, PETRI_PLACES=95, PETRI_TRANSITIONS=80} [2024-06-03 22:10:36,038 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 66 predicate places. [2024-06-03 22:10:36,038 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 80 transitions, 666 flow [2024-06-03 22:10:36,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:10:36,039 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:10:36,039 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:10:36,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-03 22:10:36,039 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:10:36,039 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:10:36,040 INFO L85 PathProgramCache]: Analyzing trace with hash 2082601061, now seen corresponding path program 2 times [2024-06-03 22:10:36,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:10:36,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940814252] [2024-06-03 22:10:36,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:10:36,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:10:36,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:10:40,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:10:40,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:10:40,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940814252] [2024-06-03 22:10:40,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940814252] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:10:40,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:10:40,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:10:40,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229362347] [2024-06-03 22:10:40,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:10:40,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:10:40,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:10:40,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:10:40,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:10:40,673 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:10:40,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 80 transitions, 666 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:10:40,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:10:40,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:10:40,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:10:41,002 INFO L124 PetriNetUnfolderBase]: 228/417 cut-off events. [2024-06-03 22:10:41,002 INFO L125 PetriNetUnfolderBase]: For 5269/5269 co-relation queries the response was YES. [2024-06-03 22:10:41,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2110 conditions, 417 events. 228/417 cut-off events. For 5269/5269 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1638 event pairs, 34 based on Foata normal form. 2/418 useless extension candidates. Maximal degree in co-relation 2065. Up to 382 conditions per place. [2024-06-03 22:10:41,005 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 75 selfloop transitions, 14 changer transitions 0/91 dead transitions. [2024-06-03 22:10:41,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 91 transitions, 878 flow [2024-06-03 22:10:41,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:10:41,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:10:41,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2024-06-03 22:10:41,007 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2024-06-03 22:10:41,007 INFO L175 Difference]: Start difference. First operand has 95 places, 80 transitions, 666 flow. Second operand 8 states and 88 transitions. [2024-06-03 22:10:41,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 91 transitions, 878 flow [2024-06-03 22:10:41,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 91 transitions, 809 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-03 22:10:41,016 INFO L231 Difference]: Finished difference. Result has 96 places, 81 transitions, 642 flow [2024-06-03 22:10:41,016 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=597, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=642, PETRI_PLACES=96, PETRI_TRANSITIONS=81} [2024-06-03 22:10:41,017 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 67 predicate places. [2024-06-03 22:10:41,017 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 81 transitions, 642 flow [2024-06-03 22:10:41,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:10:41,017 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:10:41,017 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:10:41,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-03 22:10:41,018 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:10:41,018 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:10:41,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1109997413, now seen corresponding path program 3 times [2024-06-03 22:10:41,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:10:41,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907536299] [2024-06-03 22:10:41,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:10:41,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:10:41,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:10:45,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:10:45,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:10:45,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907536299] [2024-06-03 22:10:45,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907536299] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:10:45,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:10:45,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:10:45,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030837767] [2024-06-03 22:10:45,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:10:45,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:10:45,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:10:45,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:10:45,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:10:45,633 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:10:45,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 81 transitions, 642 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:10:45,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:10:45,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:10:45,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:10:45,872 INFO L124 PetriNetUnfolderBase]: 232/425 cut-off events. [2024-06-03 22:10:45,873 INFO L125 PetriNetUnfolderBase]: For 5685/5685 co-relation queries the response was YES. [2024-06-03 22:10:45,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2097 conditions, 425 events. 232/425 cut-off events. For 5685/5685 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1674 event pairs, 33 based on Foata normal form. 2/426 useless extension candidates. Maximal degree in co-relation 2051. Up to 398 conditions per place. [2024-06-03 22:10:45,876 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 79 selfloop transitions, 11 changer transitions 0/92 dead transitions. [2024-06-03 22:10:45,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 92 transitions, 858 flow [2024-06-03 22:10:45,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:10:45,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:10:45,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 87 transitions. [2024-06-03 22:10:45,877 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3625 [2024-06-03 22:10:45,877 INFO L175 Difference]: Start difference. First operand has 96 places, 81 transitions, 642 flow. Second operand 8 states and 87 transitions. [2024-06-03 22:10:45,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 92 transitions, 858 flow [2024-06-03 22:10:45,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 92 transitions, 825 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-03 22:10:45,886 INFO L231 Difference]: Finished difference. Result has 98 places, 82 transitions, 649 flow [2024-06-03 22:10:45,887 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=609, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=649, PETRI_PLACES=98, PETRI_TRANSITIONS=82} [2024-06-03 22:10:45,887 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 69 predicate places. [2024-06-03 22:10:45,887 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 82 transitions, 649 flow [2024-06-03 22:10:45,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:10:45,887 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:10:45,888 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:10:45,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-03 22:10:45,888 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:10:45,888 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:10:45,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1346469443, now seen corresponding path program 4 times [2024-06-03 22:10:45,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:10:45,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952120232] [2024-06-03 22:10:45,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:10:45,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:10:45,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:10:50,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:10:50,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:10:50,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952120232] [2024-06-03 22:10:50,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952120232] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:10:50,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:10:50,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:10:50,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971190025] [2024-06-03 22:10:50,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:10:50,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:10:50,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:10:50,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:10:50,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:10:50,523 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:10:50,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 82 transitions, 649 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:10:50,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:10:50,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:10:50,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:10:50,778 INFO L124 PetriNetUnfolderBase]: 229/420 cut-off events. [2024-06-03 22:10:50,779 INFO L125 PetriNetUnfolderBase]: For 5485/5485 co-relation queries the response was YES. [2024-06-03 22:10:50,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2034 conditions, 420 events. 229/420 cut-off events. For 5485/5485 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1641 event pairs, 35 based on Foata normal form. 2/421 useless extension candidates. Maximal degree in co-relation 1987. Up to 388 conditions per place. [2024-06-03 22:10:50,782 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 79 selfloop transitions, 11 changer transitions 0/92 dead transitions. [2024-06-03 22:10:50,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 92 transitions, 851 flow [2024-06-03 22:10:50,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:10:50,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:10:50,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 86 transitions. [2024-06-03 22:10:50,783 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35833333333333334 [2024-06-03 22:10:50,783 INFO L175 Difference]: Start difference. First operand has 98 places, 82 transitions, 649 flow. Second operand 8 states and 86 transitions. [2024-06-03 22:10:50,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 92 transitions, 851 flow [2024-06-03 22:10:50,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 92 transitions, 796 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-03 22:10:50,794 INFO L231 Difference]: Finished difference. Result has 98 places, 82 transitions, 620 flow [2024-06-03 22:10:50,794 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=594, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=620, PETRI_PLACES=98, PETRI_TRANSITIONS=82} [2024-06-03 22:10:50,794 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 69 predicate places. [2024-06-03 22:10:50,795 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 82 transitions, 620 flow [2024-06-03 22:10:50,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:10:50,795 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:10:50,795 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:10:50,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-03 22:10:50,796 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:10:50,796 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:10:50,796 INFO L85 PathProgramCache]: Analyzing trace with hash 250008119, now seen corresponding path program 7 times [2024-06-03 22:10:50,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:10:50,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640028403] [2024-06-03 22:10:50,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:10:50,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:10:50,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:10:55,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:10:55,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:10:55,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640028403] [2024-06-03 22:10:55,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640028403] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:10:55,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:10:55,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:10:55,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488843868] [2024-06-03 22:10:55,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:10:55,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:10:55,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:10:55,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:10:55,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:10:55,232 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:10:55,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 82 transitions, 620 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:10:55,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:10:55,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:10:55,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:10:55,506 INFO L124 PetriNetUnfolderBase]: 225/414 cut-off events. [2024-06-03 22:10:55,506 INFO L125 PetriNetUnfolderBase]: For 5141/5141 co-relation queries the response was YES. [2024-06-03 22:10:55,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1928 conditions, 414 events. 225/414 cut-off events. For 5141/5141 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1619 event pairs, 35 based on Foata normal form. 2/415 useless extension candidates. Maximal degree in co-relation 1880. Up to 325 conditions per place. [2024-06-03 22:10:55,509 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 72 selfloop transitions, 27 changer transitions 0/101 dead transitions. [2024-06-03 22:10:55,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 101 transitions, 870 flow [2024-06-03 22:10:55,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:10:55,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:10:55,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 99 transitions. [2024-06-03 22:10:55,510 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4714285714285714 [2024-06-03 22:10:55,510 INFO L175 Difference]: Start difference. First operand has 98 places, 82 transitions, 620 flow. Second operand 7 states and 99 transitions. [2024-06-03 22:10:55,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 101 transitions, 870 flow [2024-06-03 22:10:55,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 101 transitions, 816 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-03 22:10:55,519 INFO L231 Difference]: Finished difference. Result has 98 places, 82 transitions, 629 flow [2024-06-03 22:10:55,519 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=629, PETRI_PLACES=98, PETRI_TRANSITIONS=82} [2024-06-03 22:10:55,519 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 69 predicate places. [2024-06-03 22:10:55,519 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 82 transitions, 629 flow [2024-06-03 22:10:55,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:10:55,520 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:10:55,520 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:10:55,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-03 22:10:55,520 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:10:55,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:10:55,520 INFO L85 PathProgramCache]: Analyzing trace with hash 335276361, now seen corresponding path program 1 times [2024-06-03 22:10:55,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:10:55,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102527885] [2024-06-03 22:10:55,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:10:55,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:10:55,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:10:59,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:10:59,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:10:59,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102527885] [2024-06-03 22:10:59,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102527885] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:10:59,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:10:59,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:10:59,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552679348] [2024-06-03 22:10:59,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:10:59,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:10:59,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:10:59,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:10:59,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:11:00,029 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:11:00,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 82 transitions, 629 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:11:00,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:11:00,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:11:00,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:11:00,383 INFO L124 PetriNetUnfolderBase]: 252/475 cut-off events. [2024-06-03 22:11:00,383 INFO L125 PetriNetUnfolderBase]: For 9769/9769 co-relation queries the response was YES. [2024-06-03 22:11:00,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2259 conditions, 475 events. 252/475 cut-off events. For 9769/9769 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1966 event pairs, 42 based on Foata normal form. 8/482 useless extension candidates. Maximal degree in co-relation 2211. Up to 149 conditions per place. [2024-06-03 22:11:00,386 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 57 selfloop transitions, 37 changer transitions 12/108 dead transitions. [2024-06-03 22:11:00,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 108 transitions, 971 flow [2024-06-03 22:11:00,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:11:00,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:11:00,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 115 transitions. [2024-06-03 22:11:00,387 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42592592592592593 [2024-06-03 22:11:00,387 INFO L175 Difference]: Start difference. First operand has 98 places, 82 transitions, 629 flow. Second operand 9 states and 115 transitions. [2024-06-03 22:11:00,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 108 transitions, 971 flow [2024-06-03 22:11:00,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 108 transitions, 890 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-03 22:11:00,398 INFO L231 Difference]: Finished difference. Result has 101 places, 80 transitions, 614 flow [2024-06-03 22:11:00,398 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=548, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=614, PETRI_PLACES=101, PETRI_TRANSITIONS=80} [2024-06-03 22:11:00,399 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 72 predicate places. [2024-06-03 22:11:00,399 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 80 transitions, 614 flow [2024-06-03 22:11:00,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:11:00,400 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:11:00,400 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:11:00,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-03 22:11:00,400 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:11:00,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:11:00,400 INFO L85 PathProgramCache]: Analyzing trace with hash 337150311, now seen corresponding path program 2 times [2024-06-03 22:11:00,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:11:00,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217470304] [2024-06-03 22:11:00,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:11:00,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:11:00,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:11:05,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-03 22:11:05,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:11:05,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217470304] [2024-06-03 22:11:05,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217470304] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:11:05,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:11:05,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:11:05,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165678864] [2024-06-03 22:11:05,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:11:05,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:11:05,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:11:05,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:11:05,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:11:05,939 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:11:05,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 80 transitions, 614 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:11:05,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:11:05,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:11:05,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:11:06,257 INFO L124 PetriNetUnfolderBase]: 261/490 cut-off events. [2024-06-03 22:11:06,258 INFO L125 PetriNetUnfolderBase]: For 11446/11446 co-relation queries the response was YES. [2024-06-03 22:11:06,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2505 conditions, 490 events. 261/490 cut-off events. For 11446/11446 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2066 event pairs, 35 based on Foata normal form. 4/493 useless extension candidates. Maximal degree in co-relation 2456. Up to 262 conditions per place. [2024-06-03 22:11:06,262 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 60 selfloop transitions, 42 changer transitions 3/107 dead transitions. [2024-06-03 22:11:06,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 107 transitions, 970 flow [2024-06-03 22:11:06,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:11:06,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:11:06,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 118 transitions. [2024-06-03 22:11:06,264 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43703703703703706 [2024-06-03 22:11:06,265 INFO L175 Difference]: Start difference. First operand has 101 places, 80 transitions, 614 flow. Second operand 9 states and 118 transitions. [2024-06-03 22:11:06,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 107 transitions, 970 flow [2024-06-03 22:11:06,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 107 transitions, 905 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-03 22:11:06,277 INFO L231 Difference]: Finished difference. Result has 101 places, 83 transitions, 677 flow [2024-06-03 22:11:06,277 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=553, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=677, PETRI_PLACES=101, PETRI_TRANSITIONS=83} [2024-06-03 22:11:06,278 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 72 predicate places. [2024-06-03 22:11:06,278 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 83 transitions, 677 flow [2024-06-03 22:11:06,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:11:06,278 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:11:06,278 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:11:06,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-03 22:11:06,279 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:11:06,279 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:11:06,279 INFO L85 PathProgramCache]: Analyzing trace with hash 337154031, now seen corresponding path program 3 times [2024-06-03 22:11:06,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:11:06,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452128870] [2024-06-03 22:11:06,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:11:06,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:11:06,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:11:10,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:11:10,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:11:10,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452128870] [2024-06-03 22:11:10,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452128870] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:11:10,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:11:10,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:11:10,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335410996] [2024-06-03 22:11:10,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:11:10,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:11:10,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:11:10,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:11:10,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:11:10,866 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:11:10,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 83 transitions, 677 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:11:10,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:11:10,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:11:10,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:11:11,190 INFO L124 PetriNetUnfolderBase]: 256/487 cut-off events. [2024-06-03 22:11:11,190 INFO L125 PetriNetUnfolderBase]: For 10610/10610 co-relation queries the response was YES. [2024-06-03 22:11:11,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2404 conditions, 487 events. 256/487 cut-off events. For 10610/10610 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2074 event pairs, 42 based on Foata normal form. 10/496 useless extension candidates. Maximal degree in co-relation 2355. Up to 272 conditions per place. [2024-06-03 22:11:11,199 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 52 selfloop transitions, 36 changer transitions 14/104 dead transitions. [2024-06-03 22:11:11,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 104 transitions, 937 flow [2024-06-03 22:11:11,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:11:11,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:11:11,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2024-06-03 22:11:11,200 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4222222222222222 [2024-06-03 22:11:11,200 INFO L175 Difference]: Start difference. First operand has 101 places, 83 transitions, 677 flow. Second operand 9 states and 114 transitions. [2024-06-03 22:11:11,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 104 transitions, 937 flow [2024-06-03 22:11:11,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 104 transitions, 867 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-06-03 22:11:11,213 INFO L231 Difference]: Finished difference. Result has 105 places, 78 transitions, 648 flow [2024-06-03 22:11:11,213 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=607, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=648, PETRI_PLACES=105, PETRI_TRANSITIONS=78} [2024-06-03 22:11:11,214 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 76 predicate places. [2024-06-03 22:11:11,214 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 78 transitions, 648 flow [2024-06-03 22:11:11,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:11:11,214 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:11:11,214 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:11:11,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-03 22:11:11,215 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:11:11,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:11:11,215 INFO L85 PathProgramCache]: Analyzing trace with hash -435479185, now seen corresponding path program 4 times [2024-06-03 22:11:11,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:11:11,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735535323] [2024-06-03 22:11:11,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:11:11,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:11:11,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:11:16,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:11:16,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:11:16,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735535323] [2024-06-03 22:11:16,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735535323] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:11:16,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:11:16,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:11:16,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387420645] [2024-06-03 22:11:16,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:11:16,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:11:16,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:11:16,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:11:16,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:11:16,314 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:11:16,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 78 transitions, 648 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:11:16,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:11:16,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:11:16,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:11:16,594 INFO L124 PetriNetUnfolderBase]: 248/475 cut-off events. [2024-06-03 22:11:16,594 INFO L125 PetriNetUnfolderBase]: For 11403/11403 co-relation queries the response was YES. [2024-06-03 22:11:16,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2409 conditions, 475 events. 248/475 cut-off events. For 11403/11403 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2013 event pairs, 42 based on Foata normal form. 10/484 useless extension candidates. Maximal degree in co-relation 2358. Up to 345 conditions per place. [2024-06-03 22:11:16,597 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 67 selfloop transitions, 18 changer transitions 11/98 dead transitions. [2024-06-03 22:11:16,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 98 transitions, 908 flow [2024-06-03 22:11:16,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:11:16,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:11:16,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 110 transitions. [2024-06-03 22:11:16,598 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4074074074074074 [2024-06-03 22:11:16,598 INFO L175 Difference]: Start difference. First operand has 105 places, 78 transitions, 648 flow. Second operand 9 states and 110 transitions. [2024-06-03 22:11:16,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 98 transitions, 908 flow [2024-06-03 22:11:16,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 98 transitions, 824 flow, removed 4 selfloop flow, removed 10 redundant places. [2024-06-03 22:11:16,610 INFO L231 Difference]: Finished difference. Result has 101 places, 75 transitions, 582 flow [2024-06-03 22:11:16,610 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=582, PETRI_PLACES=101, PETRI_TRANSITIONS=75} [2024-06-03 22:11:16,611 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 72 predicate places. [2024-06-03 22:11:16,611 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 75 transitions, 582 flow [2024-06-03 22:11:16,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:11:16,611 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:11:16,611 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:11:16,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-03 22:11:16,611 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:11:16,612 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:11:16,612 INFO L85 PathProgramCache]: Analyzing trace with hash 423842121, now seen corresponding path program 5 times [2024-06-03 22:11:16,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:11:16,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946200639] [2024-06-03 22:11:16,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:11:16,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:11:16,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:11:21,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:11:21,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:11:21,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946200639] [2024-06-03 22:11:21,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946200639] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:11:21,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:11:21,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:11:21,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793416518] [2024-06-03 22:11:21,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:11:21,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:11:21,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:11:21,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:11:21,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:11:21,243 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:11:21,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 75 transitions, 582 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:11:21,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:11:21,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:11:21,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:11:21,511 INFO L124 PetriNetUnfolderBase]: 263/512 cut-off events. [2024-06-03 22:11:21,511 INFO L125 PetriNetUnfolderBase]: For 13442/13442 co-relation queries the response was YES. [2024-06-03 22:11:21,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2656 conditions, 512 events. 263/512 cut-off events. For 13442/13442 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2243 event pairs, 53 based on Foata normal form. 8/519 useless extension candidates. Maximal degree in co-relation 2607. Up to 295 conditions per place. [2024-06-03 22:11:21,514 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 66 selfloop transitions, 25 changer transitions 7/100 dead transitions. [2024-06-03 22:11:21,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 100 transitions, 920 flow [2024-06-03 22:11:21,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:11:21,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:11:21,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2024-06-03 22:11:21,515 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2024-06-03 22:11:21,515 INFO L175 Difference]: Start difference. First operand has 101 places, 75 transitions, 582 flow. Second operand 9 states and 117 transitions. [2024-06-03 22:11:21,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 100 transitions, 920 flow [2024-06-03 22:11:21,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 100 transitions, 876 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-03 22:11:21,528 INFO L231 Difference]: Finished difference. Result has 99 places, 73 transitions, 580 flow [2024-06-03 22:11:21,528 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=542, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=580, PETRI_PLACES=99, PETRI_TRANSITIONS=73} [2024-06-03 22:11:21,528 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 70 predicate places. [2024-06-03 22:11:21,528 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 73 transitions, 580 flow [2024-06-03 22:11:21,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:11:21,529 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:11:21,529 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:11:21,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-03 22:11:21,529 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:11:21,529 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:11:21,529 INFO L85 PathProgramCache]: Analyzing trace with hash -435623335, now seen corresponding path program 6 times [2024-06-03 22:11:21,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:11:21,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420101487] [2024-06-03 22:11:21,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:11:21,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:11:21,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:11:25,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:11:25,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:11:25,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420101487] [2024-06-03 22:11:25,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420101487] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:11:25,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:11:25,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:11:25,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390354539] [2024-06-03 22:11:25,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:11:25,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:11:25,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:11:25,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:11:25,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:11:26,093 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:11:26,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 73 transitions, 580 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:11:26,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:11:26,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:11:26,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:11:26,333 INFO L124 PetriNetUnfolderBase]: 232/451 cut-off events. [2024-06-03 22:11:26,333 INFO L125 PetriNetUnfolderBase]: For 9821/9821 co-relation queries the response was YES. [2024-06-03 22:11:26,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2205 conditions, 451 events. 232/451 cut-off events. For 9821/9821 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1893 event pairs, 46 based on Foata normal form. 10/460 useless extension candidates. Maximal degree in co-relation 2157. Up to 320 conditions per place. [2024-06-03 22:11:26,336 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 62 selfloop transitions, 16 changer transitions 13/93 dead transitions. [2024-06-03 22:11:26,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 93 transitions, 828 flow [2024-06-03 22:11:26,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:11:26,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:11:26,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2024-06-03 22:11:26,337 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40370370370370373 [2024-06-03 22:11:26,337 INFO L175 Difference]: Start difference. First operand has 99 places, 73 transitions, 580 flow. Second operand 9 states and 109 transitions. [2024-06-03 22:11:26,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 93 transitions, 828 flow [2024-06-03 22:11:26,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 93 transitions, 776 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-03 22:11:26,349 INFO L231 Difference]: Finished difference. Result has 98 places, 69 transitions, 531 flow [2024-06-03 22:11:26,349 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=528, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=531, PETRI_PLACES=98, PETRI_TRANSITIONS=69} [2024-06-03 22:11:26,349 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 69 predicate places. [2024-06-03 22:11:26,350 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 69 transitions, 531 flow [2024-06-03 22:11:26,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:11:26,350 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:11:26,350 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:11:26,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-03 22:11:26,350 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:11:26,351 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:11:26,351 INFO L85 PathProgramCache]: Analyzing trace with hash -297098905, now seen corresponding path program 7 times [2024-06-03 22:11:26,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:11:26,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084367184] [2024-06-03 22:11:26,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:11:26,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:11:26,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:11:30,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:11:30,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:11:30,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084367184] [2024-06-03 22:11:30,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084367184] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:11:30,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:11:30,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:11:30,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410748734] [2024-06-03 22:11:30,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:11:30,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:11:30,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:11:30,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:11:30,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:11:31,087 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:11:31,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 69 transitions, 531 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:11:31,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:11:31,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:11:31,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:11:31,400 INFO L124 PetriNetUnfolderBase]: 227/448 cut-off events. [2024-06-03 22:11:31,400 INFO L125 PetriNetUnfolderBase]: For 9637/9637 co-relation queries the response was YES. [2024-06-03 22:11:31,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2210 conditions, 448 events. 227/448 cut-off events. For 9637/9637 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1887 event pairs, 44 based on Foata normal form. 8/455 useless extension candidates. Maximal degree in co-relation 2163. Up to 162 conditions per place. [2024-06-03 22:11:31,403 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 52 selfloop transitions, 35 changer transitions 10/99 dead transitions. [2024-06-03 22:11:31,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 99 transitions, 867 flow [2024-06-03 22:11:31,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:11:31,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:11:31,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 122 transitions. [2024-06-03 22:11:31,409 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45185185185185184 [2024-06-03 22:11:31,410 INFO L175 Difference]: Start difference. First operand has 98 places, 69 transitions, 531 flow. Second operand 9 states and 122 transitions. [2024-06-03 22:11:31,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 99 transitions, 867 flow [2024-06-03 22:11:31,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 99 transitions, 823 flow, removed 6 selfloop flow, removed 8 redundant places. [2024-06-03 22:11:31,421 INFO L231 Difference]: Finished difference. Result has 93 places, 67 transitions, 548 flow [2024-06-03 22:11:31,421 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=493, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=548, PETRI_PLACES=93, PETRI_TRANSITIONS=67} [2024-06-03 22:11:31,421 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 64 predicate places. [2024-06-03 22:11:31,422 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 67 transitions, 548 flow [2024-06-03 22:11:31,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:11:31,422 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:11:31,422 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:11:31,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-03 22:11:31,423 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:11:31,423 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:11:31,423 INFO L85 PathProgramCache]: Analyzing trace with hash -297095185, now seen corresponding path program 8 times [2024-06-03 22:11:31,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:11:31,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122026787] [2024-06-03 22:11:31,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:11:31,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:11:31,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:11:35,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:11:35,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:11:35,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122026787] [2024-06-03 22:11:35,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122026787] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:11:35,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:11:35,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:11:35,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178992774] [2024-06-03 22:11:35,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:11:35,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:11:35,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:11:35,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:11:35,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:11:35,997 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:11:35,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 67 transitions, 548 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:11:35,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:11:35,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:11:35,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:11:36,360 INFO L124 PetriNetUnfolderBase]: 217/428 cut-off events. [2024-06-03 22:11:36,360 INFO L125 PetriNetUnfolderBase]: For 8833/8833 co-relation queries the response was YES. [2024-06-03 22:11:36,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2123 conditions, 428 events. 217/428 cut-off events. For 8833/8833 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1807 event pairs, 54 based on Foata normal form. 10/437 useless extension candidates. Maximal degree in co-relation 2078. Up to 272 conditions per place. [2024-06-03 22:11:36,362 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 55 selfloop transitions, 23 changer transitions 11/91 dead transitions. [2024-06-03 22:11:36,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 91 transitions, 804 flow [2024-06-03 22:11:36,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:11:36,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:11:36,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2024-06-03 22:11:36,363 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4222222222222222 [2024-06-03 22:11:36,364 INFO L175 Difference]: Start difference. First operand has 93 places, 67 transitions, 548 flow. Second operand 9 states and 114 transitions. [2024-06-03 22:11:36,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 91 transitions, 804 flow [2024-06-03 22:11:36,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 91 transitions, 738 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-03 22:11:36,373 INFO L231 Difference]: Finished difference. Result has 92 places, 64 transitions, 503 flow [2024-06-03 22:11:36,373 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=482, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=503, PETRI_PLACES=92, PETRI_TRANSITIONS=64} [2024-06-03 22:11:36,373 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 63 predicate places. [2024-06-03 22:11:36,374 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 64 transitions, 503 flow [2024-06-03 22:11:36,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:11:36,374 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:11:36,374 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:11:36,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-03 22:11:36,374 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:11:36,374 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:11:36,375 INFO L85 PathProgramCache]: Analyzing trace with hash 550710567, now seen corresponding path program 9 times [2024-06-03 22:11:36,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:11:36,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618496927] [2024-06-03 22:11:36,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:11:36,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:11:36,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:11:41,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:11:41,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:11:41,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618496927] [2024-06-03 22:11:41,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618496927] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:11:41,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:11:41,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:11:41,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605221625] [2024-06-03 22:11:41,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:11:41,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:11:41,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:11:41,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:11:41,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:11:41,275 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:11:41,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 64 transitions, 503 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:11:41,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:11:41,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:11:41,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:11:41,612 INFO L124 PetriNetUnfolderBase]: 209/416 cut-off events. [2024-06-03 22:11:41,613 INFO L125 PetriNetUnfolderBase]: For 8027/8027 co-relation queries the response was YES. [2024-06-03 22:11:41,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2022 conditions, 416 events. 209/416 cut-off events. For 8027/8027 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1734 event pairs, 46 based on Foata normal form. 10/425 useless extension candidates. Maximal degree in co-relation 1978. Up to 286 conditions per place. [2024-06-03 22:11:41,615 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 57 selfloop transitions, 18 changer transitions 11/88 dead transitions. [2024-06-03 22:11:41,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 88 transitions, 753 flow [2024-06-03 22:11:41,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:11:41,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:11:41,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 113 transitions. [2024-06-03 22:11:41,616 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4185185185185185 [2024-06-03 22:11:41,616 INFO L175 Difference]: Start difference. First operand has 92 places, 64 transitions, 503 flow. Second operand 9 states and 113 transitions. [2024-06-03 22:11:41,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 88 transitions, 753 flow [2024-06-03 22:11:41,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 88 transitions, 703 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-03 22:11:41,624 INFO L231 Difference]: Finished difference. Result has 90 places, 61 transitions, 466 flow [2024-06-03 22:11:41,624 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=453, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=466, PETRI_PLACES=90, PETRI_TRANSITIONS=61} [2024-06-03 22:11:41,624 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 61 predicate places. [2024-06-03 22:11:41,624 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 61 transitions, 466 flow [2024-06-03 22:11:41,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:11:41,624 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:11:41,625 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:11:41,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-03 22:11:41,625 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:11:41,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:11:41,625 INFO L85 PathProgramCache]: Analyzing trace with hash 550716519, now seen corresponding path program 1 times [2024-06-03 22:11:41,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:11:41,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307909328] [2024-06-03 22:11:41,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:11:41,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:11:41,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:11:46,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:11:46,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:11:46,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307909328] [2024-06-03 22:11:46,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307909328] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:11:46,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:11:46,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:11:46,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992493419] [2024-06-03 22:11:46,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:11:46,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:11:46,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:11:46,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:11:46,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:11:46,760 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:11:46,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 61 transitions, 466 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:11:46,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:11:46,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:11:46,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:11:47,066 INFO L124 PetriNetUnfolderBase]: 190/379 cut-off events. [2024-06-03 22:11:47,066 INFO L125 PetriNetUnfolderBase]: For 5564/5564 co-relation queries the response was YES. [2024-06-03 22:11:47,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1853 conditions, 379 events. 190/379 cut-off events. For 5564/5564 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1524 event pairs, 43 based on Foata normal form. 2/380 useless extension candidates. Maximal degree in co-relation 1810. Up to 276 conditions per place. [2024-06-03 22:11:47,069 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 56 selfloop transitions, 24 changer transitions 0/82 dead transitions. [2024-06-03 22:11:47,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 82 transitions, 698 flow [2024-06-03 22:11:47,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:11:47,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:11:47,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 100 transitions. [2024-06-03 22:11:47,070 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2024-06-03 22:11:47,071 INFO L175 Difference]: Start difference. First operand has 90 places, 61 transitions, 466 flow. Second operand 8 states and 100 transitions. [2024-06-03 22:11:47,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 82 transitions, 698 flow [2024-06-03 22:11:47,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 82 transitions, 658 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-03 22:11:47,077 INFO L231 Difference]: Finished difference. Result has 88 places, 64 transitions, 521 flow [2024-06-03 22:11:47,077 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=426, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=521, PETRI_PLACES=88, PETRI_TRANSITIONS=64} [2024-06-03 22:11:47,078 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 59 predicate places. [2024-06-03 22:11:47,078 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 64 transitions, 521 flow [2024-06-03 22:11:47,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:11:47,078 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:11:47,078 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:11:47,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-03 22:11:47,079 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:11:47,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:11:47,079 INFO L85 PathProgramCache]: Analyzing trace with hash 556280709, now seen corresponding path program 2 times [2024-06-03 22:11:47,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:11:47,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851505167] [2024-06-03 22:11:47,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:11:47,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:11:47,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:11:51,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:11:51,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:11:51,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851505167] [2024-06-03 22:11:51,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851505167] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:11:51,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:11:51,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:11:51,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929380744] [2024-06-03 22:11:51,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:11:51,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:11:51,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:11:51,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:11:51,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:11:52,120 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:11:52,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 64 transitions, 521 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:11:52,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:11:52,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:11:52,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:11:52,371 INFO L124 PetriNetUnfolderBase]: 194/387 cut-off events. [2024-06-03 22:11:52,372 INFO L125 PetriNetUnfolderBase]: For 5168/5168 co-relation queries the response was YES. [2024-06-03 22:11:52,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1918 conditions, 387 events. 194/387 cut-off events. For 5168/5168 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1585 event pairs, 48 based on Foata normal form. 2/388 useless extension candidates. Maximal degree in co-relation 1875. Up to 301 conditions per place. [2024-06-03 22:11:52,374 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 60 selfloop transitions, 17 changer transitions 0/79 dead transitions. [2024-06-03 22:11:52,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 79 transitions, 721 flow [2024-06-03 22:11:52,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:11:52,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:11:52,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2024-06-03 22:11:52,376 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39166666666666666 [2024-06-03 22:11:52,376 INFO L175 Difference]: Start difference. First operand has 88 places, 64 transitions, 521 flow. Second operand 8 states and 94 transitions. [2024-06-03 22:11:52,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 79 transitions, 721 flow [2024-06-03 22:11:52,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 79 transitions, 682 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-03 22:11:52,383 INFO L231 Difference]: Finished difference. Result has 91 places, 65 transitions, 532 flow [2024-06-03 22:11:52,384 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=482, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=532, PETRI_PLACES=91, PETRI_TRANSITIONS=65} [2024-06-03 22:11:52,384 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 62 predicate places. [2024-06-03 22:11:52,384 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 65 transitions, 532 flow [2024-06-03 22:11:52,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:11:52,385 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:11:52,385 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:11:52,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-03 22:11:52,386 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:11:52,386 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:11:52,386 INFO L85 PathProgramCache]: Analyzing trace with hash 556288149, now seen corresponding path program 3 times [2024-06-03 22:11:52,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:11:52,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721428259] [2024-06-03 22:11:52,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:11:52,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:11:52,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:11:57,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:11:57,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:11:57,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721428259] [2024-06-03 22:11:57,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721428259] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:11:57,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:11:57,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:11:57,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392402128] [2024-06-03 22:11:57,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:11:57,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:11:57,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:11:57,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:11:57,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:11:57,515 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:11:57,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 65 transitions, 532 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:11:57,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:11:57,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:11:57,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:11:57,761 INFO L124 PetriNetUnfolderBase]: 198/395 cut-off events. [2024-06-03 22:11:57,761 INFO L125 PetriNetUnfolderBase]: For 5714/5714 co-relation queries the response was YES. [2024-06-03 22:11:57,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1979 conditions, 395 events. 198/395 cut-off events. For 5714/5714 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1626 event pairs, 46 based on Foata normal form. 2/396 useless extension candidates. Maximal degree in co-relation 1935. Up to 273 conditions per place. [2024-06-03 22:11:57,763 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 58 selfloop transitions, 20 changer transitions 0/80 dead transitions. [2024-06-03 22:11:57,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 80 transitions, 734 flow [2024-06-03 22:11:57,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:11:57,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:11:57,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 95 transitions. [2024-06-03 22:11:57,765 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2024-06-03 22:11:57,765 INFO L175 Difference]: Start difference. First operand has 91 places, 65 transitions, 532 flow. Second operand 8 states and 95 transitions. [2024-06-03 22:11:57,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 80 transitions, 734 flow [2024-06-03 22:11:57,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 80 transitions, 694 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-03 22:11:57,773 INFO L231 Difference]: Finished difference. Result has 93 places, 66 transitions, 551 flow [2024-06-03 22:11:57,773 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=551, PETRI_PLACES=93, PETRI_TRANSITIONS=66} [2024-06-03 22:11:57,773 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 64 predicate places. [2024-06-03 22:11:57,774 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 66 transitions, 551 flow [2024-06-03 22:11:57,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:11:57,774 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:11:57,774 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:11:57,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-03 22:11:57,774 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:11:57,774 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:11:57,775 INFO L85 PathProgramCache]: Analyzing trace with hash 556072947, now seen corresponding path program 10 times [2024-06-03 22:11:57,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:11:57,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536656822] [2024-06-03 22:11:57,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:11:57,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:11:57,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:12:03,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:12:03,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:12:03,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536656822] [2024-06-03 22:12:03,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536656822] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:12:03,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:12:03,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:12:03,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688812029] [2024-06-03 22:12:03,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:12:03,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:12:03,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:12:03,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:12:03,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:12:03,755 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:12:03,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 66 transitions, 551 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:12:03,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:12:03,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:12:03,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:12:04,027 INFO L124 PetriNetUnfolderBase]: 222/451 cut-off events. [2024-06-03 22:12:04,027 INFO L125 PetriNetUnfolderBase]: For 9572/9572 co-relation queries the response was YES. [2024-06-03 22:12:04,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2162 conditions, 451 events. 222/451 cut-off events. For 9572/9572 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1987 event pairs, 58 based on Foata normal form. 16/466 useless extension candidates. Maximal degree in co-relation 2117. Up to 291 conditions per place. [2024-06-03 22:12:04,029 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 55 selfloop transitions, 12 changer transitions 17/86 dead transitions. [2024-06-03 22:12:04,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 86 transitions, 785 flow [2024-06-03 22:12:04,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:12:04,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:12:04,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2024-06-03 22:12:04,031 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-03 22:12:04,031 INFO L175 Difference]: Start difference. First operand has 93 places, 66 transitions, 551 flow. Second operand 9 states and 108 transitions. [2024-06-03 22:12:04,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 86 transitions, 785 flow [2024-06-03 22:12:04,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 86 transitions, 738 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-03 22:12:04,039 INFO L231 Difference]: Finished difference. Result has 96 places, 59 transitions, 471 flow [2024-06-03 22:12:04,040 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=471, PETRI_PLACES=96, PETRI_TRANSITIONS=59} [2024-06-03 22:12:04,040 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 67 predicate places. [2024-06-03 22:12:04,040 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 59 transitions, 471 flow [2024-06-03 22:12:04,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:12:04,040 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:12:04,041 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:12:04,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-03 22:12:04,041 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:12:04,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:12:04,041 INFO L85 PathProgramCache]: Analyzing trace with hash 401821465, now seen corresponding path program 4 times [2024-06-03 22:12:04,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:12:04,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386589439] [2024-06-03 22:12:04,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:12:04,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:12:04,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:12:08,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:12:08,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:12:08,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386589439] [2024-06-03 22:12:08,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386589439] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:12:08,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:12:08,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:12:08,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111478553] [2024-06-03 22:12:08,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:12:08,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:12:08,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:12:08,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:12:08,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:12:08,612 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:12:08,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 59 transitions, 471 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:12:08,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:12:08,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:12:08,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:12:08,777 INFO L124 PetriNetUnfolderBase]: 178/367 cut-off events. [2024-06-03 22:12:08,777 INFO L125 PetriNetUnfolderBase]: For 6635/6635 co-relation queries the response was YES. [2024-06-03 22:12:08,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1861 conditions, 367 events. 178/367 cut-off events. For 6635/6635 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1504 event pairs, 48 based on Foata normal form. 2/368 useless extension candidates. Maximal degree in co-relation 1815. Up to 327 conditions per place. [2024-06-03 22:12:08,779 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 58 selfloop transitions, 10 changer transitions 0/70 dead transitions. [2024-06-03 22:12:08,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 70 transitions, 643 flow [2024-06-03 22:12:08,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:12:08,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:12:08,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2024-06-03 22:12:08,781 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3761904761904762 [2024-06-03 22:12:08,781 INFO L175 Difference]: Start difference. First operand has 96 places, 59 transitions, 471 flow. Second operand 7 states and 79 transitions. [2024-06-03 22:12:08,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 70 transitions, 643 flow [2024-06-03 22:12:08,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 70 transitions, 609 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-03 22:12:08,789 INFO L231 Difference]: Finished difference. Result has 89 places, 60 transitions, 477 flow [2024-06-03 22:12:08,790 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=439, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=477, PETRI_PLACES=89, PETRI_TRANSITIONS=60} [2024-06-03 22:12:08,791 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 60 predicate places. [2024-06-03 22:12:08,791 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 60 transitions, 477 flow [2024-06-03 22:12:08,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:12:08,792 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:12:08,792 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:12:08,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-03 22:12:08,796 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:12:08,796 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:12:08,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1934464683, now seen corresponding path program 5 times [2024-06-03 22:12:08,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:12:08,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273566257] [2024-06-03 22:12:08,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:12:08,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:12:08,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:12:13,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:12:13,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:12:13,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273566257] [2024-06-03 22:12:13,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273566257] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:12:13,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:12:13,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:12:13,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590129786] [2024-06-03 22:12:13,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:12:13,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:12:13,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:12:13,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:12:13,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:12:13,467 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:12:13,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 60 transitions, 477 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:12:13,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:12:13,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:12:13,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:12:13,673 INFO L124 PetriNetUnfolderBase]: 182/375 cut-off events. [2024-06-03 22:12:13,674 INFO L125 PetriNetUnfolderBase]: For 5665/5665 co-relation queries the response was YES. [2024-06-03 22:12:13,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1848 conditions, 375 events. 182/375 cut-off events. For 5665/5665 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1566 event pairs, 46 based on Foata normal form. 2/376 useless extension candidates. Maximal degree in co-relation 1804. Up to 218 conditions per place. [2024-06-03 22:12:13,676 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 48 selfloop transitions, 25 changer transitions 0/75 dead transitions. [2024-06-03 22:12:13,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 75 transitions, 713 flow [2024-06-03 22:12:13,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:12:13,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:12:13,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 89 transitions. [2024-06-03 22:12:13,705 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4238095238095238 [2024-06-03 22:12:13,705 INFO L175 Difference]: Start difference. First operand has 89 places, 60 transitions, 477 flow. Second operand 7 states and 89 transitions. [2024-06-03 22:12:13,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 75 transitions, 713 flow [2024-06-03 22:12:13,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 75 transitions, 685 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-06-03 22:12:13,713 INFO L231 Difference]: Finished difference. Result has 91 places, 61 transitions, 520 flow [2024-06-03 22:12:13,713 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=449, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=520, PETRI_PLACES=91, PETRI_TRANSITIONS=61} [2024-06-03 22:12:13,714 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 62 predicate places. [2024-06-03 22:12:13,714 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 61 transitions, 520 flow [2024-06-03 22:12:13,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:12:13,714 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:12:13,714 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:12:13,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-03 22:12:13,715 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:12:13,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:12:13,715 INFO L85 PathProgramCache]: Analyzing trace with hash 392617255, now seen corresponding path program 6 times [2024-06-03 22:12:13,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:12:13,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018285636] [2024-06-03 22:12:13,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:12:13,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:12:13,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:12:18,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:12:18,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:12:18,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018285636] [2024-06-03 22:12:18,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018285636] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:12:18,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:12:18,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:12:18,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632641393] [2024-06-03 22:12:18,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:12:18,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:12:18,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:12:18,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:12:18,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:12:18,686 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:12:18,687 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 61 transitions, 520 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:12:18,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:12:18,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:12:18,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:12:18,933 INFO L124 PetriNetUnfolderBase]: 179/370 cut-off events. [2024-06-03 22:12:18,933 INFO L125 PetriNetUnfolderBase]: For 5776/5776 co-relation queries the response was YES. [2024-06-03 22:12:18,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1846 conditions, 370 events. 179/370 cut-off events. For 5776/5776 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1522 event pairs, 49 based on Foata normal form. 2/371 useless extension candidates. Maximal degree in co-relation 1801. Up to 262 conditions per place. [2024-06-03 22:12:18,935 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 50 selfloop transitions, 25 changer transitions 0/77 dead transitions. [2024-06-03 22:12:18,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 77 transitions, 712 flow [2024-06-03 22:12:18,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:12:18,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:12:18,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 92 transitions. [2024-06-03 22:12:18,937 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4380952380952381 [2024-06-03 22:12:18,937 INFO L175 Difference]: Start difference. First operand has 91 places, 61 transitions, 520 flow. Second operand 7 states and 92 transitions. [2024-06-03 22:12:18,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 77 transitions, 712 flow [2024-06-03 22:12:18,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 77 transitions, 662 flow, removed 9 selfloop flow, removed 4 redundant places. [2024-06-03 22:12:18,946 INFO L231 Difference]: Finished difference. Result has 94 places, 61 transitions, 527 flow [2024-06-03 22:12:18,946 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=527, PETRI_PLACES=94, PETRI_TRANSITIONS=61} [2024-06-03 22:12:18,947 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 65 predicate places. [2024-06-03 22:12:18,947 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 61 transitions, 527 flow [2024-06-03 22:12:18,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:12:18,948 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:12:18,948 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:12:18,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-03 22:12:18,948 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:12:18,948 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:12:18,948 INFO L85 PathProgramCache]: Analyzing trace with hash 135908983, now seen corresponding path program 11 times [2024-06-03 22:12:18,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:12:18,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369449871] [2024-06-03 22:12:18,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:12:18,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:12:18,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:12:23,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:12:23,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:12:23,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369449871] [2024-06-03 22:12:23,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369449871] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:12:23,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:12:23,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:12:23,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669214620] [2024-06-03 22:12:23,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:12:23,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:12:23,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:12:23,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:12:23,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:12:23,684 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:12:23,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 61 transitions, 527 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:12:23,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:12:23,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:12:23,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:12:23,944 INFO L124 PetriNetUnfolderBase]: 166/347 cut-off events. [2024-06-03 22:12:23,944 INFO L125 PetriNetUnfolderBase]: For 5611/5611 co-relation queries the response was YES. [2024-06-03 22:12:23,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1568 conditions, 347 events. 166/347 cut-off events. For 5611/5611 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1428 event pairs, 40 based on Foata normal form. 10/356 useless extension candidates. Maximal degree in co-relation 1522. Up to 213 conditions per place. [2024-06-03 22:12:23,946 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 47 selfloop transitions, 22 changer transitions 11/82 dead transitions. [2024-06-03 22:12:23,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 82 transitions, 747 flow [2024-06-03 22:12:23,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:12:23,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:12:23,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 105 transitions. [2024-06-03 22:12:23,947 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4375 [2024-06-03 22:12:23,947 INFO L175 Difference]: Start difference. First operand has 94 places, 61 transitions, 527 flow. Second operand 8 states and 105 transitions. [2024-06-03 22:12:23,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 82 transitions, 747 flow [2024-06-03 22:12:23,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 82 transitions, 681 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-03 22:12:23,955 INFO L231 Difference]: Finished difference. Result has 96 places, 56 transitions, 453 flow [2024-06-03 22:12:23,955 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=453, PETRI_PLACES=96, PETRI_TRANSITIONS=56} [2024-06-03 22:12:23,956 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 67 predicate places. [2024-06-03 22:12:23,956 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 56 transitions, 453 flow [2024-06-03 22:12:23,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:12:23,956 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:12:23,956 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:12:23,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-03 22:12:23,956 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:12:23,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:12:23,957 INFO L85 PathProgramCache]: Analyzing trace with hash 258973110, now seen corresponding path program 1 times [2024-06-03 22:12:23,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:12:23,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106669033] [2024-06-03 22:12:23,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:12:23,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:12:24,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:12:29,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:12:29,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:12:29,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106669033] [2024-06-03 22:12:29,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106669033] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:12:29,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:12:29,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:12:29,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144464689] [2024-06-03 22:12:29,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:12:29,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:12:29,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:12:29,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:12:29,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:12:29,629 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:12:29,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 56 transitions, 453 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:12:29,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:12:29,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:12:29,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:12:29,887 INFO L124 PetriNetUnfolderBase]: 146/315 cut-off events. [2024-06-03 22:12:29,888 INFO L125 PetriNetUnfolderBase]: For 4122/4122 co-relation queries the response was YES. [2024-06-03 22:12:29,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1375 conditions, 315 events. 146/315 cut-off events. For 4122/4122 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1285 event pairs, 34 based on Foata normal form. 6/320 useless extension candidates. Maximal degree in co-relation 1328. Up to 211 conditions per place. [2024-06-03 22:12:29,890 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 53 selfloop transitions, 13 changer transitions 6/74 dead transitions. [2024-06-03 22:12:29,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 74 transitions, 645 flow [2024-06-03 22:12:29,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:12:29,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:12:29,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2024-06-03 22:12:29,891 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2024-06-03 22:12:29,891 INFO L175 Difference]: Start difference. First operand has 96 places, 56 transitions, 453 flow. Second operand 9 states and 105 transitions. [2024-06-03 22:12:29,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 74 transitions, 645 flow [2024-06-03 22:12:29,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 74 transitions, 569 flow, removed 3 selfloop flow, removed 12 redundant places. [2024-06-03 22:12:29,898 INFO L231 Difference]: Finished difference. Result has 91 places, 54 transitions, 392 flow [2024-06-03 22:12:29,898 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=377, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=392, PETRI_PLACES=91, PETRI_TRANSITIONS=54} [2024-06-03 22:12:29,898 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 62 predicate places. [2024-06-03 22:12:29,899 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 54 transitions, 392 flow [2024-06-03 22:12:29,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:12:29,899 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:12:29,899 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:12:29,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-03 22:12:29,899 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:12:29,899 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:12:29,900 INFO L85 PathProgramCache]: Analyzing trace with hash -442641686, now seen corresponding path program 2 times [2024-06-03 22:12:29,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:12:29,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685161893] [2024-06-03 22:12:29,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:12:29,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:12:29,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:12:35,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:12:35,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:12:35,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685161893] [2024-06-03 22:12:35,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685161893] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:12:35,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:12:35,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:12:35,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981926811] [2024-06-03 22:12:35,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:12:35,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:12:35,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:12:35,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:12:35,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:12:35,616 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:12:35,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 54 transitions, 392 flow. Second operand has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:12:35,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:12:35,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:12:35,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:12:35,839 INFO L124 PetriNetUnfolderBase]: 133/284 cut-off events. [2024-06-03 22:12:35,840 INFO L125 PetriNetUnfolderBase]: For 2652/2652 co-relation queries the response was YES. [2024-06-03 22:12:35,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1189 conditions, 284 events. 133/284 cut-off events. For 2652/2652 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1097 event pairs, 32 based on Foata normal form. 2/285 useless extension candidates. Maximal degree in co-relation 1146. Up to 187 conditions per place. [2024-06-03 22:12:35,857 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 52 selfloop transitions, 17 changer transitions 0/71 dead transitions. [2024-06-03 22:12:35,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 71 transitions, 574 flow [2024-06-03 22:12:35,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:12:35,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:12:35,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 102 transitions. [2024-06-03 22:12:35,869 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37777777777777777 [2024-06-03 22:12:35,869 INFO L175 Difference]: Start difference. First operand has 91 places, 54 transitions, 392 flow. Second operand 9 states and 102 transitions. [2024-06-03 22:12:35,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 71 transitions, 574 flow [2024-06-03 22:12:35,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 71 transitions, 517 flow, removed 1 selfloop flow, removed 10 redundant places. [2024-06-03 22:12:35,876 INFO L231 Difference]: Finished difference. Result has 89 places, 55 transitions, 381 flow [2024-06-03 22:12:35,876 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=381, PETRI_PLACES=89, PETRI_TRANSITIONS=55} [2024-06-03 22:12:35,876 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 60 predicate places. [2024-06-03 22:12:35,877 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 55 transitions, 381 flow [2024-06-03 22:12:35,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:12:35,877 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:12:35,877 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:12:35,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-03 22:12:35,878 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:12:35,878 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:12:35,879 INFO L85 PathProgramCache]: Analyzing trace with hash -107656330, now seen corresponding path program 3 times [2024-06-03 22:12:35,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:12:35,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478898183] [2024-06-03 22:12:35,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:12:35,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:12:35,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:12:41,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:12:41,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:12:41,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478898183] [2024-06-03 22:12:41,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478898183] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:12:41,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:12:41,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:12:41,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361316117] [2024-06-03 22:12:41,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:12:41,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:12:41,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:12:41,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:12:41,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:12:41,332 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:12:41,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 55 transitions, 381 flow. Second operand has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:12:41,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:12:41,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:12:41,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:12:41,610 INFO L124 PetriNetUnfolderBase]: 141/304 cut-off events. [2024-06-03 22:12:41,610 INFO L125 PetriNetUnfolderBase]: For 3338/3338 co-relation queries the response was YES. [2024-06-03 22:12:41,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1221 conditions, 304 events. 141/304 cut-off events. For 3338/3338 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1206 event pairs, 36 based on Foata normal form. 6/309 useless extension candidates. Maximal degree in co-relation 1178. Up to 215 conditions per place. [2024-06-03 22:12:41,612 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 52 selfloop transitions, 9 changer transitions 13/76 dead transitions. [2024-06-03 22:12:41,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 76 transitions, 587 flow [2024-06-03 22:12:41,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:12:41,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:12:41,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2024-06-03 22:12:41,613 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3925925925925926 [2024-06-03 22:12:41,613 INFO L175 Difference]: Start difference. First operand has 89 places, 55 transitions, 381 flow. Second operand 9 states and 106 transitions. [2024-06-03 22:12:41,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 76 transitions, 587 flow [2024-06-03 22:12:41,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 76 transitions, 551 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-06-03 22:12:41,619 INFO L231 Difference]: Finished difference. Result has 91 places, 50 transitions, 329 flow [2024-06-03 22:12:41,619 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=329, PETRI_PLACES=91, PETRI_TRANSITIONS=50} [2024-06-03 22:12:41,619 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 62 predicate places. [2024-06-03 22:12:41,619 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 50 transitions, 329 flow [2024-06-03 22:12:41,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:12:41,620 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:12:41,620 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:12:41,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-03 22:12:41,620 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:12:41,620 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:12:41,620 INFO L85 PathProgramCache]: Analyzing trace with hash -428435708, now seen corresponding path program 4 times [2024-06-03 22:12:41,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:12:41,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888338763] [2024-06-03 22:12:41,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:12:41,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:12:41,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:12:46,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:12:46,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:12:46,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888338763] [2024-06-03 22:12:46,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888338763] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:12:46,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:12:46,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:12:46,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62977776] [2024-06-03 22:12:46,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:12:46,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:12:46,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:12:46,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:12:46,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:12:46,865 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:12:46,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 50 transitions, 329 flow. Second operand has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:12:46,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:12:46,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:12:46,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:12:47,074 INFO L124 PetriNetUnfolderBase]: 129/280 cut-off events. [2024-06-03 22:12:47,075 INFO L125 PetriNetUnfolderBase]: For 3651/3651 co-relation queries the response was YES. [2024-06-03 22:12:47,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1111 conditions, 280 events. 129/280 cut-off events. For 3651/3651 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1068 event pairs, 34 based on Foata normal form. 6/285 useless extension candidates. Maximal degree in co-relation 1067. Up to 216 conditions per place. [2024-06-03 22:12:47,076 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 42 selfloop transitions, 6 changer transitions 14/64 dead transitions. [2024-06-03 22:12:47,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 64 transitions, 489 flow [2024-06-03 22:12:47,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:12:47,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:12:47,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2024-06-03 22:12:47,078 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37083333333333335 [2024-06-03 22:12:47,078 INFO L175 Difference]: Start difference. First operand has 91 places, 50 transitions, 329 flow. Second operand 8 states and 89 transitions. [2024-06-03 22:12:47,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 64 transitions, 489 flow [2024-06-03 22:12:47,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 64 transitions, 460 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-03 22:12:47,084 INFO L231 Difference]: Finished difference. Result has 86 places, 46 transitions, 295 flow [2024-06-03 22:12:47,084 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=295, PETRI_PLACES=86, PETRI_TRANSITIONS=46} [2024-06-03 22:12:47,084 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 57 predicate places. [2024-06-03 22:12:47,085 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 46 transitions, 295 flow [2024-06-03 22:12:47,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:12:47,085 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:12:47,085 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:12:47,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-03 22:12:47,085 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:12:47,085 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:12:47,086 INFO L85 PathProgramCache]: Analyzing trace with hash -713535578, now seen corresponding path program 5 times [2024-06-03 22:12:47,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:12:47,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740528153] [2024-06-03 22:12:47,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:12:47,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:12:47,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:12:52,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:12:52,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:12:52,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740528153] [2024-06-03 22:12:52,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740528153] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:12:52,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:12:52,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:12:52,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019893688] [2024-06-03 22:12:52,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:12:52,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:12:52,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:12:52,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:12:52,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:12:52,428 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:12:52,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 46 transitions, 295 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:12:52,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:12:52,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:12:52,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:12:52,656 INFO L124 PetriNetUnfolderBase]: 115/254 cut-off events. [2024-06-03 22:12:52,656 INFO L125 PetriNetUnfolderBase]: For 3664/3664 co-relation queries the response was YES. [2024-06-03 22:12:52,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1018 conditions, 254 events. 115/254 cut-off events. For 3664/3664 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 936 event pairs, 30 based on Foata normal form. 6/259 useless extension candidates. Maximal degree in co-relation 975. Up to 144 conditions per place. [2024-06-03 22:12:52,658 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 39 selfloop transitions, 12 changer transitions 10/63 dead transitions. [2024-06-03 22:12:52,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 63 transitions, 463 flow [2024-06-03 22:12:52,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:12:52,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:12:52,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2024-06-03 22:12:52,659 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-03 22:12:52,659 INFO L175 Difference]: Start difference. First operand has 86 places, 46 transitions, 295 flow. Second operand 8 states and 96 transitions. [2024-06-03 22:12:52,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 63 transitions, 463 flow [2024-06-03 22:12:52,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 63 transitions, 443 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-03 22:12:52,663 INFO L231 Difference]: Finished difference. Result has 80 places, 42 transitions, 274 flow [2024-06-03 22:12:52,664 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=274, PETRI_PLACES=80, PETRI_TRANSITIONS=42} [2024-06-03 22:12:52,664 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 51 predicate places. [2024-06-03 22:12:52,664 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 42 transitions, 274 flow [2024-06-03 22:12:52,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:12:52,664 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:12:52,664 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:12:52,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-03 22:12:52,665 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:12:52,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:12:52,665 INFO L85 PathProgramCache]: Analyzing trace with hash -713766218, now seen corresponding path program 6 times [2024-06-03 22:12:52,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:12:52,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548031539] [2024-06-03 22:12:52,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:12:52,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:12:52,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:12:57,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:12:57,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:12:57,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548031539] [2024-06-03 22:12:57,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548031539] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:12:57,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:12:57,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:12:57,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162791470] [2024-06-03 22:12:57,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:12:57,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:12:57,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:12:57,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:12:57,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:12:58,022 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:12:58,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 42 transitions, 274 flow. Second operand has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:12:58,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:12:58,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:12:58,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:12:58,257 INFO L124 PetriNetUnfolderBase]: 96/221 cut-off events. [2024-06-03 22:12:58,257 INFO L125 PetriNetUnfolderBase]: For 2394/2394 co-relation queries the response was YES. [2024-06-03 22:12:58,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 854 conditions, 221 events. 96/221 cut-off events. For 2394/2394 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 786 event pairs, 27 based on Foata normal form. 6/226 useless extension candidates. Maximal degree in co-relation 814. Up to 127 conditions per place. [2024-06-03 22:12:58,259 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 34 selfloop transitions, 8 changer transitions 17/61 dead transitions. [2024-06-03 22:12:58,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 61 transitions, 440 flow [2024-06-03 22:12:58,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:12:58,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:12:58,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 97 transitions. [2024-06-03 22:12:58,260 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4041666666666667 [2024-06-03 22:12:58,260 INFO L175 Difference]: Start difference. First operand has 80 places, 42 transitions, 274 flow. Second operand 8 states and 97 transitions. [2024-06-03 22:12:58,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 61 transitions, 440 flow [2024-06-03 22:12:58,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 61 transitions, 406 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-03 22:12:58,263 INFO L231 Difference]: Finished difference. Result has 76 places, 32 transitions, 185 flow [2024-06-03 22:12:58,264 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=185, PETRI_PLACES=76, PETRI_TRANSITIONS=32} [2024-06-03 22:12:58,264 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 47 predicate places. [2024-06-03 22:12:58,264 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 32 transitions, 185 flow [2024-06-03 22:12:58,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:12:58,264 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:12:58,264 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-03 22:12:58,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-03 22:12:58,265 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:12:58,265 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:12:58,265 INFO L85 PathProgramCache]: Analyzing trace with hash 437945416, now seen corresponding path program 1 times [2024-06-03 22:12:58,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:12:58,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883846256] [2024-06-03 22:12:58,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:12:58,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:12:58,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:13:03,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:13:03,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:13:03,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883846256] [2024-06-03 22:13:03,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883846256] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:13:03,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:13:03,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:13:03,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118382276] [2024-06-03 22:13:03,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:13:03,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:13:03,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:13:03,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:13:03,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:13:04,045 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:13:04,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 32 transitions, 185 flow. Second operand has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:13:04,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:13:04,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:13:04,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:13:04,285 INFO L124 PetriNetUnfolderBase]: 66/155 cut-off events. [2024-06-03 22:13:04,285 INFO L125 PetriNetUnfolderBase]: For 1224/1224 co-relation queries the response was YES. [2024-06-03 22:13:04,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 551 conditions, 155 events. 66/155 cut-off events. For 1224/1224 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 445 event pairs, 13 based on Foata normal form. 4/158 useless extension candidates. Maximal degree in co-relation 526. Up to 57 conditions per place. [2024-06-03 22:13:04,286 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 23 selfloop transitions, 6 changer transitions 19/50 dead transitions. [2024-06-03 22:13:04,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 50 transitions, 323 flow [2024-06-03 22:13:04,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:13:04,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:13:04,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 105 transitions. [2024-06-03 22:13:04,287 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35 [2024-06-03 22:13:04,287 INFO L175 Difference]: Start difference. First operand has 76 places, 32 transitions, 185 flow. Second operand 10 states and 105 transitions. [2024-06-03 22:13:04,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 50 transitions, 323 flow [2024-06-03 22:13:04,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 50 transitions, 279 flow, removed 5 selfloop flow, removed 15 redundant places. [2024-06-03 22:13:04,289 INFO L231 Difference]: Finished difference. Result has 64 places, 26 transitions, 129 flow [2024-06-03 22:13:04,289 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=129, PETRI_PLACES=64, PETRI_TRANSITIONS=26} [2024-06-03 22:13:04,289 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 35 predicate places. [2024-06-03 22:13:04,290 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 26 transitions, 129 flow [2024-06-03 22:13:04,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:13:04,290 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:13:04,290 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-03 22:13:04,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-03 22:13:04,290 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:13:04,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:13:04,290 INFO L85 PathProgramCache]: Analyzing trace with hash 2016990996, now seen corresponding path program 2 times [2024-06-03 22:13:04,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:13:04,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839383740] [2024-06-03 22:13:04,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:13:04,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:13:04,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:13:09,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:13:09,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:13:09,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839383740] [2024-06-03 22:13:09,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839383740] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:13:09,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:13:09,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:13:09,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800825684] [2024-06-03 22:13:09,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:13:09,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:13:09,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:13:09,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:13:09,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:13:09,987 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:13:09,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 26 transitions, 129 flow. Second operand has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:13:09,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:13:09,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:13:09,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:13:10,145 INFO L124 PetriNetUnfolderBase]: 35/88 cut-off events. [2024-06-03 22:13:10,145 INFO L125 PetriNetUnfolderBase]: For 513/513 co-relation queries the response was YES. [2024-06-03 22:13:10,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 252 conditions, 88 events. 35/88 cut-off events. For 513/513 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 183 event pairs, 1 based on Foata normal form. 4/91 useless extension candidates. Maximal degree in co-relation 233. Up to 21 conditions per place. [2024-06-03 22:13:10,145 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 0 selfloop transitions, 0 changer transitions 37/37 dead transitions. [2024-06-03 22:13:10,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 37 transitions, 193 flow [2024-06-03 22:13:10,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:13:10,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:13:10,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 92 transitions. [2024-06-03 22:13:10,146 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30666666666666664 [2024-06-03 22:13:10,146 INFO L175 Difference]: Start difference. First operand has 64 places, 26 transitions, 129 flow. Second operand 10 states and 92 transitions. [2024-06-03 22:13:10,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 37 transitions, 193 flow [2024-06-03 22:13:10,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 37 transitions, 161 flow, removed 0 selfloop flow, removed 13 redundant places. [2024-06-03 22:13:10,147 INFO L231 Difference]: Finished difference. Result has 48 places, 0 transitions, 0 flow [2024-06-03 22:13:10,147 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=65, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=0, PETRI_PLACES=48, PETRI_TRANSITIONS=0} [2024-06-03 22:13:10,148 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 19 predicate places. [2024-06-03 22:13:10,148 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 0 transitions, 0 flow [2024-06-03 22:13:10,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:13:10,152 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 4 remaining) [2024-06-03 22:13:10,153 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 4 remaining) [2024-06-03 22:13:10,156 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-06-03 22:13:10,156 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-06-03 22:13:10,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-03 22:13:10,157 INFO L445 BasicCegarLoop]: Path program histogram: [11, 7, 6, 6, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:13:10,159 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-03 22:13:10,159 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-03 22:13:10,162 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-06-03 22:13:10,162 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-06-03 22:13:10,163 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.06 10:13:10 BasicIcfg [2024-06-03 22:13:10,163 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-03 22:13:10,164 INFO L158 Benchmark]: Toolchain (without parser) took 261195.01ms. Allocated memory was 155.2MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 128.0MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 345.3MB. Max. memory is 16.1GB. [2024-06-03 22:13:10,164 INFO L158 Benchmark]: Witness Parser took 0.15ms. Allocated memory is still 94.4MB. Free memory is still 55.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-03 22:13:10,164 INFO L158 Benchmark]: CDTParser took 4.83ms. Allocated memory is still 155.2MB. Free memory is still 124.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-03 22:13:10,164 INFO L158 Benchmark]: CACSL2BoogieTranslator took 625.84ms. Allocated memory is still 155.2MB. Free memory was 128.0MB in the beginning and 78.5MB in the end (delta: 49.4MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2024-06-03 22:13:10,165 INFO L158 Benchmark]: Boogie Procedure Inliner took 108.41ms. Allocated memory is still 155.2MB. Free memory was 78.5MB in the beginning and 63.9MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-06-03 22:13:10,165 INFO L158 Benchmark]: Boogie Preprocessor took 119.47ms. Allocated memory is still 155.2MB. Free memory was 63.9MB in the beginning and 57.3MB in the end (delta: 6.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-06-03 22:13:10,165 INFO L158 Benchmark]: RCFGBuilder took 1018.53ms. Allocated memory was 155.2MB in the beginning and 257.9MB in the end (delta: 102.8MB). Free memory was 57.3MB in the beginning and 170.8MB in the end (delta: -113.4MB). Peak memory consumption was 44.3MB. Max. memory is 16.1GB. [2024-06-03 22:13:10,165 INFO L158 Benchmark]: TraceAbstraction took 259314.45ms. Allocated memory was 257.9MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 169.7MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 282.7MB. Max. memory is 16.1GB. [2024-06-03 22:13:10,168 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.15ms. Allocated memory is still 94.4MB. Free memory is still 55.3MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 4.83ms. Allocated memory is still 155.2MB. Free memory is still 124.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 625.84ms. Allocated memory is still 155.2MB. Free memory was 128.0MB in the beginning and 78.5MB in the end (delta: 49.4MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 108.41ms. Allocated memory is still 155.2MB. Free memory was 78.5MB in the beginning and 63.9MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 119.47ms. Allocated memory is still 155.2MB. Free memory was 63.9MB in the beginning and 57.3MB in the end (delta: 6.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1018.53ms. Allocated memory was 155.2MB in the beginning and 257.9MB in the end (delta: 102.8MB). Free memory was 57.3MB in the beginning and 170.8MB in the end (delta: -113.4MB). Peak memory consumption was 44.3MB. Max. memory is 16.1GB. * TraceAbstraction took 259314.45ms. Allocated memory was 257.9MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 169.7MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 282.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 808]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 809]: 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: 259.2s, OverallIterations: 53, TraceHistogramMax: 1, PathProgramHistogramMax: 11, EmptinessCheckTime: 0.0s, AutomataDifference: 20.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2960 SdHoareTripleChecker+Valid, 13.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2501 mSDsluCounter, 1594 SdHoareTripleChecker+Invalid, 12.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1350 mSDsCounter, 588 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15729 IncrementalHoareTripleChecker+Invalid, 16317 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 588 mSolverCounterUnsat, 244 mSDtfsCounter, 15729 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 476 GetRequests, 3 SyntacticMatches, 7 SemanticMatches, 466 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 11.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=677occurred in iteration=30, InterpolantAutomatonStates: 407, 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.9s SatisfiabilityAnalysisTime, 235.7s InterpolantComputationTime, 828 NumberOfCodeBlocks, 828 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 775 ConstructedInterpolants, 0 QuantifiedInterpolants, 34493 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 53 InterpolantComputations, 53 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-06-03 22:13:10,221 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE