./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 76401ed0 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-76401ed-m [2024-06-20 19:21:10,795 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-20 19:21:10,856 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-20 19:21:10,860 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-20 19:21:10,861 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-20 19:21:10,878 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-20 19:21:10,878 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-20 19:21:10,879 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-20 19:21:10,879 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-20 19:21:10,879 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-20 19:21:10,880 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-20 19:21:10,880 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-20 19:21:10,881 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-20 19:21:10,881 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-20 19:21:10,881 INFO L153 SettingsManager]: * Use SBE=true [2024-06-20 19:21:10,881 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-20 19:21:10,882 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-20 19:21:10,882 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-20 19:21:10,882 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-20 19:21:10,883 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-20 19:21:10,883 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-20 19:21:10,885 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-20 19:21:10,885 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-20 19:21:10,885 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-20 19:21:10,885 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-20 19:21:10,886 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-20 19:21:10,886 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-20 19:21:10,886 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-20 19:21:10,886 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-20 19:21:10,887 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-20 19:21:10,887 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-20 19:21:10,887 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-20 19:21:10,887 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-20 19:21:10,888 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-20 19:21:10,888 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-20 19:21:10,888 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-20 19:21:10,888 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-20 19:21:10,888 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-20 19:21:10,889 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-20 19:21:10,889 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-20 19:21:10,889 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-20 19:21:10,892 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-20 19:21:10,892 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-20 19:21:10,892 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-20 19:21:11,120 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-20 19:21:11,139 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-20 19:21:11,140 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-20 19:21:11,141 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-20 19:21:11,142 INFO L274 PluginConnector]: CDTParser initialized [2024-06-20 19:21:11,142 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-20 19:21:12,116 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-20 19:21:12,304 INFO L384 CDTParser]: Found 1 translation units. [2024-06-20 19:21:12,305 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2024-06-20 19:21:12,325 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/171111a32/8456ba11f0624bde84dc623d95e37979/FLAG25ef8e425 [2024-06-20 19:21:12,334 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/171111a32/8456ba11f0624bde84dc623d95e37979 [2024-06-20 19:21:12,336 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-20 19:21:12,337 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-20 19:21:12,337 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-20 19:21:12,507 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-20 19:21:12,508 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-20 19:21:12,509 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-20 19:21:12,509 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-20 19:21:12,513 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-20 19:21:12,513 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 07:21:12" (1/2) ... [2024-06-20 19:21:12,514 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@469cc443 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:21:12, skipping insertion in model container [2024-06-20 19:21:12,514 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 07:21:12" (1/2) ... [2024-06-20 19:21:12,516 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@66d73fcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:21:12, skipping insertion in model container [2024-06-20 19:21:12,516 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 07:21:12" (2/2) ... [2024-06-20 19:21:12,516 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@469cc443 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:21:12, skipping insertion in model container [2024-06-20 19:21:12,516 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 07:21:12" (2/2) ... [2024-06-20 19:21:12,516 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-20 19:21:12,560 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-20 19:21:12,561 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-20 19:21:12,562 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-20 19:21:12,562 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-20 19:21:12,563 INFO L106 edCorrectnessWitness]: ghost_update [L806-L806] multithreaded = 1; [2024-06-20 19:21:12,594 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-20 19:21:12,821 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-20 19:21:12,834 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-20 19:21:13,071 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-20 19:21:13,105 INFO L206 MainTranslator]: Completed translation [2024-06-20 19:21:13,106 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:21:13 WrapperNode [2024-06-20 19:21:13,107 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-20 19:21:13,109 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-20 19:21:13,109 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-20 19:21:13,109 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-20 19:21:13,114 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:21:13" (1/1) ... [2024-06-20 19:21:13,145 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:21:13" (1/1) ... [2024-06-20 19:21:13,208 INFO L138 Inliner]: procedures = 174, calls = 34, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 112 [2024-06-20 19:21:13,209 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-20 19:21:13,209 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-20 19:21:13,210 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-20 19:21:13,210 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-20 19:21:13,218 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:21:13" (1/1) ... [2024-06-20 19:21:13,219 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:21:13" (1/1) ... [2024-06-20 19:21:13,240 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:21:13" (1/1) ... [2024-06-20 19:21:13,265 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-20 19:21:13,265 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:21:13" (1/1) ... [2024-06-20 19:21:13,266 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:21:13" (1/1) ... [2024-06-20 19:21:13,286 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:21:13" (1/1) ... [2024-06-20 19:21:13,288 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:21:13" (1/1) ... [2024-06-20 19:21:13,294 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:21:13" (1/1) ... [2024-06-20 19:21:13,297 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:21:13" (1/1) ... [2024-06-20 19:21:13,305 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-20 19:21:13,306 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-20 19:21:13,307 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-20 19:21:13,307 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-20 19:21:13,307 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:21:13" (1/1) ... [2024-06-20 19:21:13,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-20 19:21:13,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-20 19:21:13,366 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-20 19:21:13,374 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-20 19:21:13,397 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-20 19:21:13,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-20 19:21:13,397 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-20 19:21:13,397 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-20 19:21:13,398 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-20 19:21:13,398 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-20 19:21:13,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-20 19:21:13,398 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-20 19:21:13,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-20 19:21:13,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-20 19:21:13,399 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-20 19:21:13,506 INFO L244 CfgBuilder]: Building ICFG [2024-06-20 19:21:13,509 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-20 19:21:14,092 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-20 19:21:14,092 INFO L293 CfgBuilder]: Performing block encoding [2024-06-20 19:21:14,240 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-20 19:21:14,240 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-20 19:21:14,242 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 07:21:14 BoogieIcfgContainer [2024-06-20 19:21:14,242 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-20 19:21:14,245 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-20 19:21:14,245 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-20 19:21:14,247 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-20 19:21:14,248 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.06 07:21:12" (1/4) ... [2024-06-20 19:21:14,249 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21fb5322 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.06 07:21:14, skipping insertion in model container [2024-06-20 19:21:14,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 07:21:12" (2/4) ... [2024-06-20 19:21:14,249 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21fb5322 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 20.06 07:21:14, skipping insertion in model container [2024-06-20 19:21:14,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:21:13" (3/4) ... [2024-06-20 19:21:14,253 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21fb5322 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 20.06 07:21:14, skipping insertion in model container [2024-06-20 19:21:14,253 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 07:21:14" (4/4) ... [2024-06-20 19:21:14,254 INFO L112 eAbstractionObserver]: Analyzing ICFG mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2024-06-20 19:21:14,267 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-20 19:21:14,267 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-20 19:21:14,267 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-20 19:21:14,325 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-20 19:21:14,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 29 transitions, 66 flow [2024-06-20 19:21:14,398 INFO L124 PetriNetUnfolderBase]: 0/27 cut-off events. [2024-06-20 19:21:14,399 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-20 19:21:14,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 27 events. 0/27 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/25 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-20 19:21:14,404 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 29 transitions, 66 flow [2024-06-20 19:21:14,407 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 28 places, 21 transitions, 48 flow [2024-06-20 19:21:14,418 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-20 19:21:14,424 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;@3b5d61ce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-20 19:21:14,424 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-20 19:21:14,431 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-20 19:21:14,432 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-20 19:21:14,432 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-20 19:21:14,432 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:21:14,433 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-20 19:21:14,433 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-20 19:21:14,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:21:14,441 INFO L85 PathProgramCache]: Analyzing trace with hash 322901022, now seen corresponding path program 1 times [2024-06-20 19:21:14,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:21:14,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461436508] [2024-06-20 19:21:14,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:21:14,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:21:14,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:21:17,195 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-20 19:21:17,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:21:17,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461436508] [2024-06-20 19:21:17,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461436508] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:21:17,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:21:17,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-20 19:21:17,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450903879] [2024-06-20 19:21:17,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:21:17,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-20 19:21:17,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:21:17,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-20 19:21:17,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-20 19:21:17,287 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-06-20 19:21:17,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 21 transitions, 48 flow. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:21:17,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:21:17,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-06-20 19:21:17,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:21:17,488 INFO L124 PetriNetUnfolderBase]: 162/296 cut-off events. [2024-06-20 19:21:17,488 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-06-20 19:21:17,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 607 conditions, 296 events. 162/296 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1017 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-20 19:21:17,493 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 21 selfloop transitions, 3 changer transitions 0/27 dead transitions. [2024-06-20 19:21:17,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 27 transitions, 111 flow [2024-06-20 19:21:17,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-20 19:21:17,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-20 19:21:17,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2024-06-20 19:21:17,502 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5747126436781609 [2024-06-20 19:21:17,503 INFO L175 Difference]: Start difference. First operand has 28 places, 21 transitions, 48 flow. Second operand 3 states and 50 transitions. [2024-06-20 19:21:17,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 27 transitions, 111 flow [2024-06-20 19:21:17,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 27 transitions, 108 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-20 19:21:17,506 INFO L231 Difference]: Finished difference. Result has 29 places, 23 transitions, 67 flow [2024-06-20 19:21:17,508 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=67, PETRI_PLACES=29, PETRI_TRANSITIONS=23} [2024-06-20 19:21:17,511 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 1 predicate places. [2024-06-20 19:21:17,511 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 23 transitions, 67 flow [2024-06-20 19:21:17,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:21:17,511 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:21:17,511 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:21:17,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-20 19:21:17,512 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-20 19:21:17,512 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:21:17,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1070392915, now seen corresponding path program 1 times [2024-06-20 19:21:17,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:21:17,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401883300] [2024-06-20 19:21:17,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:21:17,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:21:17,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:21:19,630 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-20 19:21:19,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:21:19,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401883300] [2024-06-20 19:21:19,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401883300] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:21:19,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:21:19,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-20 19:21:19,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992299688] [2024-06-20 19:21:19,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:21:19,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-20 19:21:19,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:21:19,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-20 19:21:19,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-20 19:21:19,671 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-06-20 19:21:19,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 23 transitions, 67 flow. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:21:19,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:21:19,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-06-20 19:21:19,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:21:19,871 INFO L124 PetriNetUnfolderBase]: 159/291 cut-off events. [2024-06-20 19:21:19,872 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2024-06-20 19:21:19,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 679 conditions, 291 events. 159/291 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 998 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-20 19:21:19,881 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 25 selfloop transitions, 5 changer transitions 0/33 dead transitions. [2024-06-20 19:21:19,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 33 transitions, 153 flow [2024-06-20 19:21:19,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-20 19:21:19,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-20 19:21:19,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2024-06-20 19:21:19,884 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5517241379310345 [2024-06-20 19:21:19,884 INFO L175 Difference]: Start difference. First operand has 29 places, 23 transitions, 67 flow. Second operand 4 states and 64 transitions. [2024-06-20 19:21:19,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 33 transitions, 153 flow [2024-06-20 19:21:19,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 33 transitions, 150 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-20 19:21:19,888 INFO L231 Difference]: Finished difference. Result has 32 places, 25 transitions, 91 flow [2024-06-20 19:21:19,888 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=91, PETRI_PLACES=32, PETRI_TRANSITIONS=25} [2024-06-20 19:21:19,890 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 4 predicate places. [2024-06-20 19:21:19,890 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 25 transitions, 91 flow [2024-06-20 19:21:19,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:21:19,890 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:21:19,890 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:21:19,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-20 19:21:19,891 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-20 19:21:19,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:21:19,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1177557569, now seen corresponding path program 1 times [2024-06-20 19:21:19,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:21:19,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466356333] [2024-06-20 19:21:19,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:21:19,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:21:19,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:21:21,903 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-20 19:21:21,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:21:21,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466356333] [2024-06-20 19:21:21,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466356333] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:21:21,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:21:21,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-20 19:21:21,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956073399] [2024-06-20 19:21:21,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:21:21,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-20 19:21:21,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:21:21,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-20 19:21:21,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-20 19:21:21,973 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-06-20 19:21:21,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 25 transitions, 91 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 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-20 19:21:21,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:21:21,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-06-20 19:21:21,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:21:22,197 INFO L124 PetriNetUnfolderBase]: 188/339 cut-off events. [2024-06-20 19:21:22,198 INFO L125 PetriNetUnfolderBase]: For 179/179 co-relation queries the response was YES. [2024-06-20 19:21:22,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 864 conditions, 339 events. 188/339 cut-off events. For 179/179 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1236 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-20 19:21:22,201 INFO L140 encePairwiseOnDemand]: 20/29 looper letters, 37 selfloop transitions, 11 changer transitions 0/51 dead transitions. [2024-06-20 19:21:22,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 51 transitions, 261 flow [2024-06-20 19:21:22,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-20 19:21:22,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-20 19:21:22,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions. [2024-06-20 19:21:22,206 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6068965517241379 [2024-06-20 19:21:22,206 INFO L175 Difference]: Start difference. First operand has 32 places, 25 transitions, 91 flow. Second operand 5 states and 88 transitions. [2024-06-20 19:21:22,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 51 transitions, 261 flow [2024-06-20 19:21:22,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 51 transitions, 252 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-20 19:21:22,210 INFO L231 Difference]: Finished difference. Result has 37 places, 33 transitions, 160 flow [2024-06-20 19:21:22,210 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=160, PETRI_PLACES=37, PETRI_TRANSITIONS=33} [2024-06-20 19:21:22,211 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 9 predicate places. [2024-06-20 19:21:22,212 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 33 transitions, 160 flow [2024-06-20 19:21:22,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 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-20 19:21:22,212 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:21:22,212 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:21:22,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-20 19:21:22,213 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-20 19:21:22,214 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:21:22,214 INFO L85 PathProgramCache]: Analyzing trace with hash 2011893340, now seen corresponding path program 1 times [2024-06-20 19:21:22,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:21:22,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485812559] [2024-06-20 19:21:22,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:21:22,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:21:22,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:21:24,513 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-20 19:21:24,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:21:24,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485812559] [2024-06-20 19:21:24,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485812559] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:21:24,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:21:24,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-20 19:21:24,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691663922] [2024-06-20 19:21:24,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:21:24,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-20 19:21:24,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:21:24,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-20 19:21:24,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-20 19:21:24,581 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-06-20 19:21:24,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 33 transitions, 160 flow. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:21:24,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:21:24,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-06-20 19:21:24,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:21:24,826 INFO L124 PetriNetUnfolderBase]: 189/341 cut-off events. [2024-06-20 19:21:24,826 INFO L125 PetriNetUnfolderBase]: For 407/407 co-relation queries the response was YES. [2024-06-20 19:21:24,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1093 conditions, 341 events. 189/341 cut-off events. For 407/407 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1229 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-20 19:21:24,829 INFO L140 encePairwiseOnDemand]: 20/29 looper letters, 42 selfloop transitions, 14 changer transitions 0/59 dead transitions. [2024-06-20 19:21:24,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 59 transitions, 368 flow [2024-06-20 19:21:24,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 19:21:24,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 19:21:24,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions. [2024-06-20 19:21:24,831 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5689655172413793 [2024-06-20 19:21:24,831 INFO L175 Difference]: Start difference. First operand has 37 places, 33 transitions, 160 flow. Second operand 6 states and 99 transitions. [2024-06-20 19:21:24,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 59 transitions, 368 flow [2024-06-20 19:21:24,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 59 transitions, 364 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-06-20 19:21:24,834 INFO L231 Difference]: Finished difference. Result has 45 places, 41 transitions, 256 flow [2024-06-20 19:21:24,834 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=256, PETRI_PLACES=45, PETRI_TRANSITIONS=41} [2024-06-20 19:21:24,834 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 17 predicate places. [2024-06-20 19:21:24,835 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 41 transitions, 256 flow [2024-06-20 19:21:24,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:21:24,835 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:21:24,835 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:21:24,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-20 19:21:24,835 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-20 19:21:24,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:21:24,836 INFO L85 PathProgramCache]: Analyzing trace with hash -2056410050, now seen corresponding path program 1 times [2024-06-20 19:21:24,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:21:24,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712777047] [2024-06-20 19:21:24,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:21:24,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:21:24,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:21:27,261 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-20 19:21:27,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:21:27,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712777047] [2024-06-20 19:21:27,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712777047] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:21:27,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:21:27,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 19:21:27,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33570007] [2024-06-20 19:21:27,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:21:27,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 19:21:27,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:21:27,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 19:21:27,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-20 19:21:27,389 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-06-20 19:21:27,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 41 transitions, 256 flow. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:21:27,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:21:27,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-06-20 19:21:27,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:21:27,715 INFO L124 PetriNetUnfolderBase]: 190/344 cut-off events. [2024-06-20 19:21:27,716 INFO L125 PetriNetUnfolderBase]: For 725/725 co-relation queries the response was YES. [2024-06-20 19:21:27,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1271 conditions, 344 events. 190/344 cut-off events. For 725/725 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1245 event pairs, 25 based on Foata normal form. 6/350 useless extension candidates. Maximal degree in co-relation 1249. Up to 260 conditions per place. [2024-06-20 19:21:27,719 INFO L140 encePairwiseOnDemand]: 20/29 looper letters, 42 selfloop transitions, 16 changer transitions 0/61 dead transitions. [2024-06-20 19:21:27,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 61 transitions, 432 flow [2024-06-20 19:21:27,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:21:27,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:21:27,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 109 transitions. [2024-06-20 19:21:27,722 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5369458128078818 [2024-06-20 19:21:27,722 INFO L175 Difference]: Start difference. First operand has 45 places, 41 transitions, 256 flow. Second operand 7 states and 109 transitions. [2024-06-20 19:21:27,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 61 transitions, 432 flow [2024-06-20 19:21:27,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 61 transitions, 416 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-06-20 19:21:27,728 INFO L231 Difference]: Finished difference. Result has 50 places, 41 transitions, 275 flow [2024-06-20 19:21:27,728 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=275, PETRI_PLACES=50, PETRI_TRANSITIONS=41} [2024-06-20 19:21:27,732 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 22 predicate places. [2024-06-20 19:21:27,732 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 41 transitions, 275 flow [2024-06-20 19:21:27,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:21:27,733 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:21:27,733 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:21:27,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-20 19:21:27,734 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-20 19:21:27,734 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:21:27,735 INFO L85 PathProgramCache]: Analyzing trace with hash -2073240141, now seen corresponding path program 1 times [2024-06-20 19:21:27,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:21:27,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723882102] [2024-06-20 19:21:27,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:21:27,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:21:27,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:21:31,902 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-20 19:21:31,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:21:31,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723882102] [2024-06-20 19:21:31,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723882102] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:21:31,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:21:31,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-20 19:21:31,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101995881] [2024-06-20 19:21:31,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:21:31,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-20 19:21:31,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:21:31,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-20 19:21:31,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-20 19:21:31,972 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-06-20 19:21:31,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 275 flow. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:21:31,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:21:31,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-06-20 19:21:31,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:21:32,246 INFO L124 PetriNetUnfolderBase]: 184/335 cut-off events. [2024-06-20 19:21:32,246 INFO L125 PetriNetUnfolderBase]: For 825/825 co-relation queries the response was YES. [2024-06-20 19:21:32,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1326 conditions, 335 events. 184/335 cut-off events. For 825/825 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1194 event pairs, 38 based on Foata normal form. 3/338 useless extension candidates. Maximal degree in co-relation 1301. Up to 318 conditions per place. [2024-06-20 19:21:32,251 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 40 selfloop transitions, 7 changer transitions 0/49 dead transitions. [2024-06-20 19:21:32,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 49 transitions, 393 flow [2024-06-20 19:21:32,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-20 19:21:32,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-20 19:21:32,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2024-06-20 19:21:32,253 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41379310344827586 [2024-06-20 19:21:32,253 INFO L175 Difference]: Start difference. First operand has 50 places, 41 transitions, 275 flow. Second operand 5 states and 60 transitions. [2024-06-20 19:21:32,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 49 transitions, 393 flow [2024-06-20 19:21:32,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 49 transitions, 352 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-20 19:21:32,255 INFO L231 Difference]: Finished difference. Result has 50 places, 43 transitions, 268 flow [2024-06-20 19:21:32,256 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=268, PETRI_PLACES=50, PETRI_TRANSITIONS=43} [2024-06-20 19:21:32,258 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 22 predicate places. [2024-06-20 19:21:32,258 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 43 transitions, 268 flow [2024-06-20 19:21:32,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:21:32,259 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:21:32,259 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:21:32,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-20 19:21:32,259 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-20 19:21:32,259 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:21:32,260 INFO L85 PathProgramCache]: Analyzing trace with hash 454051128, now seen corresponding path program 1 times [2024-06-20 19:21:32,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:21:32,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102552074] [2024-06-20 19:21:32,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:21:32,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:21:32,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:21:35,751 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-20 19:21:35,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:21:35,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102552074] [2024-06-20 19:21:35,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102552074] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:21:35,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:21:35,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 19:21:35,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294480923] [2024-06-20 19:21:35,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:21:35,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 19:21:35,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:21:35,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 19:21:35,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-20 19:21:35,810 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-06-20 19:21:35,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 43 transitions, 268 flow. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:21:35,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:21:35,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-06-20 19:21:35,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:21:36,055 INFO L124 PetriNetUnfolderBase]: 187/341 cut-off events. [2024-06-20 19:21:36,055 INFO L125 PetriNetUnfolderBase]: For 982/982 co-relation queries the response was YES. [2024-06-20 19:21:36,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1335 conditions, 341 events. 187/341 cut-off events. For 982/982 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1232 event pairs, 41 based on Foata normal form. 6/347 useless extension candidates. Maximal degree in co-relation 1308. Up to 256 conditions per place. [2024-06-20 19:21:36,058 INFO L140 encePairwiseOnDemand]: 20/29 looper letters, 41 selfloop transitions, 16 changer transitions 0/59 dead transitions. [2024-06-20 19:21:36,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 59 transitions, 454 flow [2024-06-20 19:21:36,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 19:21:36,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 19:21:36,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2024-06-20 19:21:36,060 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4540229885057471 [2024-06-20 19:21:36,060 INFO L175 Difference]: Start difference. First operand has 50 places, 43 transitions, 268 flow. Second operand 6 states and 79 transitions. [2024-06-20 19:21:36,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 59 transitions, 454 flow [2024-06-20 19:21:36,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 59 transitions, 440 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-20 19:21:36,062 INFO L231 Difference]: Finished difference. Result has 53 places, 46 transitions, 326 flow [2024-06-20 19:21:36,063 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=326, PETRI_PLACES=53, PETRI_TRANSITIONS=46} [2024-06-20 19:21:36,063 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 25 predicate places. [2024-06-20 19:21:36,063 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 326 flow [2024-06-20 19:21:36,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:21:36,063 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:21:36,064 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:21:36,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-20 19:21:36,064 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-20 19:21:36,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:21:36,064 INFO L85 PathProgramCache]: Analyzing trace with hash 481070418, now seen corresponding path program 2 times [2024-06-20 19:21:36,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:21:36,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318051522] [2024-06-20 19:21:36,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:21:36,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:21:36,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:21:39,253 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-20 19:21:39,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:21:39,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318051522] [2024-06-20 19:21:39,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318051522] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:21:39,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:21:39,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-20 19:21:39,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30428021] [2024-06-20 19:21:39,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:21:39,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-20 19:21:39,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:21:39,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-20 19:21:39,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-20 19:21:39,303 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-06-20 19:21:39,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 326 flow. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:21:39,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:21:39,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-06-20 19:21:39,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:21:39,443 INFO L124 PetriNetUnfolderBase]: 176/321 cut-off events. [2024-06-20 19:21:39,443 INFO L125 PetriNetUnfolderBase]: For 1072/1072 co-relation queries the response was YES. [2024-06-20 19:21:39,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1311 conditions, 321 events. 176/321 cut-off events. For 1072/1072 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1114 event pairs, 40 based on Foata normal form. 3/324 useless extension candidates. Maximal degree in co-relation 1284. Up to 301 conditions per place. [2024-06-20 19:21:39,447 INFO L140 encePairwiseOnDemand]: 22/29 looper letters, 43 selfloop transitions, 8 changer transitions 0/54 dead transitions. [2024-06-20 19:21:39,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 54 transitions, 449 flow [2024-06-20 19:21:39,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-20 19:21:39,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-20 19:21:39,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2024-06-20 19:21:39,448 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.496551724137931 [2024-06-20 19:21:39,448 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 326 flow. Second operand 5 states and 72 transitions. [2024-06-20 19:21:39,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 54 transitions, 449 flow [2024-06-20 19:21:39,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 54 transitions, 430 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-20 19:21:39,452 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 329 flow [2024-06-20 19:21:39,452 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=329, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2024-06-20 19:21:39,453 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 27 predicate places. [2024-06-20 19:21:39,454 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 329 flow [2024-06-20 19:21:39,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:21:39,454 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:21:39,454 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:21:39,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-20 19:21:39,454 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-20 19:21:39,455 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:21:39,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1197350210, now seen corresponding path program 1 times [2024-06-20 19:21:39,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:21:39,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719708411] [2024-06-20 19:21:39,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:21:39,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:21:39,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:21:43,047 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-20 19:21:43,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:21:43,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719708411] [2024-06-20 19:21:43,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719708411] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:21:43,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:21:43,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-20 19:21:43,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856695500] [2024-06-20 19:21:43,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:21:43,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-20 19:21:43,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:21:43,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-20 19:21:43,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-20 19:21:43,138 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-06-20 19:21:43,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 329 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:21:43,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:21:43,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-06-20 19:21:43,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:21:43,331 INFO L124 PetriNetUnfolderBase]: 177/323 cut-off events. [2024-06-20 19:21:43,332 INFO L125 PetriNetUnfolderBase]: For 1232/1232 co-relation queries the response was YES. [2024-06-20 19:21:43,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1332 conditions, 323 events. 177/323 cut-off events. For 1232/1232 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1128 event pairs, 33 based on Foata normal form. 2/325 useless extension candidates. Maximal degree in co-relation 1305. Up to 303 conditions per place. [2024-06-20 19:21:43,334 INFO L140 encePairwiseOnDemand]: 21/29 looper letters, 46 selfloop transitions, 9 changer transitions 0/58 dead transitions. [2024-06-20 19:21:43,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 58 transitions, 477 flow [2024-06-20 19:21:43,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 19:21:43,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 19:21:43,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2024-06-20 19:21:43,335 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47126436781609193 [2024-06-20 19:21:43,335 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 329 flow. Second operand 6 states and 82 transitions. [2024-06-20 19:21:43,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 58 transitions, 477 flow [2024-06-20 19:21:43,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 58 transitions, 434 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-20 19:21:43,338 INFO L231 Difference]: Finished difference. Result has 57 places, 50 transitions, 340 flow [2024-06-20 19:21:43,338 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=340, PETRI_PLACES=57, PETRI_TRANSITIONS=50} [2024-06-20 19:21:43,339 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 29 predicate places. [2024-06-20 19:21:43,339 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 50 transitions, 340 flow [2024-06-20 19:21:43,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:21:43,339 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:21:43,339 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:21:43,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-20 19:21:43,339 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-20 19:21:43,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:21:43,340 INFO L85 PathProgramCache]: Analyzing trace with hash 2059801544, now seen corresponding path program 1 times [2024-06-20 19:21:43,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:21:43,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866833393] [2024-06-20 19:21:43,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:21:43,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:21:43,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:21:48,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:21:48,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:21:48,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866833393] [2024-06-20 19:21:48,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866833393] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:21:48,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:21:48,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:21:48,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096249324] [2024-06-20 19:21:48,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:21:48,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:21:48,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:21:48,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:21:48,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:21:48,798 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-06-20 19:21:48,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 50 transitions, 340 flow. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:21:48,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:21:48,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-06-20 19:21:48,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:21:49,106 INFO L124 PetriNetUnfolderBase]: 174/318 cut-off events. [2024-06-20 19:21:49,106 INFO L125 PetriNetUnfolderBase]: For 1238/1238 co-relation queries the response was YES. [2024-06-20 19:21:49,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1354 conditions, 318 events. 174/318 cut-off events. For 1238/1238 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1093 event pairs, 34 based on Foata normal form. 2/320 useless extension candidates. Maximal degree in co-relation 1325. Up to 295 conditions per place. [2024-06-20 19:21:49,108 INFO L140 encePairwiseOnDemand]: 22/29 looper letters, 46 selfloop transitions, 10 changer transitions 0/58 dead transitions. [2024-06-20 19:21:49,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 58 transitions, 470 flow [2024-06-20 19:21:49,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:21:49,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:21:49,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2024-06-20 19:21:49,110 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37438423645320196 [2024-06-20 19:21:49,110 INFO L175 Difference]: Start difference. First operand has 57 places, 50 transitions, 340 flow. Second operand 7 states and 76 transitions. [2024-06-20 19:21:49,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 58 transitions, 470 flow [2024-06-20 19:21:49,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 58 transitions, 448 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-20 19:21:49,113 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 342 flow [2024-06-20 19:21:49,113 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=342, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2024-06-20 19:21:49,113 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 33 predicate places. [2024-06-20 19:21:49,114 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 342 flow [2024-06-20 19:21:49,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:21:49,114 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:21:49,114 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:21:49,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-20 19:21:49,114 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-20 19:21:49,115 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:21:49,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1821458127, now seen corresponding path program 1 times [2024-06-20 19:21:49,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:21:49,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978070528] [2024-06-20 19:21:49,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:21:49,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:21:49,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:21:53,578 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-20 19:21:53,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:21:53,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978070528] [2024-06-20 19:21:53,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978070528] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:21:53,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:21:53,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:21:53,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831851203] [2024-06-20 19:21:53,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:21:53,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:21:53,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:21:53,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:21:53,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:21:53,676 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-06-20 19:21:53,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 342 flow. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:21:53,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:21:53,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-06-20 19:21:53,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:21:54,005 INFO L124 PetriNetUnfolderBase]: 192/347 cut-off events. [2024-06-20 19:21:54,005 INFO L125 PetriNetUnfolderBase]: For 1624/1624 co-relation queries the response was YES. [2024-06-20 19:21:54,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1498 conditions, 347 events. 192/347 cut-off events. For 1624/1624 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1232 event pairs, 36 based on Foata normal form. 1/348 useless extension candidates. Maximal degree in co-relation 1467. Up to 252 conditions per place. [2024-06-20 19:21:54,007 INFO L140 encePairwiseOnDemand]: 19/29 looper letters, 51 selfloop transitions, 21 changer transitions 0/74 dead transitions. [2024-06-20 19:21:54,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 74 transitions, 614 flow [2024-06-20 19:21:54,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:21:54,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:21:54,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 93 transitions. [2024-06-20 19:21:54,009 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.458128078817734 [2024-06-20 19:21:54,009 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 342 flow. Second operand 7 states and 93 transitions. [2024-06-20 19:21:54,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 74 transitions, 614 flow [2024-06-20 19:21:54,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 74 transitions, 585 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-06-20 19:21:54,015 INFO L231 Difference]: Finished difference. Result has 64 places, 57 transitions, 422 flow [2024-06-20 19:21:54,015 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=422, PETRI_PLACES=64, PETRI_TRANSITIONS=57} [2024-06-20 19:21:54,015 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 36 predicate places. [2024-06-20 19:21:54,016 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 57 transitions, 422 flow [2024-06-20 19:21:54,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:21:54,016 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:21:54,016 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:21:54,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-20 19:21:54,016 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-20 19:21:54,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:21:54,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1778123919, now seen corresponding path program 2 times [2024-06-20 19:21:54,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:21:54,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884510768] [2024-06-20 19:21:54,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:21:54,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:21:54,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:21:58,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:21:58,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:21:58,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884510768] [2024-06-20 19:21:58,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884510768] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:21:58,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:21:58,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:21:58,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999438639] [2024-06-20 19:21:58,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:21:58,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:21:58,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:21:58,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:21:58,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:21:58,476 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-06-20 19:21:58,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 57 transitions, 422 flow. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:21:58,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:21:58,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-06-20 19:21:58,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:21:58,736 INFO L124 PetriNetUnfolderBase]: 190/344 cut-off events. [2024-06-20 19:21:58,737 INFO L125 PetriNetUnfolderBase]: For 1919/1919 co-relation queries the response was YES. [2024-06-20 19:21:58,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1610 conditions, 344 events. 190/344 cut-off events. For 1919/1919 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1222 event pairs, 40 based on Foata normal form. 1/345 useless extension candidates. Maximal degree in co-relation 1577. Up to 298 conditions per place. [2024-06-20 19:21:58,741 INFO L140 encePairwiseOnDemand]: 20/29 looper letters, 52 selfloop transitions, 15 changer transitions 0/69 dead transitions. [2024-06-20 19:21:58,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 69 transitions, 594 flow [2024-06-20 19:21:58,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:21:58,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:21:58,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 83 transitions. [2024-06-20 19:21:58,743 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4088669950738916 [2024-06-20 19:21:58,743 INFO L175 Difference]: Start difference. First operand has 64 places, 57 transitions, 422 flow. Second operand 7 states and 83 transitions. [2024-06-20 19:21:58,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 69 transitions, 594 flow [2024-06-20 19:21:58,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 69 transitions, 567 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-06-20 19:21:58,748 INFO L231 Difference]: Finished difference. Result has 68 places, 59 transitions, 446 flow [2024-06-20 19:21:58,748 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=395, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=446, PETRI_PLACES=68, PETRI_TRANSITIONS=59} [2024-06-20 19:21:58,748 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 40 predicate places. [2024-06-20 19:21:58,749 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 59 transitions, 446 flow [2024-06-20 19:21:58,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:21:58,749 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:21:58,749 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:21:58,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-20 19:21:58,749 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-20 19:21:58,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:21:58,750 INFO L85 PathProgramCache]: Analyzing trace with hash -910336676, now seen corresponding path program 1 times [2024-06-20 19:21:58,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:21:58,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945688498] [2024-06-20 19:21:58,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:21:58,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:21:58,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:22:02,936 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-20 19:22:02,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:22:02,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945688498] [2024-06-20 19:22:02,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945688498] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:22:02,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:22:02,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:22:02,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106008022] [2024-06-20 19:22:02,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:22:02,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:22:02,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:22:02,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:22:02,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:22:03,033 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-06-20 19:22:03,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 59 transitions, 446 flow. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:22:03,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:22:03,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-06-20 19:22:03,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:22:03,303 INFO L124 PetriNetUnfolderBase]: 185/337 cut-off events. [2024-06-20 19:22:03,303 INFO L125 PetriNetUnfolderBase]: For 2127/2127 co-relation queries the response was YES. [2024-06-20 19:22:03,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1585 conditions, 337 events. 185/337 cut-off events. For 2127/2127 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1192 event pairs, 31 based on Foata normal form. 3/340 useless extension candidates. Maximal degree in co-relation 1551. Up to 234 conditions per place. [2024-06-20 19:22:03,306 INFO L140 encePairwiseOnDemand]: 21/29 looper letters, 48 selfloop transitions, 28 changer transitions 0/78 dead transitions. [2024-06-20 19:22:03,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 78 transitions, 696 flow [2024-06-20 19:22:03,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 19:22:03,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 19:22:03,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2024-06-20 19:22:03,309 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4827586206896552 [2024-06-20 19:22:03,309 INFO L175 Difference]: Start difference. First operand has 68 places, 59 transitions, 446 flow. Second operand 6 states and 84 transitions. [2024-06-20 19:22:03,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 78 transitions, 696 flow [2024-06-20 19:22:03,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 78 transitions, 665 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-20 19:22:03,317 INFO L231 Difference]: Finished difference. Result has 71 places, 63 transitions, 546 flow [2024-06-20 19:22:03,317 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=415, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=546, PETRI_PLACES=71, PETRI_TRANSITIONS=63} [2024-06-20 19:22:03,318 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 43 predicate places. [2024-06-20 19:22:03,318 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 63 transitions, 546 flow [2024-06-20 19:22:03,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:22:03,319 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:22:03,319 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:22:03,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-20 19:22:03,319 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-20 19:22:03,319 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:22:03,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1540149199, now seen corresponding path program 1 times [2024-06-20 19:22:03,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:22:03,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411687760] [2024-06-20 19:22:03,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:22:03,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:22:03,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:22:08,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:22:08,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:22:08,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411687760] [2024-06-20 19:22:08,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411687760] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:22:08,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:22:08,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:22:08,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386157026] [2024-06-20 19:22:08,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:22:08,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:22:08,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:22:08,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:22:08,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:22:08,206 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-06-20 19:22:08,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 63 transitions, 546 flow. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:22:08,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:22:08,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-06-20 19:22:08,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:22:08,488 INFO L124 PetriNetUnfolderBase]: 182/332 cut-off events. [2024-06-20 19:22:08,488 INFO L125 PetriNetUnfolderBase]: For 2427/2427 co-relation queries the response was YES. [2024-06-20 19:22:08,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1681 conditions, 332 events. 182/332 cut-off events. For 2427/2427 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1174 event pairs, 33 based on Foata normal form. 1/333 useless extension candidates. Maximal degree in co-relation 1646. Up to 306 conditions per place. [2024-06-20 19:22:08,491 INFO L140 encePairwiseOnDemand]: 21/29 looper letters, 56 selfloop transitions, 13 changer transitions 0/71 dead transitions. [2024-06-20 19:22:08,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 71 transitions, 704 flow [2024-06-20 19:22:08,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:22:08,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:22:08,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 78 transitions. [2024-06-20 19:22:08,492 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3842364532019704 [2024-06-20 19:22:08,492 INFO L175 Difference]: Start difference. First operand has 71 places, 63 transitions, 546 flow. Second operand 7 states and 78 transitions. [2024-06-20 19:22:08,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 71 transitions, 704 flow [2024-06-20 19:22:08,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 71 transitions, 675 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-06-20 19:22:08,498 INFO L231 Difference]: Finished difference. Result has 75 places, 63 transitions, 551 flow [2024-06-20 19:22:08,498 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=517, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=551, PETRI_PLACES=75, PETRI_TRANSITIONS=63} [2024-06-20 19:22:08,499 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 47 predicate places. [2024-06-20 19:22:08,499 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 63 transitions, 551 flow [2024-06-20 19:22:08,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:22:08,499 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:22:08,499 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:22:08,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-20 19:22:08,500 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-20 19:22:08,500 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:22:08,500 INFO L85 PathProgramCache]: Analyzing trace with hash 709877165, now seen corresponding path program 1 times [2024-06-20 19:22:08,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:22:08,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891159994] [2024-06-20 19:22:08,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:22:08,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:22:08,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:22:13,340 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-20 19:22:13,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:22:13,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891159994] [2024-06-20 19:22:13,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891159994] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:22:13,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:22:13,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:22:13,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589593983] [2024-06-20 19:22:13,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:22:13,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:22:13,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:22:13,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:22:13,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:22:13,495 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-06-20 19:22:13,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 63 transitions, 551 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-20 19:22:13,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:22:13,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-06-20 19:22:13,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:22:13,810 INFO L124 PetriNetUnfolderBase]: 186/340 cut-off events. [2024-06-20 19:22:13,811 INFO L125 PetriNetUnfolderBase]: For 2471/2471 co-relation queries the response was YES. [2024-06-20 19:22:13,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1714 conditions, 340 events. 186/340 cut-off events. For 2471/2471 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1226 event pairs, 18 based on Foata normal form. 2/342 useless extension candidates. Maximal degree in co-relation 1678. Up to 236 conditions per place. [2024-06-20 19:22:13,813 INFO L140 encePairwiseOnDemand]: 21/29 looper letters, 59 selfloop transitions, 20 changer transitions 0/81 dead transitions. [2024-06-20 19:22:13,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 81 transitions, 781 flow [2024-06-20 19:22:13,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:22:13,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:22:13,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 95 transitions. [2024-06-20 19:22:13,814 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40948275862068967 [2024-06-20 19:22:13,814 INFO L175 Difference]: Start difference. First operand has 75 places, 63 transitions, 551 flow. Second operand 8 states and 95 transitions. [2024-06-20 19:22:13,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 81 transitions, 781 flow [2024-06-20 19:22:13,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 81 transitions, 725 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-20 19:22:13,819 INFO L231 Difference]: Finished difference. Result has 76 places, 64 transitions, 545 flow [2024-06-20 19:22:13,819 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=495, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=545, PETRI_PLACES=76, PETRI_TRANSITIONS=64} [2024-06-20 19:22:13,820 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 48 predicate places. [2024-06-20 19:22:13,820 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 64 transitions, 545 flow [2024-06-20 19:22:13,820 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-20 19:22:13,820 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:22:13,820 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:22:13,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-20 19:22:13,821 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-20 19:22:13,821 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:22:13,821 INFO L85 PathProgramCache]: Analyzing trace with hash 709937739, now seen corresponding path program 1 times [2024-06-20 19:22:13,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:22:13,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795357888] [2024-06-20 19:22:13,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:22:13,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:22:13,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:22:17,942 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-20 19:22:17,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:22:17,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795357888] [2024-06-20 19:22:17,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795357888] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:22:17,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:22:17,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:22:17,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265563166] [2024-06-20 19:22:17,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:22:17,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:22:17,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:22:17,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:22:17,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:22:18,063 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-06-20 19:22:18,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 64 transitions, 545 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-20 19:22:18,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:22:18,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-06-20 19:22:18,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:22:18,377 INFO L124 PetriNetUnfolderBase]: 192/350 cut-off events. [2024-06-20 19:22:18,378 INFO L125 PetriNetUnfolderBase]: For 2683/2683 co-relation queries the response was YES. [2024-06-20 19:22:18,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1768 conditions, 350 events. 192/350 cut-off events. For 2683/2683 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1267 event pairs, 29 based on Foata normal form. 2/352 useless extension candidates. Maximal degree in co-relation 1732. Up to 193 conditions per place. [2024-06-20 19:22:18,380 INFO L140 encePairwiseOnDemand]: 20/29 looper letters, 53 selfloop transitions, 31 changer transitions 0/86 dead transitions. [2024-06-20 19:22:18,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 86 transitions, 825 flow [2024-06-20 19:22:18,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:22:18,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:22:18,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2024-06-20 19:22:18,382 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44396551724137934 [2024-06-20 19:22:18,382 INFO L175 Difference]: Start difference. First operand has 76 places, 64 transitions, 545 flow. Second operand 8 states and 103 transitions. [2024-06-20 19:22:18,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 86 transitions, 825 flow [2024-06-20 19:22:18,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 86 transitions, 787 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-20 19:22:18,387 INFO L231 Difference]: Finished difference. Result has 79 places, 68 transitions, 614 flow [2024-06-20 19:22:18,387 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=507, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=614, PETRI_PLACES=79, PETRI_TRANSITIONS=68} [2024-06-20 19:22:18,387 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 51 predicate places. [2024-06-20 19:22:18,388 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 68 transitions, 614 flow [2024-06-20 19:22:18,388 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-20 19:22:18,388 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:22:18,388 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:22:18,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-20 19:22:18,388 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-20 19:22:18,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:22:18,389 INFO L85 PathProgramCache]: Analyzing trace with hash 709937615, now seen corresponding path program 2 times [2024-06-20 19:22:18,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:22:18,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570861075] [2024-06-20 19:22:18,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:22:18,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:22:18,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:22:22,761 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-20 19:22:22,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:22:22,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570861075] [2024-06-20 19:22:22,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570861075] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:22:22,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:22:22,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:22:22,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002475147] [2024-06-20 19:22:22,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:22:22,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:22:22,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:22:22,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:22:22,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:22:22,892 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-06-20 19:22:22,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 68 transitions, 614 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-20 19:22:22,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:22:22,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-06-20 19:22:22,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:22:23,167 INFO L124 PetriNetUnfolderBase]: 196/358 cut-off events. [2024-06-20 19:22:23,168 INFO L125 PetriNetUnfolderBase]: For 3138/3138 co-relation queries the response was YES. [2024-06-20 19:22:23,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1858 conditions, 358 events. 196/358 cut-off events. For 3138/3138 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1317 event pairs, 33 based on Foata normal form. 2/360 useless extension candidates. Maximal degree in co-relation 1821. Up to 291 conditions per place. [2024-06-20 19:22:23,171 INFO L140 encePairwiseOnDemand]: 21/29 looper letters, 64 selfloop transitions, 18 changer transitions 0/84 dead transitions. [2024-06-20 19:22:23,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 84 transitions, 819 flow [2024-06-20 19:22:23,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:22:23,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:22:23,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 95 transitions. [2024-06-20 19:22:23,172 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40948275862068967 [2024-06-20 19:22:23,172 INFO L175 Difference]: Start difference. First operand has 79 places, 68 transitions, 614 flow. Second operand 8 states and 95 transitions. [2024-06-20 19:22:23,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 84 transitions, 819 flow [2024-06-20 19:22:23,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 84 transitions, 752 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-06-20 19:22:23,178 INFO L231 Difference]: Finished difference. Result has 82 places, 69 transitions, 594 flow [2024-06-20 19:22:23,178 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=547, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=594, PETRI_PLACES=82, PETRI_TRANSITIONS=69} [2024-06-20 19:22:23,179 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 54 predicate places. [2024-06-20 19:22:23,179 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 69 transitions, 594 flow [2024-06-20 19:22:23,179 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-20 19:22:23,179 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:22:23,179 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:22:23,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-20 19:22:23,180 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-20 19:22:23,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:22:23,180 INFO L85 PathProgramCache]: Analyzing trace with hash 712738899, now seen corresponding path program 2 times [2024-06-20 19:22:23,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:22:23,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764905444] [2024-06-20 19:22:23,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:22:23,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:22:23,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:22:27,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:22:27,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:22:27,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764905444] [2024-06-20 19:22:27,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764905444] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:22:27,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:22:27,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:22:27,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691683197] [2024-06-20 19:22:27,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:22:27,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:22:27,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:22:27,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:22:27,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:22:27,919 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-06-20 19:22:27,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 69 transitions, 594 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-20 19:22:27,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:22:27,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-06-20 19:22:27,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:22:28,218 INFO L124 PetriNetUnfolderBase]: 237/430 cut-off events. [2024-06-20 19:22:28,218 INFO L125 PetriNetUnfolderBase]: For 3727/3727 co-relation queries the response was YES. [2024-06-20 19:22:28,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2223 conditions, 430 events. 237/430 cut-off events. For 3727/3727 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1680 event pairs, 83 based on Foata normal form. 2/432 useless extension candidates. Maximal degree in co-relation 2185. Up to 352 conditions per place. [2024-06-20 19:22:28,221 INFO L140 encePairwiseOnDemand]: 18/29 looper letters, 74 selfloop transitions, 21 changer transitions 0/97 dead transitions. [2024-06-20 19:22:28,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 97 transitions, 994 flow [2024-06-20 19:22:28,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:22:28,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:22:28,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 102 transitions. [2024-06-20 19:22:28,224 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39080459770114945 [2024-06-20 19:22:28,224 INFO L175 Difference]: Start difference. First operand has 82 places, 69 transitions, 594 flow. Second operand 9 states and 102 transitions. [2024-06-20 19:22:28,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 97 transitions, 994 flow [2024-06-20 19:22:28,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 97 transitions, 948 flow, removed 1 selfloop flow, removed 6 redundant places. [2024-06-20 19:22:28,234 INFO L231 Difference]: Finished difference. Result has 89 places, 84 transitions, 803 flow [2024-06-20 19:22:28,234 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=803, PETRI_PLACES=89, PETRI_TRANSITIONS=84} [2024-06-20 19:22:28,234 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 61 predicate places. [2024-06-20 19:22:28,235 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 84 transitions, 803 flow [2024-06-20 19:22:28,235 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-20 19:22:28,235 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:22:28,235 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:22:28,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-20 19:22:28,235 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-20 19:22:28,235 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:22:28,236 INFO L85 PathProgramCache]: Analyzing trace with hash -530893375, now seen corresponding path program 3 times [2024-06-20 19:22:28,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:22:28,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338333326] [2024-06-20 19:22:28,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:22:28,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:22:28,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:22:32,442 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-20 19:22:32,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:22:32,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338333326] [2024-06-20 19:22:32,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338333326] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:22:32,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:22:32,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:22:32,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411255433] [2024-06-20 19:22:32,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:22:32,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:22:32,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:22:32,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:22:32,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:22:32,561 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-06-20 19:22:32,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 84 transitions, 803 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-20 19:22:32,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:22:32,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-06-20 19:22:32,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:22:32,915 INFO L124 PetriNetUnfolderBase]: 243/439 cut-off events. [2024-06-20 19:22:32,915 INFO L125 PetriNetUnfolderBase]: For 4253/4253 co-relation queries the response was YES. [2024-06-20 19:22:32,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2381 conditions, 439 events. 243/439 cut-off events. For 4253/4253 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1722 event pairs, 36 based on Foata normal form. 2/441 useless extension candidates. Maximal degree in co-relation 2338. Up to 316 conditions per place. [2024-06-20 19:22:32,918 INFO L140 encePairwiseOnDemand]: 18/29 looper letters, 75 selfloop transitions, 28 changer transitions 0/105 dead transitions. [2024-06-20 19:22:32,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 105 transitions, 1116 flow [2024-06-20 19:22:32,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:22:32,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:22:32,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 111 transitions. [2024-06-20 19:22:32,919 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42528735632183906 [2024-06-20 19:22:32,919 INFO L175 Difference]: Start difference. First operand has 89 places, 84 transitions, 803 flow. Second operand 9 states and 111 transitions. [2024-06-20 19:22:32,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 105 transitions, 1116 flow [2024-06-20 19:22:32,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 105 transitions, 1089 flow, removed 7 selfloop flow, removed 2 redundant places. [2024-06-20 19:22:32,926 INFO L231 Difference]: Finished difference. Result has 97 places, 88 transitions, 898 flow [2024-06-20 19:22:32,927 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=776, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=898, PETRI_PLACES=97, PETRI_TRANSITIONS=88} [2024-06-20 19:22:32,927 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 69 predicate places. [2024-06-20 19:22:32,927 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 88 transitions, 898 flow [2024-06-20 19:22:32,927 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-20 19:22:32,927 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:22:32,928 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:22:32,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-20 19:22:32,928 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-20 19:22:32,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:22:32,928 INFO L85 PathProgramCache]: Analyzing trace with hash 482525873, now seen corresponding path program 4 times [2024-06-20 19:22:32,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:22:32,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880115312] [2024-06-20 19:22:32,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:22:32,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:22:32,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:22:37,271 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-20 19:22:37,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:22:37,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880115312] [2024-06-20 19:22:37,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880115312] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:22:37,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:22:37,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:22:37,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581652234] [2024-06-20 19:22:37,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:22:37,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:22:37,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:22:37,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:22:37,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:22:37,411 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-06-20 19:22:37,411 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 88 transitions, 898 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-20 19:22:37,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:22:37,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-06-20 19:22:37,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:22:37,765 INFO L124 PetriNetUnfolderBase]: 252/454 cut-off events. [2024-06-20 19:22:37,765 INFO L125 PetriNetUnfolderBase]: For 5033/5033 co-relation queries the response was YES. [2024-06-20 19:22:37,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2551 conditions, 454 events. 252/454 cut-off events. For 5033/5033 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1794 event pairs, 36 based on Foata normal form. 2/456 useless extension candidates. Maximal degree in co-relation 2505. Up to 322 conditions per place. [2024-06-20 19:22:37,768 INFO L140 encePairwiseOnDemand]: 18/29 looper letters, 77 selfloop transitions, 31 changer transitions 0/110 dead transitions. [2024-06-20 19:22:37,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 110 transitions, 1223 flow [2024-06-20 19:22:37,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:22:37,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:22:37,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 113 transitions. [2024-06-20 19:22:37,770 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4329501915708812 [2024-06-20 19:22:37,770 INFO L175 Difference]: Start difference. First operand has 97 places, 88 transitions, 898 flow. Second operand 9 states and 113 transitions. [2024-06-20 19:22:37,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 110 transitions, 1223 flow [2024-06-20 19:22:37,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 110 transitions, 1124 flow, removed 21 selfloop flow, removed 7 redundant places. [2024-06-20 19:22:37,778 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 921 flow [2024-06-20 19:22:37,779 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=799, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=921, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2024-06-20 19:22:37,779 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 72 predicate places. [2024-06-20 19:22:37,779 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 92 transitions, 921 flow [2024-06-20 19:22:37,779 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-20 19:22:37,779 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:22:37,780 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:22:37,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-20 19:22:37,780 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-20 19:22:37,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:22:37,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1361173319, now seen corresponding path program 3 times [2024-06-20 19:22:37,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:22:37,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833976439] [2024-06-20 19:22:37,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:22:37,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:22:37,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:22:43,365 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-20 19:22:43,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:22:43,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833976439] [2024-06-20 19:22:43,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833976439] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:22:43,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:22:43,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:22:43,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111233943] [2024-06-20 19:22:43,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:22:43,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:22:43,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:22:43,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:22:43,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:22:43,490 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-06-20 19:22:43,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 92 transitions, 921 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-20 19:22:43,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:22:43,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-06-20 19:22:43,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:22:43,793 INFO L124 PetriNetUnfolderBase]: 256/462 cut-off events. [2024-06-20 19:22:43,794 INFO L125 PetriNetUnfolderBase]: For 5377/5377 co-relation queries the response was YES. [2024-06-20 19:22:43,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2556 conditions, 462 events. 256/462 cut-off events. For 5377/5377 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1835 event pairs, 40 based on Foata normal form. 2/464 useless extension candidates. Maximal degree in co-relation 2510. Up to 392 conditions per place. [2024-06-20 19:22:43,797 INFO L140 encePairwiseOnDemand]: 19/29 looper letters, 82 selfloop transitions, 23 changer transitions 0/107 dead transitions. [2024-06-20 19:22:43,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 107 transitions, 1188 flow [2024-06-20 19:22:43,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:22:43,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:22:43,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2024-06-20 19:22:43,798 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39846743295019155 [2024-06-20 19:22:43,798 INFO L175 Difference]: Start difference. First operand has 100 places, 92 transitions, 921 flow. Second operand 9 states and 104 transitions. [2024-06-20 19:22:43,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 107 transitions, 1188 flow [2024-06-20 19:22:43,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 107 transitions, 1117 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-06-20 19:22:43,807 INFO L231 Difference]: Finished difference. Result has 103 places, 94 transitions, 917 flow [2024-06-20 19:22:43,807 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=850, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=917, PETRI_PLACES=103, PETRI_TRANSITIONS=94} [2024-06-20 19:22:43,807 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 75 predicate places. [2024-06-20 19:22:43,807 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 94 transitions, 917 flow [2024-06-20 19:22:43,808 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-20 19:22:43,808 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:22:43,808 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:22:43,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-20 19:22:43,808 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-20 19:22:43,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:22:43,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1627459353, now seen corresponding path program 5 times [2024-06-20 19:22:43,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:22:43,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008037791] [2024-06-20 19:22:43,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:22:43,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:22:43,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:22:48,126 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-20 19:22:48,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:22:48,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008037791] [2024-06-20 19:22:48,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008037791] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:22:48,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:22:48,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:22:48,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291176130] [2024-06-20 19:22:48,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:22:48,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:22:48,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:22:48,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:22:48,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:22:48,246 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-06-20 19:22:48,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 94 transitions, 917 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-20 19:22:48,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:22:48,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-06-20 19:22:48,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:22:48,616 INFO L124 PetriNetUnfolderBase]: 283/507 cut-off events. [2024-06-20 19:22:48,617 INFO L125 PetriNetUnfolderBase]: For 6312/6312 co-relation queries the response was YES. [2024-06-20 19:22:48,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2842 conditions, 507 events. 283/507 cut-off events. For 6312/6312 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2069 event pairs, 38 based on Foata normal form. 2/509 useless extension candidates. Maximal degree in co-relation 2795. Up to 337 conditions per place. [2024-06-20 19:22:48,621 INFO L140 encePairwiseOnDemand]: 18/29 looper letters, 80 selfloop transitions, 41 changer transitions 0/123 dead transitions. [2024-06-20 19:22:48,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 123 transitions, 1388 flow [2024-06-20 19:22:48,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:22:48,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:22:48,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 119 transitions. [2024-06-20 19:22:48,623 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4559386973180077 [2024-06-20 19:22:48,623 INFO L175 Difference]: Start difference. First operand has 103 places, 94 transitions, 917 flow. Second operand 9 states and 119 transitions. [2024-06-20 19:22:48,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 123 transitions, 1388 flow [2024-06-20 19:22:48,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 123 transitions, 1339 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-20 19:22:48,638 INFO L231 Difference]: Finished difference. Result has 109 places, 104 transitions, 1123 flow [2024-06-20 19:22:48,639 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=870, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1123, PETRI_PLACES=109, PETRI_TRANSITIONS=104} [2024-06-20 19:22:48,639 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 81 predicate places. [2024-06-20 19:22:48,639 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 104 transitions, 1123 flow [2024-06-20 19:22:48,639 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-20 19:22:48,640 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:22:48,640 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:22:48,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-20 19:22:48,640 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-20 19:22:48,640 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:22:48,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1605293733, now seen corresponding path program 6 times [2024-06-20 19:22:48,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:22:48,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737473307] [2024-06-20 19:22:48,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:22:48,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:22:48,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:22:53,019 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-20 19:22:53,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:22:53,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737473307] [2024-06-20 19:22:53,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737473307] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:22:53,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:22:53,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:22:53,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290302548] [2024-06-20 19:22:53,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:22:53,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:22:53,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:22:53,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:22:53,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:22:53,108 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-06-20 19:22:53,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 104 transitions, 1123 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-20 19:22:53,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:22:53,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-06-20 19:22:53,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:22:53,495 INFO L124 PetriNetUnfolderBase]: 295/528 cut-off events. [2024-06-20 19:22:53,495 INFO L125 PetriNetUnfolderBase]: For 7432/7432 co-relation queries the response was YES. [2024-06-20 19:22:53,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3130 conditions, 528 events. 295/528 cut-off events. For 7432/7432 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2195 event pairs, 38 based on Foata normal form. 2/530 useless extension candidates. Maximal degree in co-relation 3079. Up to 396 conditions per place. [2024-06-20 19:22:53,501 INFO L140 encePairwiseOnDemand]: 19/29 looper letters, 92 selfloop transitions, 29 changer transitions 0/123 dead transitions. [2024-06-20 19:22:53,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 123 transitions, 1470 flow [2024-06-20 19:22:53,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:22:53,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:22:53,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2024-06-20 19:22:53,505 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41762452107279696 [2024-06-20 19:22:53,505 INFO L175 Difference]: Start difference. First operand has 109 places, 104 transitions, 1123 flow. Second operand 9 states and 109 transitions. [2024-06-20 19:22:53,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 123 transitions, 1470 flow [2024-06-20 19:22:53,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 123 transitions, 1427 flow, removed 11 selfloop flow, removed 3 redundant places. [2024-06-20 19:22:53,518 INFO L231 Difference]: Finished difference. Result has 115 places, 108 transitions, 1208 flow [2024-06-20 19:22:53,518 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1082, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1208, PETRI_PLACES=115, PETRI_TRANSITIONS=108} [2024-06-20 19:22:53,519 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 87 predicate places. [2024-06-20 19:22:53,519 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 108 transitions, 1208 flow [2024-06-20 19:22:53,519 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-20 19:22:53,520 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:22:53,520 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:22:53,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-20 19:22:53,520 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-20 19:22:53,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:22:53,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1649430821, now seen corresponding path program 1 times [2024-06-20 19:22:53,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:22:53,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362784554] [2024-06-20 19:22:53,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:22:53,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:22:53,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:22:58,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-20 19:22:58,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:22:58,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362784554] [2024-06-20 19:22:58,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362784554] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:22:58,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:22:58,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:22:58,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604007504] [2024-06-20 19:22:58,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:22:58,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:22:58,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:22:58,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:22:58,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:22:58,665 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-06-20 19:22:58,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 108 transitions, 1208 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-20 19:22:58,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:22:58,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-06-20 19:22:58,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:22:59,016 INFO L124 PetriNetUnfolderBase]: 303/544 cut-off events. [2024-06-20 19:22:59,016 INFO L125 PetriNetUnfolderBase]: For 8653/8653 co-relation queries the response was YES. [2024-06-20 19:22:59,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3267 conditions, 544 events. 303/544 cut-off events. For 8653/8653 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2307 event pairs, 41 based on Foata normal form. 4/548 useless extension candidates. Maximal degree in co-relation 3214. Up to 408 conditions per place. [2024-06-20 19:22:59,020 INFO L140 encePairwiseOnDemand]: 19/29 looper letters, 91 selfloop transitions, 32 changer transitions 0/125 dead transitions. [2024-06-20 19:22:59,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 125 transitions, 1512 flow [2024-06-20 19:22:59,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:22:59,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:22:59,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 111 transitions. [2024-06-20 19:22:59,024 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42528735632183906 [2024-06-20 19:22:59,024 INFO L175 Difference]: Start difference. First operand has 115 places, 108 transitions, 1208 flow. Second operand 9 states and 111 transitions. [2024-06-20 19:22:59,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 125 transitions, 1512 flow [2024-06-20 19:22:59,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 125 transitions, 1441 flow, removed 13 selfloop flow, removed 5 redundant places. [2024-06-20 19:22:59,037 INFO L231 Difference]: Finished difference. Result has 119 places, 110 transitions, 1226 flow [2024-06-20 19:22:59,037 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1137, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1226, PETRI_PLACES=119, PETRI_TRANSITIONS=110} [2024-06-20 19:22:59,037 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 91 predicate places. [2024-06-20 19:22:59,037 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 110 transitions, 1226 flow [2024-06-20 19:22:59,038 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-20 19:22:59,038 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:22:59,038 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:22:59,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-20 19:22:59,038 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-20 19:22:59,038 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:22:59,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1627267495, now seen corresponding path program 7 times [2024-06-20 19:22:59,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:22:59,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758819869] [2024-06-20 19:22:59,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:22:59,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:22:59,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:23:03,437 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-20 19:23:03,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:23:03,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758819869] [2024-06-20 19:23:03,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758819869] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:23:03,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:23:03,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:23:03,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075551421] [2024-06-20 19:23:03,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:23:03,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:23:03,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:23:03,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:23:03,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:23:03,540 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-06-20 19:23:03,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 110 transitions, 1226 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-20 19:23:03,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:23:03,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-06-20 19:23:03,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:23:03,885 INFO L124 PetriNetUnfolderBase]: 299/537 cut-off events. [2024-06-20 19:23:03,885 INFO L125 PetriNetUnfolderBase]: For 7862/7862 co-relation queries the response was YES. [2024-06-20 19:23:03,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3204 conditions, 537 events. 299/537 cut-off events. For 7862/7862 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2275 event pairs, 39 based on Foata normal form. 2/539 useless extension candidates. Maximal degree in co-relation 3150. Up to 406 conditions per place. [2024-06-20 19:23:03,889 INFO L140 encePairwiseOnDemand]: 18/29 looper letters, 94 selfloop transitions, 31 changer transitions 0/127 dead transitions. [2024-06-20 19:23:03,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 127 transitions, 1528 flow [2024-06-20 19:23:03,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:23:03,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:23:03,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 113 transitions. [2024-06-20 19:23:03,891 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4329501915708812 [2024-06-20 19:23:03,891 INFO L175 Difference]: Start difference. First operand has 119 places, 110 transitions, 1226 flow. Second operand 9 states and 113 transitions. [2024-06-20 19:23:03,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 127 transitions, 1528 flow [2024-06-20 19:23:03,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 127 transitions, 1439 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-20 19:23:03,905 INFO L231 Difference]: Finished difference. Result has 121 places, 110 transitions, 1204 flow [2024-06-20 19:23:03,905 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1137, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1204, PETRI_PLACES=121, PETRI_TRANSITIONS=110} [2024-06-20 19:23:03,905 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 93 predicate places. [2024-06-20 19:23:03,906 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 110 transitions, 1204 flow [2024-06-20 19:23:03,906 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-20 19:23:03,906 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:23:03,906 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:23:03,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-20 19:23:03,906 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-20 19:23:03,906 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:23:03,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1193626545, now seen corresponding path program 8 times [2024-06-20 19:23:03,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:23:03,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900118473] [2024-06-20 19:23:03,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:23:03,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:23:03,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:23:08,240 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-20 19:23:08,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:23:08,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900118473] [2024-06-20 19:23:08,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900118473] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:23:08,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:23:08,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:23:08,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171062625] [2024-06-20 19:23:08,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:23:08,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:23:08,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:23:08,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:23:08,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:23:08,305 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-06-20 19:23:08,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 110 transitions, 1204 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-20 19:23:08,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:23:08,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-06-20 19:23:08,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:23:08,598 INFO L124 PetriNetUnfolderBase]: 305/547 cut-off events. [2024-06-20 19:23:08,598 INFO L125 PetriNetUnfolderBase]: For 8548/8548 co-relation queries the response was YES. [2024-06-20 19:23:08,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3250 conditions, 547 events. 305/547 cut-off events. For 8548/8548 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2321 event pairs, 38 based on Foata normal form. 2/549 useless extension candidates. Maximal degree in co-relation 3195. Up to 390 conditions per place. [2024-06-20 19:23:08,602 INFO L140 encePairwiseOnDemand]: 19/29 looper letters, 79 selfloop transitions, 44 changer transitions 0/125 dead transitions. [2024-06-20 19:23:08,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 125 transitions, 1522 flow [2024-06-20 19:23:08,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:23:08,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:23:08,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 99 transitions. [2024-06-20 19:23:08,609 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4267241379310345 [2024-06-20 19:23:08,609 INFO L175 Difference]: Start difference. First operand has 121 places, 110 transitions, 1204 flow. Second operand 8 states and 99 transitions. [2024-06-20 19:23:08,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 125 transitions, 1522 flow [2024-06-20 19:23:08,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 125 transitions, 1448 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-20 19:23:08,624 INFO L231 Difference]: Finished difference. Result has 122 places, 112 transitions, 1264 flow [2024-06-20 19:23:08,625 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1130, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1264, PETRI_PLACES=122, PETRI_TRANSITIONS=112} [2024-06-20 19:23:08,625 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 94 predicate places. [2024-06-20 19:23:08,625 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 112 transitions, 1264 flow [2024-06-20 19:23:08,625 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-20 19:23:08,625 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:23:08,625 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:23:08,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-20 19:23:08,626 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-20 19:23:08,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:23:08,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1193626421, now seen corresponding path program 4 times [2024-06-20 19:23:08,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:23:08,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786986477] [2024-06-20 19:23:08,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:23:08,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:23:08,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:23:12,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:23:12,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:23:12,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786986477] [2024-06-20 19:23:12,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786986477] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:23:12,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:23:12,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:23:12,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811510605] [2024-06-20 19:23:12,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:23:12,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:23:12,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:23:12,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:23:12,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:23:12,448 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-06-20 19:23:12,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 112 transitions, 1264 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-20 19:23:12,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:23:12,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-06-20 19:23:12,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:23:12,672 INFO L124 PetriNetUnfolderBase]: 302/543 cut-off events. [2024-06-20 19:23:12,673 INFO L125 PetriNetUnfolderBase]: For 8488/8488 co-relation queries the response was YES. [2024-06-20 19:23:12,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3244 conditions, 543 events. 302/543 cut-off events. For 8488/8488 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2284 event pairs, 45 based on Foata normal form. 2/545 useless extension candidates. Maximal degree in co-relation 3188. Up to 459 conditions per place. [2024-06-20 19:23:12,677 INFO L140 encePairwiseOnDemand]: 20/29 looper letters, 90 selfloop transitions, 30 changer transitions 0/122 dead transitions. [2024-06-20 19:23:12,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 122 transitions, 1528 flow [2024-06-20 19:23:12,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:23:12,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:23:12,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2024-06-20 19:23:12,679 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39655172413793105 [2024-06-20 19:23:12,679 INFO L175 Difference]: Start difference. First operand has 122 places, 112 transitions, 1264 flow. Second operand 8 states and 92 transitions. [2024-06-20 19:23:12,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 122 transitions, 1528 flow [2024-06-20 19:23:12,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 122 transitions, 1418 flow, removed 14 selfloop flow, removed 6 redundant places. [2024-06-20 19:23:12,696 INFO L231 Difference]: Finished difference. Result has 124 places, 112 transitions, 1220 flow [2024-06-20 19:23:12,696 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1154, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1220, PETRI_PLACES=124, PETRI_TRANSITIONS=112} [2024-06-20 19:23:12,697 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 96 predicate places. [2024-06-20 19:23:12,697 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 112 transitions, 1220 flow [2024-06-20 19:23:12,697 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-20 19:23:12,697 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:23:12,697 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:23:12,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-20 19:23:12,697 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-20 19:23:12,697 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:23:12,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1308917715, now seen corresponding path program 9 times [2024-06-20 19:23:12,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:23:12,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31092934] [2024-06-20 19:23:12,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:23:12,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:23:12,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:23:17,158 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-20 19:23:17,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:23:17,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31092934] [2024-06-20 19:23:17,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31092934] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:23:17,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:23:17,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:23:17,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627912014] [2024-06-20 19:23:17,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:23:17,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:23:17,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:23:17,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:23:17,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:23:17,266 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-06-20 19:23:17,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 112 transitions, 1220 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-20 19:23:17,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:23:17,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-06-20 19:23:17,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:23:17,577 INFO L124 PetriNetUnfolderBase]: 308/553 cut-off events. [2024-06-20 19:23:17,577 INFO L125 PetriNetUnfolderBase]: For 8101/8101 co-relation queries the response was YES. [2024-06-20 19:23:17,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3236 conditions, 553 events. 308/553 cut-off events. For 8101/8101 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2371 event pairs, 31 based on Foata normal form. 2/555 useless extension candidates. Maximal degree in co-relation 3179. Up to 328 conditions per place. [2024-06-20 19:23:17,581 INFO L140 encePairwiseOnDemand]: 19/29 looper letters, 70 selfloop transitions, 62 changer transitions 0/134 dead transitions. [2024-06-20 19:23:17,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 134 transitions, 1634 flow [2024-06-20 19:23:17,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:23:17,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:23:17,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 109 transitions. [2024-06-20 19:23:17,593 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4698275862068966 [2024-06-20 19:23:17,593 INFO L175 Difference]: Start difference. First operand has 124 places, 112 transitions, 1220 flow. Second operand 8 states and 109 transitions. [2024-06-20 19:23:17,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 134 transitions, 1634 flow [2024-06-20 19:23:17,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 134 transitions, 1560 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-20 19:23:17,611 INFO L231 Difference]: Finished difference. Result has 125 places, 114 transitions, 1314 flow [2024-06-20 19:23:17,611 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1148, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1314, PETRI_PLACES=125, PETRI_TRANSITIONS=114} [2024-06-20 19:23:17,616 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 97 predicate places. [2024-06-20 19:23:17,616 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 114 transitions, 1314 flow [2024-06-20 19:23:17,616 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-20 19:23:17,617 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:23:17,617 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:23:17,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-20 19:23:17,617 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-20 19:23:17,618 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:23:17,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1309102289, now seen corresponding path program 2 times [2024-06-20 19:23:17,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:23:17,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079032244] [2024-06-20 19:23:17,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:23:17,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:23:17,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:23:22,302 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-20 19:23:22,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:23:22,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079032244] [2024-06-20 19:23:22,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079032244] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:23:22,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:23:22,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:23:22,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183196893] [2024-06-20 19:23:22,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:23:22,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:23:22,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:23:22,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:23:22,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:23:22,400 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-06-20 19:23:22,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 114 transitions, 1314 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-20 19:23:22,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:23:22,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-06-20 19:23:22,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:23:22,651 INFO L124 PetriNetUnfolderBase]: 316/569 cut-off events. [2024-06-20 19:23:22,651 INFO L125 PetriNetUnfolderBase]: For 9201/9201 co-relation queries the response was YES. [2024-06-20 19:23:22,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3401 conditions, 569 events. 316/569 cut-off events. For 9201/9201 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2448 event pairs, 36 based on Foata normal form. 4/573 useless extension candidates. Maximal degree in co-relation 3343. Up to 421 conditions per place. [2024-06-20 19:23:22,655 INFO L140 encePairwiseOnDemand]: 20/29 looper letters, 88 selfloop transitions, 38 changer transitions 0/128 dead transitions. [2024-06-20 19:23:22,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 128 transitions, 1618 flow [2024-06-20 19:23:22,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:23:22,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:23:22,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 97 transitions. [2024-06-20 19:23:22,657 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41810344827586204 [2024-06-20 19:23:22,657 INFO L175 Difference]: Start difference. First operand has 125 places, 114 transitions, 1314 flow. Second operand 8 states and 97 transitions. [2024-06-20 19:23:22,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 128 transitions, 1618 flow [2024-06-20 19:23:22,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 128 transitions, 1457 flow, removed 12 selfloop flow, removed 7 redundant places. [2024-06-20 19:23:22,673 INFO L231 Difference]: Finished difference. Result has 126 places, 116 transitions, 1261 flow [2024-06-20 19:23:22,673 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1261, PETRI_PLACES=126, PETRI_TRANSITIONS=116} [2024-06-20 19:23:22,674 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 98 predicate places. [2024-06-20 19:23:22,674 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 116 transitions, 1261 flow [2024-06-20 19:23:22,674 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-20 19:23:22,675 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:23:22,675 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:23:22,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-20 19:23:22,675 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-20 19:23:22,675 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:23:22,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1786016993, now seen corresponding path program 10 times [2024-06-20 19:23:22,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:23:22,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138097130] [2024-06-20 19:23:22,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:23:22,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:23:22,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:23:27,403 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-20 19:23:27,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:23:27,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138097130] [2024-06-20 19:23:27,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138097130] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:23:27,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:23:27,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:23:27,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065801362] [2024-06-20 19:23:27,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:23:27,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:23:27,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:23:27,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:23:27,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:23:27,473 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-06-20 19:23:27,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 116 transitions, 1261 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-20 19:23:27,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:23:27,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-06-20 19:23:27,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:23:27,805 INFO L124 PetriNetUnfolderBase]: 328/589 cut-off events. [2024-06-20 19:23:27,805 INFO L125 PetriNetUnfolderBase]: For 8394/8394 co-relation queries the response was YES. [2024-06-20 19:23:27,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3445 conditions, 589 events. 328/589 cut-off events. For 8394/8394 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2569 event pairs, 34 based on Foata normal form. 2/591 useless extension candidates. Maximal degree in co-relation 3387. Up to 445 conditions per place. [2024-06-20 19:23:27,809 INFO L140 encePairwiseOnDemand]: 20/29 looper letters, 93 selfloop transitions, 37 changer transitions 0/132 dead transitions. [2024-06-20 19:23:27,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 132 transitions, 1619 flow [2024-06-20 19:23:27,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:23:27,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:23:27,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 95 transitions. [2024-06-20 19:23:27,811 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40948275862068967 [2024-06-20 19:23:27,811 INFO L175 Difference]: Start difference. First operand has 126 places, 116 transitions, 1261 flow. Second operand 8 states and 95 transitions. [2024-06-20 19:23:27,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 132 transitions, 1619 flow [2024-06-20 19:23:27,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 132 transitions, 1527 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-06-20 19:23:27,828 INFO L231 Difference]: Finished difference. Result has 128 places, 120 transitions, 1319 flow [2024-06-20 19:23:27,828 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1173, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1319, PETRI_PLACES=128, PETRI_TRANSITIONS=120} [2024-06-20 19:23:27,828 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 100 predicate places. [2024-06-20 19:23:27,828 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 120 transitions, 1319 flow [2024-06-20 19:23:27,828 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-20 19:23:27,829 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:23:27,829 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:23:27,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-20 19:23:27,829 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-20 19:23:27,829 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:23:27,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1308922365, now seen corresponding path program 11 times [2024-06-20 19:23:27,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:23:27,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020708548] [2024-06-20 19:23:27,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:23:27,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:23:27,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:23:32,570 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-20 19:23:32,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:23:32,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020708548] [2024-06-20 19:23:32,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020708548] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:23:32,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:23:32,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:23:32,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322521544] [2024-06-20 19:23:32,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:23:32,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:23:32,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:23:32,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:23:32,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:23:32,640 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-06-20 19:23:32,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 120 transitions, 1319 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-20 19:23:32,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:23:32,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-06-20 19:23:32,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:23:32,947 INFO L124 PetriNetUnfolderBase]: 329/593 cut-off events. [2024-06-20 19:23:32,948 INFO L125 PetriNetUnfolderBase]: For 8025/8025 co-relation queries the response was YES. [2024-06-20 19:23:32,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3437 conditions, 593 events. 329/593 cut-off events. For 8025/8025 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2614 event pairs, 57 based on Foata normal form. 2/595 useless extension candidates. Maximal degree in co-relation 3378. Up to 447 conditions per place. [2024-06-20 19:23:32,952 INFO L140 encePairwiseOnDemand]: 19/29 looper letters, 94 selfloop transitions, 42 changer transitions 0/138 dead transitions. [2024-06-20 19:23:32,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 138 transitions, 1681 flow [2024-06-20 19:23:32,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:23:32,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:23:32,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2024-06-20 19:23:32,953 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4353448275862069 [2024-06-20 19:23:32,953 INFO L175 Difference]: Start difference. First operand has 128 places, 120 transitions, 1319 flow. Second operand 8 states and 101 transitions. [2024-06-20 19:23:32,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 138 transitions, 1681 flow [2024-06-20 19:23:32,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 138 transitions, 1574 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-06-20 19:23:32,970 INFO L231 Difference]: Finished difference. Result has 129 places, 122 transitions, 1346 flow [2024-06-20 19:23:32,970 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1212, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1346, PETRI_PLACES=129, PETRI_TRANSITIONS=122} [2024-06-20 19:23:32,970 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 101 predicate places. [2024-06-20 19:23:32,970 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 122 transitions, 1346 flow [2024-06-20 19:23:32,970 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-20 19:23:32,970 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:23:32,970 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:23:32,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-20 19:23:32,971 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-20 19:23:32,971 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:23:32,971 INFO L85 PathProgramCache]: Analyzing trace with hash -736159321, now seen corresponding path program 3 times [2024-06-20 19:23:32,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:23:32,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681690999] [2024-06-20 19:23:32,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:23:32,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:23:33,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:23:37,753 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-20 19:23:37,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:23:37,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681690999] [2024-06-20 19:23:37,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681690999] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:23:37,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:23:37,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:23:37,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534438045] [2024-06-20 19:23:37,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:23:37,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:23:37,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:23:37,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:23:37,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:23:37,851 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-06-20 19:23:37,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 122 transitions, 1346 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-20 19:23:37,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:23:37,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-06-20 19:23:37,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:23:38,193 INFO L124 PetriNetUnfolderBase]: 333/598 cut-off events. [2024-06-20 19:23:38,193 INFO L125 PetriNetUnfolderBase]: For 8126/8126 co-relation queries the response was YES. [2024-06-20 19:23:38,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3423 conditions, 598 events. 333/598 cut-off events. For 8126/8126 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2611 event pairs, 104 based on Foata normal form. 2/600 useless extension candidates. Maximal degree in co-relation 3366. Up to 570 conditions per place. [2024-06-20 19:23:38,196 INFO L140 encePairwiseOnDemand]: 21/29 looper letters, 118 selfloop transitions, 12 changer transitions 0/132 dead transitions. [2024-06-20 19:23:38,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 132 transitions, 1638 flow [2024-06-20 19:23:38,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:23:38,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:23:38,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 86 transitions. [2024-06-20 19:23:38,197 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3706896551724138 [2024-06-20 19:23:38,197 INFO L175 Difference]: Start difference. First operand has 129 places, 122 transitions, 1346 flow. Second operand 8 states and 86 transitions. [2024-06-20 19:23:38,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 132 transitions, 1638 flow [2024-06-20 19:23:38,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 132 transitions, 1512 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-20 19:23:38,214 INFO L231 Difference]: Finished difference. Result has 130 places, 123 transitions, 1260 flow [2024-06-20 19:23:38,214 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1220, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1260, PETRI_PLACES=130, PETRI_TRANSITIONS=123} [2024-06-20 19:23:38,214 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 102 predicate places. [2024-06-20 19:23:38,214 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 123 transitions, 1260 flow [2024-06-20 19:23:38,214 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-20 19:23:38,215 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:23:38,215 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:23:38,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-20 19:23:38,215 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-20 19:23:38,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:23:38,215 INFO L85 PathProgramCache]: Analyzing trace with hash -519189977, now seen corresponding path program 4 times [2024-06-20 19:23:38,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:23:38,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425220064] [2024-06-20 19:23:38,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:23:38,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:23:38,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:23:42,742 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-20 19:23:42,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:23:42,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425220064] [2024-06-20 19:23:42,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425220064] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:23:42,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:23:42,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:23:42,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643234379] [2024-06-20 19:23:42,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:23:42,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:23:42,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:23:42,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:23:42,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:23:42,904 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-06-20 19:23:42,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 123 transitions, 1260 flow. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:23:42,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:23:42,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-06-20 19:23:42,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:23:43,182 INFO L124 PetriNetUnfolderBase]: 337/607 cut-off events. [2024-06-20 19:23:43,183 INFO L125 PetriNetUnfolderBase]: For 7684/7684 co-relation queries the response was YES. [2024-06-20 19:23:43,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3319 conditions, 607 events. 337/607 cut-off events. For 7684/7684 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 2654 event pairs, 104 based on Foata normal form. 2/609 useless extension candidates. Maximal degree in co-relation 3262. Up to 570 conditions per place. [2024-06-20 19:23:43,186 INFO L140 encePairwiseOnDemand]: 21/29 looper letters, 116 selfloop transitions, 15 changer transitions 0/133 dead transitions. [2024-06-20 19:23:43,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 133 transitions, 1556 flow [2024-06-20 19:23:43,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:23:43,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:23:43,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 87 transitions. [2024-06-20 19:23:43,187 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-20 19:23:43,187 INFO L175 Difference]: Start difference. First operand has 130 places, 123 transitions, 1260 flow. Second operand 8 states and 87 transitions. [2024-06-20 19:23:43,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 133 transitions, 1556 flow [2024-06-20 19:23:43,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 133 transitions, 1478 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-20 19:23:43,204 INFO L231 Difference]: Finished difference. Result has 130 places, 124 transitions, 1231 flow [2024-06-20 19:23:43,204 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1182, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1231, PETRI_PLACES=130, PETRI_TRANSITIONS=124} [2024-06-20 19:23:43,204 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 102 predicate places. [2024-06-20 19:23:43,205 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 124 transitions, 1231 flow [2024-06-20 19:23:43,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:23:43,205 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:23:43,205 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:23:43,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-20 19:23:43,205 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-20 19:23:43,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:23:43,206 INFO L85 PathProgramCache]: Analyzing trace with hash -519196921, now seen corresponding path program 12 times [2024-06-20 19:23:43,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:23:43,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600723537] [2024-06-20 19:23:43,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:23:43,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:23:43,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:23:47,674 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-20 19:23:47,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:23:47,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600723537] [2024-06-20 19:23:47,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600723537] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:23:47,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:23:47,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:23:47,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131940791] [2024-06-20 19:23:47,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:23:47,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:23:47,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:23:47,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:23:47,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:23:47,785 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-06-20 19:23:47,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 124 transitions, 1231 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-20 19:23:47,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:23:47,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-06-20 19:23:47,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:23:48,078 INFO L124 PetriNetUnfolderBase]: 331/598 cut-off events. [2024-06-20 19:23:48,078 INFO L125 PetriNetUnfolderBase]: For 7213/7213 co-relation queries the response was YES. [2024-06-20 19:23:48,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3175 conditions, 598 events. 331/598 cut-off events. For 7213/7213 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 2653 event pairs, 45 based on Foata normal form. 3/601 useless extension candidates. Maximal degree in co-relation 3117. Up to 472 conditions per place. [2024-06-20 19:23:48,081 INFO L140 encePairwiseOnDemand]: 19/29 looper letters, 94 selfloop transitions, 45 changer transitions 0/141 dead transitions. [2024-06-20 19:23:48,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 141 transitions, 1567 flow [2024-06-20 19:23:48,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:23:48,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:23:48,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 98 transitions. [2024-06-20 19:23:48,082 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4827586206896552 [2024-06-20 19:23:48,082 INFO L175 Difference]: Start difference. First operand has 130 places, 124 transitions, 1231 flow. Second operand 7 states and 98 transitions. [2024-06-20 19:23:48,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 141 transitions, 1567 flow [2024-06-20 19:23:48,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 141 transitions, 1508 flow, removed 16 selfloop flow, removed 6 redundant places. [2024-06-20 19:23:48,102 INFO L231 Difference]: Finished difference. Result has 131 places, 124 transitions, 1280 flow [2024-06-20 19:23:48,102 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1172, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1280, PETRI_PLACES=131, PETRI_TRANSITIONS=124} [2024-06-20 19:23:48,103 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 103 predicate places. [2024-06-20 19:23:48,103 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 124 transitions, 1280 flow [2024-06-20 19:23:48,103 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-20 19:23:48,103 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:23:48,103 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:23:48,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-20 19:23:48,103 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-20 19:23:48,103 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:23:48,103 INFO L85 PathProgramCache]: Analyzing trace with hash -499687291, now seen corresponding path program 5 times [2024-06-20 19:23:48,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:23:48,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352797449] [2024-06-20 19:23:48,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:23:48,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:23:48,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:23:52,605 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-20 19:23:52,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:23:52,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352797449] [2024-06-20 19:23:52,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352797449] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:23:52,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:23:52,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:23:52,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235740428] [2024-06-20 19:23:52,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:23:52,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:23:52,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:23:52,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:23:52,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:23:52,727 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-06-20 19:23:52,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 124 transitions, 1280 flow. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:23:52,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:23:52,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-06-20 19:23:52,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:23:52,977 INFO L124 PetriNetUnfolderBase]: 328/593 cut-off events. [2024-06-20 19:23:52,977 INFO L125 PetriNetUnfolderBase]: For 6765/6765 co-relation queries the response was YES. [2024-06-20 19:23:52,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3189 conditions, 593 events. 328/593 cut-off events. For 6765/6765 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 2591 event pairs, 102 based on Foata normal form. 2/595 useless extension candidates. Maximal degree in co-relation 3130. Up to 559 conditions per place. [2024-06-20 19:23:52,981 INFO L140 encePairwiseOnDemand]: 21/29 looper letters, 119 selfloop transitions, 12 changer transitions 0/133 dead transitions. [2024-06-20 19:23:52,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 133 transitions, 1562 flow [2024-06-20 19:23:52,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:23:52,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:23:52,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 85 transitions. [2024-06-20 19:23:52,982 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36637931034482757 [2024-06-20 19:23:52,982 INFO L175 Difference]: Start difference. First operand has 131 places, 124 transitions, 1280 flow. Second operand 8 states and 85 transitions. [2024-06-20 19:23:52,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 133 transitions, 1562 flow [2024-06-20 19:23:52,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 133 transitions, 1443 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-20 19:23:52,999 INFO L231 Difference]: Finished difference. Result has 133 places, 124 transitions, 1189 flow [2024-06-20 19:23:52,999 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1161, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1189, PETRI_PLACES=133, PETRI_TRANSITIONS=124} [2024-06-20 19:23:53,000 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 105 predicate places. [2024-06-20 19:23:53,000 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 124 transitions, 1189 flow [2024-06-20 19:23:53,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:23:53,000 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:23:53,000 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:23:53,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-20 19:23:53,000 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-20 19:23:53,000 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:23:53,000 INFO L85 PathProgramCache]: Analyzing trace with hash 156259881, now seen corresponding path program 1 times [2024-06-20 19:23:53,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:23:53,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109200790] [2024-06-20 19:23:53,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:23:53,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:23:53,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:23:57,523 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-20 19:23:57,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:23:57,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109200790] [2024-06-20 19:23:57,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109200790] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:23:57,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:23:57,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:23:57,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24669555] [2024-06-20 19:23:57,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:23:57,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:23:57,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:23:57,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:23:57,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:23:57,707 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-06-20 19:23:57,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 124 transitions, 1189 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-20 19:23:57,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:23:57,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-06-20 19:23:57,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:23:58,111 INFO L124 PetriNetUnfolderBase]: 399/739 cut-off events. [2024-06-20 19:23:58,111 INFO L125 PetriNetUnfolderBase]: For 13255/13255 co-relation queries the response was YES. [2024-06-20 19:23:58,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3791 conditions, 739 events. 399/739 cut-off events. For 13255/13255 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3526 event pairs, 78 based on Foata normal form. 8/747 useless extension candidates. Maximal degree in co-relation 3731. Up to 368 conditions per place. [2024-06-20 19:23:58,115 INFO L140 encePairwiseOnDemand]: 19/29 looper letters, 108 selfloop transitions, 41 changer transitions 11/162 dead transitions. [2024-06-20 19:23:58,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 162 transitions, 1728 flow [2024-06-20 19:23:58,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:23:58,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:23:58,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2024-06-20 19:23:58,117 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44482758620689655 [2024-06-20 19:23:58,117 INFO L175 Difference]: Start difference. First operand has 133 places, 124 transitions, 1189 flow. Second operand 10 states and 129 transitions. [2024-06-20 19:23:58,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 162 transitions, 1728 flow [2024-06-20 19:23:58,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 162 transitions, 1667 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-20 19:23:58,141 INFO L231 Difference]: Finished difference. Result has 139 places, 127 transitions, 1278 flow [2024-06-20 19:23:58,141 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1128, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1278, PETRI_PLACES=139, PETRI_TRANSITIONS=127} [2024-06-20 19:23:58,141 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 111 predicate places. [2024-06-20 19:23:58,142 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 127 transitions, 1278 flow [2024-06-20 19:23:58,142 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-20 19:23:58,142 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:23:58,142 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:23:58,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-20 19:23:58,143 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-20 19:23:58,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:23:58,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1445815759, now seen corresponding path program 2 times [2024-06-20 19:23:58,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:23:58,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368441760] [2024-06-20 19:23:58,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:23:58,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:23:58,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:24:02,674 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-20 19:24:02,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:24:02,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368441760] [2024-06-20 19:24:02,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368441760] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:24:02,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:24:02,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:24:02,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492123236] [2024-06-20 19:24:02,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:24:02,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:24:02,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:24:02,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:24:02,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:24:02,809 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-06-20 19:24:02,810 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 127 transitions, 1278 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-20 19:24:02,810 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:24:02,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-06-20 19:24:02,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:24:03,217 INFO L124 PetriNetUnfolderBase]: 388/720 cut-off events. [2024-06-20 19:24:03,218 INFO L125 PetriNetUnfolderBase]: For 13748/13748 co-relation queries the response was YES. [2024-06-20 19:24:03,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3838 conditions, 720 events. 388/720 cut-off events. For 13748/13748 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3429 event pairs, 80 based on Foata normal form. 6/726 useless extension candidates. Maximal degree in co-relation 3775. Up to 479 conditions per place. [2024-06-20 19:24:03,222 INFO L140 encePairwiseOnDemand]: 19/29 looper letters, 95 selfloop transitions, 54 changer transitions 0/151 dead transitions. [2024-06-20 19:24:03,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 151 transitions, 1668 flow [2024-06-20 19:24:03,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:24:03,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:24:03,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 126 transitions. [2024-06-20 19:24:03,223 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43448275862068964 [2024-06-20 19:24:03,223 INFO L175 Difference]: Start difference. First operand has 139 places, 127 transitions, 1278 flow. Second operand 10 states and 126 transitions. [2024-06-20 19:24:03,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 151 transitions, 1668 flow [2024-06-20 19:24:03,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 151 transitions, 1618 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-06-20 19:24:03,249 INFO L231 Difference]: Finished difference. Result has 142 places, 131 transitions, 1408 flow [2024-06-20 19:24:03,249 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1228, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1408, PETRI_PLACES=142, PETRI_TRANSITIONS=131} [2024-06-20 19:24:03,250 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 114 predicate places. [2024-06-20 19:24:03,250 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 131 transitions, 1408 flow [2024-06-20 19:24:03,250 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-20 19:24:03,250 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:24:03,250 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:24:03,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-20 19:24:03,251 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-20 19:24:03,251 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:24:03,251 INFO L85 PathProgramCache]: Analyzing trace with hash 666609151, now seen corresponding path program 3 times [2024-06-20 19:24:03,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:24:03,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390111042] [2024-06-20 19:24:03,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:24:03,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:24:03,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:24:08,058 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-20 19:24:08,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:24:08,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390111042] [2024-06-20 19:24:08,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390111042] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:24:08,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:24:08,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:24:08,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649393584] [2024-06-20 19:24:08,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:24:08,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:24:08,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:24:08,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:24:08,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:24:08,232 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-06-20 19:24:08,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 131 transitions, 1408 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-20 19:24:08,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:24:08,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-06-20 19:24:08,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:24:08,654 INFO L124 PetriNetUnfolderBase]: 408/768 cut-off events. [2024-06-20 19:24:08,654 INFO L125 PetriNetUnfolderBase]: For 16349/16349 co-relation queries the response was YES. [2024-06-20 19:24:08,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4251 conditions, 768 events. 408/768 cut-off events. For 16349/16349 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3755 event pairs, 86 based on Foata normal form. 8/776 useless extension candidates. Maximal degree in co-relation 4187. Up to 487 conditions per place. [2024-06-20 19:24:08,660 INFO L140 encePairwiseOnDemand]: 19/29 looper letters, 106 selfloop transitions, 42 changer transitions 7/157 dead transitions. [2024-06-20 19:24:08,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 157 transitions, 1860 flow [2024-06-20 19:24:08,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:24:08,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:24:08,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2024-06-20 19:24:08,674 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44482758620689655 [2024-06-20 19:24:08,674 INFO L175 Difference]: Start difference. First operand has 142 places, 131 transitions, 1408 flow. Second operand 10 states and 129 transitions. [2024-06-20 19:24:08,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 157 transitions, 1860 flow [2024-06-20 19:24:08,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 157 transitions, 1750 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-20 19:24:08,704 INFO L231 Difference]: Finished difference. Result has 147 places, 130 transitions, 1375 flow [2024-06-20 19:24:08,704 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1298, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1375, PETRI_PLACES=147, PETRI_TRANSITIONS=130} [2024-06-20 19:24:08,705 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 119 predicate places. [2024-06-20 19:24:08,705 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 130 transitions, 1375 flow [2024-06-20 19:24:08,705 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-20 19:24:08,705 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:24:08,705 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:24:08,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-20 19:24:08,706 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-20 19:24:08,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:24:08,706 INFO L85 PathProgramCache]: Analyzing trace with hash 722175325, now seen corresponding path program 4 times [2024-06-20 19:24:08,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:24:08,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161160088] [2024-06-20 19:24:08,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:24:08,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:24:08,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:24:13,978 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-20 19:24:13,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:24:13,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161160088] [2024-06-20 19:24:13,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161160088] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:24:13,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:24:13,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:24:13,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467609685] [2024-06-20 19:24:13,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:24:13,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:24:13,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:24:13,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:24:13,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:24:14,121 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-06-20 19:24:14,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 130 transitions, 1375 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-20 19:24:14,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:24:14,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-06-20 19:24:14,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:24:14,522 INFO L124 PetriNetUnfolderBase]: 414/786 cut-off events. [2024-06-20 19:24:14,522 INFO L125 PetriNetUnfolderBase]: For 21001/21001 co-relation queries the response was YES. [2024-06-20 19:24:14,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4283 conditions, 786 events. 414/786 cut-off events. For 21001/21001 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3910 event pairs, 102 based on Foata normal form. 16/802 useless extension candidates. Maximal degree in co-relation 4217. Up to 570 conditions per place. [2024-06-20 19:24:14,528 INFO L140 encePairwiseOnDemand]: 18/29 looper letters, 107 selfloop transitions, 32 changer transitions 10/151 dead transitions. [2024-06-20 19:24:14,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 151 transitions, 1747 flow [2024-06-20 19:24:14,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:24:14,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:24:14,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2024-06-20 19:24:14,530 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43103448275862066 [2024-06-20 19:24:14,530 INFO L175 Difference]: Start difference. First operand has 147 places, 130 transitions, 1375 flow. Second operand 10 states and 125 transitions. [2024-06-20 19:24:14,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 151 transitions, 1747 flow [2024-06-20 19:24:14,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 151 transitions, 1659 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-20 19:24:14,562 INFO L231 Difference]: Finished difference. Result has 147 places, 126 transitions, 1313 flow [2024-06-20 19:24:14,562 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1287, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1313, PETRI_PLACES=147, PETRI_TRANSITIONS=126} [2024-06-20 19:24:14,562 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 119 predicate places. [2024-06-20 19:24:14,562 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 126 transitions, 1313 flow [2024-06-20 19:24:14,563 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-20 19:24:14,563 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:24:14,563 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:24:14,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-20 19:24:14,563 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-20 19:24:14,563 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:24:14,563 INFO L85 PathProgramCache]: Analyzing trace with hash 753304681, now seen corresponding path program 5 times [2024-06-20 19:24:14,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:24:14,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907501958] [2024-06-20 19:24:14,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:24:14,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:24:14,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:24:19,185 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-20 19:24:19,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:24:19,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907501958] [2024-06-20 19:24:19,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907501958] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:24:19,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:24:19,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:24:19,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087836654] [2024-06-20 19:24:19,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:24:19,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:24:19,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:24:19,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:24:19,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:24:19,278 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-06-20 19:24:19,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 126 transitions, 1313 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-20 19:24:19,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:24:19,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-06-20 19:24:19,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:24:19,737 INFO L124 PetriNetUnfolderBase]: 392/748 cut-off events. [2024-06-20 19:24:19,737 INFO L125 PetriNetUnfolderBase]: For 18162/18162 co-relation queries the response was YES. [2024-06-20 19:24:19,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4099 conditions, 748 events. 392/748 cut-off events. For 18162/18162 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3672 event pairs, 96 based on Foata normal form. 10/758 useless extension candidates. Maximal degree in co-relation 4034. Up to 567 conditions per place. [2024-06-20 19:24:19,742 INFO L140 encePairwiseOnDemand]: 18/29 looper letters, 103 selfloop transitions, 31 changer transitions 11/147 dead transitions. [2024-06-20 19:24:19,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 147 transitions, 1677 flow [2024-06-20 19:24:19,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:24:19,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:24:19,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 123 transitions. [2024-06-20 19:24:19,753 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4241379310344828 [2024-06-20 19:24:19,753 INFO L175 Difference]: Start difference. First operand has 147 places, 126 transitions, 1313 flow. Second operand 10 states and 123 transitions. [2024-06-20 19:24:19,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 147 transitions, 1677 flow [2024-06-20 19:24:19,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 147 transitions, 1607 flow, removed 2 selfloop flow, removed 10 redundant places. [2024-06-20 19:24:19,784 INFO L231 Difference]: Finished difference. Result has 145 places, 123 transitions, 1271 flow [2024-06-20 19:24:19,784 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1243, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1271, PETRI_PLACES=145, PETRI_TRANSITIONS=123} [2024-06-20 19:24:19,785 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 117 predicate places. [2024-06-20 19:24:19,785 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 123 transitions, 1271 flow [2024-06-20 19:24:19,785 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-20 19:24:19,785 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:24:19,785 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:24:19,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-20 19:24:19,785 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-20 19:24:19,786 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:24:19,786 INFO L85 PathProgramCache]: Analyzing trace with hash 2073397221, now seen corresponding path program 6 times [2024-06-20 19:24:19,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:24:19,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947906313] [2024-06-20 19:24:19,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:24:19,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:24:19,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:24:24,653 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-20 19:24:24,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:24:24,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947906313] [2024-06-20 19:24:24,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947906313] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:24:24,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:24:24,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:24:24,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871594672] [2024-06-20 19:24:24,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:24:24,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:24:24,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:24:24,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:24:24,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:24:24,797 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-06-20 19:24:24,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 123 transitions, 1271 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-20 19:24:24,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:24:24,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-06-20 19:24:24,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:24:25,178 INFO L124 PetriNetUnfolderBase]: 380/728 cut-off events. [2024-06-20 19:24:25,178 INFO L125 PetriNetUnfolderBase]: For 16109/16109 co-relation queries the response was YES. [2024-06-20 19:24:25,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3962 conditions, 728 events. 380/728 cut-off events. For 16109/16109 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3544 event pairs, 92 based on Foata normal form. 8/736 useless extension candidates. Maximal degree in co-relation 3898. Up to 531 conditions per place. [2024-06-20 19:24:25,183 INFO L140 encePairwiseOnDemand]: 18/29 looper letters, 93 selfloop transitions, 35 changer transitions 13/143 dead transitions. [2024-06-20 19:24:25,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 143 transitions, 1617 flow [2024-06-20 19:24:25,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:24:25,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:24:25,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 122 transitions. [2024-06-20 19:24:25,184 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4206896551724138 [2024-06-20 19:24:25,184 INFO L175 Difference]: Start difference. First operand has 145 places, 123 transitions, 1271 flow. Second operand 10 states and 122 transitions. [2024-06-20 19:24:25,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 143 transitions, 1617 flow [2024-06-20 19:24:25,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 143 transitions, 1549 flow, removed 3 selfloop flow, removed 9 redundant places. [2024-06-20 19:24:25,210 INFO L231 Difference]: Finished difference. Result has 143 places, 118 transitions, 1211 flow [2024-06-20 19:24:25,210 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1203, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1211, PETRI_PLACES=143, PETRI_TRANSITIONS=118} [2024-06-20 19:24:25,211 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 115 predicate places. [2024-06-20 19:24:25,211 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 118 transitions, 1211 flow [2024-06-20 19:24:25,211 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-20 19:24:25,211 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:24:25,211 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:24:25,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-20 19:24:25,211 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-20 19:24:25,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:24:25,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1857812125, now seen corresponding path program 7 times [2024-06-20 19:24:25,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:24:25,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404578628] [2024-06-20 19:24:25,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:24:25,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:24:25,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:24:31,253 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-20 19:24:31,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:24:31,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404578628] [2024-06-20 19:24:31,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404578628] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:24:31,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:24:31,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:24:31,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745521628] [2024-06-20 19:24:31,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:24:31,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:24:31,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:24:31,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:24:31,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:24:31,344 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-06-20 19:24:31,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 118 transitions, 1211 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-20 19:24:31,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:24:31,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-06-20 19:24:31,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:24:31,708 INFO L124 PetriNetUnfolderBase]: 397/763 cut-off events. [2024-06-20 19:24:31,708 INFO L125 PetriNetUnfolderBase]: For 19210/19210 co-relation queries the response was YES. [2024-06-20 19:24:31,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4247 conditions, 763 events. 397/763 cut-off events. For 19210/19210 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3726 event pairs, 117 based on Foata normal form. 8/771 useless extension candidates. Maximal degree in co-relation 4184. Up to 387 conditions per place. [2024-06-20 19:24:31,713 INFO L140 encePairwiseOnDemand]: 20/29 looper letters, 81 selfloop transitions, 47 changer transitions 14/144 dead transitions. [2024-06-20 19:24:31,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 144 transitions, 1651 flow [2024-06-20 19:24:31,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:24:31,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:24:31,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 112 transitions. [2024-06-20 19:24:31,713 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42911877394636017 [2024-06-20 19:24:31,714 INFO L175 Difference]: Start difference. First operand has 143 places, 118 transitions, 1211 flow. Second operand 9 states and 112 transitions. [2024-06-20 19:24:31,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 144 transitions, 1651 flow [2024-06-20 19:24:31,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 144 transitions, 1561 flow, removed 6 selfloop flow, removed 10 redundant places. [2024-06-20 19:24:31,741 INFO L231 Difference]: Finished difference. Result has 140 places, 118 transitions, 1264 flow [2024-06-20 19:24:31,741 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1123, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1264, PETRI_PLACES=140, PETRI_TRANSITIONS=118} [2024-06-20 19:24:31,741 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 112 predicate places. [2024-06-20 19:24:31,741 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 118 transitions, 1264 flow [2024-06-20 19:24:31,742 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-20 19:24:31,742 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:24:31,742 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:24:31,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-20 19:24:31,745 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-20 19:24:31,745 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:24:31,745 INFO L85 PathProgramCache]: Analyzing trace with hash 241347249, now seen corresponding path program 8 times [2024-06-20 19:24:31,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:24:31,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713778209] [2024-06-20 19:24:31,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:24:31,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:24:31,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:24:37,426 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-20 19:24:37,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:24:37,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713778209] [2024-06-20 19:24:37,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713778209] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:24:37,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:24:37,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:24:37,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033815190] [2024-06-20 19:24:37,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:24:37,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:24:37,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:24:37,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:24:37,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:24:37,507 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-06-20 19:24:37,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 118 transitions, 1264 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-20 19:24:37,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:24:37,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-06-20 19:24:37,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:24:37,886 INFO L124 PetriNetUnfolderBase]: 448/862 cut-off events. [2024-06-20 19:24:37,887 INFO L125 PetriNetUnfolderBase]: For 24722/24722 co-relation queries the response was YES. [2024-06-20 19:24:37,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4975 conditions, 862 events. 448/862 cut-off events. For 24722/24722 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4379 event pairs, 133 based on Foata normal form. 8/870 useless extension candidates. Maximal degree in co-relation 4912. Up to 291 conditions per place. [2024-06-20 19:24:37,892 INFO L140 encePairwiseOnDemand]: 20/29 looper letters, 88 selfloop transitions, 52 changer transitions 12/154 dead transitions. [2024-06-20 19:24:37,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 154 transitions, 1825 flow [2024-06-20 19:24:37,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:24:37,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:24:37,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 121 transitions. [2024-06-20 19:24:37,893 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46360153256704983 [2024-06-20 19:24:37,893 INFO L175 Difference]: Start difference. First operand has 140 places, 118 transitions, 1264 flow. Second operand 9 states and 121 transitions. [2024-06-20 19:24:37,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 154 transitions, 1825 flow [2024-06-20 19:24:37,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 154 transitions, 1754 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-20 19:24:37,925 INFO L231 Difference]: Finished difference. Result has 141 places, 121 transitions, 1358 flow [2024-06-20 19:24:37,925 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1203, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1358, PETRI_PLACES=141, PETRI_TRANSITIONS=121} [2024-06-20 19:24:37,926 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 113 predicate places. [2024-06-20 19:24:37,926 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 121 transitions, 1358 flow [2024-06-20 19:24:37,926 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-20 19:24:37,926 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:24:37,926 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:24:37,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-20 19:24:37,927 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-20 19:24:37,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:24:37,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1073496369, now seen corresponding path program 9 times [2024-06-20 19:24:37,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:24:37,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585555995] [2024-06-20 19:24:37,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:24:37,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:24:37,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:24:44,016 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-20 19:24:44,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:24:44,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585555995] [2024-06-20 19:24:44,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585555995] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:24:44,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:24:44,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:24:44,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952089831] [2024-06-20 19:24:44,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:24:44,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:24:44,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:24:44,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:24:44,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:24:44,204 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-06-20 19:24:44,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 121 transitions, 1358 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-20 19:24:44,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:24:44,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-06-20 19:24:44,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:24:44,625 INFO L124 PetriNetUnfolderBase]: 451/873 cut-off events. [2024-06-20 19:24:44,626 INFO L125 PetriNetUnfolderBase]: For 27323/27323 co-relation queries the response was YES. [2024-06-20 19:24:44,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5258 conditions, 873 events. 451/873 cut-off events. For 27323/27323 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 4472 event pairs, 133 based on Foata normal form. 8/881 useless extension candidates. Maximal degree in co-relation 5195. Up to 442 conditions per place. [2024-06-20 19:24:44,632 INFO L140 encePairwiseOnDemand]: 19/29 looper letters, 80 selfloop transitions, 58 changer transitions 8/148 dead transitions. [2024-06-20 19:24:44,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 148 transitions, 1824 flow [2024-06-20 19:24:44,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:24:44,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:24:44,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 121 transitions. [2024-06-20 19:24:44,633 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46360153256704983 [2024-06-20 19:24:44,633 INFO L175 Difference]: Start difference. First operand has 141 places, 121 transitions, 1358 flow. Second operand 9 states and 121 transitions. [2024-06-20 19:24:44,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 148 transitions, 1824 flow [2024-06-20 19:24:44,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 148 transitions, 1712 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-06-20 19:24:44,667 INFO L231 Difference]: Finished difference. Result has 142 places, 121 transitions, 1392 flow [2024-06-20 19:24:44,667 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1248, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1392, PETRI_PLACES=142, PETRI_TRANSITIONS=121} [2024-06-20 19:24:44,667 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 114 predicate places. [2024-06-20 19:24:44,667 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 121 transitions, 1392 flow [2024-06-20 19:24:44,667 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-20 19:24:44,668 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:24:44,668 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:24:44,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-20 19:24:44,668 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-20 19:24:44,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:24:44,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1046688189, now seen corresponding path program 10 times [2024-06-20 19:24:44,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:24:44,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125273912] [2024-06-20 19:24:44,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:24:44,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:24:44,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:24:50,054 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-20 19:24:50,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:24:50,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125273912] [2024-06-20 19:24:50,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125273912] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:24:50,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:24:50,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:24:50,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461355504] [2024-06-20 19:24:50,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:24:50,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:24:50,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:24:50,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:24:50,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:24:50,178 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-06-20 19:24:50,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 121 transitions, 1392 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-20 19:24:50,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:24:50,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-06-20 19:24:50,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:24:50,628 INFO L124 PetriNetUnfolderBase]: 420/812 cut-off events. [2024-06-20 19:24:50,629 INFO L125 PetriNetUnfolderBase]: For 23745/23745 co-relation queries the response was YES. [2024-06-20 19:24:50,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4874 conditions, 812 events. 420/812 cut-off events. For 23745/23745 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4058 event pairs, 108 based on Foata normal form. 10/822 useless extension candidates. Maximal degree in co-relation 4813. Up to 498 conditions per place. [2024-06-20 19:24:50,633 INFO L140 encePairwiseOnDemand]: 19/29 looper letters, 65 selfloop transitions, 58 changer transitions 19/144 dead transitions. [2024-06-20 19:24:50,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 144 transitions, 1761 flow [2024-06-20 19:24:50,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:24:50,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:24:50,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 121 transitions. [2024-06-20 19:24:50,638 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41724137931034483 [2024-06-20 19:24:50,638 INFO L175 Difference]: Start difference. First operand has 142 places, 121 transitions, 1392 flow. Second operand 10 states and 121 transitions. [2024-06-20 19:24:50,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 144 transitions, 1761 flow [2024-06-20 19:24:50,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 144 transitions, 1645 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-06-20 19:24:50,667 INFO L231 Difference]: Finished difference. Result has 144 places, 116 transitions, 1332 flow [2024-06-20 19:24:50,668 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1276, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1332, PETRI_PLACES=144, PETRI_TRANSITIONS=116} [2024-06-20 19:24:50,668 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 116 predicate places. [2024-06-20 19:24:50,668 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 116 transitions, 1332 flow [2024-06-20 19:24:50,668 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-20 19:24:50,668 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:24:50,668 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:24:50,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-20 19:24:50,669 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-20 19:24:50,670 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:24:50,670 INFO L85 PathProgramCache]: Analyzing trace with hash 401527353, now seen corresponding path program 11 times [2024-06-20 19:24:50,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:24:50,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547384008] [2024-06-20 19:24:50,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:24:50,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:24:50,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:24:55,204 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-20 19:24:55,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:24:55,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547384008] [2024-06-20 19:24:55,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547384008] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:24:55,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:24:55,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:24:55,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937289887] [2024-06-20 19:24:55,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:24:55,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:24:55,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:24:55,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:24:55,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:24:55,383 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-06-20 19:24:55,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 116 transitions, 1332 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-20 19:24:55,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:24:55,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-06-20 19:24:55,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:24:55,845 INFO L124 PetriNetUnfolderBase]: 404/775 cut-off events. [2024-06-20 19:24:55,845 INFO L125 PetriNetUnfolderBase]: For 22623/22623 co-relation queries the response was YES. [2024-06-20 19:24:55,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4718 conditions, 775 events. 404/775 cut-off events. For 22623/22623 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3836 event pairs, 93 based on Foata normal form. 8/783 useless extension candidates. Maximal degree in co-relation 4657. Up to 504 conditions per place. [2024-06-20 19:24:55,850 INFO L140 encePairwiseOnDemand]: 18/29 looper letters, 102 selfloop transitions, 33 changer transitions 8/145 dead transitions. [2024-06-20 19:24:55,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 145 transitions, 1786 flow [2024-06-20 19:24:55,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:24:55,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:24:55,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2024-06-20 19:24:55,851 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44482758620689655 [2024-06-20 19:24:55,851 INFO L175 Difference]: Start difference. First operand has 144 places, 116 transitions, 1332 flow. Second operand 10 states and 129 transitions. [2024-06-20 19:24:55,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 145 transitions, 1786 flow [2024-06-20 19:24:55,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 145 transitions, 1590 flow, removed 3 selfloop flow, removed 13 redundant places. [2024-06-20 19:24:55,879 INFO L231 Difference]: Finished difference. Result has 138 places, 115 transitions, 1194 flow [2024-06-20 19:24:55,880 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1138, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1194, PETRI_PLACES=138, PETRI_TRANSITIONS=115} [2024-06-20 19:24:55,880 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 110 predicate places. [2024-06-20 19:24:55,880 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 115 transitions, 1194 flow [2024-06-20 19:24:55,880 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-20 19:24:55,880 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:24:55,880 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:24:55,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-20 19:24:55,880 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-20 19:24:55,880 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:24:55,880 INFO L85 PathProgramCache]: Analyzing trace with hash 401531073, now seen corresponding path program 12 times [2024-06-20 19:24:55,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:24:55,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978713691] [2024-06-20 19:24:55,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:24:55,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:24:55,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:25:00,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:25:00,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:25:00,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978713691] [2024-06-20 19:25:00,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978713691] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:25:00,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:25:00,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:25:00,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075779961] [2024-06-20 19:25:00,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:25:00,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:25:00,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:25:00,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:25:00,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:25:00,729 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-06-20 19:25:00,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 115 transitions, 1194 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-20 19:25:00,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:25:00,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-06-20 19:25:00,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:25:01,113 INFO L124 PetriNetUnfolderBase]: 398/763 cut-off events. [2024-06-20 19:25:01,113 INFO L125 PetriNetUnfolderBase]: For 22928/22928 co-relation queries the response was YES. [2024-06-20 19:25:01,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4446 conditions, 763 events. 398/763 cut-off events. For 22928/22928 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3766 event pairs, 97 based on Foata normal form. 10/773 useless extension candidates. Maximal degree in co-relation 4389. Up to 575 conditions per place. [2024-06-20 19:25:01,117 INFO L140 encePairwiseOnDemand]: 18/29 looper letters, 94 selfloop transitions, 31 changer transitions 11/138 dead transitions. [2024-06-20 19:25:01,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 138 transitions, 1550 flow [2024-06-20 19:25:01,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:25:01,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:25:01,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2024-06-20 19:25:01,118 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43103448275862066 [2024-06-20 19:25:01,118 INFO L175 Difference]: Start difference. First operand has 138 places, 115 transitions, 1194 flow. Second operand 10 states and 125 transitions. [2024-06-20 19:25:01,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 138 transitions, 1550 flow [2024-06-20 19:25:01,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 138 transitions, 1467 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-20 19:25:01,141 INFO L231 Difference]: Finished difference. Result has 137 places, 112 transitions, 1136 flow [2024-06-20 19:25:01,141 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1111, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1136, PETRI_PLACES=137, PETRI_TRANSITIONS=112} [2024-06-20 19:25:01,141 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 109 predicate places. [2024-06-20 19:25:01,142 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 112 transitions, 1136 flow [2024-06-20 19:25:01,142 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-20 19:25:01,142 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:25:01,142 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:25:01,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-20 19:25:01,142 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-20 19:25:01,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:25:01,142 INFO L85 PathProgramCache]: Analyzing trace with hash 407245365, now seen corresponding path program 1 times [2024-06-20 19:25:01,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:25:01,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743093640] [2024-06-20 19:25:01,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:25:01,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:25:01,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:25:06,303 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-20 19:25:06,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:25:06,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743093640] [2024-06-20 19:25:06,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743093640] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:25:06,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:25:06,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:25:06,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445674865] [2024-06-20 19:25:06,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:25:06,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:25:06,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:25:06,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:25:06,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:25:06,406 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-06-20 19:25:06,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 112 transitions, 1136 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-20 19:25:06,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:25:06,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-06-20 19:25:06,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:25:06,758 INFO L124 PetriNetUnfolderBase]: 378/724 cut-off events. [2024-06-20 19:25:06,758 INFO L125 PetriNetUnfolderBase]: For 19552/19552 co-relation queries the response was YES. [2024-06-20 19:25:06,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4287 conditions, 724 events. 378/724 cut-off events. For 19552/19552 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3506 event pairs, 92 based on Foata normal form. 2/726 useless extension candidates. Maximal degree in co-relation 4232. Up to 601 conditions per place. [2024-06-20 19:25:06,763 INFO L140 encePairwiseOnDemand]: 20/29 looper letters, 98 selfloop transitions, 27 changer transitions 0/127 dead transitions. [2024-06-20 19:25:06,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 127 transitions, 1436 flow [2024-06-20 19:25:06,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:25:06,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:25:06,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2024-06-20 19:25:06,764 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4061302681992337 [2024-06-20 19:25:06,764 INFO L175 Difference]: Start difference. First operand has 137 places, 112 transitions, 1136 flow. Second operand 9 states and 106 transitions. [2024-06-20 19:25:06,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 127 transitions, 1436 flow [2024-06-20 19:25:06,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 127 transitions, 1368 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-06-20 19:25:06,788 INFO L231 Difference]: Finished difference. Result has 135 places, 113 transitions, 1138 flow [2024-06-20 19:25:06,789 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1068, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1138, PETRI_PLACES=135, PETRI_TRANSITIONS=113} [2024-06-20 19:25:06,789 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 107 predicate places. [2024-06-20 19:25:06,789 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 113 transitions, 1138 flow [2024-06-20 19:25:06,789 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-20 19:25:06,789 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:25:06,789 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:25:06,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-20 19:25:06,789 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-20 19:25:06,789 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:25:06,790 INFO L85 PathProgramCache]: Analyzing trace with hash 407037603, now seen corresponding path program 13 times [2024-06-20 19:25:06,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:25:06,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678240589] [2024-06-20 19:25:06,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:25:06,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:25:06,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:25:11,713 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-20 19:25:11,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:25:11,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678240589] [2024-06-20 19:25:11,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678240589] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:25:11,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:25:11,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:25:11,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177083630] [2024-06-20 19:25:11,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:25:11,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:25:11,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:25:11,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:25:11,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:25:11,816 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-06-20 19:25:11,816 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 113 transitions, 1138 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-20 19:25:11,816 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:25:11,816 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-06-20 19:25:11,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:25:12,221 INFO L124 PetriNetUnfolderBase]: 394/759 cut-off events. [2024-06-20 19:25:12,221 INFO L125 PetriNetUnfolderBase]: For 22757/22757 co-relation queries the response was YES. [2024-06-20 19:25:12,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4399 conditions, 759 events. 394/759 cut-off events. For 22757/22757 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3770 event pairs, 98 based on Foata normal form. 10/769 useless extension candidates. Maximal degree in co-relation 4344. Up to 593 conditions per place. [2024-06-20 19:25:12,225 INFO L140 encePairwiseOnDemand]: 19/29 looper letters, 95 selfloop transitions, 25 changer transitions 11/133 dead transitions. [2024-06-20 19:25:12,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 133 transitions, 1472 flow [2024-06-20 19:25:12,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:25:12,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:25:12,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 119 transitions. [2024-06-20 19:25:12,226 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4103448275862069 [2024-06-20 19:25:12,226 INFO L175 Difference]: Start difference. First operand has 135 places, 113 transitions, 1138 flow. Second operand 10 states and 119 transitions. [2024-06-20 19:25:12,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 133 transitions, 1472 flow [2024-06-20 19:25:12,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 133 transitions, 1412 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-20 19:25:12,255 INFO L231 Difference]: Finished difference. Result has 138 places, 110 transitions, 1087 flow [2024-06-20 19:25:12,255 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1078, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1087, PETRI_PLACES=138, PETRI_TRANSITIONS=110} [2024-06-20 19:25:12,255 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 110 predicate places. [2024-06-20 19:25:12,255 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 110 transitions, 1087 flow [2024-06-20 19:25:12,256 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-20 19:25:12,256 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:25:12,256 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:25:12,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-20 19:25:12,256 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-20 19:25:12,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:25:12,256 INFO L85 PathProgramCache]: Analyzing trace with hash 401681175, now seen corresponding path program 2 times [2024-06-20 19:25:12,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:25:12,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804932905] [2024-06-20 19:25:12,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:25:12,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:25:12,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:25:17,786 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-20 19:25:17,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:25:17,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804932905] [2024-06-20 19:25:17,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804932905] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:25:17,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:25:17,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:25:17,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616441665] [2024-06-20 19:25:17,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:25:17,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:25:17,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:25:17,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:25:17,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:25:17,903 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-06-20 19:25:17,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 110 transitions, 1087 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-20 19:25:17,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:25:17,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-06-20 19:25:17,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:25:18,255 INFO L124 PetriNetUnfolderBase]: 372/717 cut-off events. [2024-06-20 19:25:18,255 INFO L125 PetriNetUnfolderBase]: For 20776/20776 co-relation queries the response was YES. [2024-06-20 19:25:18,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4240 conditions, 717 events. 372/717 cut-off events. For 20776/20776 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3491 event pairs, 99 based on Foata normal form. 2/719 useless extension candidates. Maximal degree in co-relation 4184. Up to 595 conditions per place. [2024-06-20 19:25:18,260 INFO L140 encePairwiseOnDemand]: 20/29 looper letters, 98 selfloop transitions, 27 changer transitions 0/127 dead transitions. [2024-06-20 19:25:18,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 127 transitions, 1397 flow [2024-06-20 19:25:18,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:25:18,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:25:18,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2024-06-20 19:25:18,261 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41762452107279696 [2024-06-20 19:25:18,261 INFO L175 Difference]: Start difference. First operand has 138 places, 110 transitions, 1087 flow. Second operand 9 states and 109 transitions. [2024-06-20 19:25:18,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 127 transitions, 1397 flow [2024-06-20 19:25:18,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 127 transitions, 1341 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-06-20 19:25:18,289 INFO L231 Difference]: Finished difference. Result has 136 places, 111 transitions, 1103 flow [2024-06-20 19:25:18,289 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1031, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1103, PETRI_PLACES=136, PETRI_TRANSITIONS=111} [2024-06-20 19:25:18,289 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 108 predicate places. [2024-06-20 19:25:18,289 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 111 transitions, 1103 flow [2024-06-20 19:25:18,289 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-20 19:25:18,289 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:25:18,290 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:25:18,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-20 19:25:18,290 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-20 19:25:18,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:25:18,290 INFO L85 PathProgramCache]: Analyzing trace with hash 407252805, now seen corresponding path program 3 times [2024-06-20 19:25:18,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:25:18,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436969912] [2024-06-20 19:25:18,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:25:18,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:25:18,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:25:24,130 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-20 19:25:24,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:25:24,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436969912] [2024-06-20 19:25:24,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436969912] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:25:24,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:25:24,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:25:24,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358063193] [2024-06-20 19:25:24,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:25:24,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:25:24,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:25:24,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:25:24,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:25:24,249 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-06-20 19:25:24,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 111 transitions, 1103 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-20 19:25:24,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:25:24,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-06-20 19:25:24,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:25:24,673 INFO L124 PetriNetUnfolderBase]: 377/733 cut-off events. [2024-06-20 19:25:24,673 INFO L125 PetriNetUnfolderBase]: For 22227/22227 co-relation queries the response was YES. [2024-06-20 19:25:24,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4234 conditions, 733 events. 377/733 cut-off events. For 22227/22227 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3613 event pairs, 93 based on Foata normal form. 8/741 useless extension candidates. Maximal degree in co-relation 4178. Up to 452 conditions per place. [2024-06-20 19:25:24,677 INFO L140 encePairwiseOnDemand]: 19/29 looper letters, 101 selfloop transitions, 25 changer transitions 7/135 dead transitions. [2024-06-20 19:25:24,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 135 transitions, 1525 flow [2024-06-20 19:25:24,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:25:24,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:25:24,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 123 transitions. [2024-06-20 19:25:24,678 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4241379310344828 [2024-06-20 19:25:24,678 INFO L175 Difference]: Start difference. First operand has 136 places, 111 transitions, 1103 flow. Second operand 10 states and 123 transitions. [2024-06-20 19:25:24,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 135 transitions, 1525 flow [2024-06-20 19:25:24,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 135 transitions, 1463 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-20 19:25:24,705 INFO L231 Difference]: Finished difference. Result has 139 places, 109 transitions, 1072 flow [2024-06-20 19:25:24,705 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1041, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1072, PETRI_PLACES=139, PETRI_TRANSITIONS=109} [2024-06-20 19:25:24,706 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 111 predicate places. [2024-06-20 19:25:24,706 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 109 transitions, 1072 flow [2024-06-20 19:25:24,706 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-20 19:25:24,706 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:25:24,706 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:25:24,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-20 19:25:24,707 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-20 19:25:24,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:25:24,707 INFO L85 PathProgramCache]: Analyzing trace with hash 401675223, now seen corresponding path program 14 times [2024-06-20 19:25:24,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:25:24,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043287199] [2024-06-20 19:25:24,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:25:24,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:25:24,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:25:29,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-20 19:25:29,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:25:29,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043287199] [2024-06-20 19:25:29,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043287199] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:25:29,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:25:29,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:25:29,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248141432] [2024-06-20 19:25:29,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:25:29,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:25:29,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:25:29,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:25:29,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:25:29,963 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-06-20 19:25:29,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 109 transitions, 1072 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-20 19:25:29,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:25:29,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-06-20 19:25:29,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:25:30,384 INFO L124 PetriNetUnfolderBase]: 346/671 cut-off events. [2024-06-20 19:25:30,384 INFO L125 PetriNetUnfolderBase]: For 20053/20053 co-relation queries the response was YES. [2024-06-20 19:25:30,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3737 conditions, 671 events. 346/671 cut-off events. For 20053/20053 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3216 event pairs, 81 based on Foata normal form. 10/681 useless extension candidates. Maximal degree in co-relation 3680. Up to 505 conditions per place. [2024-06-20 19:25:30,388 INFO L140 encePairwiseOnDemand]: 19/29 looper letters, 94 selfloop transitions, 24 changer transitions 11/131 dead transitions. [2024-06-20 19:25:30,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 131 transitions, 1410 flow [2024-06-20 19:25:30,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:25:30,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:25:30,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 121 transitions. [2024-06-20 19:25:30,390 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41724137931034483 [2024-06-20 19:25:30,390 INFO L175 Difference]: Start difference. First operand has 139 places, 109 transitions, 1072 flow. Second operand 10 states and 121 transitions. [2024-06-20 19:25:30,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 131 transitions, 1410 flow [2024-06-20 19:25:30,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 131 transitions, 1360 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-20 19:25:30,417 INFO L231 Difference]: Finished difference. Result has 138 places, 106 transitions, 1028 flow [2024-06-20 19:25:30,417 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1022, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1028, PETRI_PLACES=138, PETRI_TRANSITIONS=106} [2024-06-20 19:25:30,417 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 110 predicate places. [2024-06-20 19:25:30,418 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 106 transitions, 1028 flow [2024-06-20 19:25:30,418 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-20 19:25:30,418 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:25:30,418 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:25:30,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-20 19:25:30,418 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-20 19:25:30,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:25:30,418 INFO L85 PathProgramCache]: Analyzing trace with hash 531356525, now seen corresponding path program 15 times [2024-06-20 19:25:30,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:25:30,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417475535] [2024-06-20 19:25:30,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:25:30,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:25:30,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:25:34,978 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-20 19:25:34,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:25:34,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417475535] [2024-06-20 19:25:34,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417475535] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:25:34,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:25:34,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:25:34,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598525817] [2024-06-20 19:25:34,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:25:34,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:25:34,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:25:34,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:25:34,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:25:35,097 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-06-20 19:25:35,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 106 transitions, 1028 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-20 19:25:35,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:25:35,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-06-20 19:25:35,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:25:35,421 INFO L124 PetriNetUnfolderBase]: 347/682 cut-off events. [2024-06-20 19:25:35,421 INFO L125 PetriNetUnfolderBase]: For 21856/21856 co-relation queries the response was YES. [2024-06-20 19:25:35,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3867 conditions, 682 events. 347/682 cut-off events. For 21856/21856 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3293 event pairs, 93 based on Foata normal form. 8/690 useless extension candidates. Maximal degree in co-relation 3811. Up to 214 conditions per place. [2024-06-20 19:25:35,425 INFO L140 encePairwiseOnDemand]: 20/29 looper letters, 67 selfloop transitions, 48 changer transitions 10/127 dead transitions. [2024-06-20 19:25:35,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 127 transitions, 1410 flow [2024-06-20 19:25:35,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:25:35,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:25:35,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 110 transitions. [2024-06-20 19:25:35,426 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.421455938697318 [2024-06-20 19:25:35,426 INFO L175 Difference]: Start difference. First operand has 138 places, 106 transitions, 1028 flow. Second operand 9 states and 110 transitions. [2024-06-20 19:25:35,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 127 transitions, 1410 flow [2024-06-20 19:25:35,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 127 transitions, 1354 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-20 19:25:35,451 INFO L231 Difference]: Finished difference. Result has 135 places, 104 transitions, 1062 flow [2024-06-20 19:25:35,451 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=974, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1062, PETRI_PLACES=135, PETRI_TRANSITIONS=104} [2024-06-20 19:25:35,451 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 107 predicate places. [2024-06-20 19:25:35,451 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 104 transitions, 1062 flow [2024-06-20 19:25:35,452 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-20 19:25:35,452 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:25:35,452 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:25:35,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-20 19:25:35,452 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:25:35,452 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:25:35,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1925372085, now seen corresponding path program 16 times [2024-06-20 19:25:35,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:25:35,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937224708] [2024-06-20 19:25:35,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:25:35,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:25:35,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:25:40,095 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-20 19:25:40,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:25:40,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937224708] [2024-06-20 19:25:40,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937224708] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:25:40,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:25:40,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:25:40,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412620296] [2024-06-20 19:25:40,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:25:40,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:25:40,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:25:40,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:25:40,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:25:40,199 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-06-20 19:25:40,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 104 transitions, 1062 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-20 19:25:40,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:25:40,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-06-20 19:25:40,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:25:40,562 INFO L124 PetriNetUnfolderBase]: 368/729 cut-off events. [2024-06-20 19:25:40,562 INFO L125 PetriNetUnfolderBase]: For 26772/26772 co-relation queries the response was YES. [2024-06-20 19:25:40,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4373 conditions, 729 events. 368/729 cut-off events. For 26772/26772 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3641 event pairs, 100 based on Foata normal form. 8/737 useless extension candidates. Maximal degree in co-relation 4317. Up to 380 conditions per place. [2024-06-20 19:25:40,566 INFO L140 encePairwiseOnDemand]: 20/29 looper letters, 79 selfloop transitions, 38 changer transitions 8/127 dead transitions. [2024-06-20 19:25:40,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 127 transitions, 1462 flow [2024-06-20 19:25:40,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:25:40,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:25:40,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 112 transitions. [2024-06-20 19:25:40,567 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42911877394636017 [2024-06-20 19:25:40,567 INFO L175 Difference]: Start difference. First operand has 135 places, 104 transitions, 1062 flow. Second operand 9 states and 112 transitions. [2024-06-20 19:25:40,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 127 transitions, 1462 flow [2024-06-20 19:25:40,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 127 transitions, 1379 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-20 19:25:40,591 INFO L231 Difference]: Finished difference. Result has 134 places, 102 transitions, 1046 flow [2024-06-20 19:25:40,591 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=983, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1046, PETRI_PLACES=134, PETRI_TRANSITIONS=102} [2024-06-20 19:25:40,592 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 106 predicate places. [2024-06-20 19:25:40,592 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 102 transitions, 1046 flow [2024-06-20 19:25:40,592 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-20 19:25:40,592 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:25:40,592 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:25:40,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-20 19:25:40,592 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:25:40,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:25:40,593 INFO L85 PathProgramCache]: Analyzing trace with hash -667368629, now seen corresponding path program 17 times [2024-06-20 19:25:40,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:25:40,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712433003] [2024-06-20 19:25:40,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:25:40,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:25:40,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:25:44,956 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-20 19:25:44,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:25:44,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712433003] [2024-06-20 19:25:44,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712433003] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:25:44,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:25:44,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:25:44,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368194794] [2024-06-20 19:25:44,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:25:44,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:25:44,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:25:44,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:25:44,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:25:45,073 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-06-20 19:25:45,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 102 transitions, 1046 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-20 19:25:45,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:25:45,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-06-20 19:25:45,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:25:45,377 INFO L124 PetriNetUnfolderBase]: 341/676 cut-off events. [2024-06-20 19:25:45,377 INFO L125 PetriNetUnfolderBase]: For 21630/21630 co-relation queries the response was YES. [2024-06-20 19:25:45,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4019 conditions, 676 events. 341/676 cut-off events. For 21630/21630 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3296 event pairs, 91 based on Foata normal form. 6/682 useless extension candidates. Maximal degree in co-relation 3964. Up to 399 conditions per place. [2024-06-20 19:25:45,380 INFO L140 encePairwiseOnDemand]: 20/29 looper letters, 61 selfloop transitions, 56 changer transitions 1/120 dead transitions. [2024-06-20 19:25:45,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 120 transitions, 1348 flow [2024-06-20 19:25:45,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:25:45,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:25:45,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2024-06-20 19:25:45,381 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41379310344827586 [2024-06-20 19:25:45,381 INFO L175 Difference]: Start difference. First operand has 134 places, 102 transitions, 1046 flow. Second operand 9 states and 108 transitions. [2024-06-20 19:25:45,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 120 transitions, 1348 flow [2024-06-20 19:25:45,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 120 transitions, 1272 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-20 19:25:45,406 INFO L231 Difference]: Finished difference. Result has 133 places, 104 transitions, 1116 flow [2024-06-20 19:25:45,406 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=970, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1116, PETRI_PLACES=133, PETRI_TRANSITIONS=104} [2024-06-20 19:25:45,406 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 105 predicate places. [2024-06-20 19:25:45,406 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 104 transitions, 1116 flow [2024-06-20 19:25:45,406 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-20 19:25:45,406 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:25:45,406 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:25:45,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-20 19:25:45,407 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:25:45,407 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:25:45,407 INFO L85 PathProgramCache]: Analyzing trace with hash -239399021, now seen corresponding path program 18 times [2024-06-20 19:25:45,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:25:45,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222558217] [2024-06-20 19:25:45,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:25:45,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:25:45,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:25:50,191 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-20 19:25:50,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:25:50,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222558217] [2024-06-20 19:25:50,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222558217] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:25:50,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:25:50,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:25:50,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077418496] [2024-06-20 19:25:50,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:25:50,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:25:50,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:25:50,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:25:50,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:25:50,288 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2024-06-20 19:25:50,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 104 transitions, 1116 flow. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:25:50,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:25:50,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2024-06-20 19:25:50,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:25:50,619 INFO L124 PetriNetUnfolderBase]: 357/712 cut-off events. [2024-06-20 19:25:50,619 INFO L125 PetriNetUnfolderBase]: For 21705/21705 co-relation queries the response was YES. [2024-06-20 19:25:50,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4200 conditions, 712 events. 357/712 cut-off events. For 21705/21705 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3560 event pairs, 105 based on Foata normal form. 10/722 useless extension candidates. Maximal degree in co-relation 4146. Up to 529 conditions per place. [2024-06-20 19:25:50,623 INFO L140 encePairwiseOnDemand]: 18/29 looper letters, 77 selfloop transitions, 31 changer transitions 11/121 dead transitions. [2024-06-20 19:25:50,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 121 transitions, 1420 flow [2024-06-20 19:25:50,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:25:50,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:25:50,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2024-06-20 19:25:50,624 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4482758620689655 [2024-06-20 19:25:50,624 INFO L175 Difference]: Start difference. First operand has 133 places, 104 transitions, 1116 flow. Second operand 9 states and 117 transitions. [2024-06-20 19:25:50,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 121 transitions, 1420 flow [2024-06-20 19:25:50,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 121 transitions, 1294 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-20 19:25:50,651 INFO L231 Difference]: Finished difference. Result has 135 places, 101 transitions, 1033 flow [2024-06-20 19:25:50,651 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=994, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1033, PETRI_PLACES=135, PETRI_TRANSITIONS=101} [2024-06-20 19:25:50,651 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 107 predicate places. [2024-06-20 19:25:50,651 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 101 transitions, 1033 flow [2024-06-20 19:25:50,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:25:50,652 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:25:50,652 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:25:50,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-20 19:25:50,652 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:25:50,652 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:25:50,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1838680275, now seen corresponding path program 19 times [2024-06-20 19:25:50,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:25:50,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122454096] [2024-06-20 19:25:50,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:25:50,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:25:50,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:25:55,255 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-20 19:25:55,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:25:55,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122454096] [2024-06-20 19:25:55,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122454096] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:25:55,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:25:55,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:25:55,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167814967] [2024-06-20 19:25:55,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:25:55,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:25:55,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:25:55,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:25:55,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:25:55,401 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-06-20 19:25:55,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 101 transitions, 1033 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-20 19:25:55,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:25:55,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-06-20 19:25:55,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:25:55,810 INFO L124 PetriNetUnfolderBase]: 372/749 cut-off events. [2024-06-20 19:25:55,810 INFO L125 PetriNetUnfolderBase]: For 25210/25210 co-relation queries the response was YES. [2024-06-20 19:25:55,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4442 conditions, 749 events. 372/749 cut-off events. For 25210/25210 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3840 event pairs, 115 based on Foata normal form. 8/757 useless extension candidates. Maximal degree in co-relation 4387. Up to 521 conditions per place. [2024-06-20 19:25:55,814 INFO L140 encePairwiseOnDemand]: 19/29 looper letters, 87 selfloop transitions, 27 changer transitions 7/123 dead transitions. [2024-06-20 19:25:55,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 123 transitions, 1417 flow [2024-06-20 19:25:55,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:25:55,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:25:55,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 112 transitions. [2024-06-20 19:25:55,815 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42911877394636017 [2024-06-20 19:25:55,815 INFO L175 Difference]: Start difference. First operand has 135 places, 101 transitions, 1033 flow. Second operand 9 states and 112 transitions. [2024-06-20 19:25:55,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 123 transitions, 1417 flow [2024-06-20 19:25:55,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 123 transitions, 1371 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-20 19:25:55,841 INFO L231 Difference]: Finished difference. Result has 134 places, 99 transitions, 1031 flow [2024-06-20 19:25:55,841 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=991, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1031, PETRI_PLACES=134, PETRI_TRANSITIONS=99} [2024-06-20 19:25:55,841 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 106 predicate places. [2024-06-20 19:25:55,841 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 99 transitions, 1031 flow [2024-06-20 19:25:55,841 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-20 19:25:55,841 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:25:55,841 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:25:55,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-20 19:25:55,841 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:25:55,842 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:25:55,842 INFO L85 PathProgramCache]: Analyzing trace with hash -239543171, now seen corresponding path program 20 times [2024-06-20 19:25:55,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:25:55,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320556649] [2024-06-20 19:25:55,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:25:55,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:25:55,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:26:00,080 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-20 19:26:00,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:26:00,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320556649] [2024-06-20 19:26:00,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320556649] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:26:00,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:26:00,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:26:00,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083268448] [2024-06-20 19:26:00,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:26:00,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:26:00,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:26:00,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:26:00,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:26:00,242 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-06-20 19:26:00,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 99 transitions, 1031 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-20 19:26:00,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:26:00,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-06-20 19:26:00,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:26:00,619 INFO L124 PetriNetUnfolderBase]: 341/688 cut-off events. [2024-06-20 19:26:00,619 INFO L125 PetriNetUnfolderBase]: For 20674/20674 co-relation queries the response was YES. [2024-06-20 19:26:00,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3942 conditions, 688 events. 341/688 cut-off events. For 20674/20674 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3431 event pairs, 106 based on Foata normal form. 10/698 useless extension candidates. Maximal degree in co-relation 3888. Up to 495 conditions per place. [2024-06-20 19:26:00,623 INFO L140 encePairwiseOnDemand]: 19/29 looper letters, 69 selfloop transitions, 32 changer transitions 13/116 dead transitions. [2024-06-20 19:26:00,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 116 transitions, 1321 flow [2024-06-20 19:26:00,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:26:00,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:26:00,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2024-06-20 19:26:00,624 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41379310344827586 [2024-06-20 19:26:00,624 INFO L175 Difference]: Start difference. First operand has 134 places, 99 transitions, 1031 flow. Second operand 9 states and 108 transitions. [2024-06-20 19:26:00,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 116 transitions, 1321 flow [2024-06-20 19:26:00,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 116 transitions, 1265 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-20 19:26:00,650 INFO L231 Difference]: Finished difference. Result has 133 places, 95 transitions, 1002 flow [2024-06-20 19:26:00,650 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=975, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1002, PETRI_PLACES=133, PETRI_TRANSITIONS=95} [2024-06-20 19:26:00,650 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 105 predicate places. [2024-06-20 19:26:00,650 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 95 transitions, 1002 flow [2024-06-20 19:26:00,650 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-20 19:26:00,650 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:26:00,650 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:26:00,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-20 19:26:00,651 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:26:00,651 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:26:00,651 INFO L85 PathProgramCache]: Analyzing trace with hash -101018741, now seen corresponding path program 21 times [2024-06-20 19:26:00,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:26:00,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285455722] [2024-06-20 19:26:00,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:26:00,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:26:00,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:26:05,312 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-20 19:26:05,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:26:05,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285455722] [2024-06-20 19:26:05,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285455722] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:26:05,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:26:05,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:26:05,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191136257] [2024-06-20 19:26:05,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:26:05,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:26:05,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:26:05,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:26:05,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:26:05,467 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-06-20 19:26:05,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 95 transitions, 1002 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-20 19:26:05,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:26:05,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-06-20 19:26:05,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:26:05,831 INFO L124 PetriNetUnfolderBase]: 328/665 cut-off events. [2024-06-20 19:26:05,831 INFO L125 PetriNetUnfolderBase]: For 18487/18487 co-relation queries the response was YES. [2024-06-20 19:26:05,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3809 conditions, 665 events. 328/665 cut-off events. For 18487/18487 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3282 event pairs, 90 based on Foata normal form. 8/673 useless extension candidates. Maximal degree in co-relation 3756. Up to 334 conditions per place. [2024-06-20 19:26:05,834 INFO L140 encePairwiseOnDemand]: 19/29 looper letters, 61 selfloop transitions, 49 changer transitions 8/120 dead transitions. [2024-06-20 19:26:05,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 120 transitions, 1383 flow [2024-06-20 19:26:05,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:26:05,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:26:05,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2024-06-20 19:26:05,837 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4482758620689655 [2024-06-20 19:26:05,837 INFO L175 Difference]: Start difference. First operand has 133 places, 95 transitions, 1002 flow. Second operand 9 states and 117 transitions. [2024-06-20 19:26:05,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 120 transitions, 1383 flow [2024-06-20 19:26:05,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 120 transitions, 1307 flow, removed 6 selfloop flow, removed 8 redundant places. [2024-06-20 19:26:05,859 INFO L231 Difference]: Finished difference. Result has 128 places, 93 transitions, 1012 flow [2024-06-20 19:26:05,859 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=932, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1012, PETRI_PLACES=128, PETRI_TRANSITIONS=93} [2024-06-20 19:26:05,860 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 100 predicate places. [2024-06-20 19:26:05,860 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 93 transitions, 1012 flow [2024-06-20 19:26:05,860 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-20 19:26:05,860 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:26:05,860 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:26:05,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-20 19:26:05,860 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:26:05,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:26:05,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1735349715, now seen corresponding path program 22 times [2024-06-20 19:26:05,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:26:05,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682433917] [2024-06-20 19:26:05,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:26:05,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:26:05,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:26:10,334 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-20 19:26:10,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:26:10,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682433917] [2024-06-20 19:26:10,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682433917] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:26:10,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:26:10,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:26:10,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389431379] [2024-06-20 19:26:10,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:26:10,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:26:10,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:26:10,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:26:10,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:26:10,464 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-06-20 19:26:10,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 93 transitions, 1012 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-20 19:26:10,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:26:10,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-06-20 19:26:10,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:26:10,830 INFO L124 PetriNetUnfolderBase]: 322/653 cut-off events. [2024-06-20 19:26:10,831 INFO L125 PetriNetUnfolderBase]: For 16617/16617 co-relation queries the response was YES. [2024-06-20 19:26:10,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3717 conditions, 653 events. 322/653 cut-off events. For 16617/16617 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3233 event pairs, 94 based on Foata normal form. 10/663 useless extension candidates. Maximal degree in co-relation 3666. Up to 415 conditions per place. [2024-06-20 19:26:10,834 INFO L140 encePairwiseOnDemand]: 19/29 looper letters, 54 selfloop transitions, 47 changer transitions 11/114 dead transitions. [2024-06-20 19:26:10,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 114 transitions, 1317 flow [2024-06-20 19:26:10,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:26:10,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:26:10,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 113 transitions. [2024-06-20 19:26:10,835 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4329501915708812 [2024-06-20 19:26:10,835 INFO L175 Difference]: Start difference. First operand has 128 places, 93 transitions, 1012 flow. Second operand 9 states and 113 transitions. [2024-06-20 19:26:10,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 114 transitions, 1317 flow [2024-06-20 19:26:10,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 114 transitions, 1225 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-20 19:26:10,853 INFO L231 Difference]: Finished difference. Result has 127 places, 90 transitions, 986 flow [2024-06-20 19:26:10,853 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=920, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=986, PETRI_PLACES=127, PETRI_TRANSITIONS=90} [2024-06-20 19:26:10,853 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 99 predicate places. [2024-06-20 19:26:10,853 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 90 transitions, 986 flow [2024-06-20 19:26:10,854 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-20 19:26:10,854 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:26:10,854 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:26:10,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-20 19:26:10,854 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:26:10,854 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:26:10,854 INFO L85 PathProgramCache]: Analyzing trace with hash -525115457, now seen corresponding path program 4 times [2024-06-20 19:26:10,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:26:10,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512063119] [2024-06-20 19:26:10,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:26:10,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:26:10,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:26:15,755 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-20 19:26:15,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:26:15,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512063119] [2024-06-20 19:26:15,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512063119] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:26:15,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:26:15,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:26:15,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084235656] [2024-06-20 19:26:15,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:26:15,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:26:15,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:26:15,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:26:15,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:26:15,873 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-06-20 19:26:15,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 90 transitions, 986 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-20 19:26:15,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:26:15,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-06-20 19:26:15,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:26:16,193 INFO L124 PetriNetUnfolderBase]: 302/613 cut-off events. [2024-06-20 19:26:16,193 INFO L125 PetriNetUnfolderBase]: For 13256/13256 co-relation queries the response was YES. [2024-06-20 19:26:16,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3564 conditions, 613 events. 302/613 cut-off events. For 13256/13256 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2970 event pairs, 90 based on Foata normal form. 2/615 useless extension candidates. Maximal degree in co-relation 3514. Up to 485 conditions per place. [2024-06-20 19:26:16,197 INFO L140 encePairwiseOnDemand]: 20/29 looper letters, 74 selfloop transitions, 30 changer transitions 0/106 dead transitions. [2024-06-20 19:26:16,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 106 transitions, 1257 flow [2024-06-20 19:26:16,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:26:16,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:26:16,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 97 transitions. [2024-06-20 19:26:16,198 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41810344827586204 [2024-06-20 19:26:16,198 INFO L175 Difference]: Start difference. First operand has 127 places, 90 transitions, 986 flow. Second operand 8 states and 97 transitions. [2024-06-20 19:26:16,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 106 transitions, 1257 flow [2024-06-20 19:26:16,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 106 transitions, 1157 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-06-20 19:26:16,214 INFO L231 Difference]: Finished difference. Result has 124 places, 91 transitions, 968 flow [2024-06-20 19:26:16,214 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=886, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=968, PETRI_PLACES=124, PETRI_TRANSITIONS=91} [2024-06-20 19:26:16,214 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 96 predicate places. [2024-06-20 19:26:16,214 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 91 transitions, 968 flow [2024-06-20 19:26:16,214 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-20 19:26:16,215 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:26:16,215 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:26:16,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-20 19:26:16,215 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:26:16,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:26:16,215 INFO L85 PathProgramCache]: Analyzing trace with hash -519551267, now seen corresponding path program 5 times [2024-06-20 19:26:16,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:26:16,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713872200] [2024-06-20 19:26:16,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:26:16,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:26:16,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:26:21,007 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-20 19:26:21,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:26:21,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713872200] [2024-06-20 19:26:21,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713872200] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:26:21,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:26:21,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:26:21,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757931723] [2024-06-20 19:26:21,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:26:21,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:26:21,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:26:21,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:26:21,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:26:21,134 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-06-20 19:26:21,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 91 transitions, 968 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-20 19:26:21,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:26:21,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-06-20 19:26:21,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:26:21,500 INFO L124 PetriNetUnfolderBase]: 306/621 cut-off events. [2024-06-20 19:26:21,500 INFO L125 PetriNetUnfolderBase]: For 12323/12323 co-relation queries the response was YES. [2024-06-20 19:26:21,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3545 conditions, 621 events. 306/621 cut-off events. For 12323/12323 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3011 event pairs, 93 based on Foata normal form. 2/623 useless extension candidates. Maximal degree in co-relation 3496. Up to 493 conditions per place. [2024-06-20 19:26:21,504 INFO L140 encePairwiseOnDemand]: 21/29 looper letters, 74 selfloop transitions, 27 changer transitions 0/103 dead transitions. [2024-06-20 19:26:21,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 103 transitions, 1216 flow [2024-06-20 19:26:21,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:26:21,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:26:21,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2024-06-20 19:26:21,505 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39655172413793105 [2024-06-20 19:26:21,505 INFO L175 Difference]: Start difference. First operand has 124 places, 91 transitions, 968 flow. Second operand 8 states and 92 transitions. [2024-06-20 19:26:21,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 103 transitions, 1216 flow [2024-06-20 19:26:21,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 103 transitions, 1144 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-20 19:26:21,523 INFO L231 Difference]: Finished difference. Result has 126 places, 92 transitions, 974 flow [2024-06-20 19:26:21,523 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=898, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=974, PETRI_PLACES=126, PETRI_TRANSITIONS=92} [2024-06-20 19:26:21,523 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 98 predicate places. [2024-06-20 19:26:21,523 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 92 transitions, 974 flow [2024-06-20 19:26:21,523 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-20 19:26:21,523 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:26:21,523 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:26:21,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-20 19:26:21,524 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:26:21,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:26:21,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1741071447, now seen corresponding path program 6 times [2024-06-20 19:26:21,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:26:21,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552166798] [2024-06-20 19:26:21,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:26:21,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:26:21,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:26:26,510 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-20 19:26:26,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:26:26,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552166798] [2024-06-20 19:26:26,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552166798] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:26:26,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:26:26,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:26:26,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583453821] [2024-06-20 19:26:26,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:26:26,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:26:26,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:26:26,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:26:26,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:26:26,678 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-06-20 19:26:26,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 92 transitions, 974 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-20 19:26:26,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:26:26,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-06-20 19:26:26,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:26:26,894 INFO L124 PetriNetUnfolderBase]: 310/629 cut-off events. [2024-06-20 19:26:26,895 INFO L125 PetriNetUnfolderBase]: For 12444/12444 co-relation queries the response was YES. [2024-06-20 19:26:26,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3570 conditions, 629 events. 310/629 cut-off events. For 12444/12444 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3077 event pairs, 93 based on Foata normal form. 2/631 useless extension candidates. Maximal degree in co-relation 3520. Up to 459 conditions per place. [2024-06-20 19:26:26,898 INFO L140 encePairwiseOnDemand]: 21/29 looper letters, 72 selfloop transitions, 30 changer transitions 0/104 dead transitions. [2024-06-20 19:26:26,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 104 transitions, 1222 flow [2024-06-20 19:26:26,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:26:26,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:26:26,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2024-06-20 19:26:26,899 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39655172413793105 [2024-06-20 19:26:26,899 INFO L175 Difference]: Start difference. First operand has 126 places, 92 transitions, 974 flow. Second operand 8 states and 92 transitions. [2024-06-20 19:26:26,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 104 transitions, 1222 flow [2024-06-20 19:26:26,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 104 transitions, 1156 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-20 19:26:26,917 INFO L231 Difference]: Finished difference. Result has 128 places, 93 transitions, 991 flow [2024-06-20 19:26:26,917 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=910, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=991, PETRI_PLACES=128, PETRI_TRANSITIONS=93} [2024-06-20 19:26:26,917 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 100 predicate places. [2024-06-20 19:26:26,917 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 93 transitions, 991 flow [2024-06-20 19:26:26,917 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-20 19:26:26,917 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:26:26,917 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:26:26,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-20 19:26:26,918 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:26:26,918 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:26:26,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1927250797, now seen corresponding path program 23 times [2024-06-20 19:26:26,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:26:26,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644205241] [2024-06-20 19:26:26,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:26:26,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:26:26,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:26:31,616 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-20 19:26:31,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:26:31,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644205241] [2024-06-20 19:26:31,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644205241] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:26:31,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:26:31,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:26:31,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977493364] [2024-06-20 19:26:31,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:26:31,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:26:31,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:26:31,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:26:31,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:26:31,764 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-06-20 19:26:31,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 93 transitions, 991 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-20 19:26:31,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:26:31,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-06-20 19:26:31,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:26:32,115 INFO L124 PetriNetUnfolderBase]: 326/665 cut-off events. [2024-06-20 19:26:32,115 INFO L125 PetriNetUnfolderBase]: For 14439/14439 co-relation queries the response was YES. [2024-06-20 19:26:32,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3675 conditions, 665 events. 326/665 cut-off events. For 14439/14439 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3327 event pairs, 99 based on Foata normal form. 10/675 useless extension candidates. Maximal degree in co-relation 3624. Up to 499 conditions per place. [2024-06-20 19:26:32,119 INFO L140 encePairwiseOnDemand]: 20/29 looper letters, 73 selfloop transitions, 24 changer transitions 11/110 dead transitions. [2024-06-20 19:26:32,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 110 transitions, 1269 flow [2024-06-20 19:26:32,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:26:32,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:26:32,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2024-06-20 19:26:32,120 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40229885057471265 [2024-06-20 19:26:32,120 INFO L175 Difference]: Start difference. First operand has 128 places, 93 transitions, 991 flow. Second operand 9 states and 105 transitions. [2024-06-20 19:26:32,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 110 transitions, 1269 flow [2024-06-20 19:26:32,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 110 transitions, 1200 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-20 19:26:32,140 INFO L231 Difference]: Finished difference. Result has 131 places, 90 transitions, 943 flow [2024-06-20 19:26:32,141 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=922, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=943, PETRI_PLACES=131, PETRI_TRANSITIONS=90} [2024-06-20 19:26:32,141 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 103 predicate places. [2024-06-20 19:26:32,141 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 90 transitions, 943 flow [2024-06-20 19:26:32,141 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-20 19:26:32,141 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:26:32,141 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:26:32,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-20 19:26:32,142 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:26:32,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:26:32,142 INFO L85 PathProgramCache]: Analyzing trace with hash -473409679, now seen corresponding path program 24 times [2024-06-20 19:26:32,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:26:32,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749904484] [2024-06-20 19:26:32,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:26:32,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:26:32,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:26:36,845 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-20 19:26:36,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:26:36,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749904484] [2024-06-20 19:26:36,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749904484] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:26:36,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:26:36,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:26:36,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135326827] [2024-06-20 19:26:36,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:26:36,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:26:36,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:26:36,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:26:36,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:26:36,967 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-06-20 19:26:36,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 90 transitions, 943 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-20 19:26:36,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:26:36,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-06-20 19:26:36,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:26:37,383 INFO L124 PetriNetUnfolderBase]: 316/651 cut-off events. [2024-06-20 19:26:37,383 INFO L125 PetriNetUnfolderBase]: For 15420/15420 co-relation queries the response was YES. [2024-06-20 19:26:37,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3600 conditions, 651 events. 316/651 cut-off events. For 15420/15420 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3248 event pairs, 98 based on Foata normal form. 10/661 useless extension candidates. Maximal degree in co-relation 3548. Up to 485 conditions per place. [2024-06-20 19:26:37,387 INFO L140 encePairwiseOnDemand]: 19/29 looper letters, 72 selfloop transitions, 26 changer transitions 11/111 dead transitions. [2024-06-20 19:26:37,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 111 transitions, 1242 flow [2024-06-20 19:26:37,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:26:37,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:26:37,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 110 transitions. [2024-06-20 19:26:37,389 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.421455938697318 [2024-06-20 19:26:37,389 INFO L175 Difference]: Start difference. First operand has 131 places, 90 transitions, 943 flow. Second operand 9 states and 110 transitions. [2024-06-20 19:26:37,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 111 transitions, 1242 flow [2024-06-20 19:26:37,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 111 transitions, 1190 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-20 19:26:37,412 INFO L231 Difference]: Finished difference. Result has 129 places, 87 transitions, 916 flow [2024-06-20 19:26:37,412 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=891, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=916, PETRI_PLACES=129, PETRI_TRANSITIONS=87} [2024-06-20 19:26:37,413 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 101 predicate places. [2024-06-20 19:26:37,413 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 87 transitions, 916 flow [2024-06-20 19:26:37,413 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-20 19:26:37,413 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:26:37,413 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:26:37,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-20 19:26:37,413 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:26:37,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:26:37,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1689563867, now seen corresponding path program 7 times [2024-06-20 19:26:37,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:26:37,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222868101] [2024-06-20 19:26:37,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:26:37,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:26:37,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:26:41,736 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-20 19:26:41,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:26:41,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222868101] [2024-06-20 19:26:41,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222868101] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:26:41,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:26:41,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:26:41,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720173237] [2024-06-20 19:26:41,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:26:41,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:26:41,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:26:41,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:26:41,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:26:41,832 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-06-20 19:26:41,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 87 transitions, 916 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-20 19:26:41,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:26:41,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-06-20 19:26:41,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:26:42,073 INFO L124 PetriNetUnfolderBase]: 287/596 cut-off events. [2024-06-20 19:26:42,073 INFO L125 PetriNetUnfolderBase]: For 11608/11608 co-relation queries the response was YES. [2024-06-20 19:26:42,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3309 conditions, 596 events. 287/596 cut-off events. For 11608/11608 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2904 event pairs, 119 based on Foata normal form. 2/598 useless extension candidates. Maximal degree in co-relation 3258. Up to 555 conditions per place. [2024-06-20 19:26:42,076 INFO L140 encePairwiseOnDemand]: 22/29 looper letters, 84 selfloop transitions, 11 changer transitions 0/97 dead transitions. [2024-06-20 19:26:42,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 97 transitions, 1142 flow [2024-06-20 19:26:42,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:26:42,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:26:42,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 78 transitions. [2024-06-20 19:26:42,078 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3842364532019704 [2024-06-20 19:26:42,078 INFO L175 Difference]: Start difference. First operand has 129 places, 87 transitions, 916 flow. Second operand 7 states and 78 transitions. [2024-06-20 19:26:42,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 97 transitions, 1142 flow [2024-06-20 19:26:42,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 97 transitions, 1086 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-20 19:26:42,093 INFO L231 Difference]: Finished difference. Result has 125 places, 88 transitions, 904 flow [2024-06-20 19:26:42,093 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=860, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=904, PETRI_PLACES=125, PETRI_TRANSITIONS=88} [2024-06-20 19:26:42,093 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 97 predicate places. [2024-06-20 19:26:42,093 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 88 transitions, 904 flow [2024-06-20 19:26:42,093 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-20 19:26:42,093 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:26:42,093 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:26:42,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-20 19:26:42,093 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:26:42,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:26:42,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1680359657, now seen corresponding path program 8 times [2024-06-20 19:26:42,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:26:42,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466237883] [2024-06-20 19:26:42,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:26:42,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:26:42,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:26:46,540 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-20 19:26:46,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:26:46,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466237883] [2024-06-20 19:26:46,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466237883] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:26:46,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:26:46,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:26:46,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485892571] [2024-06-20 19:26:46,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:26:46,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:26:46,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:26:46,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:26:46,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:26:46,615 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-06-20 19:26:46,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 88 transitions, 904 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:26:46,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:26:46,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-06-20 19:26:46,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:26:46,830 INFO L124 PetriNetUnfolderBase]: 291/604 cut-off events. [2024-06-20 19:26:46,830 INFO L125 PetriNetUnfolderBase]: For 10636/10636 co-relation queries the response was YES. [2024-06-20 19:26:46,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3284 conditions, 604 events. 291/604 cut-off events. For 10636/10636 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2960 event pairs, 89 based on Foata normal form. 2/606 useless extension candidates. Maximal degree in co-relation 3235. Up to 430 conditions per place. [2024-06-20 19:26:46,834 INFO L140 encePairwiseOnDemand]: 22/29 looper letters, 61 selfloop transitions, 38 changer transitions 0/102 dead transitions. [2024-06-20 19:26:46,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 102 transitions, 1163 flow [2024-06-20 19:26:46,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 19:26:46,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 19:26:46,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 94 transitions. [2024-06-20 19:26:46,839 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5402298850574713 [2024-06-20 19:26:46,839 INFO L175 Difference]: Start difference. First operand has 125 places, 88 transitions, 904 flow. Second operand 6 states and 94 transitions. [2024-06-20 19:26:46,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 102 transitions, 1163 flow [2024-06-20 19:26:46,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 102 transitions, 1129 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-06-20 19:26:46,855 INFO L231 Difference]: Finished difference. Result has 126 places, 89 transitions, 979 flow [2024-06-20 19:26:46,855 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=870, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=979, PETRI_PLACES=126, PETRI_TRANSITIONS=89} [2024-06-20 19:26:46,856 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 98 predicate places. [2024-06-20 19:26:46,856 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 89 transitions, 979 flow [2024-06-20 19:26:46,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:26:46,856 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:26:46,856 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:26:46,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-20 19:26:46,856 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:26:46,856 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:26:46,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1340021501, now seen corresponding path program 9 times [2024-06-20 19:26:46,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:26:46,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470556049] [2024-06-20 19:26:46,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:26:46,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:26:46,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:26:51,521 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-20 19:26:51,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:26:51,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470556049] [2024-06-20 19:26:51,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470556049] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:26:51,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:26:51,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:26:51,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069831838] [2024-06-20 19:26:51,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:26:51,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:26:51,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:26:51,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:26:51,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:26:51,663 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-06-20 19:26:51,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 89 transitions, 979 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-20 19:26:51,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:26:51,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-06-20 19:26:51,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:26:51,903 INFO L124 PetriNetUnfolderBase]: 288/599 cut-off events. [2024-06-20 19:26:51,903 INFO L125 PetriNetUnfolderBase]: For 11471/11471 co-relation queries the response was YES. [2024-06-20 19:26:51,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3334 conditions, 599 events. 288/599 cut-off events. For 11471/11471 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2938 event pairs, 95 based on Foata normal form. 2/601 useless extension candidates. Maximal degree in co-relation 3284. Up to 379 conditions per place. [2024-06-20 19:26:51,906 INFO L140 encePairwiseOnDemand]: 22/29 looper letters, 63 selfloop transitions, 34 changer transitions 0/99 dead transitions. [2024-06-20 19:26:51,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 99 transitions, 1199 flow [2024-06-20 19:26:51,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:26:51,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:26:51,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 85 transitions. [2024-06-20 19:26:51,907 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4187192118226601 [2024-06-20 19:26:51,907 INFO L175 Difference]: Start difference. First operand has 126 places, 89 transitions, 979 flow. Second operand 7 states and 85 transitions. [2024-06-20 19:26:51,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 99 transitions, 1199 flow [2024-06-20 19:26:51,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 99 transitions, 1114 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-06-20 19:26:51,924 INFO L231 Difference]: Finished difference. Result has 129 places, 89 transitions, 969 flow [2024-06-20 19:26:51,924 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=894, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=969, PETRI_PLACES=129, PETRI_TRANSITIONS=89} [2024-06-20 19:26:51,925 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 101 predicate places. [2024-06-20 19:26:51,925 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 89 transitions, 969 flow [2024-06-20 19:26:51,925 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-20 19:26:51,925 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:26:51,925 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:26:51,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-20 19:26:51,925 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:26:51,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:26:51,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1509393977, now seen corresponding path program 25 times [2024-06-20 19:26:51,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:26:51,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835918425] [2024-06-20 19:26:51,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:26:51,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:26:51,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:26:56,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:26:56,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:26:56,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835918425] [2024-06-20 19:26:56,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835918425] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:26:56,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:26:56,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:26:56,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263247824] [2024-06-20 19:26:56,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:26:56,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:26:56,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:26:56,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:26:56,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:26:56,450 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-06-20 19:26:56,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 89 transitions, 969 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-20 19:26:56,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:26:56,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-06-20 19:26:56,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:26:56,758 INFO L124 PetriNetUnfolderBase]: 275/576 cut-off events. [2024-06-20 19:26:56,759 INFO L125 PetriNetUnfolderBase]: For 10066/10066 co-relation queries the response was YES. [2024-06-20 19:26:56,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2994 conditions, 576 events. 275/576 cut-off events. For 10066/10066 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2804 event pairs, 83 based on Foata normal form. 10/586 useless extension candidates. Maximal degree in co-relation 2942. Up to 412 conditions per place. [2024-06-20 19:26:56,761 INFO L140 encePairwiseOnDemand]: 19/29 looper letters, 61 selfloop transitions, 31 changer transitions 13/107 dead transitions. [2024-06-20 19:26:56,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 107 transitions, 1242 flow [2024-06-20 19:26:56,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:26:56,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:26:56,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 102 transitions. [2024-06-20 19:26:56,762 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4396551724137931 [2024-06-20 19:26:56,762 INFO L175 Difference]: Start difference. First operand has 129 places, 89 transitions, 969 flow. Second operand 8 states and 102 transitions. [2024-06-20 19:26:56,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 107 transitions, 1242 flow [2024-06-20 19:26:56,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 107 transitions, 1165 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-06-20 19:26:56,778 INFO L231 Difference]: Finished difference. Result has 132 places, 82 transitions, 866 flow [2024-06-20 19:26:56,778 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=892, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=866, PETRI_PLACES=132, PETRI_TRANSITIONS=82} [2024-06-20 19:26:56,778 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 104 predicate places. [2024-06-20 19:26:56,778 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 82 transitions, 866 flow [2024-06-20 19:26:56,779 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-20 19:26:56,779 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:26:56,779 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:26:56,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-20 19:26:56,779 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:26:56,779 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:26:56,779 INFO L85 PathProgramCache]: Analyzing trace with hash -432784728, now seen corresponding path program 1 times [2024-06-20 19:26:56,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:26:56,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974358424] [2024-06-20 19:26:56,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:26:56,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:26:56,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:27:02,008 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-20 19:27:02,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:27:02,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974358424] [2024-06-20 19:27:02,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974358424] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:27:02,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:27:02,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:27:02,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543492025] [2024-06-20 19:27:02,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:27:02,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:27:02,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:27:02,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:27:02,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:27:02,179 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-06-20 19:27:02,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 82 transitions, 866 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-20 19:27:02,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:27:02,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-06-20 19:27:02,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:27:02,559 INFO L124 PetriNetUnfolderBase]: 252/539 cut-off events. [2024-06-20 19:27:02,559 INFO L125 PetriNetUnfolderBase]: For 8710/8710 co-relation queries the response was YES. [2024-06-20 19:27:02,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2755 conditions, 539 events. 252/539 cut-off events. For 8710/8710 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2616 event pairs, 79 based on Foata normal form. 6/545 useless extension candidates. Maximal degree in co-relation 2702. Up to 393 conditions per place. [2024-06-20 19:27:02,562 INFO L140 encePairwiseOnDemand]: 20/29 looper letters, 71 selfloop transitions, 17 changer transitions 12/102 dead transitions. [2024-06-20 19:27:02,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 102 transitions, 1128 flow [2024-06-20 19:27:02,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:27:02,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:27:02,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2024-06-20 19:27:02,563 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40344827586206894 [2024-06-20 19:27:02,563 INFO L175 Difference]: Start difference. First operand has 132 places, 82 transitions, 866 flow. Second operand 10 states and 117 transitions. [2024-06-20 19:27:02,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 102 transitions, 1128 flow [2024-06-20 19:27:02,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 102 transitions, 1013 flow, removed 3 selfloop flow, removed 12 redundant places. [2024-06-20 19:27:02,577 INFO L231 Difference]: Finished difference. Result has 128 places, 78 transitions, 738 flow [2024-06-20 19:27:02,578 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=751, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=738, PETRI_PLACES=128, PETRI_TRANSITIONS=78} [2024-06-20 19:27:02,578 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 100 predicate places. [2024-06-20 19:27:02,578 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 78 transitions, 738 flow [2024-06-20 19:27:02,578 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-20 19:27:02,578 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:27:02,578 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:27:02,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-20 19:27:02,578 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:27:02,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:27:02,579 INFO L85 PathProgramCache]: Analyzing trace with hash 800483252, now seen corresponding path program 2 times [2024-06-20 19:27:02,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:27:02,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954795101] [2024-06-20 19:27:02,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:27:02,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:27:02,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:27:09,357 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-20 19:27:09,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:27:09,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954795101] [2024-06-20 19:27:09,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954795101] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:27:09,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:27:09,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:27:09,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7953556] [2024-06-20 19:27:09,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:27:09,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:27:09,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:27:09,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:27:09,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:27:09,461 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-06-20 19:27:09,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 78 transitions, 738 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-20 19:27:09,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:27:09,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-06-20 19:27:09,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:27:09,795 INFO L124 PetriNetUnfolderBase]: 235/504 cut-off events. [2024-06-20 19:27:09,795 INFO L125 PetriNetUnfolderBase]: For 7273/7273 co-relation queries the response was YES. [2024-06-20 19:27:09,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2312 conditions, 504 events. 235/504 cut-off events. For 7273/7273 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2400 event pairs, 65 based on Foata normal form. 12/516 useless extension candidates. Maximal degree in co-relation 2262. Up to 320 conditions per place. [2024-06-20 19:27:09,797 INFO L140 encePairwiseOnDemand]: 20/29 looper letters, 57 selfloop transitions, 18 changer transitions 17/94 dead transitions. [2024-06-20 19:27:09,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 94 transitions, 970 flow [2024-06-20 19:27:09,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:27:09,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:27:09,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 103 transitions. [2024-06-20 19:27:09,798 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3946360153256705 [2024-06-20 19:27:09,798 INFO L175 Difference]: Start difference. First operand has 128 places, 78 transitions, 738 flow. Second operand 9 states and 103 transitions. [2024-06-20 19:27:09,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 94 transitions, 970 flow [2024-06-20 19:27:09,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 94 transitions, 932 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-20 19:27:09,809 INFO L231 Difference]: Finished difference. Result has 124 places, 69 transitions, 647 flow [2024-06-20 19:27:09,809 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=700, PETRI_DIFFERENCE_MINUEND_PLACES=115, 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=647, PETRI_PLACES=124, PETRI_TRANSITIONS=69} [2024-06-20 19:27:09,810 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 96 predicate places. [2024-06-20 19:27:09,810 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 69 transitions, 647 flow [2024-06-20 19:27:09,810 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-20 19:27:09,810 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:27:09,810 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:27:09,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-20 19:27:09,810 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:27:09,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:27:09,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1168750188, now seen corresponding path program 3 times [2024-06-20 19:27:09,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:27:09,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360696644] [2024-06-20 19:27:09,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:27:09,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:27:09,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:27:15,058 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-20 19:27:15,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:27:15,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360696644] [2024-06-20 19:27:15,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360696644] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:27:15,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:27:15,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:27:15,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459184530] [2024-06-20 19:27:15,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:27:15,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:27:15,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:27:15,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:27:15,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:27:15,181 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-06-20 19:27:15,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 69 transitions, 647 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:27:15,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:27:15,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-06-20 19:27:15,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:27:15,465 INFO L124 PetriNetUnfolderBase]: 200/435 cut-off events. [2024-06-20 19:27:15,465 INFO L125 PetriNetUnfolderBase]: For 6001/6001 co-relation queries the response was YES. [2024-06-20 19:27:15,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2038 conditions, 435 events. 200/435 cut-off events. For 6001/6001 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1981 event pairs, 61 based on Foata normal form. 6/441 useless extension candidates. Maximal degree in co-relation 2001. Up to 321 conditions per place. [2024-06-20 19:27:15,468 INFO L140 encePairwiseOnDemand]: 20/29 looper letters, 60 selfloop transitions, 16 changer transitions 6/84 dead transitions. [2024-06-20 19:27:15,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 84 transitions, 855 flow [2024-06-20 19:27:15,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:27:15,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:27:15,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 102 transitions. [2024-06-20 19:27:15,470 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39080459770114945 [2024-06-20 19:27:15,470 INFO L175 Difference]: Start difference. First operand has 124 places, 69 transitions, 647 flow. Second operand 9 states and 102 transitions. [2024-06-20 19:27:15,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 84 transitions, 855 flow [2024-06-20 19:27:15,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 84 transitions, 812 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-20 19:27:15,480 INFO L231 Difference]: Finished difference. Result has 115 places, 67 transitions, 625 flow [2024-06-20 19:27:15,480 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=604, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=625, PETRI_PLACES=115, PETRI_TRANSITIONS=67} [2024-06-20 19:27:15,480 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 87 predicate places. [2024-06-20 19:27:15,480 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 67 transitions, 625 flow [2024-06-20 19:27:15,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:27:15,481 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:27:15,481 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:27:15,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-20 19:27:15,481 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:27:15,481 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:27:15,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1168155542, now seen corresponding path program 4 times [2024-06-20 19:27:15,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:27:15,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499900305] [2024-06-20 19:27:15,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:27:15,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:27:15,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:27:21,019 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-20 19:27:21,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:27:21,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499900305] [2024-06-20 19:27:21,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499900305] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:27:21,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:27:21,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:27:21,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913809321] [2024-06-20 19:27:21,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:27:21,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:27:21,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:27:21,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:27:21,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:27:21,131 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-06-20 19:27:21,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 67 transitions, 625 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:27:21,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:27:21,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-06-20 19:27:21,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:27:21,463 INFO L124 PetriNetUnfolderBase]: 191/416 cut-off events. [2024-06-20 19:27:21,463 INFO L125 PetriNetUnfolderBase]: For 5846/5846 co-relation queries the response was YES. [2024-06-20 19:27:21,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1963 conditions, 416 events. 191/416 cut-off events. For 5846/5846 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1857 event pairs, 61 based on Foata normal form. 6/422 useless extension candidates. Maximal degree in co-relation 1927. Up to 317 conditions per place. [2024-06-20 19:27:21,465 INFO L140 encePairwiseOnDemand]: 21/29 looper letters, 57 selfloop transitions, 13 changer transitions 13/85 dead transitions. [2024-06-20 19:27:21,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 85 transitions, 849 flow [2024-06-20 19:27:21,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:27:21,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:27:21,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 103 transitions. [2024-06-20 19:27:21,466 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3946360153256705 [2024-06-20 19:27:21,466 INFO L175 Difference]: Start difference. First operand has 115 places, 67 transitions, 625 flow. Second operand 9 states and 103 transitions. [2024-06-20 19:27:21,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 85 transitions, 849 flow [2024-06-20 19:27:21,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 85 transitions, 781 flow, removed 1 selfloop flow, removed 10 redundant places. [2024-06-20 19:27:21,475 INFO L231 Difference]: Finished difference. Result has 113 places, 62 transitions, 545 flow [2024-06-20 19:27:21,475 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=557, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=545, PETRI_PLACES=113, PETRI_TRANSITIONS=62} [2024-06-20 19:27:21,475 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 85 predicate places. [2024-06-20 19:27:21,475 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 62 transitions, 545 flow [2024-06-20 19:27:21,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:27:21,475 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:27:21,475 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:27:21,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-20 19:27:21,475 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:27:21,476 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:27:21,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1861359256, now seen corresponding path program 5 times [2024-06-20 19:27:21,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:27:21,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637793996] [2024-06-20 19:27:21,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:27:21,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:27:21,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:27:27,601 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-20 19:27:27,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:27:27,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637793996] [2024-06-20 19:27:27,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637793996] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:27:27,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:27:27,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:27:27,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442967465] [2024-06-20 19:27:27,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:27:27,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:27:27,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:27:27,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:27:27,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:27:27,784 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-06-20 19:27:27,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 62 transitions, 545 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:27:27,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:27:27,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-06-20 19:27:27,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:27:28,059 INFO L124 PetriNetUnfolderBase]: 179/392 cut-off events. [2024-06-20 19:27:28,059 INFO L125 PetriNetUnfolderBase]: For 5690/5690 co-relation queries the response was YES. [2024-06-20 19:27:28,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1816 conditions, 392 events. 179/392 cut-off events. For 5690/5690 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1718 event pairs, 61 based on Foata normal form. 6/398 useless extension candidates. Maximal degree in co-relation 1780. Up to 286 conditions per place. [2024-06-20 19:27:28,061 INFO L140 encePairwiseOnDemand]: 21/29 looper letters, 48 selfloop transitions, 8 changer transitions 19/77 dead transitions. [2024-06-20 19:27:28,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 77 transitions, 737 flow [2024-06-20 19:27:28,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:27:28,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:27:28,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions. [2024-06-20 19:27:28,062 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3793103448275862 [2024-06-20 19:27:28,062 INFO L175 Difference]: Start difference. First operand has 113 places, 62 transitions, 545 flow. Second operand 9 states and 99 transitions. [2024-06-20 19:27:28,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 77 transitions, 737 flow [2024-06-20 19:27:28,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 77 transitions, 697 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-20 19:27:28,069 INFO L231 Difference]: Finished difference. Result has 109 places, 53 transitions, 451 flow [2024-06-20 19:27:28,069 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=505, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=451, PETRI_PLACES=109, PETRI_TRANSITIONS=53} [2024-06-20 19:27:28,070 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 81 predicate places. [2024-06-20 19:27:28,070 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 53 transitions, 451 flow [2024-06-20 19:27:28,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:27:28,070 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:27:28,070 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:27:28,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-20 19:27:28,070 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:27:28,070 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:27:28,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1183705222, now seen corresponding path program 6 times [2024-06-20 19:27:28,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:27:28,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779250994] [2024-06-20 19:27:28,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:27:28,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:27:28,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:27:33,190 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-20 19:27:33,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:27:33,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779250994] [2024-06-20 19:27:33,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779250994] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:27:33,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:27:33,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:27:33,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775225510] [2024-06-20 19:27:33,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:27:33,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:27:33,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:27:33,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:27:33,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:27:33,286 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-06-20 19:27:33,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 53 transitions, 451 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-20 19:27:33,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:27:33,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-06-20 19:27:33,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:27:33,533 INFO L124 PetriNetUnfolderBase]: 157/346 cut-off events. [2024-06-20 19:27:33,533 INFO L125 PetriNetUnfolderBase]: For 5586/5586 co-relation queries the response was YES. [2024-06-20 19:27:33,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1623 conditions, 346 events. 157/346 cut-off events. For 5586/5586 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1466 event pairs, 59 based on Foata normal form. 6/352 useless extension candidates. Maximal degree in co-relation 1588. Up to 248 conditions per place. [2024-06-20 19:27:33,535 INFO L140 encePairwiseOnDemand]: 22/29 looper letters, 42 selfloop transitions, 14 changer transitions 12/70 dead transitions. [2024-06-20 19:27:33,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 70 transitions, 643 flow [2024-06-20 19:27:33,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:27:33,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:27:33,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 95 transitions. [2024-06-20 19:27:33,535 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40948275862068967 [2024-06-20 19:27:33,535 INFO L175 Difference]: Start difference. First operand has 109 places, 53 transitions, 451 flow. Second operand 8 states and 95 transitions. [2024-06-20 19:27:33,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 70 transitions, 643 flow [2024-06-20 19:27:33,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 70 transitions, 598 flow, removed 8 selfloop flow, removed 12 redundant places. [2024-06-20 19:27:33,541 INFO L231 Difference]: Finished difference. Result has 94 places, 48 transitions, 397 flow [2024-06-20 19:27:33,541 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=397, PETRI_PLACES=94, PETRI_TRANSITIONS=48} [2024-06-20 19:27:33,542 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 66 predicate places. [2024-06-20 19:27:33,542 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 48 transitions, 397 flow [2024-06-20 19:27:33,542 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-20 19:27:33,542 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:27:33,542 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:27:33,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-20 19:27:33,542 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:27:33,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:27:33,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1190191972, now seen corresponding path program 7 times [2024-06-20 19:27:33,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:27:33,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884400871] [2024-06-20 19:27:33,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:27:33,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:27:33,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:27:38,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-20 19:27:38,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:27:38,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884400871] [2024-06-20 19:27:38,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884400871] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:27:38,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:27:38,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:27:38,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22504459] [2024-06-20 19:27:38,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:27:38,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:27:38,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:27:38,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:27:38,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:27:38,718 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2024-06-20 19:27:38,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 48 transitions, 397 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:27:38,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:27:38,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2024-06-20 19:27:38,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:27:38,917 INFO L124 PetriNetUnfolderBase]: 129/290 cut-off events. [2024-06-20 19:27:38,917 INFO L125 PetriNetUnfolderBase]: For 2898/2898 co-relation queries the response was YES. [2024-06-20 19:27:38,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1263 conditions, 290 events. 129/290 cut-off events. For 2898/2898 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1156 event pairs, 45 based on Foata normal form. 6/296 useless extension candidates. Maximal degree in co-relation 1234. Up to 195 conditions per place. [2024-06-20 19:27:38,919 INFO L140 encePairwiseOnDemand]: 21/29 looper letters, 37 selfloop transitions, 9 changer transitions 15/63 dead transitions. [2024-06-20 19:27:38,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 63 transitions, 561 flow [2024-06-20 19:27:38,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:27:38,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:27:38,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2024-06-20 19:27:38,920 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41762452107279696 [2024-06-20 19:27:38,920 INFO L175 Difference]: Start difference. First operand has 94 places, 48 transitions, 397 flow. Second operand 9 states and 109 transitions. [2024-06-20 19:27:38,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 63 transitions, 561 flow [2024-06-20 19:27:38,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 63 transitions, 505 flow, removed 3 selfloop flow, removed 11 redundant places. [2024-06-20 19:27:38,924 INFO L231 Difference]: Finished difference. Result has 89 places, 42 transitions, 315 flow [2024-06-20 19:27:38,924 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=341, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=315, PETRI_PLACES=89, PETRI_TRANSITIONS=42} [2024-06-20 19:27:38,924 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 61 predicate places. [2024-06-20 19:27:38,924 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 42 transitions, 315 flow [2024-06-20 19:27:38,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:27:38,924 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:27:38,924 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:27:38,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-20 19:27:38,924 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:27:38,924 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:27:38,924 INFO L85 PathProgramCache]: Analyzing trace with hash 689787576, now seen corresponding path program 8 times [2024-06-20 19:27:38,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:27:38,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795629169] [2024-06-20 19:27:38,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:27:38,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:27:38,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:27:44,249 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-20 19:27:44,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:27:44,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795629169] [2024-06-20 19:27:44,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795629169] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:27:44,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:27:44,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:27:44,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333087401] [2024-06-20 19:27:44,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:27:44,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:27:44,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:27:44,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:27:44,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:27:44,403 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-06-20 19:27:44,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 42 transitions, 315 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:27:44,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:27:44,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-06-20 19:27:44,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:27:44,607 INFO L124 PetriNetUnfolderBase]: 99/228 cut-off events. [2024-06-20 19:27:44,608 INFO L125 PetriNetUnfolderBase]: For 1813/1813 co-relation queries the response was YES. [2024-06-20 19:27:44,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 929 conditions, 228 events. 99/228 cut-off events. For 1813/1813 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 816 event pairs, 46 based on Foata normal form. 6/234 useless extension candidates. Maximal degree in co-relation 902. Up to 163 conditions per place. [2024-06-20 19:27:44,608 INFO L140 encePairwiseOnDemand]: 22/29 looper letters, 31 selfloop transitions, 4 changer transitions 17/54 dead transitions. [2024-06-20 19:27:44,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 54 transitions, 445 flow [2024-06-20 19:27:44,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:27:44,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:27:44,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2024-06-20 19:27:44,609 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3793103448275862 [2024-06-20 19:27:44,609 INFO L175 Difference]: Start difference. First operand has 89 places, 42 transitions, 315 flow. Second operand 8 states and 88 transitions. [2024-06-20 19:27:44,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 54 transitions, 445 flow [2024-06-20 19:27:44,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 54 transitions, 415 flow, removed 4 selfloop flow, removed 10 redundant places. [2024-06-20 19:27:44,612 INFO L231 Difference]: Finished difference. Result has 80 places, 34 transitions, 253 flow [2024-06-20 19:27:44,612 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=253, PETRI_PLACES=80, PETRI_TRANSITIONS=34} [2024-06-20 19:27:44,613 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 52 predicate places. [2024-06-20 19:27:44,613 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 34 transitions, 253 flow [2024-06-20 19:27:44,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:27:44,613 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:27:44,613 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-20 19:27:44,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-20 19:27:44,613 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:27:44,614 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:27:44,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1296258310, now seen corresponding path program 1 times [2024-06-20 19:27:44,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:27:44,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540432702] [2024-06-20 19:27:44,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:27:44,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:27:44,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:27:50,409 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-20 19:27:50,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:27:50,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540432702] [2024-06-20 19:27:50,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540432702] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:27:50,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:27:50,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:27:50,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057811615] [2024-06-20 19:27:50,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:27:50,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:27:50,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:27:50,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:27:50,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:27:50,540 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-06-20 19:27:50,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 34 transitions, 253 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-20 19:27:50,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:27:50,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-06-20 19:27:50,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:27:50,733 INFO L124 PetriNetUnfolderBase]: 70/165 cut-off events. [2024-06-20 19:27:50,733 INFO L125 PetriNetUnfolderBase]: For 791/791 co-relation queries the response was YES. [2024-06-20 19:27:50,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 670 conditions, 165 events. 70/165 cut-off events. For 791/791 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 506 event pairs, 14 based on Foata normal form. 4/169 useless extension candidates. Maximal degree in co-relation 647. Up to 65 conditions per place. [2024-06-20 19:27:50,734 INFO L140 encePairwiseOnDemand]: 19/29 looper letters, 20 selfloop transitions, 4 changer transitions 27/53 dead transitions. [2024-06-20 19:27:50,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 53 transitions, 405 flow [2024-06-20 19:27:50,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:27:50,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:27:50,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 113 transitions. [2024-06-20 19:27:50,734 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3542319749216301 [2024-06-20 19:27:50,735 INFO L175 Difference]: Start difference. First operand has 80 places, 34 transitions, 253 flow. Second operand 11 states and 113 transitions. [2024-06-20 19:27:50,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 53 transitions, 405 flow [2024-06-20 19:27:50,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 53 transitions, 373 flow, removed 8 selfloop flow, removed 11 redundant places. [2024-06-20 19:27:50,736 INFO L231 Difference]: Finished difference. Result has 70 places, 22 transitions, 125 flow [2024-06-20 19:27:50,736 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=125, PETRI_PLACES=70, PETRI_TRANSITIONS=22} [2024-06-20 19:27:50,736 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 42 predicate places. [2024-06-20 19:27:50,737 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 22 transitions, 125 flow [2024-06-20 19:27:50,737 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-20 19:27:50,737 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:27:50,737 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-20 19:27:50,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-20 19:27:50,737 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:27:50,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:27:50,737 INFO L85 PathProgramCache]: Analyzing trace with hash 851935314, now seen corresponding path program 2 times [2024-06-20 19:27:50,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:27:50,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102462129] [2024-06-20 19:27:50,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:27:50,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:27:50,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:27:56,867 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-20 19:27:56,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:27:56,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102462129] [2024-06-20 19:27:56,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102462129] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:27:56,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:27:56,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:27:56,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194930079] [2024-06-20 19:27:56,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:27:56,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:27:56,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:27:56,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:27:56,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:27:57,038 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-06-20 19:27:57,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 22 transitions, 125 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:27:57,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:27:57,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-06-20 19:27:57,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:27:57,211 INFO L124 PetriNetUnfolderBase]: 31/75 cut-off events. [2024-06-20 19:27:57,211 INFO L125 PetriNetUnfolderBase]: For 212/212 co-relation queries the response was YES. [2024-06-20 19:27:57,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 265 conditions, 75 events. 31/75 cut-off events. For 212/212 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 137 event pairs, 0 based on Foata normal form. 4/79 useless extension candidates. Maximal degree in co-relation 248. Up to 22 conditions per place. [2024-06-20 19:27:57,212 INFO L140 encePairwiseOnDemand]: 20/29 looper letters, 0 selfloop transitions, 0 changer transitions 32/32 dead transitions. [2024-06-20 19:27:57,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 32 transitions, 193 flow [2024-06-20 19:27:57,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:27:57,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:27:57,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 91 transitions. [2024-06-20 19:27:57,212 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3137931034482759 [2024-06-20 19:27:57,213 INFO L175 Difference]: Start difference. First operand has 70 places, 22 transitions, 125 flow. Second operand 10 states and 91 transitions. [2024-06-20 19:27:57,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 32 transitions, 193 flow [2024-06-20 19:27:57,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 32 transitions, 149 flow, removed 5 selfloop flow, removed 19 redundant places. [2024-06-20 19:27:57,213 INFO L231 Difference]: Finished difference. Result has 43 places, 0 transitions, 0 flow [2024-06-20 19:27:57,213 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=0, PETRI_PLACES=43, PETRI_TRANSITIONS=0} [2024-06-20 19:27:57,213 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 15 predicate places. [2024-06-20 19:27:57,213 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 0 transitions, 0 flow [2024-06-20 19:27:57,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:27:57,216 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 4 remaining) [2024-06-20 19:27:57,218 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 4 remaining) [2024-06-20 19:27:57,218 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-06-20 19:27:57,218 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-06-20 19:27:57,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-20 19:27:57,218 INFO L445 BasicCegarLoop]: Path program histogram: [25, 12, 9, 8, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:27:57,221 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-20 19:27:57,221 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-20 19:27:57,224 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-06-20 19:27:57,224 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-06-20 19:27:57,225 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.06 07:27:57 BasicIcfg [2024-06-20 19:27:57,225 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-20 19:27:57,225 INFO L158 Benchmark]: Toolchain (without parser) took 404717.03ms. Allocated memory was 146.8MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 114.3MB in the beginning and 1.1GB in the end (delta: -938.1MB). Peak memory consumption was 386.7MB. Max. memory is 16.1GB. [2024-06-20 19:27:57,225 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 146.8MB. Free memory was 105.7MB in the beginning and 105.5MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-06-20 19:27:57,225 INFO L158 Benchmark]: Witness Parser took 0.11ms. Allocated memory is still 146.8MB. Free memory is still 78.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-20 19:27:57,225 INFO L158 Benchmark]: CACSL2BoogieTranslator took 598.72ms. Allocated memory is still 146.8MB. Free memory was 113.8MB in the beginning and 64.5MB in the end (delta: 49.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2024-06-20 19:27:57,226 INFO L158 Benchmark]: Boogie Procedure Inliner took 100.27ms. Allocated memory is still 146.8MB. Free memory was 64.5MB in the beginning and 49.7MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-06-20 19:27:57,226 INFO L158 Benchmark]: Boogie Preprocessor took 95.79ms. Allocated memory is still 146.8MB. Free memory was 49.7MB in the beginning and 43.0MB in the end (delta: 6.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-06-20 19:27:57,226 INFO L158 Benchmark]: RCFGBuilder took 936.04ms. Allocated memory was 146.8MB in the beginning and 216.0MB in the end (delta: 69.2MB). Free memory was 43.0MB in the beginning and 136.6MB in the end (delta: -93.6MB). Peak memory consumption was 34.5MB. Max. memory is 16.1GB. [2024-06-20 19:27:57,226 INFO L158 Benchmark]: TraceAbstraction took 402979.85ms. Allocated memory was 216.0MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 136.6MB in the beginning and 1.1GB in the end (delta: -915.8MB). Peak memory consumption was 337.3MB. Max. memory is 16.1GB. [2024-06-20 19:27:57,227 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 146.8MB. Free memory was 105.7MB in the beginning and 105.5MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.11ms. Allocated memory is still 146.8MB. Free memory is still 78.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 598.72ms. Allocated memory is still 146.8MB. Free memory was 113.8MB in the beginning and 64.5MB in the end (delta: 49.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 100.27ms. Allocated memory is still 146.8MB. Free memory was 64.5MB in the beginning and 49.7MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 95.79ms. Allocated memory is still 146.8MB. Free memory was 49.7MB in the beginning and 43.0MB in the end (delta: 6.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 936.04ms. Allocated memory was 146.8MB in the beginning and 216.0MB in the end (delta: 69.2MB). Free memory was 43.0MB in the beginning and 136.6MB in the end (delta: -93.6MB). Peak memory consumption was 34.5MB. Max. memory is 16.1GB. * TraceAbstraction took 402979.85ms. Allocated memory was 216.0MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 136.6MB in the beginning and 1.1GB in the end (delta: -915.8MB). Peak memory consumption was 337.3MB. 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, 46 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: 402.9s, OverallIterations: 79, TraceHistogramMax: 1, PathProgramHistogramMax: 25, EmptinessCheckTime: 0.0s, AutomataDifference: 35.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4460 SdHoareTripleChecker+Valid, 21.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3677 mSDsluCounter, 3585 SdHoareTripleChecker+Invalid, 18.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3126 mSDsCounter, 1034 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 24636 IncrementalHoareTripleChecker+Invalid, 25670 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1034 mSolverCounterUnsat, 459 mSDtfsCounter, 24636 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 741 GetRequests, 8 SyntacticMatches, 11 SemanticMatches, 722 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 985 ImplicationChecksByTransitivity, 19.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1408occurred in iteration=37, InterpolantAutomatonStates: 655, 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.2s SsaConstructionTime, 2.6s SatisfiabilityAnalysisTime, 363.2s InterpolantComputationTime, 1186 NumberOfCodeBlocks, 1186 NumberOfCodeBlocksAsserted, 79 NumberOfCheckSat, 1107 ConstructedInterpolants, 0 QuantifiedInterpolants, 52598 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 79 InterpolantComputations, 79 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-20 19:27:57,316 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