./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/mutex-meet/safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cde23df1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-cde23df-m [2024-06-14 15:59:12,074 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-14 15:59:12,133 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-14 15:59:12,138 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-14 15:59:12,138 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-14 15:59:12,159 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-14 15:59:12,163 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-14 15:59:12,163 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-14 15:59:12,164 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-14 15:59:12,167 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-14 15:59:12,167 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-14 15:59:12,167 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-14 15:59:12,168 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-14 15:59:12,169 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-14 15:59:12,169 INFO L153 SettingsManager]: * Use SBE=true [2024-06-14 15:59:12,169 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-14 15:59:12,169 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-14 15:59:12,170 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-14 15:59:12,170 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-14 15:59:12,170 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-14 15:59:12,170 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-14 15:59:12,171 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-14 15:59:12,171 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-14 15:59:12,171 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-14 15:59:12,171 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-14 15:59:12,171 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-14 15:59:12,172 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-14 15:59:12,172 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-14 15:59:12,172 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-14 15:59:12,173 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-14 15:59:12,173 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-14 15:59:12,173 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-14 15:59:12,174 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 15:59:12,174 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-14 15:59:12,174 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-14 15:59:12,174 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-14 15:59:12,174 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-14 15:59:12,174 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-14 15:59:12,175 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-14 15:59:12,175 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-14 15:59:12,175 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-14 15:59:12,175 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-14 15:59:12,175 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-14 15:59:12,176 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-14 15:59:12,409 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-14 15:59:12,435 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-14 15:59:12,437 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-14 15:59:12,437 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-14 15:59:12,438 INFO L274 PluginConnector]: CDTParser initialized [2024-06-14 15:59:12,439 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-14 15:59:13,428 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-14 15:59:13,647 INFO L384 CDTParser]: Found 1 translation units. [2024-06-14 15:59:13,652 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-14 15:59:13,663 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6eefd2ee5/572725b98c6b4b3d9c3da214c0ce3a83/FLAG38ac5871d [2024-06-14 15:59:13,672 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6eefd2ee5/572725b98c6b4b3d9c3da214c0ce3a83 [2024-06-14 15:59:13,674 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-14 15:59:13,675 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-14 15:59:13,675 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/safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml [2024-06-14 15:59:13,822 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-14 15:59:13,824 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-14 15:59:13,826 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-14 15:59:13,826 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-14 15:59:13,830 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-14 15:59:13,831 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 03:59:13" (1/2) ... [2024-06-14 15:59:13,832 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d04c6a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:59:13, skipping insertion in model container [2024-06-14 15:59:13,832 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 03:59:13" (1/2) ... [2024-06-14 15:59:13,834 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6ad63071 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:59:13, skipping insertion in model container [2024-06-14 15:59:13,834 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:59:13" (2/2) ... [2024-06-14 15:59:13,834 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d04c6a2 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:59:13, skipping insertion in model container [2024-06-14 15:59:13,834 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:59:13" (2/2) ... [2024-06-14 15:59:13,835 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-14 15:59:13,926 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-14 15:59:13,927 INFO L97 edCorrectnessWitness]: Location invariant before [L811-L811] (((((((((((((((! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1))) && (! multithreaded || y$read_delayed == (_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 )__unbuffered_p1_EBX >= 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 )__unbuffered_p1_EBX >= 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 )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (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 )__unbuffered_p1_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (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 )__unbuffered_p1_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (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$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && x <= 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)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 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)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-14 15:59:13,928 INFO L97 edCorrectnessWitness]: Location invariant before [L810-L810] (((((((((((((((! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1))) && (! multithreaded || y$read_delayed == (_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 )__unbuffered_p1_EBX >= 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 )__unbuffered_p1_EBX >= 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 )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (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 )__unbuffered_p1_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (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 )__unbuffered_p1_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (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$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && x <= 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)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 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)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-14 15:59:13,928 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-14 15:59:13,928 INFO L106 edCorrectnessWitness]: ghost_update [L808-L808] multithreaded = 1; [2024-06-14 15:59:13,964 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-14 15:59:14,308 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 15:59:14,321 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-14 15:59:14,527 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 15:59:14,553 INFO L206 MainTranslator]: Completed translation [2024-06-14 15:59:14,553 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:59:14 WrapperNode [2024-06-14 15:59:14,553 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-14 15:59:14,554 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-14 15:59:14,554 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-14 15:59:14,554 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-14 15:59:14,559 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:59:14" (1/1) ... [2024-06-14 15:59:14,593 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:59:14" (1/1) ... [2024-06-14 15:59:14,651 INFO L138 Inliner]: procedures = 174, calls = 34, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 113 [2024-06-14 15:59:14,652 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-14 15:59:14,653 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-14 15:59:14,653 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-14 15:59:14,653 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-14 15:59:14,661 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:59:14" (1/1) ... [2024-06-14 15:59:14,662 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:59:14" (1/1) ... [2024-06-14 15:59:14,682 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:59:14" (1/1) ... [2024-06-14 15:59:14,711 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-14 15:59:14,711 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:59:14" (1/1) ... [2024-06-14 15:59:14,712 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:59:14" (1/1) ... [2024-06-14 15:59:14,734 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:59:14" (1/1) ... [2024-06-14 15:59:14,736 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:59:14" (1/1) ... [2024-06-14 15:59:14,746 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:59:14" (1/1) ... [2024-06-14 15:59:14,750 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:59:14" (1/1) ... [2024-06-14 15:59:14,761 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-14 15:59:14,762 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-14 15:59:14,762 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-14 15:59:14,762 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-14 15:59:14,763 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:59:14" (1/1) ... [2024-06-14 15:59:14,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 15:59:14,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 15:59:14,787 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-14 15:59:14,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-14 15:59:14,819 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-14 15:59:14,820 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-14 15:59:14,820 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-14 15:59:14,820 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-14 15:59:14,821 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-14 15:59:14,821 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-14 15:59:14,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-14 15:59:14,821 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-14 15:59:14,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-14 15:59:14,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-14 15:59:14,822 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-14 15:59:14,925 INFO L244 CfgBuilder]: Building ICFG [2024-06-14 15:59:14,937 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-14 15:59:15,566 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-14 15:59:15,566 INFO L293 CfgBuilder]: Performing block encoding [2024-06-14 15:59:15,724 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-14 15:59:15,724 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-14 15:59:15,726 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 03:59:15 BoogieIcfgContainer [2024-06-14 15:59:15,727 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-14 15:59:15,729 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-14 15:59:15,729 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-14 15:59:15,732 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-14 15:59:15,732 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.06 03:59:13" (1/4) ... [2024-06-14 15:59:15,733 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ecdf599 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 03:59:15, skipping insertion in model container [2024-06-14 15:59:15,733 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:59:13" (2/4) ... [2024-06-14 15:59:15,733 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ecdf599 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 03:59:15, skipping insertion in model container [2024-06-14 15:59:15,733 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:59:14" (3/4) ... [2024-06-14 15:59:15,737 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ecdf599 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 03:59:15, skipping insertion in model container [2024-06-14 15:59:15,737 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 03:59:15" (4/4) ... [2024-06-14 15:59:15,738 INFO L112 eAbstractionObserver]: Analyzing ICFG safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-14 15:59:15,751 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-14 15:59:15,752 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-14 15:59:15,752 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-14 15:59:15,808 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-14 15:59:15,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 30 transitions, 68 flow [2024-06-14 15:59:15,877 INFO L124 PetriNetUnfolderBase]: 0/28 cut-off events. [2024-06-14 15:59:15,878 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 15:59:15,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 28 events. 0/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 39 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-14 15:59:15,879 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 30 transitions, 68 flow [2024-06-14 15:59:15,882 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 22 transitions, 50 flow [2024-06-14 15:59:15,920 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-14 15:59:15,941 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;@62b0fa4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-14 15:59:15,941 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-14 15:59:15,949 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-14 15:59:15,949 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-14 15:59:15,949 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 15:59:15,950 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:59:15,950 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-14 15:59:15,951 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:59:15,966 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:59:15,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1470245525, now seen corresponding path program 1 times [2024-06-14 15:59:15,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:59:15,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014795721] [2024-06-14 15:59:15,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:59:15,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:59:16,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:59:19,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:59:19,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:59:19,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014795721] [2024-06-14 15:59:19,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014795721] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:59:19,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:59:19,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-14 15:59:19,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193342266] [2024-06-14 15:59:19,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:59:19,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-14 15:59:19,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:59:19,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-14 15:59:19,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-14 15:59:19,654 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2024-06-14 15:59:19,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 22 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:59:19,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:59:19,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2024-06-14 15:59:19,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:59:19,836 INFO L124 PetriNetUnfolderBase]: 131/247 cut-off events. [2024-06-14 15:59:19,836 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-06-14 15:59:19,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 509 conditions, 247 events. 131/247 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 848 event pairs, 79 based on Foata normal form. 3/244 useless extension candidates. Maximal degree in co-relation 495. Up to 231 conditions per place. [2024-06-14 15:59:19,840 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 24 selfloop transitions, 3 changer transitions 0/30 dead transitions. [2024-06-14 15:59:19,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 30 transitions, 123 flow [2024-06-14 15:59:19,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-14 15:59:19,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-14 15:59:19,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2024-06-14 15:59:19,848 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5888888888888889 [2024-06-14 15:59:19,850 INFO L175 Difference]: Start difference. First operand has 29 places, 22 transitions, 50 flow. Second operand 3 states and 53 transitions. [2024-06-14 15:59:19,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 30 transitions, 123 flow [2024-06-14 15:59:19,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 30 transitions, 120 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-14 15:59:19,853 INFO L231 Difference]: Finished difference. Result has 30 places, 24 transitions, 69 flow [2024-06-14 15:59:19,855 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=69, PETRI_PLACES=30, PETRI_TRANSITIONS=24} [2024-06-14 15:59:19,857 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 1 predicate places. [2024-06-14 15:59:19,858 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 24 transitions, 69 flow [2024-06-14 15:59:19,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:59:19,858 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:59:19,858 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:59:19,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-14 15:59:19,859 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:59:19,859 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:59:19,860 INFO L85 PathProgramCache]: Analyzing trace with hash -138254860, now seen corresponding path program 1 times [2024-06-14 15:59:19,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:59:19,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233857303] [2024-06-14 15:59:19,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:59:19,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:59:19,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:59:22,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:59:22,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:59:22,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233857303] [2024-06-14 15:59:22,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233857303] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:59:22,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:59:22,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-14 15:59:22,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780239212] [2024-06-14 15:59:22,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:59:22,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 15:59:22,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:59:22,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 15:59:22,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-14 15:59:22,660 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2024-06-14 15:59:22,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 69 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:59:22,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:59:22,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2024-06-14 15:59:22,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:59:22,821 INFO L124 PetriNetUnfolderBase]: 134/252 cut-off events. [2024-06-14 15:59:22,821 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2024-06-14 15:59:22,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 595 conditions, 252 events. 134/252 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 871 event pairs, 53 based on Foata normal form. 4/255 useless extension candidates. Maximal degree in co-relation 580. Up to 227 conditions per place. [2024-06-14 15:59:22,823 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 30 selfloop transitions, 5 changer transitions 0/38 dead transitions. [2024-06-14 15:59:22,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 38 transitions, 176 flow [2024-06-14 15:59:22,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-14 15:59:22,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-14 15:59:22,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2024-06-14 15:59:22,827 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5583333333333333 [2024-06-14 15:59:22,827 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 69 flow. Second operand 4 states and 67 transitions. [2024-06-14 15:59:22,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 38 transitions, 176 flow [2024-06-14 15:59:22,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 38 transitions, 172 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-14 15:59:22,831 INFO L231 Difference]: Finished difference. Result has 34 places, 28 transitions, 106 flow [2024-06-14 15:59:22,831 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=106, PETRI_PLACES=34, PETRI_TRANSITIONS=28} [2024-06-14 15:59:22,833 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 5 predicate places. [2024-06-14 15:59:22,833 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 28 transitions, 106 flow [2024-06-14 15:59:22,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:59:22,833 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:59:22,833 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:59:22,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-14 15:59:22,834 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:59:22,835 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:59:22,836 INFO L85 PathProgramCache]: Analyzing trace with hash 9067822, now seen corresponding path program 1 times [2024-06-14 15:59:22,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:59:22,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091068513] [2024-06-14 15:59:22,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:59:22,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:59:22,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:59:25,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:59:25,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:59:25,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091068513] [2024-06-14 15:59:25,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091068513] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:59:25,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:59:25,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 15:59:25,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118351434] [2024-06-14 15:59:25,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:59:25,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 15:59:25,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:59:25,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 15:59:25,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-14 15:59:25,204 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 30 [2024-06-14 15:59:25,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 28 transitions, 106 flow. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:59:25,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:59:25,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 30 [2024-06-14 15:59:25,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:59:25,379 INFO L124 PetriNetUnfolderBase]: 154/285 cut-off events. [2024-06-14 15:59:25,380 INFO L125 PetriNetUnfolderBase]: For 155/155 co-relation queries the response was YES. [2024-06-14 15:59:25,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 779 conditions, 285 events. 154/285 cut-off events. For 155/155 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 952 event pairs, 58 based on Foata normal form. 2/286 useless extension candidates. Maximal degree in co-relation 761. Up to 258 conditions per place. [2024-06-14 15:59:25,382 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 37 selfloop transitions, 7 changer transitions 0/46 dead transitions. [2024-06-14 15:59:25,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 46 transitions, 245 flow [2024-06-14 15:59:25,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 15:59:25,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 15:59:25,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 75 transitions. [2024-06-14 15:59:25,385 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-14 15:59:25,385 INFO L175 Difference]: Start difference. First operand has 34 places, 28 transitions, 106 flow. Second operand 5 states and 75 transitions. [2024-06-14 15:59:25,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 46 transitions, 245 flow [2024-06-14 15:59:25,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 46 transitions, 238 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-14 15:59:25,387 INFO L231 Difference]: Finished difference. Result has 40 places, 34 transitions, 155 flow [2024-06-14 15:59:25,387 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=155, PETRI_PLACES=40, PETRI_TRANSITIONS=34} [2024-06-14 15:59:25,388 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 11 predicate places. [2024-06-14 15:59:25,388 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 34 transitions, 155 flow [2024-06-14 15:59:25,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:59:25,388 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:59:25,388 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:59:25,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-14 15:59:25,389 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:59:25,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:59:25,389 INFO L85 PathProgramCache]: Analyzing trace with hash 946038819, now seen corresponding path program 1 times [2024-06-14 15:59:25,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:59:25,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803037111] [2024-06-14 15:59:25,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:59:25,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:59:25,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:59:28,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:59:28,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:59:28,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803037111] [2024-06-14 15:59:28,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803037111] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:59:28,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:59:28,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 15:59:28,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596157097] [2024-06-14 15:59:28,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:59:28,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 15:59:28,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:59:28,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 15:59:28,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-14 15:59:28,256 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 30 [2024-06-14 15:59:28,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 155 flow. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:59:28,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:59:28,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 30 [2024-06-14 15:59:28,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:59:28,456 INFO L124 PetriNetUnfolderBase]: 151/280 cut-off events. [2024-06-14 15:59:28,457 INFO L125 PetriNetUnfolderBase]: For 296/296 co-relation queries the response was YES. [2024-06-14 15:59:28,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 855 conditions, 280 events. 151/280 cut-off events. For 296/296 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 930 event pairs, 40 based on Foata normal form. 2/281 useless extension candidates. Maximal degree in co-relation 833. Up to 244 conditions per place. [2024-06-14 15:59:28,460 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 41 selfloop transitions, 9 changer transitions 0/52 dead transitions. [2024-06-14 15:59:28,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 52 transitions, 301 flow [2024-06-14 15:59:28,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:59:28,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:59:28,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2024-06-14 15:59:28,465 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4888888888888889 [2024-06-14 15:59:28,465 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 155 flow. Second operand 6 states and 88 transitions. [2024-06-14 15:59:28,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 52 transitions, 301 flow [2024-06-14 15:59:28,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 52 transitions, 301 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-14 15:59:28,469 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 190 flow [2024-06-14 15:59:28,469 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=190, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2024-06-14 15:59:28,471 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 17 predicate places. [2024-06-14 15:59:28,471 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 190 flow [2024-06-14 15:59:28,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:59:28,471 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:59:28,471 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:59:28,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-14 15:59:28,472 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-14 15:59:28,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:59:28,472 INFO L85 PathProgramCache]: Analyzing trace with hash -737566435, now seen corresponding path program 1 times [2024-06-14 15:59:28,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:59:28,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281396811] [2024-06-14 15:59:28,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:59:28,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:59:28,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:59:31,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:59:31,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:59:31,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281396811] [2024-06-14 15:59:31,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281396811] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:59:31,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:59:31,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:59:31,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326815895] [2024-06-14 15:59:31,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:59:31,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:59:31,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:59:31,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:59:31,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:59:31,392 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 30 [2024-06-14 15:59:31,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 190 flow. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:59:31,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:59:31,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 30 [2024-06-14 15:59:31,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:59:31,668 INFO L124 PetriNetUnfolderBase]: 147/272 cut-off events. [2024-06-14 15:59:31,669 INFO L125 PetriNetUnfolderBase]: For 423/423 co-relation queries the response was YES. [2024-06-14 15:59:31,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 908 conditions, 272 events. 147/272 cut-off events. For 423/423 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 886 event pairs, 21 based on Foata normal form. 4/275 useless extension candidates. Maximal degree in co-relation 883. Up to 218 conditions per place. [2024-06-14 15:59:31,671 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 41 selfloop transitions, 10 changer transitions 0/53 dead transitions. [2024-06-14 15:59:31,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 53 transitions, 326 flow [2024-06-14 15:59:31,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:59:31,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:59:31,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 96 transitions. [2024-06-14 15:59:31,672 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45714285714285713 [2024-06-14 15:59:31,672 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 190 flow. Second operand 7 states and 96 transitions. [2024-06-14 15:59:31,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 53 transitions, 326 flow [2024-06-14 15:59:31,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 53 transitions, 309 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-06-14 15:59:31,678 INFO L231 Difference]: Finished difference. Result has 48 places, 35 transitions, 187 flow [2024-06-14 15:59:31,678 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=187, PETRI_PLACES=48, PETRI_TRANSITIONS=35} [2024-06-14 15:59:31,683 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 19 predicate places. [2024-06-14 15:59:31,683 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 35 transitions, 187 flow [2024-06-14 15:59:31,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:59:31,683 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:59:31,684 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:59:31,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-14 15:59:31,687 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:59:31,687 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:59:31,687 INFO L85 PathProgramCache]: Analyzing trace with hash 2137059725, now seen corresponding path program 1 times [2024-06-14 15:59:31,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:59:31,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155962081] [2024-06-14 15:59:31,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:59:31,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:59:31,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:59:36,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:59:36,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:59:36,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155962081] [2024-06-14 15:59:36,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155962081] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:59:36,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:59:36,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:59:36,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961364152] [2024-06-14 15:59:36,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:59:36,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:59:36,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:59:36,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:59:36,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:59:36,596 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 15:59:36,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 35 transitions, 187 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-14 15:59:36,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:59:36,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 15:59:36,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:59:36,818 INFO L124 PetriNetUnfolderBase]: 166/303 cut-off events. [2024-06-14 15:59:36,818 INFO L125 PetriNetUnfolderBase]: For 562/562 co-relation queries the response was YES. [2024-06-14 15:59:36,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1042 conditions, 303 events. 166/303 cut-off events. For 562/562 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1026 event pairs, 39 based on Foata normal form. 3/305 useless extension candidates. Maximal degree in co-relation 1016. Up to 235 conditions per place. [2024-06-14 15:59:36,821 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 43 selfloop transitions, 14 changer transitions 0/59 dead transitions. [2024-06-14 15:59:36,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 59 transitions, 383 flow [2024-06-14 15:59:36,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:59:36,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:59:36,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 93 transitions. [2024-06-14 15:59:36,822 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44285714285714284 [2024-06-14 15:59:36,822 INFO L175 Difference]: Start difference. First operand has 48 places, 35 transitions, 187 flow. Second operand 7 states and 93 transitions. [2024-06-14 15:59:36,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 59 transitions, 383 flow [2024-06-14 15:59:36,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 59 transitions, 356 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-14 15:59:36,825 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 217 flow [2024-06-14 15:59:36,825 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=217, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2024-06-14 15:59:36,826 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 20 predicate places. [2024-06-14 15:59:36,826 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 217 flow [2024-06-14 15:59:36,826 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-14 15:59:36,826 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:59:36,827 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:59:36,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-14 15:59:36,827 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:59:36,827 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:59:36,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1111055291, now seen corresponding path program 2 times [2024-06-14 15:59:36,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:59:36,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216937719] [2024-06-14 15:59:36,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:59:36,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:59:36,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:59:41,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:59:41,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:59:41,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216937719] [2024-06-14 15:59:41,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216937719] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:59:41,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:59:41,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:59:41,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558586516] [2024-06-14 15:59:41,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:59:41,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:59:41,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:59:41,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:59:41,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:59:41,906 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 15:59:41,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 217 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-14 15:59:41,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:59:41,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 15:59:41,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:59:42,200 INFO L124 PetriNetUnfolderBase]: 184/333 cut-off events. [2024-06-14 15:59:42,200 INFO L125 PetriNetUnfolderBase]: For 834/834 co-relation queries the response was YES. [2024-06-14 15:59:42,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1213 conditions, 333 events. 184/333 cut-off events. For 834/834 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1161 event pairs, 40 based on Foata normal form. 3/335 useless extension candidates. Maximal degree in co-relation 1186. Up to 281 conditions per place. [2024-06-14 15:59:42,203 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 44 selfloop transitions, 13 changer transitions 0/59 dead transitions. [2024-06-14 15:59:42,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 59 transitions, 401 flow [2024-06-14 15:59:42,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:59:42,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:59:42,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 88 transitions. [2024-06-14 15:59:42,204 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41904761904761906 [2024-06-14 15:59:42,204 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 217 flow. Second operand 7 states and 88 transitions. [2024-06-14 15:59:42,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 59 transitions, 401 flow [2024-06-14 15:59:42,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 59 transitions, 382 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-06-14 15:59:42,207 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 261 flow [2024-06-14 15:59:42,208 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=261, PETRI_PLACES=53, PETRI_TRANSITIONS=43} [2024-06-14 15:59:42,208 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 24 predicate places. [2024-06-14 15:59:42,208 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 43 transitions, 261 flow [2024-06-14 15:59:42,208 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-14 15:59:42,209 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:59:42,209 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:59:42,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-14 15:59:42,210 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:59:42,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:59:42,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1264656335, now seen corresponding path program 1 times [2024-06-14 15:59:42,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:59:42,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746334601] [2024-06-14 15:59:42,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:59:42,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:59:42,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:59:47,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:59:47,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:59:47,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746334601] [2024-06-14 15:59:47,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746334601] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:59:47,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:59:47,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:59:47,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428286357] [2024-06-14 15:59:47,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:59:47,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:59:47,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:59:47,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:59:47,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:59:47,130 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 15:59:47,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 43 transitions, 261 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-14 15:59:47,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:59:47,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 15:59:47,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:59:47,368 INFO L124 PetriNetUnfolderBase]: 180/327 cut-off events. [2024-06-14 15:59:47,368 INFO L125 PetriNetUnfolderBase]: For 970/970 co-relation queries the response was YES. [2024-06-14 15:59:47,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1255 conditions, 327 events. 180/327 cut-off events. For 970/970 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1147 event pairs, 33 based on Foata normal form. 2/328 useless extension candidates. Maximal degree in co-relation 1226. Up to 274 conditions per place. [2024-06-14 15:59:47,371 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 41 selfloop transitions, 13 changer transitions 0/56 dead transitions. [2024-06-14 15:59:47,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 56 transitions, 409 flow [2024-06-14 15:59:47,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 15:59:47,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 15:59:47,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2024-06-14 15:59:47,373 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4533333333333333 [2024-06-14 15:59:47,373 INFO L175 Difference]: Start difference. First operand has 53 places, 43 transitions, 261 flow. Second operand 5 states and 68 transitions. [2024-06-14 15:59:47,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 56 transitions, 409 flow [2024-06-14 15:59:47,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 56 transitions, 380 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-14 15:59:47,376 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 286 flow [2024-06-14 15:59:47,376 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=286, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2024-06-14 15:59:47,376 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 25 predicate places. [2024-06-14 15:59:47,377 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 286 flow [2024-06-14 15:59:47,377 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-14 15:59:47,377 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:59:47,377 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:59:47,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-14 15:59:47,377 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:59:47,378 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:59:47,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1242550421, now seen corresponding path program 3 times [2024-06-14 15:59:47,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:59:47,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350386530] [2024-06-14 15:59:47,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:59:47,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:59:47,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:59:51,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:59:51,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:59:51,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350386530] [2024-06-14 15:59:51,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350386530] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:59:51,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:59:51,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:59:51,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342233204] [2024-06-14 15:59:51,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:59:51,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:59:51,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:59:51,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:59:51,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:59:51,735 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 15:59:51,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 286 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-14 15:59:51,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:59:51,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 15:59:51,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:59:52,013 INFO L124 PetriNetUnfolderBase]: 174/318 cut-off events. [2024-06-14 15:59:52,013 INFO L125 PetriNetUnfolderBase]: For 1141/1141 co-relation queries the response was YES. [2024-06-14 15:59:52,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1263 conditions, 318 events. 174/318 cut-off events. For 1141/1141 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1102 event pairs, 40 based on Foata normal form. 3/320 useless extension candidates. Maximal degree in co-relation 1233. Up to 266 conditions per place. [2024-06-14 15:59:52,016 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 46 selfloop transitions, 13 changer transitions 0/61 dead transitions. [2024-06-14 15:59:52,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 61 transitions, 446 flow [2024-06-14 15:59:52,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:59:52,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:59:52,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 81 transitions. [2024-06-14 15:59:52,017 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45 [2024-06-14 15:59:52,017 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 286 flow. Second operand 6 states and 81 transitions. [2024-06-14 15:59:52,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 61 transitions, 446 flow [2024-06-14 15:59:52,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 61 transitions, 424 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-06-14 15:59:52,020 INFO L231 Difference]: Finished difference. Result has 57 places, 45 transitions, 298 flow [2024-06-14 15:59:52,020 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=298, PETRI_PLACES=57, PETRI_TRANSITIONS=45} [2024-06-14 15:59:52,021 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 28 predicate places. [2024-06-14 15:59:52,021 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 45 transitions, 298 flow [2024-06-14 15:59:52,021 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-14 15:59:52,021 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:59:52,021 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:59:52,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-14 15:59:52,022 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:59:52,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:59:52,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1264647407, now seen corresponding path program 1 times [2024-06-14 15:59:52,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:59:52,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388871575] [2024-06-14 15:59:52,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:59:52,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:59:52,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:59:57,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:59:57,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:59:57,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388871575] [2024-06-14 15:59:57,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388871575] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:59:57,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:59:57,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:59:57,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747388313] [2024-06-14 15:59:57,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:59:57,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:59:57,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:59:57,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:59:57,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:59:58,050 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 15:59:58,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 298 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-14 15:59:58,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:59:58,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 15:59:58,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:59:58,275 INFO L124 PetriNetUnfolderBase]: 171/313 cut-off events. [2024-06-14 15:59:58,276 INFO L125 PetriNetUnfolderBase]: For 1322/1322 co-relation queries the response was YES. [2024-06-14 15:59:58,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1276 conditions, 313 events. 171/313 cut-off events. For 1322/1322 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1069 event pairs, 40 based on Foata normal form. 2/314 useless extension candidates. Maximal degree in co-relation 1245. Up to 289 conditions per place. [2024-06-14 15:59:58,278 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 43 selfloop transitions, 7 changer transitions 0/52 dead transitions. [2024-06-14 15:59:58,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 52 transitions, 414 flow [2024-06-14 15:59:58,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 15:59:58,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 15:59:58,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2024-06-14 15:59:58,279 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4066666666666667 [2024-06-14 15:59:58,280 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 298 flow. Second operand 5 states and 61 transitions. [2024-06-14 15:59:58,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 52 transitions, 414 flow [2024-06-14 15:59:58,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 52 transitions, 375 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-06-14 15:59:58,282 INFO L231 Difference]: Finished difference. Result has 57 places, 45 transitions, 277 flow [2024-06-14 15:59:58,283 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=277, PETRI_PLACES=57, PETRI_TRANSITIONS=45} [2024-06-14 15:59:58,283 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 28 predicate places. [2024-06-14 15:59:58,283 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 45 transitions, 277 flow [2024-06-14 15:59:58,284 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-14 15:59:58,284 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:59:58,284 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:59:58,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-14 15:59:58,284 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:59:58,284 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:59:58,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1079636854, now seen corresponding path program 1 times [2024-06-14 15:59:58,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:59:58,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057268605] [2024-06-14 15:59:58,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:59:58,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:59:58,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:00:03,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:00:03,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:00:03,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057268605] [2024-06-14 16:00:03,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057268605] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:00:03,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:00:03,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:00:03,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334448552] [2024-06-14 16:00:03,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:00:03,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:00:03,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:00:03,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:00:03,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:00:03,918 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 16:00:03,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 277 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-14 16:00:03,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:00:03,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 16:00:03,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:00:04,276 INFO L124 PetriNetUnfolderBase]: 190/344 cut-off events. [2024-06-14 16:00:04,276 INFO L125 PetriNetUnfolderBase]: For 1413/1413 co-relation queries the response was YES. [2024-06-14 16:00:04,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1336 conditions, 344 events. 190/344 cut-off events. For 1413/1413 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1233 event pairs, 34 based on Foata normal form. 3/346 useless extension candidates. Maximal degree in co-relation 1304. Up to 218 conditions per place. [2024-06-14 16:00:04,279 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 50 selfloop transitions, 26 changer transitions 0/78 dead transitions. [2024-06-14 16:00:04,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 78 transitions, 547 flow [2024-06-14 16:00:04,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 16:00:04,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 16:00:04,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 119 transitions. [2024-06-14 16:00:04,281 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44074074074074077 [2024-06-14 16:00:04,281 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 277 flow. Second operand 9 states and 119 transitions. [2024-06-14 16:00:04,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 78 transitions, 547 flow [2024-06-14 16:00:04,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 78 transitions, 533 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-14 16:00:04,284 INFO L231 Difference]: Finished difference. Result has 64 places, 51 transitions, 370 flow [2024-06-14 16:00:04,284 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=370, PETRI_PLACES=64, PETRI_TRANSITIONS=51} [2024-06-14 16:00:04,285 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 35 predicate places. [2024-06-14 16:00:04,285 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 51 transitions, 370 flow [2024-06-14 16:00:04,285 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-14 16:00:04,285 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:00:04,285 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:00:04,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-14 16:00:04,285 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 16:00:04,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:00:04,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1921402206, now seen corresponding path program 2 times [2024-06-14 16:00:04,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:00:04,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2310697] [2024-06-14 16:00:04,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:00:04,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:00:04,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:00:09,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:00:09,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:00:09,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2310697] [2024-06-14 16:00:09,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2310697] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:00:09,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:00:09,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:00:09,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807905500] [2024-06-14 16:00:09,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:00:09,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:00:09,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:00:09,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:00:09,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:00:09,615 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 16:00:09,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 51 transitions, 370 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-14 16:00:09,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:00:09,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 16:00:09,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:00:09,901 INFO L124 PetriNetUnfolderBase]: 193/349 cut-off events. [2024-06-14 16:00:09,901 INFO L125 PetriNetUnfolderBase]: For 1739/1739 co-relation queries the response was YES. [2024-06-14 16:00:09,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1545 conditions, 349 events. 193/349 cut-off events. For 1739/1739 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1240 event pairs, 39 based on Foata normal form. 1/349 useless extension candidates. Maximal degree in co-relation 1511. Up to 316 conditions per place. [2024-06-14 16:00:09,904 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 53 selfloop transitions, 15 changer transitions 0/70 dead transitions. [2024-06-14 16:00:09,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 70 transitions, 600 flow [2024-06-14 16:00:09,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:00:09,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:00:09,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 91 transitions. [2024-06-14 16:00:09,905 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37916666666666665 [2024-06-14 16:00:09,905 INFO L175 Difference]: Start difference. First operand has 64 places, 51 transitions, 370 flow. Second operand 8 states and 91 transitions. [2024-06-14 16:00:09,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 70 transitions, 600 flow [2024-06-14 16:00:09,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 70 transitions, 554 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-06-14 16:00:09,909 INFO L231 Difference]: Finished difference. Result has 70 places, 59 transitions, 451 flow [2024-06-14 16:00:09,909 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=331, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=451, PETRI_PLACES=70, PETRI_TRANSITIONS=59} [2024-06-14 16:00:09,910 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 41 predicate places. [2024-06-14 16:00:09,910 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 59 transitions, 451 flow [2024-06-14 16:00:09,910 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-14 16:00:09,910 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:00:09,910 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:00:09,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-14 16:00:09,911 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 16:00:09,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:00:09,911 INFO L85 PathProgramCache]: Analyzing trace with hash -556997100, now seen corresponding path program 3 times [2024-06-14 16:00:09,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:00:09,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570032698] [2024-06-14 16:00:09,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:00:09,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:00:09,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:00:14,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:00:14,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:00:14,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570032698] [2024-06-14 16:00:14,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570032698] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:00:14,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:00:14,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:00:14,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368702583] [2024-06-14 16:00:14,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:00:14,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:00:14,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:00:14,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:00:14,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:00:14,991 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 16:00:14,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 59 transitions, 451 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-14 16:00:14,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:00:14,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 16:00:14,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:00:15,312 INFO L124 PetriNetUnfolderBase]: 191/346 cut-off events. [2024-06-14 16:00:15,312 INFO L125 PetriNetUnfolderBase]: For 1941/1941 co-relation queries the response was YES. [2024-06-14 16:00:15,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1590 conditions, 346 events. 191/346 cut-off events. For 1941/1941 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1236 event pairs, 39 based on Foata normal form. 1/346 useless extension candidates. Maximal degree in co-relation 1551. Up to 298 conditions per place. [2024-06-14 16:00:15,315 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 59 selfloop transitions, 17 changer transitions 0/78 dead transitions. [2024-06-14 16:00:15,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 78 transitions, 671 flow [2024-06-14 16:00:15,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 16:00:15,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 16:00:15,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 90 transitions. [2024-06-14 16:00:15,317 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-14 16:00:15,317 INFO L175 Difference]: Start difference. First operand has 70 places, 59 transitions, 451 flow. Second operand 7 states and 90 transitions. [2024-06-14 16:00:15,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 78 transitions, 671 flow [2024-06-14 16:00:15,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 78 transitions, 643 flow, removed 11 selfloop flow, removed 2 redundant places. [2024-06-14 16:00:15,322 INFO L231 Difference]: Finished difference. Result has 76 places, 62 transitions, 505 flow [2024-06-14 16:00:15,322 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=423, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=505, PETRI_PLACES=76, PETRI_TRANSITIONS=62} [2024-06-14 16:00:15,323 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 47 predicate places. [2024-06-14 16:00:15,323 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 62 transitions, 505 flow [2024-06-14 16:00:15,323 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-14 16:00:15,323 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:00:15,323 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:00:15,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-14 16:00:15,323 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 16:00:15,324 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:00:15,324 INFO L85 PathProgramCache]: Analyzing trace with hash -549639715, now seen corresponding path program 1 times [2024-06-14 16:00:15,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:00:15,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040317768] [2024-06-14 16:00:15,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:00:15,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:00:15,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:00:19,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:00:19,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:00:19,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040317768] [2024-06-14 16:00:19,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040317768] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:00:19,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:00:19,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:00:19,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137011509] [2024-06-14 16:00:19,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:00:19,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:00:19,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:00:19,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:00:19,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:00:19,919 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 16:00:19,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 62 transitions, 505 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-14 16:00:19,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:00:19,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 16:00:19,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:00:20,220 INFO L124 PetriNetUnfolderBase]: 187/340 cut-off events. [2024-06-14 16:00:20,220 INFO L125 PetriNetUnfolderBase]: For 2170/2170 co-relation queries the response was YES. [2024-06-14 16:00:20,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1629 conditions, 340 events. 187/340 cut-off events. For 2170/2170 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1198 event pairs, 36 based on Foata normal form. 2/341 useless extension candidates. Maximal degree in co-relation 1587. Up to 266 conditions per place. [2024-06-14 16:00:20,223 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 57 selfloop transitions, 20 changer transitions 0/79 dead transitions. [2024-06-14 16:00:20,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 79 transitions, 711 flow [2024-06-14 16:00:20,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 16:00:20,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 16:00:20,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 83 transitions. [2024-06-14 16:00:20,224 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46111111111111114 [2024-06-14 16:00:20,224 INFO L175 Difference]: Start difference. First operand has 76 places, 62 transitions, 505 flow. Second operand 6 states and 83 transitions. [2024-06-14 16:00:20,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 79 transitions, 711 flow [2024-06-14 16:00:20,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 79 transitions, 677 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-14 16:00:20,229 INFO L231 Difference]: Finished difference. Result has 78 places, 64 transitions, 544 flow [2024-06-14 16:00:20,229 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=471, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=544, PETRI_PLACES=78, PETRI_TRANSITIONS=64} [2024-06-14 16:00:20,229 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 49 predicate places. [2024-06-14 16:00:20,229 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 64 transitions, 544 flow [2024-06-14 16:00:20,230 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-14 16:00:20,230 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:00:20,230 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:00:20,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-14 16:00:20,230 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 16:00:20,230 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:00:20,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1840836968, now seen corresponding path program 1 times [2024-06-14 16:00:20,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:00:20,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939046625] [2024-06-14 16:00:20,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:00:20,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:00:20,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:00:25,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:00:25,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:00:25,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939046625] [2024-06-14 16:00:25,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939046625] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:00:25,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:00:25,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 16:00:25,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870761538] [2024-06-14 16:00:25,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:00:25,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 16:00:25,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:00:25,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 16:00:25,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 16:00:25,776 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 16:00:25,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 64 transitions, 544 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-14 16:00:25,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:00:25,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 16:00:25,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:00:26,113 INFO L124 PetriNetUnfolderBase]: 191/348 cut-off events. [2024-06-14 16:00:26,113 INFO L125 PetriNetUnfolderBase]: For 2579/2579 co-relation queries the response was YES. [2024-06-14 16:00:26,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1737 conditions, 348 events. 191/348 cut-off events. For 2579/2579 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1258 event pairs, 24 based on Foata normal form. 2/349 useless extension candidates. Maximal degree in co-relation 1694. Up to 244 conditions per place. [2024-06-14 16:00:26,116 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 60 selfloop transitions, 27 changer transitions 0/89 dead transitions. [2024-06-14 16:00:26,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 89 transitions, 830 flow [2024-06-14 16:00:26,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 16:00:26,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 16:00:26,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2024-06-14 16:00:26,117 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-14 16:00:26,117 INFO L175 Difference]: Start difference. First operand has 78 places, 64 transitions, 544 flow. Second operand 9 states and 108 transitions. [2024-06-14 16:00:26,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 89 transitions, 830 flow [2024-06-14 16:00:26,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 89 transitions, 777 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-06-14 16:00:26,123 INFO L231 Difference]: Finished difference. Result has 84 places, 68 transitions, 614 flow [2024-06-14 16:00:26,123 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=495, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=614, PETRI_PLACES=84, PETRI_TRANSITIONS=68} [2024-06-14 16:00:26,123 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 55 predicate places. [2024-06-14 16:00:26,124 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 68 transitions, 614 flow [2024-06-14 16:00:26,124 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-14 16:00:26,124 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:00:26,124 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:00:26,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-14 16:00:26,124 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 16:00:26,124 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:00:26,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1840776394, now seen corresponding path program 1 times [2024-06-14 16:00:26,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:00:26,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334072660] [2024-06-14 16:00:26,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:00:26,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:00:26,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:00:31,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:00:31,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:00:31,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334072660] [2024-06-14 16:00:31,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334072660] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:00:31,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:00:31,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 16:00:31,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933702143] [2024-06-14 16:00:31,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:00:31,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 16:00:31,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:00:31,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 16:00:31,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 16:00:32,017 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 16:00:32,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 68 transitions, 614 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-14 16:00:32,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:00:32,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 16:00:32,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:00:32,355 INFO L124 PetriNetUnfolderBase]: 210/379 cut-off events. [2024-06-14 16:00:32,356 INFO L125 PetriNetUnfolderBase]: For 2459/2459 co-relation queries the response was YES. [2024-06-14 16:00:32,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1917 conditions, 379 events. 210/379 cut-off events. For 2459/2459 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1383 event pairs, 33 based on Foata normal form. 2/380 useless extension candidates. Maximal degree in co-relation 1872. Up to 233 conditions per place. [2024-06-14 16:00:32,358 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 58 selfloop transitions, 37 changer transitions 0/97 dead transitions. [2024-06-14 16:00:32,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 97 transitions, 934 flow [2024-06-14 16:00:32,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 16:00:32,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 16:00:32,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 116 transitions. [2024-06-14 16:00:32,360 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42962962962962964 [2024-06-14 16:00:32,361 INFO L175 Difference]: Start difference. First operand has 84 places, 68 transitions, 614 flow. Second operand 9 states and 116 transitions. [2024-06-14 16:00:32,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 97 transitions, 934 flow [2024-06-14 16:00:32,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 97 transitions, 869 flow, removed 13 selfloop flow, removed 5 redundant places. [2024-06-14 16:00:32,366 INFO L231 Difference]: Finished difference. Result has 89 places, 74 transitions, 689 flow [2024-06-14 16:00:32,366 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=550, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=689, PETRI_PLACES=89, PETRI_TRANSITIONS=74} [2024-06-14 16:00:32,367 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 60 predicate places. [2024-06-14 16:00:32,367 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 74 transitions, 689 flow [2024-06-14 16:00:32,367 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-14 16:00:32,367 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:00:32,367 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:00:32,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-14 16:00:32,367 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 16:00:32,368 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:00:32,368 INFO L85 PathProgramCache]: Analyzing trace with hash 447987146, now seen corresponding path program 2 times [2024-06-14 16:00:32,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:00:32,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247183860] [2024-06-14 16:00:32,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:00:32,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:00:32,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:00:37,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:00:37,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:00:37,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247183860] [2024-06-14 16:00:37,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247183860] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:00:37,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:00:37,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 16:00:37,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338814909] [2024-06-14 16:00:37,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:00:37,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 16:00:37,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:00:37,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 16:00:37,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 16:00:38,095 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 16:00:38,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 74 transitions, 689 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-14 16:00:38,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:00:38,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 16:00:38,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:00:38,485 INFO L124 PetriNetUnfolderBase]: 214/387 cut-off events. [2024-06-14 16:00:38,485 INFO L125 PetriNetUnfolderBase]: For 2806/2806 co-relation queries the response was YES. [2024-06-14 16:00:38,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1984 conditions, 387 events. 214/387 cut-off events. For 2806/2806 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1429 event pairs, 33 based on Foata normal form. 2/388 useless extension candidates. Maximal degree in co-relation 1938. Up to 254 conditions per place. [2024-06-14 16:00:38,488 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 59 selfloop transitions, 37 changer transitions 0/98 dead transitions. [2024-06-14 16:00:38,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 98 transitions, 966 flow [2024-06-14 16:00:38,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 16:00:38,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 16:00:38,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 115 transitions. [2024-06-14 16:00:38,491 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42592592592592593 [2024-06-14 16:00:38,491 INFO L175 Difference]: Start difference. First operand has 89 places, 74 transitions, 689 flow. Second operand 9 states and 115 transitions. [2024-06-14 16:00:38,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 98 transitions, 966 flow [2024-06-14 16:00:38,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 98 transitions, 918 flow, removed 9 selfloop flow, removed 4 redundant places. [2024-06-14 16:00:38,501 INFO L231 Difference]: Finished difference. Result has 94 places, 75 transitions, 726 flow [2024-06-14 16:00:38,502 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=641, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=726, PETRI_PLACES=94, PETRI_TRANSITIONS=75} [2024-06-14 16:00:38,502 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 65 predicate places. [2024-06-14 16:00:38,502 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 75 transitions, 726 flow [2024-06-14 16:00:38,504 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-14 16:00:38,504 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:00:38,504 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:00:38,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-14 16:00:38,504 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 16:00:38,505 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:00:38,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1837979884, now seen corresponding path program 2 times [2024-06-14 16:00:38,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:00:38,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122235135] [2024-06-14 16:00:38,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:00:38,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:00:38,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:00:43,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:00:43,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:00:43,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122235135] [2024-06-14 16:00:43,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122235135] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:00:43,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:00:43,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 16:00:43,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33773873] [2024-06-14 16:00:43,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:00:43,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 16:00:43,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:00:43,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 16:00:43,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 16:00:43,979 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 16:00:43,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 75 transitions, 726 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-14 16:00:43,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:00:43,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 16:00:43,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:00:44,303 INFO L124 PetriNetUnfolderBase]: 220/397 cut-off events. [2024-06-14 16:00:44,303 INFO L125 PetriNetUnfolderBase]: For 3179/3179 co-relation queries the response was YES. [2024-06-14 16:00:44,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2112 conditions, 397 events. 220/397 cut-off events. For 3179/3179 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1486 event pairs, 34 based on Foata normal form. 2/398 useless extension candidates. Maximal degree in co-relation 2064. Up to 297 conditions per place. [2024-06-14 16:00:44,306 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 66 selfloop transitions, 29 changer transitions 0/97 dead transitions. [2024-06-14 16:00:44,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 97 transitions, 982 flow [2024-06-14 16:00:44,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 16:00:44,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 16:00:44,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 113 transitions. [2024-06-14 16:00:44,307 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4185185185185185 [2024-06-14 16:00:44,307 INFO L175 Difference]: Start difference. First operand has 94 places, 75 transitions, 726 flow. Second operand 9 states and 113 transitions. [2024-06-14 16:00:44,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 97 transitions, 982 flow [2024-06-14 16:00:44,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 97 transitions, 922 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-06-14 16:00:44,313 INFO L231 Difference]: Finished difference. Result has 96 places, 77 transitions, 753 flow [2024-06-14 16:00:44,313 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=666, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=753, PETRI_PLACES=96, PETRI_TRANSITIONS=77} [2024-06-14 16:00:44,314 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 67 predicate places. [2024-06-14 16:00:44,314 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 77 transitions, 753 flow [2024-06-14 16:00:44,314 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-14 16:00:44,314 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:00:44,314 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:00:44,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-14 16:00:44,314 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 16:00:44,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:00:44,315 INFO L85 PathProgramCache]: Analyzing trace with hash 450783656, now seen corresponding path program 3 times [2024-06-14 16:00:44,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:00:44,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227761968] [2024-06-14 16:00:44,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:00:44,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:00:44,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:00:49,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:00:49,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:00:49,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227761968] [2024-06-14 16:00:49,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227761968] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:00:49,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:00:49,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 16:00:49,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475587941] [2024-06-14 16:00:49,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:00:49,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 16:00:49,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:00:49,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 16:00:49,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 16:00:49,913 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 16:00:49,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 77 transitions, 753 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-14 16:00:49,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:00:49,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 16:00:49,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:00:50,147 INFO L124 PetriNetUnfolderBase]: 224/405 cut-off events. [2024-06-14 16:00:50,147 INFO L125 PetriNetUnfolderBase]: For 3557/3557 co-relation queries the response was YES. [2024-06-14 16:00:50,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2164 conditions, 405 events. 224/405 cut-off events. For 3557/3557 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1549 event pairs, 38 based on Foata normal form. 2/406 useless extension candidates. Maximal degree in co-relation 2116. Up to 351 conditions per place. [2024-06-14 16:00:50,149 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 71 selfloop transitions, 21 changer transitions 0/94 dead transitions. [2024-06-14 16:00:50,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 94 transitions, 982 flow [2024-06-14 16:00:50,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 16:00:50,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 16:00:50,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2024-06-14 16:00:50,162 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3851851851851852 [2024-06-14 16:00:50,162 INFO L175 Difference]: Start difference. First operand has 96 places, 77 transitions, 753 flow. Second operand 9 states and 104 transitions. [2024-06-14 16:00:50,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 94 transitions, 982 flow [2024-06-14 16:00:50,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 94 transitions, 893 flow, removed 6 selfloop flow, removed 8 redundant places. [2024-06-14 16:00:50,169 INFO L231 Difference]: Finished difference. Result has 97 places, 78 transitions, 719 flow [2024-06-14 16:00:50,169 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=664, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=719, PETRI_PLACES=97, PETRI_TRANSITIONS=78} [2024-06-14 16:00:50,170 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 68 predicate places. [2024-06-14 16:00:50,170 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 78 transitions, 719 flow [2024-06-14 16:00:50,170 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-14 16:00:50,170 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:00:50,171 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:00:50,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-14 16:00:50,171 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 16:00:50,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:00:50,171 INFO L85 PathProgramCache]: Analyzing trace with hash 566259524, now seen corresponding path program 1 times [2024-06-14 16:00:50,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:00:50,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49264334] [2024-06-14 16:00:50,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:00:50,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:00:50,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:00:55,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:00:55,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:00:55,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49264334] [2024-06-14 16:00:55,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49264334] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:00:55,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:00:55,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 16:00:55,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953871446] [2024-06-14 16:00:55,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:00:55,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 16:00:55,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:00:55,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 16:00:55,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 16:00:55,345 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 16:00:55,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 78 transitions, 719 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-14 16:00:55,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:00:55,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 16:00:55,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:00:55,601 INFO L124 PetriNetUnfolderBase]: 231/418 cut-off events. [2024-06-14 16:00:55,602 INFO L125 PetriNetUnfolderBase]: For 3812/3812 co-relation queries the response was YES. [2024-06-14 16:00:55,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2172 conditions, 418 events. 231/418 cut-off events. For 3812/3812 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1601 event pairs, 29 based on Foata normal form. 2/419 useless extension candidates. Maximal degree in co-relation 2123. Up to 364 conditions per place. [2024-06-14 16:00:55,605 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 77 selfloop transitions, 18 changer transitions 0/97 dead transitions. [2024-06-14 16:00:55,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 97 transitions, 971 flow [2024-06-14 16:00:55,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:00:55,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:00:55,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 95 transitions. [2024-06-14 16:00:55,607 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2024-06-14 16:00:55,607 INFO L175 Difference]: Start difference. First operand has 97 places, 78 transitions, 719 flow. Second operand 8 states and 95 transitions. [2024-06-14 16:00:55,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 97 transitions, 971 flow [2024-06-14 16:00:55,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 97 transitions, 897 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-14 16:00:55,613 INFO L231 Difference]: Finished difference. Result has 99 places, 83 transitions, 740 flow [2024-06-14 16:00:55,614 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=645, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=740, PETRI_PLACES=99, PETRI_TRANSITIONS=83} [2024-06-14 16:00:55,614 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 70 predicate places. [2024-06-14 16:00:55,614 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 83 transitions, 740 flow [2024-06-14 16:00:55,614 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-14 16:00:55,615 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:00:55,615 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:00:55,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-14 16:00:55,615 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 16:00:55,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:00:55,615 INFO L85 PathProgramCache]: Analyzing trace with hash 566252580, now seen corresponding path program 3 times [2024-06-14 16:00:55,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:00:55,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194709619] [2024-06-14 16:00:55,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:00:55,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:00:55,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:01:00,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:01:00,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:01:00,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194709619] [2024-06-14 16:01:00,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194709619] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:01:00,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:01:00,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 16:01:00,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565628058] [2024-06-14 16:01:00,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:01:00,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 16:01:00,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:01:00,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 16:01:00,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-14 16:01:00,983 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 16:01:00,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 83 transitions, 740 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-14 16:01:00,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:01:00,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 16:01:00,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:01:01,432 INFO L124 PetriNetUnfolderBase]: 243/438 cut-off events. [2024-06-14 16:01:01,432 INFO L125 PetriNetUnfolderBase]: For 4390/4390 co-relation queries the response was YES. [2024-06-14 16:01:01,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2331 conditions, 438 events. 243/438 cut-off events. For 4390/4390 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1716 event pairs, 34 based on Foata normal form. 2/439 useless extension candidates. Maximal degree in co-relation 2280. Up to 374 conditions per place. [2024-06-14 16:01:01,435 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 82 selfloop transitions, 22 changer transitions 0/106 dead transitions. [2024-06-14 16:01:01,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 106 transitions, 1038 flow [2024-06-14 16:01:01,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 16:01:01,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 16:01:01,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 124 transitions. [2024-06-14 16:01:01,437 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37575757575757573 [2024-06-14 16:01:01,437 INFO L175 Difference]: Start difference. First operand has 99 places, 83 transitions, 740 flow. Second operand 11 states and 124 transitions. [2024-06-14 16:01:01,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 106 transitions, 1038 flow [2024-06-14 16:01:01,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 106 transitions, 1011 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-06-14 16:01:01,443 INFO L231 Difference]: Finished difference. Result has 105 places, 87 transitions, 804 flow [2024-06-14 16:01:01,444 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=713, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=804, PETRI_PLACES=105, PETRI_TRANSITIONS=87} [2024-06-14 16:01:01,444 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 76 predicate places. [2024-06-14 16:01:01,444 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 87 transitions, 804 flow [2024-06-14 16:01:01,444 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-14 16:01:01,444 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:01:01,444 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:01:01,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-14 16:01:01,445 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 16:01:01,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:01:01,445 INFO L85 PathProgramCache]: Analyzing trace with hash 566079600, now seen corresponding path program 4 times [2024-06-14 16:01:01,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:01:01,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534602590] [2024-06-14 16:01:01,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:01:01,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:01:01,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:01:06,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:01:06,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:01:06,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534602590] [2024-06-14 16:01:06,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534602590] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:01:06,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:01:06,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 16:01:06,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470505080] [2024-06-14 16:01:06,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:01:06,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 16:01:06,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:01:06,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 16:01:06,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-14 16:01:07,097 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 16:01:07,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 87 transitions, 804 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-14 16:01:07,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:01:07,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 16:01:07,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:01:07,466 INFO L124 PetriNetUnfolderBase]: 249/448 cut-off events. [2024-06-14 16:01:07,466 INFO L125 PetriNetUnfolderBase]: For 4904/4904 co-relation queries the response was YES. [2024-06-14 16:01:07,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2434 conditions, 448 events. 249/448 cut-off events. For 4904/4904 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1774 event pairs, 36 based on Foata normal form. 2/449 useless extension candidates. Maximal degree in co-relation 2382. Up to 384 conditions per place. [2024-06-14 16:01:07,470 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 83 selfloop transitions, 21 changer transitions 0/106 dead transitions. [2024-06-14 16:01:07,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 106 transitions, 1086 flow [2024-06-14 16:01:07,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 16:01:07,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 16:01:07,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2024-06-14 16:01:07,472 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-14 16:01:07,473 INFO L175 Difference]: Start difference. First operand has 105 places, 87 transitions, 804 flow. Second operand 9 states and 108 transitions. [2024-06-14 16:01:07,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 106 transitions, 1086 flow [2024-06-14 16:01:07,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 106 transitions, 1027 flow, removed 7 selfloop flow, removed 9 redundant places. [2024-06-14 16:01:07,480 INFO L231 Difference]: Finished difference. Result has 105 places, 89 transitions, 822 flow [2024-06-14 16:01:07,481 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=745, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=822, PETRI_PLACES=105, PETRI_TRANSITIONS=89} [2024-06-14 16:01:07,481 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 76 predicate places. [2024-06-14 16:01:07,481 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 89 transitions, 822 flow [2024-06-14 16:01:07,481 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-14 16:01:07,481 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:01:07,482 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:01:07,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-14 16:01:07,482 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 16:01:07,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:01:07,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1722688838, now seen corresponding path program 4 times [2024-06-14 16:01:07,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:01:07,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104707201] [2024-06-14 16:01:07,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:01:07,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:01:07,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:01:13,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:01:13,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:01:13,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104707201] [2024-06-14 16:01:13,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104707201] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:01:13,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:01:13,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 16:01:13,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378930262] [2024-06-14 16:01:13,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:01:13,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 16:01:13,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:01:13,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 16:01:13,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-14 16:01:13,152 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 16:01:13,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 89 transitions, 822 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-14 16:01:13,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:01:13,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 16:01:13,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:01:13,471 INFO L124 PetriNetUnfolderBase]: 253/456 cut-off events. [2024-06-14 16:01:13,471 INFO L125 PetriNetUnfolderBase]: For 5382/5382 co-relation queries the response was YES. [2024-06-14 16:01:13,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2473 conditions, 456 events. 253/456 cut-off events. For 5382/5382 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1814 event pairs, 42 based on Foata normal form. 2/457 useless extension candidates. Maximal degree in co-relation 2421. Up to 417 conditions per place. [2024-06-14 16:01:13,475 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 85 selfloop transitions, 16 changer transitions 0/103 dead transitions. [2024-06-14 16:01:13,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 103 transitions, 1063 flow [2024-06-14 16:01:13,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 16:01:13,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 16:01:13,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 100 transitions. [2024-06-14 16:01:13,477 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37037037037037035 [2024-06-14 16:01:13,477 INFO L175 Difference]: Start difference. First operand has 105 places, 89 transitions, 822 flow. Second operand 9 states and 100 transitions. [2024-06-14 16:01:13,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 103 transitions, 1063 flow [2024-06-14 16:01:13,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 103 transitions, 1010 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-14 16:01:13,487 INFO L231 Difference]: Finished difference. Result has 107 places, 90 transitions, 816 flow [2024-06-14 16:01:13,487 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=769, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=816, PETRI_PLACES=107, PETRI_TRANSITIONS=90} [2024-06-14 16:01:13,488 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 78 predicate places. [2024-06-14 16:01:13,488 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 90 transitions, 816 flow [2024-06-14 16:01:13,488 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-14 16:01:13,489 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:01:13,489 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:01:13,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-14 16:01:13,489 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 16:01:13,489 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:01:13,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1722688714, now seen corresponding path program 5 times [2024-06-14 16:01:13,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:01:13,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077136024] [2024-06-14 16:01:13,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:01:13,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:01:13,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:01:18,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:01:18,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:01:18,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077136024] [2024-06-14 16:01:18,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077136024] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:01:18,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:01:18,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 16:01:18,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547013316] [2024-06-14 16:01:18,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:01:18,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 16:01:18,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:01:18,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 16:01:18,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-14 16:01:18,603 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 16:01:18,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 90 transitions, 816 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-14 16:01:18,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:01:18,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 16:01:18,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:01:18,952 INFO L124 PetriNetUnfolderBase]: 259/466 cut-off events. [2024-06-14 16:01:18,953 INFO L125 PetriNetUnfolderBase]: For 5847/5847 co-relation queries the response was YES. [2024-06-14 16:01:18,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2520 conditions, 466 events. 259/466 cut-off events. For 5847/5847 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1869 event pairs, 33 based on Foata normal form. 2/467 useless extension candidates. Maximal degree in co-relation 2467. Up to 370 conditions per place. [2024-06-14 16:01:18,956 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 75 selfloop transitions, 32 changer transitions 0/109 dead transitions. [2024-06-14 16:01:18,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 109 transitions, 1102 flow [2024-06-14 16:01:18,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 16:01:18,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 16:01:18,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 111 transitions. [2024-06-14 16:01:18,958 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4111111111111111 [2024-06-14 16:01:18,958 INFO L175 Difference]: Start difference. First operand has 107 places, 90 transitions, 816 flow. Second operand 9 states and 111 transitions. [2024-06-14 16:01:18,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 109 transitions, 1102 flow [2024-06-14 16:01:18,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 109 transitions, 1066 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-14 16:01:18,967 INFO L231 Difference]: Finished difference. Result has 109 places, 92 transitions, 877 flow [2024-06-14 16:01:18,967 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=780, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=877, PETRI_PLACES=109, PETRI_TRANSITIONS=92} [2024-06-14 16:01:18,967 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 80 predicate places. [2024-06-14 16:01:18,968 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 92 transitions, 877 flow [2024-06-14 16:01:18,968 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-14 16:01:18,968 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:01:18,968 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:01:18,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-14 16:01:18,968 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 16:01:18,968 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:01:18,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1104369530, now seen corresponding path program 6 times [2024-06-14 16:01:18,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:01:18,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054645472] [2024-06-14 16:01:18,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:01:18,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:01:19,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:01:24,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:01:24,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:01:24,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054645472] [2024-06-14 16:01:24,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054645472] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:01:24,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:01:24,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 16:01:24,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777283175] [2024-06-14 16:01:24,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:01:24,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 16:01:24,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:01:24,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 16:01:24,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-14 16:01:24,667 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 16:01:24,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 92 transitions, 877 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-14 16:01:24,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:01:24,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 16:01:24,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:01:25,045 INFO L124 PetriNetUnfolderBase]: 255/460 cut-off events. [2024-06-14 16:01:25,045 INFO L125 PetriNetUnfolderBase]: For 5972/5972 co-relation queries the response was YES. [2024-06-14 16:01:25,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2522 conditions, 460 events. 255/460 cut-off events. For 5972/5972 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1841 event pairs, 33 based on Foata normal form. 2/461 useless extension candidates. Maximal degree in co-relation 2468. Up to 379 conditions per place. [2024-06-14 16:01:25,048 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 89 selfloop transitions, 23 changer transitions 0/114 dead transitions. [2024-06-14 16:01:25,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 114 transitions, 1203 flow [2024-06-14 16:01:25,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:01:25,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:01:25,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2024-06-14 16:01:25,049 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44583333333333336 [2024-06-14 16:01:25,049 INFO L175 Difference]: Start difference. First operand has 109 places, 92 transitions, 877 flow. Second operand 8 states and 107 transitions. [2024-06-14 16:01:25,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 114 transitions, 1203 flow [2024-06-14 16:01:25,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 114 transitions, 1126 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-14 16:01:25,063 INFO L231 Difference]: Finished difference. Result has 110 places, 92 transitions, 851 flow [2024-06-14 16:01:25,063 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=800, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=851, PETRI_PLACES=110, PETRI_TRANSITIONS=92} [2024-06-14 16:01:25,064 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 81 predicate places. [2024-06-14 16:01:25,064 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 92 transitions, 851 flow [2024-06-14 16:01:25,064 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-14 16:01:25,064 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:01:25,064 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:01:25,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-14 16:01:25,064 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 16:01:25,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:01:25,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1104191900, now seen corresponding path program 7 times [2024-06-14 16:01:25,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:01:25,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043197661] [2024-06-14 16:01:25,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:01:25,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:01:25,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:01:30,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:01:30,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:01:30,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043197661] [2024-06-14 16:01:30,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043197661] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:01:30,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:01:30,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 16:01:30,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975061392] [2024-06-14 16:01:30,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:01:30,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 16:01:30,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:01:30,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 16:01:30,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-14 16:01:30,632 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 16:01:30,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 92 transitions, 851 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-14 16:01:30,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:01:30,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 16:01:30,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:01:30,987 INFO L124 PetriNetUnfolderBase]: 267/480 cut-off events. [2024-06-14 16:01:30,987 INFO L125 PetriNetUnfolderBase]: For 6504/6504 co-relation queries the response was YES. [2024-06-14 16:01:30,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2636 conditions, 480 events. 267/480 cut-off events. For 6504/6504 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 1966 event pairs, 39 based on Foata normal form. 2/481 useless extension candidates. Maximal degree in co-relation 2581. Up to 416 conditions per place. [2024-06-14 16:01:30,991 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 89 selfloop transitions, 19 changer transitions 0/110 dead transitions. [2024-06-14 16:01:30,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 110 transitions, 1161 flow [2024-06-14 16:01:30,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:01:30,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:01:30,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2024-06-14 16:01:30,992 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-14 16:01:30,992 INFO L175 Difference]: Start difference. First operand has 110 places, 92 transitions, 851 flow. Second operand 8 states and 96 transitions. [2024-06-14 16:01:30,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 110 transitions, 1161 flow [2024-06-14 16:01:31,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 110 transitions, 1051 flow, removed 10 selfloop flow, removed 7 redundant places. [2024-06-14 16:01:31,004 INFO L231 Difference]: Finished difference. Result has 111 places, 96 transitions, 844 flow [2024-06-14 16:01:31,004 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=752, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=844, PETRI_PLACES=111, PETRI_TRANSITIONS=96} [2024-06-14 16:01:31,004 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 82 predicate places. [2024-06-14 16:01:31,004 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 96 transitions, 844 flow [2024-06-14 16:01:31,005 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-14 16:01:31,005 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:01:31,005 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:01:31,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-14 16:01:31,005 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 16:01:31,005 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:01:31,005 INFO L85 PathProgramCache]: Analyzing trace with hash -87035074, now seen corresponding path program 8 times [2024-06-14 16:01:31,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:01:31,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559200453] [2024-06-14 16:01:31,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:01:31,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:01:31,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:01:36,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:01:36,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:01:36,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559200453] [2024-06-14 16:01:36,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559200453] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:01:36,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:01:36,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 16:01:36,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027138741] [2024-06-14 16:01:36,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:01:36,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 16:01:36,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:01:36,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 16:01:36,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-14 16:01:36,485 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 16:01:36,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 96 transitions, 844 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-14 16:01:36,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:01:36,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 16:01:36,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:01:36,817 INFO L124 PetriNetUnfolderBase]: 266/479 cut-off events. [2024-06-14 16:01:36,818 INFO L125 PetriNetUnfolderBase]: For 6374/6374 co-relation queries the response was YES. [2024-06-14 16:01:36,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2514 conditions, 479 events. 266/479 cut-off events. For 6374/6374 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 1974 event pairs, 35 based on Foata normal form. 2/480 useless extension candidates. Maximal degree in co-relation 2458. Up to 398 conditions per place. [2024-06-14 16:01:36,821 INFO L140 encePairwiseOnDemand]: 19/30 looper letters, 89 selfloop transitions, 25 changer transitions 0/116 dead transitions. [2024-06-14 16:01:36,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 116 transitions, 1136 flow [2024-06-14 16:01:36,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:01:36,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:01:36,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 102 transitions. [2024-06-14 16:01:36,824 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.425 [2024-06-14 16:01:36,824 INFO L175 Difference]: Start difference. First operand has 111 places, 96 transitions, 844 flow. Second operand 8 states and 102 transitions. [2024-06-14 16:01:36,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 116 transitions, 1136 flow [2024-06-14 16:01:36,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 116 transitions, 1060 flow, removed 19 selfloop flow, removed 6 redundant places. [2024-06-14 16:01:36,836 INFO L231 Difference]: Finished difference. Result has 114 places, 98 transitions, 853 flow [2024-06-14 16:01:36,836 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=768, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=853, PETRI_PLACES=114, PETRI_TRANSITIONS=98} [2024-06-14 16:01:36,836 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 85 predicate places. [2024-06-14 16:01:36,836 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 98 transitions, 853 flow [2024-06-14 16:01:36,836 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-14 16:01:36,836 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:01:36,836 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:01:36,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-14 16:01:36,837 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 16:01:36,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:01:36,837 INFO L85 PathProgramCache]: Analyzing trace with hash -86855150, now seen corresponding path program 2 times [2024-06-14 16:01:36,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:01:36,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454562932] [2024-06-14 16:01:36,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:01:36,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:01:36,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:01:42,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:01:42,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:01:42,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454562932] [2024-06-14 16:01:42,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454562932] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:01:42,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:01:42,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 16:01:42,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425124537] [2024-06-14 16:01:42,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:01:42,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 16:01:42,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:01:42,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 16:01:42,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 16:01:42,171 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 16:01:42,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 98 transitions, 853 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-14 16:01:42,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:01:42,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 16:01:42,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:01:42,414 INFO L124 PetriNetUnfolderBase]: 270/487 cut-off events. [2024-06-14 16:01:42,414 INFO L125 PetriNetUnfolderBase]: For 6679/6679 co-relation queries the response was YES. [2024-06-14 16:01:42,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2538 conditions, 487 events. 270/487 cut-off events. For 6679/6679 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2006 event pairs, 36 based on Foata normal form. 2/488 useless extension candidates. Maximal degree in co-relation 2482. Up to 436 conditions per place. [2024-06-14 16:01:42,417 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 93 selfloop transitions, 16 changer transitions 0/111 dead transitions. [2024-06-14 16:01:42,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 111 transitions, 1107 flow [2024-06-14 16:01:42,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 16:01:42,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 16:01:42,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 83 transitions. [2024-06-14 16:01:42,427 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3952380952380952 [2024-06-14 16:01:42,427 INFO L175 Difference]: Start difference. First operand has 114 places, 98 transitions, 853 flow. Second operand 7 states and 83 transitions. [2024-06-14 16:01:42,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 111 transitions, 1107 flow [2024-06-14 16:01:42,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 111 transitions, 1045 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-14 16:01:42,437 INFO L231 Difference]: Finished difference. Result has 115 places, 99 transitions, 837 flow [2024-06-14 16:01:42,437 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=791, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=837, PETRI_PLACES=115, PETRI_TRANSITIONS=99} [2024-06-14 16:01:42,438 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 86 predicate places. [2024-06-14 16:01:42,438 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 99 transitions, 837 flow [2024-06-14 16:01:42,438 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-14 16:01:42,438 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:01:42,438 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:01:42,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-14 16:01:42,438 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 16:01:42,439 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:01:42,439 INFO L85 PathProgramCache]: Analyzing trace with hash -87039848, now seen corresponding path program 5 times [2024-06-14 16:01:42,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:01:42,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544640864] [2024-06-14 16:01:42,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:01:42,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:01:42,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:01:47,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:01:47,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:01:47,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544640864] [2024-06-14 16:01:47,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544640864] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:01:47,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:01:47,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 16:01:47,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843348485] [2024-06-14 16:01:47,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:01:47,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 16:01:47,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:01:47,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 16:01:47,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-14 16:01:48,074 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 16:01:48,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 99 transitions, 837 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-14 16:01:48,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:01:48,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 16:01:48,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:01:48,375 INFO L124 PetriNetUnfolderBase]: 267/482 cut-off events. [2024-06-14 16:01:48,376 INFO L125 PetriNetUnfolderBase]: For 6499/6499 co-relation queries the response was YES. [2024-06-14 16:01:48,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2459 conditions, 482 events. 267/482 cut-off events. For 6499/6499 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 1976 event pairs, 29 based on Foata normal form. 2/483 useless extension candidates. Maximal degree in co-relation 2402. Up to 410 conditions per place. [2024-06-14 16:01:48,379 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 96 selfloop transitions, 19 changer transitions 0/117 dead transitions. [2024-06-14 16:01:48,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 117 transitions, 1111 flow [2024-06-14 16:01:48,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:01:48,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:01:48,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 99 transitions. [2024-06-14 16:01:48,382 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4125 [2024-06-14 16:01:48,382 INFO L175 Difference]: Start difference. First operand has 115 places, 99 transitions, 837 flow. Second operand 8 states and 99 transitions. [2024-06-14 16:01:48,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 117 transitions, 1111 flow [2024-06-14 16:01:48,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 117 transitions, 1081 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-14 16:01:48,393 INFO L231 Difference]: Finished difference. Result has 119 places, 99 transitions, 851 flow [2024-06-14 16:01:48,393 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=807, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=851, PETRI_PLACES=119, PETRI_TRANSITIONS=99} [2024-06-14 16:01:48,394 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 90 predicate places. [2024-06-14 16:01:48,394 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 99 transitions, 851 flow [2024-06-14 16:01:48,394 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-14 16:01:48,394 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:01:48,394 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:01:48,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-14 16:01:48,395 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 16:01:48,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:01:48,395 INFO L85 PathProgramCache]: Analyzing trace with hash 141046000, now seen corresponding path program 3 times [2024-06-14 16:01:48,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:01:48,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088811475] [2024-06-14 16:01:48,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:01:48,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:01:48,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:01:53,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-14 16:01:53,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:01:53,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088811475] [2024-06-14 16:01:53,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088811475] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:01:53,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:01:53,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 16:01:53,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088937410] [2024-06-14 16:01:53,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:01:53,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 16:01:53,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:01:53,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 16:01:53,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 16:01:53,298 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 16:01:53,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 99 transitions, 851 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-14 16:01:53,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:01:53,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 16:01:53,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:01:53,566 INFO L124 PetriNetUnfolderBase]: 271/490 cut-off events. [2024-06-14 16:01:53,566 INFO L125 PetriNetUnfolderBase]: For 6487/6487 co-relation queries the response was YES. [2024-06-14 16:01:53,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2494 conditions, 490 events. 271/490 cut-off events. For 6487/6487 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2025 event pairs, 34 based on Foata normal form. 2/491 useless extension candidates. Maximal degree in co-relation 2436. Up to 416 conditions per place. [2024-06-14 16:01:53,570 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 88 selfloop transitions, 21 changer transitions 0/111 dead transitions. [2024-06-14 16:01:53,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 111 transitions, 1103 flow [2024-06-14 16:01:53,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 16:01:53,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 16:01:53,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2024-06-14 16:01:53,571 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42777777777777776 [2024-06-14 16:01:53,571 INFO L175 Difference]: Start difference. First operand has 119 places, 99 transitions, 851 flow. Second operand 6 states and 77 transitions. [2024-06-14 16:01:53,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 111 transitions, 1103 flow [2024-06-14 16:01:53,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 111 transitions, 1049 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-14 16:01:53,582 INFO L231 Difference]: Finished difference. Result has 117 places, 100 transitions, 856 flow [2024-06-14 16:01:53,582 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=797, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=856, PETRI_PLACES=117, PETRI_TRANSITIONS=100} [2024-06-14 16:01:53,582 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 88 predicate places. [2024-06-14 16:01:53,582 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 100 transitions, 856 flow [2024-06-14 16:01:53,583 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-14 16:01:53,583 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:01:53,583 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:01:53,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-14 16:01:53,583 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 16:01:53,583 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:01:53,584 INFO L85 PathProgramCache]: Analyzing trace with hash 141039056, now seen corresponding path program 9 times [2024-06-14 16:01:53,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:01:53,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719629513] [2024-06-14 16:01:53,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:01:53,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:01:53,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:01:58,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:01:58,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:01:58,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719629513] [2024-06-14 16:01:58,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719629513] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:01:58,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:01:58,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 16:01:58,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507572428] [2024-06-14 16:01:58,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:01:58,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 16:01:58,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:01:58,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 16:01:58,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-14 16:01:58,671 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 16:01:58,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 100 transitions, 856 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-14 16:01:58,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:01:58,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 16:01:58,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:01:59,017 INFO L124 PetriNetUnfolderBase]: 267/484 cut-off events. [2024-06-14 16:01:59,018 INFO L125 PetriNetUnfolderBase]: For 5957/5957 co-relation queries the response was YES. [2024-06-14 16:01:59,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2421 conditions, 484 events. 267/484 cut-off events. For 5957/5957 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2014 event pairs, 42 based on Foata normal form. 2/485 useless extension candidates. Maximal degree in co-relation 2363. Up to 400 conditions per place. [2024-06-14 16:01:59,021 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 90 selfloop transitions, 29 changer transitions 0/121 dead transitions. [2024-06-14 16:01:59,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 121 transitions, 1168 flow [2024-06-14 16:01:59,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 16:01:59,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 16:01:59,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 98 transitions. [2024-06-14 16:01:59,022 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2024-06-14 16:01:59,022 INFO L175 Difference]: Start difference. First operand has 117 places, 100 transitions, 856 flow. Second operand 7 states and 98 transitions. [2024-06-14 16:01:59,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 121 transitions, 1168 flow [2024-06-14 16:01:59,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 121 transitions, 1127 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-14 16:01:59,033 INFO L231 Difference]: Finished difference. Result has 120 places, 102 transitions, 911 flow [2024-06-14 16:01:59,033 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=815, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=911, PETRI_PLACES=120, PETRI_TRANSITIONS=102} [2024-06-14 16:01:59,033 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 91 predicate places. [2024-06-14 16:01:59,033 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 102 transitions, 911 flow [2024-06-14 16:01:59,034 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-14 16:01:59,034 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:01:59,034 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:01:59,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-14 16:01:59,034 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 16:01:59,034 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:01:59,034 INFO L85 PathProgramCache]: Analyzing trace with hash 149616880, now seen corresponding path program 4 times [2024-06-14 16:01:59,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:01:59,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707732952] [2024-06-14 16:01:59,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:01:59,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:01:59,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:02:03,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:02:03,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:02:03,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707732952] [2024-06-14 16:02:03,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707732952] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:02:03,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:02:03,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 16:02:03,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684868628] [2024-06-14 16:02:03,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:02:03,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 16:02:03,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:02:03,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 16:02:03,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 16:02:04,132 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 16:02:04,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 102 transitions, 911 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-14 16:02:04,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:02:04,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 16:02:04,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:02:04,387 INFO L124 PetriNetUnfolderBase]: 264/479 cut-off events. [2024-06-14 16:02:04,387 INFO L125 PetriNetUnfolderBase]: For 5296/5296 co-relation queries the response was YES. [2024-06-14 16:02:04,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2401 conditions, 479 events. 264/479 cut-off events. For 5296/5296 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 1989 event pairs, 41 based on Foata normal form. 2/480 useless extension candidates. Maximal degree in co-relation 2342. Up to 447 conditions per place. [2024-06-14 16:02:04,390 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 99 selfloop transitions, 9 changer transitions 0/110 dead transitions. [2024-06-14 16:02:04,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 110 transitions, 1145 flow [2024-06-14 16:02:04,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 16:02:04,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 16:02:04,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2024-06-14 16:02:04,390 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2024-06-14 16:02:04,391 INFO L175 Difference]: Start difference. First operand has 120 places, 102 transitions, 911 flow. Second operand 6 states and 70 transitions. [2024-06-14 16:02:04,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 110 transitions, 1145 flow [2024-06-14 16:02:04,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 110 transitions, 1072 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-14 16:02:04,401 INFO L231 Difference]: Finished difference. Result has 120 places, 102 transitions, 860 flow [2024-06-14 16:02:04,401 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=838, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=860, PETRI_PLACES=120, PETRI_TRANSITIONS=102} [2024-06-14 16:02:04,401 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 91 predicate places. [2024-06-14 16:02:04,402 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 102 transitions, 860 flow [2024-06-14 16:02:04,402 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-14 16:02:04,402 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:02:04,402 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:02:04,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-14 16:02:04,402 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 16:02:04,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:02:04,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1002614340, now seen corresponding path program 1 times [2024-06-14 16:02:04,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:02:04,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086734629] [2024-06-14 16:02:04,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:02:04,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:02:04,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:02:09,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:02:09,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:02:09,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086734629] [2024-06-14 16:02:09,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086734629] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:02:09,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:02:09,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 16:02:09,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251598438] [2024-06-14 16:02:09,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:02:09,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 16:02:09,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:02:09,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 16:02:09,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-14 16:02:09,841 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 16:02:09,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 102 transitions, 860 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-14 16:02:09,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:02:09,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 16:02:09,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:02:10,288 INFO L124 PetriNetUnfolderBase]: 291/540 cut-off events. [2024-06-14 16:02:10,288 INFO L125 PetriNetUnfolderBase]: For 8272/8272 co-relation queries the response was YES. [2024-06-14 16:02:10,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2642 conditions, 540 events. 291/540 cut-off events. For 8272/8272 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2315 event pairs, 40 based on Foata normal form. 8/547 useless extension candidates. Maximal degree in co-relation 2583. Up to 177 conditions per place. [2024-06-14 16:02:10,292 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 58 selfloop transitions, 60 changer transitions 13/133 dead transitions. [2024-06-14 16:02:10,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 133 transitions, 1268 flow [2024-06-14 16:02:10,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 16:02:10,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 16:02:10,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2024-06-14 16:02:10,293 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43 [2024-06-14 16:02:10,293 INFO L175 Difference]: Start difference. First operand has 120 places, 102 transitions, 860 flow. Second operand 10 states and 129 transitions. [2024-06-14 16:02:10,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 133 transitions, 1268 flow [2024-06-14 16:02:10,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 133 transitions, 1230 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-14 16:02:10,306 INFO L231 Difference]: Finished difference. Result has 125 places, 99 transitions, 920 flow [2024-06-14 16:02:10,306 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=822, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=920, PETRI_PLACES=125, PETRI_TRANSITIONS=99} [2024-06-14 16:02:10,306 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 96 predicate places. [2024-06-14 16:02:10,306 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 99 transitions, 920 flow [2024-06-14 16:02:10,306 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-14 16:02:10,307 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:02:10,307 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:02:10,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-14 16:02:10,307 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 16:02:10,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:02:10,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1002700830, now seen corresponding path program 2 times [2024-06-14 16:02:10,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:02:10,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975283420] [2024-06-14 16:02:10,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:02:10,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:02:10,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:02:15,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:02:15,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:02:15,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975283420] [2024-06-14 16:02:15,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975283420] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:02:15,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:02:15,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 16:02:15,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900485062] [2024-06-14 16:02:15,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:02:15,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 16:02:15,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:02:15,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 16:02:15,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-14 16:02:15,910 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 16:02:15,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 99 transitions, 920 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-14 16:02:15,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:02:15,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 16:02:15,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:02:16,318 INFO L124 PetriNetUnfolderBase]: 304/569 cut-off events. [2024-06-14 16:02:16,318 INFO L125 PetriNetUnfolderBase]: For 12091/12091 co-relation queries the response was YES. [2024-06-14 16:02:16,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3103 conditions, 569 events. 304/569 cut-off events. For 12091/12091 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2547 event pairs, 47 based on Foata normal form. 8/576 useless extension candidates. Maximal degree in co-relation 3043. Up to 254 conditions per place. [2024-06-14 16:02:16,322 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 60 selfloop transitions, 60 changer transitions 7/129 dead transitions. [2024-06-14 16:02:16,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 129 transitions, 1336 flow [2024-06-14 16:02:16,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 16:02:16,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 16:02:16,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 130 transitions. [2024-06-14 16:02:16,323 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2024-06-14 16:02:16,323 INFO L175 Difference]: Start difference. First operand has 125 places, 99 transitions, 920 flow. Second operand 10 states and 130 transitions. [2024-06-14 16:02:16,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 129 transitions, 1336 flow [2024-06-14 16:02:16,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 129 transitions, 1232 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-14 16:02:16,339 INFO L231 Difference]: Finished difference. Result has 123 places, 97 transitions, 928 flow [2024-06-14 16:02:16,339 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=820, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=928, PETRI_PLACES=123, PETRI_TRANSITIONS=97} [2024-06-14 16:02:16,340 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 94 predicate places. [2024-06-14 16:02:16,340 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 97 transitions, 928 flow [2024-06-14 16:02:16,340 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-14 16:02:16,340 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:02:16,340 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:02:16,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-14 16:02:16,340 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 16:02:16,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:02:16,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1002704550, now seen corresponding path program 3 times [2024-06-14 16:02:16,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:02:16,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939725854] [2024-06-14 16:02:16,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:02:16,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:02:16,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:02:22,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:02:22,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:02:22,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939725854] [2024-06-14 16:02:22,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939725854] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:02:22,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:02:22,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 16:02:22,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865814173] [2024-06-14 16:02:22,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:02:22,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 16:02:22,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:02:22,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 16:02:22,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-14 16:02:22,311 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 16:02:22,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 97 transitions, 928 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-14 16:02:22,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:02:22,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 16:02:22,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:02:22,679 INFO L124 PetriNetUnfolderBase]: 277/516 cut-off events. [2024-06-14 16:02:22,679 INFO L125 PetriNetUnfolderBase]: For 9109/9109 co-relation queries the response was YES. [2024-06-14 16:02:22,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2822 conditions, 516 events. 277/516 cut-off events. For 9109/9109 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2218 event pairs, 44 based on Foata normal form. 6/521 useless extension candidates. Maximal degree in co-relation 2763. Up to 318 conditions per place. [2024-06-14 16:02:22,682 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 69 selfloop transitions, 51 changer transitions 0/122 dead transitions. [2024-06-14 16:02:22,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 122 transitions, 1254 flow [2024-06-14 16:02:22,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 16:02:22,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 16:02:22,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 122 transitions. [2024-06-14 16:02:22,684 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4066666666666667 [2024-06-14 16:02:22,684 INFO L175 Difference]: Start difference. First operand has 123 places, 97 transitions, 928 flow. Second operand 10 states and 122 transitions. [2024-06-14 16:02:22,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 122 transitions, 1254 flow [2024-06-14 16:02:22,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 122 transitions, 1132 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-14 16:02:22,697 INFO L231 Difference]: Finished difference. Result has 122 places, 99 transitions, 942 flow [2024-06-14 16:02:22,698 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=806, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=942, PETRI_PLACES=122, PETRI_TRANSITIONS=99} [2024-06-14 16:02:22,698 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 93 predicate places. [2024-06-14 16:02:22,698 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 99 transitions, 942 flow [2024-06-14 16:02:22,698 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-14 16:02:22,698 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:02:22,698 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:02:22,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-14 16:02:22,699 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 16:02:22,699 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:02:22,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1089540510, now seen corresponding path program 4 times [2024-06-14 16:02:22,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:02:22,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884800134] [2024-06-14 16:02:22,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:02:22,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:02:22,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:02:29,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:02:29,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:02:29,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884800134] [2024-06-14 16:02:29,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884800134] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:02:29,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:02:29,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 16:02:29,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988526529] [2024-06-14 16:02:29,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:02:29,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 16:02:29,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:02:29,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 16:02:29,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 16:02:30,043 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 16:02:30,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 99 transitions, 942 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-14 16:02:30,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:02:30,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 16:02:30,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:02:30,436 INFO L124 PetriNetUnfolderBase]: 305/580 cut-off events. [2024-06-14 16:02:30,436 INFO L125 PetriNetUnfolderBase]: For 11402/11402 co-relation queries the response was YES. [2024-06-14 16:02:30,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3015 conditions, 580 events. 305/580 cut-off events. For 11402/11402 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2648 event pairs, 64 based on Foata normal form. 18/597 useless extension candidates. Maximal degree in co-relation 2957. Up to 409 conditions per place. [2024-06-14 16:02:30,439 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 82 selfloop transitions, 25 changer transitions 16/125 dead transitions. [2024-06-14 16:02:30,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 125 transitions, 1284 flow [2024-06-14 16:02:30,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 16:02:30,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 16:02:30,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 123 transitions. [2024-06-14 16:02:30,440 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41 [2024-06-14 16:02:30,440 INFO L175 Difference]: Start difference. First operand has 122 places, 99 transitions, 942 flow. Second operand 10 states and 123 transitions. [2024-06-14 16:02:30,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 125 transitions, 1284 flow [2024-06-14 16:02:30,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 125 transitions, 1166 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-06-14 16:02:30,454 INFO L231 Difference]: Finished difference. Result has 124 places, 94 transitions, 840 flow [2024-06-14 16:02:30,454 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=824, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=840, PETRI_PLACES=124, PETRI_TRANSITIONS=94} [2024-06-14 16:02:30,455 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 95 predicate places. [2024-06-14 16:02:30,455 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 94 transitions, 840 flow [2024-06-14 16:02:30,455 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-14 16:02:30,455 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:02:30,455 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:02:30,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-14 16:02:30,455 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 16:02:30,455 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:02:30,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1089396360, now seen corresponding path program 5 times [2024-06-14 16:02:30,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:02:30,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236020655] [2024-06-14 16:02:30,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:02:30,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:02:30,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:02:35,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:02:35,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:02:35,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236020655] [2024-06-14 16:02:35,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236020655] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:02:35,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:02:35,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 16:02:35,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487878707] [2024-06-14 16:02:35,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:02:35,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 16:02:35,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:02:35,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 16:02:35,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 16:02:36,074 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 16:02:36,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 94 transitions, 840 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-14 16:02:36,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:02:36,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 16:02:36,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:02:36,367 INFO L124 PetriNetUnfolderBase]: 279/530 cut-off events. [2024-06-14 16:02:36,367 INFO L125 PetriNetUnfolderBase]: For 9960/9960 co-relation queries the response was YES. [2024-06-14 16:02:36,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2746 conditions, 530 events. 279/530 cut-off events. For 9960/9960 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2331 event pairs, 56 based on Foata normal form. 10/539 useless extension candidates. Maximal degree in co-relation 2687. Up to 368 conditions per place. [2024-06-14 16:02:36,371 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 69 selfloop transitions, 36 changer transitions 11/118 dead transitions. [2024-06-14 16:02:36,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 118 transitions, 1158 flow [2024-06-14 16:02:36,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 16:02:36,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 16:02:36,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 122 transitions. [2024-06-14 16:02:36,372 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4066666666666667 [2024-06-14 16:02:36,372 INFO L175 Difference]: Start difference. First operand has 124 places, 94 transitions, 840 flow. Second operand 10 states and 122 transitions. [2024-06-14 16:02:36,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 118 transitions, 1158 flow [2024-06-14 16:02:36,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 118 transitions, 1081 flow, removed 1 selfloop flow, removed 11 redundant places. [2024-06-14 16:02:36,385 INFO L231 Difference]: Finished difference. Result has 120 places, 91 transitions, 818 flow [2024-06-14 16:02:36,386 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=763, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=818, PETRI_PLACES=120, PETRI_TRANSITIONS=91} [2024-06-14 16:02:36,386 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 91 predicate places. [2024-06-14 16:02:36,386 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 91 transitions, 818 flow [2024-06-14 16:02:36,386 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-14 16:02:36,386 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:02:36,386 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:02:36,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-14 16:02:36,387 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 16:02:36,387 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:02:36,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1089392640, now seen corresponding path program 6 times [2024-06-14 16:02:36,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:02:36,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767146509] [2024-06-14 16:02:36,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:02:36,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:02:36,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:02:42,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:02:42,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:02:42,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767146509] [2024-06-14 16:02:42,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767146509] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:02:42,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:02:42,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 16:02:42,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774522634] [2024-06-14 16:02:42,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:02:42,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 16:02:42,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:02:42,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 16:02:42,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 16:02:42,379 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 16:02:42,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 91 transitions, 818 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-14 16:02:42,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:02:42,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 16:02:42,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:02:42,693 INFO L124 PetriNetUnfolderBase]: 267/510 cut-off events. [2024-06-14 16:02:42,693 INFO L125 PetriNetUnfolderBase]: For 9374/9374 co-relation queries the response was YES. [2024-06-14 16:02:42,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2655 conditions, 510 events. 267/510 cut-off events. For 9374/9374 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2232 event pairs, 46 based on Foata normal form. 8/517 useless extension candidates. Maximal degree in co-relation 2598. Up to 384 conditions per place. [2024-06-14 16:02:42,696 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 76 selfloop transitions, 23 changer transitions 13/114 dead transitions. [2024-06-14 16:02:42,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 114 transitions, 1116 flow [2024-06-14 16:02:42,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 16:02:42,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 16:02:42,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2024-06-14 16:02:42,707 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39 [2024-06-14 16:02:42,707 INFO L175 Difference]: Start difference. First operand has 120 places, 91 transitions, 818 flow. Second operand 10 states and 117 transitions. [2024-06-14 16:02:42,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 114 transitions, 1116 flow [2024-06-14 16:02:42,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 114 transitions, 1040 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-14 16:02:42,720 INFO L231 Difference]: Finished difference. Result has 118 places, 87 transitions, 759 flow [2024-06-14 16:02:42,720 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=742, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=759, PETRI_PLACES=118, PETRI_TRANSITIONS=87} [2024-06-14 16:02:42,721 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 89 predicate places. [2024-06-14 16:02:42,721 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 87 transitions, 759 flow [2024-06-14 16:02:42,721 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-14 16:02:42,721 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:02:42,721 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:02:42,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-14 16:02:42,721 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 16:02:42,722 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:02:42,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1703213556, now seen corresponding path program 1 times [2024-06-14 16:02:42,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:02:42,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254134592] [2024-06-14 16:02:42,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:02:42,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:02:42,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:02:48,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:02:48,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:02:48,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254134592] [2024-06-14 16:02:48,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254134592] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:02:48,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:02:48,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 16:02:48,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041557856] [2024-06-14 16:02:48,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:02:48,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 16:02:48,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:02:48,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 16:02:48,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 16:02:48,245 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 16:02:48,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 87 transitions, 759 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-14 16:02:48,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:02:48,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 16:02:48,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:02:48,614 INFO L124 PetriNetUnfolderBase]: 251/474 cut-off events. [2024-06-14 16:02:48,614 INFO L125 PetriNetUnfolderBase]: For 7126/7126 co-relation queries the response was YES. [2024-06-14 16:02:48,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2474 conditions, 474 events. 251/474 cut-off events. For 7126/7126 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2004 event pairs, 50 based on Foata normal form. 2/475 useless extension candidates. Maximal degree in co-relation 2418. Up to 412 conditions per place. [2024-06-14 16:02:48,616 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 84 selfloop transitions, 21 changer transitions 0/107 dead transitions. [2024-06-14 16:02:48,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 107 transitions, 1025 flow [2024-06-14 16:02:48,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 16:02:48,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 16:02:48,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 123 transitions. [2024-06-14 16:02:48,629 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37272727272727274 [2024-06-14 16:02:48,630 INFO L175 Difference]: Start difference. First operand has 118 places, 87 transitions, 759 flow. Second operand 11 states and 123 transitions. [2024-06-14 16:02:48,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 107 transitions, 1025 flow [2024-06-14 16:02:48,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 107 transitions, 973 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-06-14 16:02:48,640 INFO L231 Difference]: Finished difference. Result has 114 places, 88 transitions, 761 flow [2024-06-14 16:02:48,640 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=707, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=761, PETRI_PLACES=114, PETRI_TRANSITIONS=88} [2024-06-14 16:02:48,640 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 85 predicate places. [2024-06-14 16:02:48,640 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 88 transitions, 761 flow [2024-06-14 16:02:48,641 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-14 16:02:48,641 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:02:48,641 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:02:48,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-14 16:02:48,641 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 16:02:48,641 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:02:48,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1858234984, now seen corresponding path program 7 times [2024-06-14 16:02:48,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:02:48,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290699734] [2024-06-14 16:02:48,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:02:48,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:02:48,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:02:54,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:02:54,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:02:54,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290699734] [2024-06-14 16:02:54,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290699734] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:02:54,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:02:54,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 16:02:54,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085977745] [2024-06-14 16:02:54,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:02:54,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 16:02:54,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:02:54,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 16:02:54,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-14 16:02:54,261 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 16:02:54,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 88 transitions, 761 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-14 16:02:54,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:02:54,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 16:02:54,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:02:54,714 INFO L124 PetriNetUnfolderBase]: 267/510 cut-off events. [2024-06-14 16:02:54,714 INFO L125 PetriNetUnfolderBase]: For 7776/7776 co-relation queries the response was YES. [2024-06-14 16:02:54,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2553 conditions, 510 events. 267/510 cut-off events. For 7776/7776 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2225 event pairs, 60 based on Foata normal form. 10/519 useless extension candidates. Maximal degree in co-relation 2499. Up to 404 conditions per place. [2024-06-14 16:02:54,717 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 81 selfloop transitions, 19 changer transitions 11/113 dead transitions. [2024-06-14 16:02:54,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 113 transitions, 1073 flow [2024-06-14 16:02:54,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 16:02:54,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 16:02:54,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 136 transitions. [2024-06-14 16:02:54,718 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37777777777777777 [2024-06-14 16:02:54,718 INFO L175 Difference]: Start difference. First operand has 114 places, 88 transitions, 761 flow. Second operand 12 states and 136 transitions. [2024-06-14 16:02:54,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 113 transitions, 1073 flow [2024-06-14 16:02:54,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 113 transitions, 1029 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-14 16:02:54,728 INFO L231 Difference]: Finished difference. Result has 117 places, 85 transitions, 736 flow [2024-06-14 16:02:54,728 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=717, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=736, PETRI_PLACES=117, PETRI_TRANSITIONS=85} [2024-06-14 16:02:54,729 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 88 predicate places. [2024-06-14 16:02:54,729 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 85 transitions, 736 flow [2024-06-14 16:02:54,729 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-14 16:02:54,729 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:02:54,729 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:02:54,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-14 16:02:54,729 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 16:02:54,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:02:54,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1863597364, now seen corresponding path program 8 times [2024-06-14 16:02:54,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:02:54,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044031265] [2024-06-14 16:02:54,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:02:54,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:02:54,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:03:00,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:03:00,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:03:00,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044031265] [2024-06-14 16:03:00,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044031265] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:03:00,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:03:00,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 16:03:00,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374879899] [2024-06-14 16:03:00,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:03:00,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 16:03:00,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:03:00,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 16:03:00,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-14 16:03:00,445 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 16:03:00,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 85 transitions, 736 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-14 16:03:00,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:03:00,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 16:03:00,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:03:00,834 INFO L124 PetriNetUnfolderBase]: 257/496 cut-off events. [2024-06-14 16:03:00,834 INFO L125 PetriNetUnfolderBase]: For 8455/8455 co-relation queries the response was YES. [2024-06-14 16:03:00,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2496 conditions, 496 events. 257/496 cut-off events. For 8455/8455 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2165 event pairs, 62 based on Foata normal form. 10/505 useless extension candidates. Maximal degree in co-relation 2441. Up to 390 conditions per place. [2024-06-14 16:03:00,837 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 78 selfloop transitions, 17 changer transitions 11/108 dead transitions. [2024-06-14 16:03:00,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 108 transitions, 1034 flow [2024-06-14 16:03:00,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 16:03:00,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 16:03:00,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 120 transitions. [2024-06-14 16:03:00,849 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-14 16:03:00,849 INFO L175 Difference]: Start difference. First operand has 117 places, 85 transitions, 736 flow. Second operand 10 states and 120 transitions. [2024-06-14 16:03:00,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 108 transitions, 1034 flow [2024-06-14 16:03:00,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 108 transitions, 992 flow, removed 2 selfloop flow, removed 11 redundant places. [2024-06-14 16:03:00,859 INFO L231 Difference]: Finished difference. Result has 113 places, 82 transitions, 709 flow [2024-06-14 16:03:00,859 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=694, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=709, PETRI_PLACES=113, PETRI_TRANSITIONS=82} [2024-06-14 16:03:00,859 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 84 predicate places. [2024-06-14 16:03:00,860 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 82 transitions, 709 flow [2024-06-14 16:03:00,860 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-14 16:03:00,860 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:03:00,860 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:03:00,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-14 16:03:00,860 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 16:03:00,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:03:00,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1858019782, now seen corresponding path program 2 times [2024-06-14 16:03:00,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:03:00,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303414098] [2024-06-14 16:03:00,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:03:00,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:03:00,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:03:06,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:03:06,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:03:06,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303414098] [2024-06-14 16:03:06,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303414098] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:03:06,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:03:06,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 16:03:06,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370118711] [2024-06-14 16:03:06,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:03:06,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 16:03:06,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:03:06,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 16:03:06,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 16:03:06,815 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 16:03:06,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 82 transitions, 709 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-14 16:03:06,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:03:06,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 16:03:06,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:03:07,125 INFO L124 PetriNetUnfolderBase]: 242/467 cut-off events. [2024-06-14 16:03:07,125 INFO L125 PetriNetUnfolderBase]: For 6517/6517 co-relation queries the response was YES. [2024-06-14 16:03:07,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2391 conditions, 467 events. 242/467 cut-off events. For 6517/6517 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2008 event pairs, 55 based on Foata normal form. 2/468 useless extension candidates. Maximal degree in co-relation 2337. Up to 382 conditions per place. [2024-06-14 16:03:07,128 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 80 selfloop transitions, 22 changer transitions 0/104 dead transitions. [2024-06-14 16:03:07,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 104 transitions, 1021 flow [2024-06-14 16:03:07,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 16:03:07,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 16:03:07,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 123 transitions. [2024-06-14 16:03:07,130 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37272727272727274 [2024-06-14 16:03:07,130 INFO L175 Difference]: Start difference. First operand has 113 places, 82 transitions, 709 flow. Second operand 11 states and 123 transitions. [2024-06-14 16:03:07,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 104 transitions, 1021 flow [2024-06-14 16:03:07,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 104 transitions, 979 flow, removed 4 selfloop flow, removed 9 redundant places. [2024-06-14 16:03:07,138 INFO L231 Difference]: Finished difference. Result has 112 places, 84 transitions, 737 flow [2024-06-14 16:03:07,138 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=671, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=737, PETRI_PLACES=112, PETRI_TRANSITIONS=84} [2024-06-14 16:03:07,139 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 83 predicate places. [2024-06-14 16:03:07,139 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 84 transitions, 737 flow [2024-06-14 16:03:07,139 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-14 16:03:07,139 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:03:07,139 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:03:07,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-14 16:03:07,140 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 16:03:07,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:03:07,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1863745234, now seen corresponding path program 9 times [2024-06-14 16:03:07,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:03:07,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644220336] [2024-06-14 16:03:07,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:03:07,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:03:07,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:03:12,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:03:12,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:03:12,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644220336] [2024-06-14 16:03:12,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644220336] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:03:12,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:03:12,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 16:03:12,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327606931] [2024-06-14 16:03:12,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:03:12,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 16:03:12,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:03:12,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 16:03:12,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-14 16:03:13,177 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 16:03:13,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 84 transitions, 737 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-14 16:03:13,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:03:13,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 16:03:13,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:03:13,612 INFO L124 PetriNetUnfolderBase]: 283/554 cut-off events. [2024-06-14 16:03:13,613 INFO L125 PetriNetUnfolderBase]: For 9240/9240 co-relation queries the response was YES. [2024-06-14 16:03:13,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2884 conditions, 554 events. 283/554 cut-off events. For 9240/9240 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2540 event pairs, 64 based on Foata normal form. 8/561 useless extension candidates. Maximal degree in co-relation 2831. Up to 386 conditions per place. [2024-06-14 16:03:13,616 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 84 selfloop transitions, 18 changer transitions 7/111 dead transitions. [2024-06-14 16:03:13,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 111 transitions, 1105 flow [2024-06-14 16:03:13,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 16:03:13,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 16:03:13,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-14 16:03:13,617 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41333333333333333 [2024-06-14 16:03:13,617 INFO L175 Difference]: Start difference. First operand has 112 places, 84 transitions, 737 flow. Second operand 10 states and 124 transitions. [2024-06-14 16:03:13,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 111 transitions, 1105 flow [2024-06-14 16:03:13,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 111 transitions, 1071 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-14 16:03:13,626 INFO L231 Difference]: Finished difference. Result has 115 places, 82 transitions, 728 flow [2024-06-14 16:03:13,626 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=703, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=728, PETRI_PLACES=115, PETRI_TRANSITIONS=82} [2024-06-14 16:03:13,627 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 86 predicate places. [2024-06-14 16:03:13,627 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 82 transitions, 728 flow [2024-06-14 16:03:13,627 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-14 16:03:13,627 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:03:13,627 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:03:13,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-14 16:03:13,627 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 16:03:13,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:03:13,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1863591412, now seen corresponding path program 3 times [2024-06-14 16:03:13,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:03:13,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389195878] [2024-06-14 16:03:13,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:03:13,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:03:13,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:03:19,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:03:19,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:03:19,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389195878] [2024-06-14 16:03:19,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389195878] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:03:19,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:03:19,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 16:03:19,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707094037] [2024-06-14 16:03:19,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:03:19,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 16:03:19,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:03:19,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 16:03:19,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-14 16:03:19,853 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 16:03:19,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 82 transitions, 728 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-14 16:03:19,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:03:19,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 16:03:19,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:03:20,237 INFO L124 PetriNetUnfolderBase]: 262/511 cut-off events. [2024-06-14 16:03:20,237 INFO L125 PetriNetUnfolderBase]: For 8321/8321 co-relation queries the response was YES. [2024-06-14 16:03:20,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2743 conditions, 511 events. 262/511 cut-off events. For 8321/8321 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2271 event pairs, 69 based on Foata normal form. 2/512 useless extension candidates. Maximal degree in co-relation 2688. Up to 449 conditions per place. [2024-06-14 16:03:20,241 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 79 selfloop transitions, 18 changer transitions 0/99 dead transitions. [2024-06-14 16:03:20,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 99 transitions, 968 flow [2024-06-14 16:03:20,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 16:03:20,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 16:03:20,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2024-06-14 16:03:20,248 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3925925925925926 [2024-06-14 16:03:20,248 INFO L175 Difference]: Start difference. First operand has 115 places, 82 transitions, 728 flow. Second operand 9 states and 106 transitions. [2024-06-14 16:03:20,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 99 transitions, 968 flow [2024-06-14 16:03:20,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 99 transitions, 928 flow, removed 3 selfloop flow, removed 9 redundant places. [2024-06-14 16:03:20,259 INFO L231 Difference]: Finished difference. Result has 113 places, 82 transitions, 728 flow [2024-06-14 16:03:20,259 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=688, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=728, PETRI_PLACES=113, PETRI_TRANSITIONS=82} [2024-06-14 16:03:20,259 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 84 predicate places. [2024-06-14 16:03:20,260 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 82 transitions, 728 flow [2024-06-14 16:03:20,260 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-14 16:03:20,260 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:03:20,260 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:03:20,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-14 16:03:20,261 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-14 16:03:20,261 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:03:20,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1863741514, now seen corresponding path program 10 times [2024-06-14 16:03:20,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:03:20,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80456973] [2024-06-14 16:03:20,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:03:20,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:03:20,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:03:26,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:03:26,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:03:26,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80456973] [2024-06-14 16:03:26,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80456973] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:03:26,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:03:26,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 16:03:26,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011774049] [2024-06-14 16:03:26,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:03:26,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 16:03:26,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:03:26,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 16:03:26,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-14 16:03:26,241 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 16:03:26,241 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 82 transitions, 728 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-14 16:03:26,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:03:26,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 16:03:26,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:03:26,609 INFO L124 PetriNetUnfolderBase]: 249/488 cut-off events. [2024-06-14 16:03:26,609 INFO L125 PetriNetUnfolderBase]: For 7215/7215 co-relation queries the response was YES. [2024-06-14 16:03:26,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2444 conditions, 488 events. 249/488 cut-off events. For 7215/7215 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2140 event pairs, 54 based on Foata normal form. 10/497 useless extension candidates. Maximal degree in co-relation 2390. Up to 381 conditions per place. [2024-06-14 16:03:26,612 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 74 selfloop transitions, 15 changer transitions 13/104 dead transitions. [2024-06-14 16:03:26,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 104 transitions, 1014 flow [2024-06-14 16:03:26,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 16:03:26,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 16:03:26,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2024-06-14 16:03:26,613 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3933333333333333 [2024-06-14 16:03:26,613 INFO L175 Difference]: Start difference. First operand has 113 places, 82 transitions, 728 flow. Second operand 10 states and 118 transitions. [2024-06-14 16:03:26,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 104 transitions, 1014 flow [2024-06-14 16:03:26,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 104 transitions, 972 flow, removed 1 selfloop flow, removed 8 redundant places. [2024-06-14 16:03:26,622 INFO L231 Difference]: Finished difference. Result has 115 places, 78 transitions, 689 flow [2024-06-14 16:03:26,622 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=686, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=689, PETRI_PLACES=115, PETRI_TRANSITIONS=78} [2024-06-14 16:03:26,623 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 86 predicate places. [2024-06-14 16:03:26,623 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 78 transitions, 689 flow [2024-06-14 16:03:26,623 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-14 16:03:26,623 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:03:26,623 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:03:26,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-14 16:03:26,624 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-14 16:03:26,624 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:03:26,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1602451212, now seen corresponding path program 4 times [2024-06-14 16:03:26,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:03:26,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232482353] [2024-06-14 16:03:26,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:03:26,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:03:26,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:03:32,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:03:32,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:03:32,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232482353] [2024-06-14 16:03:32,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232482353] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:03:32,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:03:32,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 16:03:32,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981356221] [2024-06-14 16:03:32,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:03:32,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 16:03:32,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:03:32,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 16:03:32,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-14 16:03:32,175 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 16:03:32,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 78 transitions, 689 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-14 16:03:32,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:03:32,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 16:03:32,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:03:32,484 INFO L124 PetriNetUnfolderBase]: 228/445 cut-off events. [2024-06-14 16:03:32,485 INFO L125 PetriNetUnfolderBase]: For 6072/6072 co-relation queries the response was YES. [2024-06-14 16:03:32,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2289 conditions, 445 events. 228/445 cut-off events. For 6072/6072 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1886 event pairs, 55 based on Foata normal form. 2/446 useless extension candidates. Maximal degree in co-relation 2234. Up to 366 conditions per place. [2024-06-14 16:03:32,487 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 71 selfloop transitions, 21 changer transitions 0/94 dead transitions. [2024-06-14 16:03:32,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 94 transitions, 923 flow [2024-06-14 16:03:32,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:03:32,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:03:32,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 98 transitions. [2024-06-14 16:03:32,488 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4083333333333333 [2024-06-14 16:03:32,488 INFO L175 Difference]: Start difference. First operand has 115 places, 78 transitions, 689 flow. Second operand 8 states and 98 transitions. [2024-06-14 16:03:32,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 94 transitions, 923 flow [2024-06-14 16:03:32,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 94 transitions, 887 flow, removed 3 selfloop flow, removed 9 redundant places. [2024-06-14 16:03:32,496 INFO L231 Difference]: Finished difference. Result has 108 places, 79 transitions, 711 flow [2024-06-14 16:03:32,496 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=653, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=711, PETRI_PLACES=108, PETRI_TRANSITIONS=79} [2024-06-14 16:03:32,496 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 79 predicate places. [2024-06-14 16:03:32,496 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 79 transitions, 711 flow [2024-06-14 16:03:32,497 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-14 16:03:32,497 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:03:32,497 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:03:32,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-14 16:03:32,497 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-14 16:03:32,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:03:32,497 INFO L85 PathProgramCache]: Analyzing trace with hash 77250460, now seen corresponding path program 5 times [2024-06-14 16:03:32,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:03:32,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669904621] [2024-06-14 16:03:32,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:03:32,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:03:32,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:03:37,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:03:37,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:03:37,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669904621] [2024-06-14 16:03:37,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669904621] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:03:37,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:03:37,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 16:03:37,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986588127] [2024-06-14 16:03:37,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:03:37,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 16:03:37,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:03:37,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 16:03:37,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-14 16:03:37,980 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 16:03:37,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 79 transitions, 711 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-14 16:03:37,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:03:37,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 16:03:37,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:03:38,327 INFO L124 PetriNetUnfolderBase]: 256/509 cut-off events. [2024-06-14 16:03:38,327 INFO L125 PetriNetUnfolderBase]: For 8007/8007 co-relation queries the response was YES. [2024-06-14 16:03:38,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2487 conditions, 509 events. 256/509 cut-off events. For 8007/8007 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2312 event pairs, 66 based on Foata normal form. 18/526 useless extension candidates. Maximal degree in co-relation 2434. Up to 285 conditions per place. [2024-06-14 16:03:38,330 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 55 selfloop transitions, 19 changer transitions 26/102 dead transitions. [2024-06-14 16:03:38,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 102 transitions, 1005 flow [2024-06-14 16:03:38,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:03:38,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:03:38,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2024-06-14 16:03:38,331 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44583333333333336 [2024-06-14 16:03:38,331 INFO L175 Difference]: Start difference. First operand has 108 places, 79 transitions, 711 flow. Second operand 8 states and 107 transitions. [2024-06-14 16:03:38,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 102 transitions, 1005 flow [2024-06-14 16:03:38,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 102 transitions, 968 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-14 16:03:38,340 INFO L231 Difference]: Finished difference. Result has 111 places, 60 transitions, 546 flow [2024-06-14 16:03:38,340 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=674, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=546, PETRI_PLACES=111, PETRI_TRANSITIONS=60} [2024-06-14 16:03:38,341 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 82 predicate places. [2024-06-14 16:03:38,341 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 60 transitions, 546 flow [2024-06-14 16:03:38,341 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-14 16:03:38,341 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:03:38,341 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:03:38,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-14 16:03:38,341 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-14 16:03:38,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:03:38,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1596736920, now seen corresponding path program 11 times [2024-06-14 16:03:38,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:03:38,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603774071] [2024-06-14 16:03:38,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:03:38,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:03:38,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:03:43,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:03:43,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:03:43,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603774071] [2024-06-14 16:03:43,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603774071] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:03:43,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:03:43,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 16:03:43,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857944817] [2024-06-14 16:03:43,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:03:43,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 16:03:43,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:03:43,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 16:03:43,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-14 16:03:44,015 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 16:03:44,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 60 transitions, 546 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-14 16:03:44,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:03:44,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 16:03:44,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:03:44,317 INFO L124 PetriNetUnfolderBase]: 182/383 cut-off events. [2024-06-14 16:03:44,317 INFO L125 PetriNetUnfolderBase]: For 6621/6621 co-relation queries the response was YES. [2024-06-14 16:03:44,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1914 conditions, 383 events. 182/383 cut-off events. For 6621/6621 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1639 event pairs, 59 based on Foata normal form. 10/392 useless extension candidates. Maximal degree in co-relation 1860. Up to 266 conditions per place. [2024-06-14 16:03:44,319 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 52 selfloop transitions, 17 changer transitions 11/82 dead transitions. [2024-06-14 16:03:44,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 82 transitions, 786 flow [2024-06-14 16:03:44,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 16:03:44,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 16:03:44,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 110 transitions. [2024-06-14 16:03:44,320 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4074074074074074 [2024-06-14 16:03:44,320 INFO L175 Difference]: Start difference. First operand has 111 places, 60 transitions, 546 flow. Second operand 9 states and 110 transitions. [2024-06-14 16:03:44,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 82 transitions, 786 flow [2024-06-14 16:03:44,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 82 transitions, 679 flow, removed 11 selfloop flow, removed 19 redundant places. [2024-06-14 16:03:44,327 INFO L231 Difference]: Finished difference. Result has 96 places, 57 transitions, 461 flow [2024-06-14 16:03:44,327 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=443, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=461, PETRI_PLACES=96, PETRI_TRANSITIONS=57} [2024-06-14 16:03:44,327 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 67 predicate places. [2024-06-14 16:03:44,328 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 57 transitions, 461 flow [2024-06-14 16:03:44,328 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-14 16:03:44,328 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:03:44,328 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:03:44,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-14 16:03:44,328 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-14 16:03:44,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:03:44,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1504563070, now seen corresponding path program 12 times [2024-06-14 16:03:44,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:03:44,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493381576] [2024-06-14 16:03:44,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:03:44,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:03:44,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:03:49,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-14 16:03:49,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:03:49,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493381576] [2024-06-14 16:03:49,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493381576] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:03:49,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:03:49,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 16:03:49,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211980278] [2024-06-14 16:03:49,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:03:49,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 16:03:49,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:03:49,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 16:03:49,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-14 16:03:50,079 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 16:03:50,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 57 transitions, 461 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-14 16:03:50,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:03:50,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 16:03:50,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:03:50,410 INFO L124 PetriNetUnfolderBase]: 148/317 cut-off events. [2024-06-14 16:03:50,410 INFO L125 PetriNetUnfolderBase]: For 3290/3290 co-relation queries the response was YES. [2024-06-14 16:03:50,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1384 conditions, 317 events. 148/317 cut-off events. For 3290/3290 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1266 event pairs, 37 based on Foata normal form. 8/324 useless extension candidates. Maximal degree in co-relation 1336. Up to 210 conditions per place. [2024-06-14 16:03:50,411 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 50 selfloop transitions, 14 changer transitions 11/77 dead transitions. [2024-06-14 16:03:50,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 77 transitions, 661 flow [2024-06-14 16:03:50,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 16:03:50,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 16:03:50,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 107 transitions. [2024-06-14 16:03:50,412 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3962962962962963 [2024-06-14 16:03:50,412 INFO L175 Difference]: Start difference. First operand has 96 places, 57 transitions, 461 flow. Second operand 9 states and 107 transitions. [2024-06-14 16:03:50,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 77 transitions, 661 flow [2024-06-14 16:03:50,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 77 transitions, 619 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-14 16:03:50,417 INFO L231 Difference]: Finished difference. Result has 94 places, 52 transitions, 402 flow [2024-06-14 16:03:50,417 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=419, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=402, PETRI_PLACES=94, PETRI_TRANSITIONS=52} [2024-06-14 16:03:50,417 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 65 predicate places. [2024-06-14 16:03:50,418 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 52 transitions, 402 flow [2024-06-14 16:03:50,418 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-14 16:03:50,418 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:03:50,418 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:03:50,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-14 16:03:50,418 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-14 16:03:50,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:03:50,418 INFO L85 PathProgramCache]: Analyzing trace with hash 130005738, now seen corresponding path program 6 times [2024-06-14 16:03:50,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:03:50,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129459602] [2024-06-14 16:03:50,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:03:50,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:03:50,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:03:55,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:03:55,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:03:55,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129459602] [2024-06-14 16:03:55,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129459602] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:03:55,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:03:55,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 16:03:55,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300299637] [2024-06-14 16:03:55,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:03:55,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 16:03:55,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:03:55,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 16:03:55,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 16:03:55,722 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 16:03:55,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 52 transitions, 402 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-14 16:03:55,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:03:55,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 16:03:55,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:03:55,948 INFO L124 PetriNetUnfolderBase]: 132/281 cut-off events. [2024-06-14 16:03:55,948 INFO L125 PetriNetUnfolderBase]: For 2224/2224 co-relation queries the response was YES. [2024-06-14 16:03:55,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1245 conditions, 281 events. 132/281 cut-off events. For 2224/2224 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1065 event pairs, 36 based on Foata normal form. 2/282 useless extension candidates. Maximal degree in co-relation 1198. Up to 219 conditions per place. [2024-06-14 16:03:55,950 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 53 selfloop transitions, 13 changer transitions 0/68 dead transitions. [2024-06-14 16:03:55,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 68 transitions, 582 flow [2024-06-14 16:03:55,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:03:55,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:03:55,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 95 transitions. [2024-06-14 16:03:55,951 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2024-06-14 16:03:55,951 INFO L175 Difference]: Start difference. First operand has 94 places, 52 transitions, 402 flow. Second operand 8 states and 95 transitions. [2024-06-14 16:03:55,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 68 transitions, 582 flow [2024-06-14 16:03:55,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 68 transitions, 539 flow, removed 2 selfloop flow, removed 13 redundant places. [2024-06-14 16:03:55,955 INFO L231 Difference]: Finished difference. Result has 86 places, 53 transitions, 401 flow [2024-06-14 16:03:55,955 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=359, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=401, PETRI_PLACES=86, PETRI_TRANSITIONS=53} [2024-06-14 16:03:55,955 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 57 predicate places. [2024-06-14 16:03:55,956 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 53 transitions, 401 flow [2024-06-14 16:03:55,956 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-14 16:03:55,956 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:03:55,956 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:03:55,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-14 16:03:55,956 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-14 16:03:55,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:03:55,957 INFO L85 PathProgramCache]: Analyzing trace with hash 343156990, now seen corresponding path program 7 times [2024-06-14 16:03:55,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:03:55,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085460708] [2024-06-14 16:03:55,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:03:55,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:03:56,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:04:01,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:04:01,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:04:01,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085460708] [2024-06-14 16:04:01,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085460708] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:04:01,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:04:01,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 16:04:01,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73508638] [2024-06-14 16:04:01,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:04:01,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 16:04:01,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:04:01,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 16:04:01,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-14 16:04:01,437 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 16:04:01,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 53 transitions, 401 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-14 16:04:01,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:04:01,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 16:04:01,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:04:01,664 INFO L124 PetriNetUnfolderBase]: 136/289 cut-off events. [2024-06-14 16:04:01,664 INFO L125 PetriNetUnfolderBase]: For 2029/2029 co-relation queries the response was YES. [2024-06-14 16:04:01,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1250 conditions, 289 events. 136/289 cut-off events. For 2029/2029 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1106 event pairs, 37 based on Foata normal form. 2/290 useless extension candidates. Maximal degree in co-relation 1207. Up to 249 conditions per place. [2024-06-14 16:04:01,665 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 52 selfloop transitions, 10 changer transitions 0/64 dead transitions. [2024-06-14 16:04:01,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 64 transitions, 559 flow [2024-06-14 16:04:01,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 16:04:01,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 16:04:01,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2024-06-14 16:04:01,666 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3761904761904762 [2024-06-14 16:04:01,666 INFO L175 Difference]: Start difference. First operand has 86 places, 53 transitions, 401 flow. Second operand 7 states and 79 transitions. [2024-06-14 16:04:01,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 64 transitions, 559 flow [2024-06-14 16:04:01,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 64 transitions, 521 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-14 16:04:01,670 INFO L231 Difference]: Finished difference. Result has 86 places, 54 transitions, 401 flow [2024-06-14 16:04:01,670 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=363, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=401, PETRI_PLACES=86, PETRI_TRANSITIONS=54} [2024-06-14 16:04:01,670 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 57 predicate places. [2024-06-14 16:04:01,670 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 54 transitions, 401 flow [2024-06-14 16:04:01,671 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-14 16:04:01,671 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:04:01,671 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:04:01,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-14 16:04:01,671 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-14 16:04:01,671 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:04:01,671 INFO L85 PathProgramCache]: Analyzing trace with hash 333960220, now seen corresponding path program 8 times [2024-06-14 16:04:01,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:04:01,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714199308] [2024-06-14 16:04:01,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:04:01,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:04:01,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:04:07,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:04:07,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:04:07,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714199308] [2024-06-14 16:04:07,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714199308] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:04:07,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:04:07,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 16:04:07,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637770639] [2024-06-14 16:04:07,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:04:07,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 16:04:07,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:04:07,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 16:04:07,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-14 16:04:07,429 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 16:04:07,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 54 transitions, 401 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-14 16:04:07,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:04:07,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 16:04:07,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:04:07,668 INFO L124 PetriNetUnfolderBase]: 133/284 cut-off events. [2024-06-14 16:04:07,668 INFO L125 PetriNetUnfolderBase]: For 1951/1951 co-relation queries the response was YES. [2024-06-14 16:04:07,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1189 conditions, 284 events. 133/284 cut-off events. For 1951/1951 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1088 event pairs, 36 based on Foata normal form. 2/285 useless extension candidates. Maximal degree in co-relation 1146. Up to 200 conditions per place. [2024-06-14 16:04:07,670 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 49 selfloop transitions, 16 changer transitions 0/67 dead transitions. [2024-06-14 16:04:07,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 67 transitions, 563 flow [2024-06-14 16:04:07,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 16:04:07,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 16:04:07,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2024-06-14 16:04:07,670 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4142857142857143 [2024-06-14 16:04:07,671 INFO L175 Difference]: Start difference. First operand has 86 places, 54 transitions, 401 flow. Second operand 7 states and 87 transitions. [2024-06-14 16:04:07,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 67 transitions, 563 flow [2024-06-14 16:04:07,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 67 transitions, 535 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-06-14 16:04:07,675 INFO L231 Difference]: Finished difference. Result has 88 places, 54 transitions, 411 flow [2024-06-14 16:04:07,675 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=411, PETRI_PLACES=88, PETRI_TRANSITIONS=54} [2024-06-14 16:04:07,675 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 59 predicate places. [2024-06-14 16:04:07,675 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 54 transitions, 411 flow [2024-06-14 16:04:07,675 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-14 16:04:07,675 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:04:07,676 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:04:07,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-14 16:04:07,676 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-14 16:04:07,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:04:07,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1291898555, now seen corresponding path program 1 times [2024-06-14 16:04:07,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:04:07,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953958261] [2024-06-14 16:04:07,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:04:07,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:04:07,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:04:13,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:04:13,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:04:13,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953958261] [2024-06-14 16:04:13,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953958261] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:04:13,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:04:13,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 16:04:13,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494775041] [2024-06-14 16:04:13,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:04:13,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 16:04:13,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:04:13,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 16:04:13,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-14 16:04:13,717 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 16:04:13,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 54 transitions, 411 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-14 16:04:13,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:04:13,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 16:04:13,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:04:14,120 INFO L124 PetriNetUnfolderBase]: 141/304 cut-off events. [2024-06-14 16:04:14,120 INFO L125 PetriNetUnfolderBase]: For 2713/2713 co-relation queries the response was YES. [2024-06-14 16:04:14,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1261 conditions, 304 events. 141/304 cut-off events. For 2713/2713 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1207 event pairs, 37 based on Foata normal form. 6/309 useless extension candidates. Maximal degree in co-relation 1217. Up to 209 conditions per place. [2024-06-14 16:04:14,122 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 49 selfloop transitions, 15 changer transitions 11/77 dead transitions. [2024-06-14 16:04:14,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 77 transitions, 625 flow [2024-06-14 16:04:14,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 16:04:14,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 16:04:14,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 131 transitions. [2024-06-14 16:04:14,126 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3638888888888889 [2024-06-14 16:04:14,127 INFO L175 Difference]: Start difference. First operand has 88 places, 54 transitions, 411 flow. Second operand 12 states and 131 transitions. [2024-06-14 16:04:14,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 77 transitions, 625 flow [2024-06-14 16:04:14,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 77 transitions, 562 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-14 16:04:14,131 INFO L231 Difference]: Finished difference. Result has 93 places, 51 transitions, 365 flow [2024-06-14 16:04:14,132 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=365, PETRI_PLACES=93, PETRI_TRANSITIONS=51} [2024-06-14 16:04:14,132 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 64 predicate places. [2024-06-14 16:04:14,132 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 51 transitions, 365 flow [2024-06-14 16:04:14,132 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-14 16:04:14,132 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:04:14,132 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:04:14,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-14 16:04:14,132 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-14 16:04:14,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:04:14,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1285411805, now seen corresponding path program 2 times [2024-06-14 16:04:14,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:04:14,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115751436] [2024-06-14 16:04:14,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:04:14,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:04:14,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:04:20,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:04:20,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:04:20,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115751436] [2024-06-14 16:04:20,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115751436] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:04:20,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:04:20,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 16:04:20,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976762230] [2024-06-14 16:04:20,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:04:20,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 16:04:20,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:04:20,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 16:04:20,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-14 16:04:20,308 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 16:04:20,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 51 transitions, 365 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-14 16:04:20,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:04:20,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 16:04:20,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:04:20,598 INFO L124 PetriNetUnfolderBase]: 131/286 cut-off events. [2024-06-14 16:04:20,599 INFO L125 PetriNetUnfolderBase]: For 2638/2638 co-relation queries the response was YES. [2024-06-14 16:04:20,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1135 conditions, 286 events. 131/286 cut-off events. For 2638/2638 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1114 event pairs, 32 based on Foata normal form. 6/291 useless extension candidates. Maximal degree in co-relation 1091. Up to 194 conditions per place. [2024-06-14 16:04:20,600 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 48 selfloop transitions, 12 changer transitions 12/74 dead transitions. [2024-06-14 16:04:20,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 74 transitions, 571 flow [2024-06-14 16:04:20,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 16:04:20,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 16:04:20,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 130 transitions. [2024-06-14 16:04:20,601 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3611111111111111 [2024-06-14 16:04:20,601 INFO L175 Difference]: Start difference. First operand has 93 places, 51 transitions, 365 flow. Second operand 12 states and 130 transitions. [2024-06-14 16:04:20,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 74 transitions, 571 flow [2024-06-14 16:04:20,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 74 transitions, 537 flow, removed 2 selfloop flow, removed 10 redundant places. [2024-06-14 16:04:20,604 INFO L231 Difference]: Finished difference. Result has 90 places, 47 transitions, 336 flow [2024-06-14 16:04:20,605 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=331, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=336, PETRI_PLACES=90, PETRI_TRANSITIONS=47} [2024-06-14 16:04:20,605 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 61 predicate places. [2024-06-14 16:04:20,605 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 47 transitions, 336 flow [2024-06-14 16:04:20,605 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-14 16:04:20,605 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:04:20,605 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:04:20,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-14 16:04:20,605 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-14 16:04:20,605 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:04:20,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1936757887, now seen corresponding path program 3 times [2024-06-14 16:04:20,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:04:20,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816647745] [2024-06-14 16:04:20,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:04:20,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:04:20,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:04:26,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:04:26,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:04:26,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816647745] [2024-06-14 16:04:26,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816647745] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:04:26,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:04:26,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 16:04:26,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991953220] [2024-06-14 16:04:26,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:04:26,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 16:04:26,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:04:26,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 16:04:26,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-14 16:04:26,922 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 16:04:26,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 47 transitions, 336 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-14 16:04:26,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:04:26,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 16:04:26,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:04:27,206 INFO L124 PetriNetUnfolderBase]: 119/262 cut-off events. [2024-06-14 16:04:27,207 INFO L125 PetriNetUnfolderBase]: For 2326/2326 co-relation queries the response was YES. [2024-06-14 16:04:27,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1048 conditions, 262 events. 119/262 cut-off events. For 2326/2326 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 977 event pairs, 34 based on Foata normal form. 6/267 useless extension candidates. Maximal degree in co-relation 1005. Up to 190 conditions per place. [2024-06-14 16:04:27,208 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 42 selfloop transitions, 7 changer transitions 15/66 dead transitions. [2024-06-14 16:04:27,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 66 transitions, 516 flow [2024-06-14 16:04:27,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 16:04:27,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 16:04:27,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 110 transitions. [2024-06-14 16:04:27,208 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2024-06-14 16:04:27,209 INFO L175 Difference]: Start difference. First operand has 90 places, 47 transitions, 336 flow. Second operand 10 states and 110 transitions. [2024-06-14 16:04:27,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 66 transitions, 516 flow [2024-06-14 16:04:27,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 66 transitions, 488 flow, removed 2 selfloop flow, removed 10 redundant places. [2024-06-14 16:04:27,212 INFO L231 Difference]: Finished difference. Result has 84 places, 42 transitions, 296 flow [2024-06-14 16:04:27,212 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=296, PETRI_PLACES=84, PETRI_TRANSITIONS=42} [2024-06-14 16:04:27,212 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 55 predicate places. [2024-06-14 16:04:27,212 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 42 transitions, 296 flow [2024-06-14 16:04:27,212 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-14 16:04:27,212 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:04:27,213 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:04:27,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-14 16:04:27,213 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-14 16:04:27,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:04:27,213 INFO L85 PathProgramCache]: Analyzing trace with hash -425695037, now seen corresponding path program 4 times [2024-06-14 16:04:27,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:04:27,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590390872] [2024-06-14 16:04:27,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:04:27,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:04:27,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:04:33,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:04:33,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:04:33,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590390872] [2024-06-14 16:04:33,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590390872] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:04:33,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:04:33,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 16:04:33,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200345336] [2024-06-14 16:04:33,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:04:33,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 16:04:33,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:04:33,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 16:04:33,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-14 16:04:33,670 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 16:04:33,670 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 42 transitions, 296 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-14 16:04:33,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:04:33,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 16:04:33,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:04:33,985 INFO L124 PetriNetUnfolderBase]: 109/240 cut-off events. [2024-06-14 16:04:33,985 INFO L125 PetriNetUnfolderBase]: For 2076/2076 co-relation queries the response was YES. [2024-06-14 16:04:33,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 959 conditions, 240 events. 109/240 cut-off events. For 2076/2076 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 861 event pairs, 32 based on Foata normal form. 6/245 useless extension candidates. Maximal degree in co-relation 917. Up to 163 conditions per place. [2024-06-14 16:04:33,986 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 38 selfloop transitions, 5 changer transitions 15/60 dead transitions. [2024-06-14 16:04:33,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 60 transitions, 460 flow [2024-06-14 16:04:33,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 16:04:33,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 16:04:33,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2024-06-14 16:04:33,989 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37407407407407406 [2024-06-14 16:04:33,989 INFO L175 Difference]: Start difference. First operand has 84 places, 42 transitions, 296 flow. Second operand 9 states and 101 transitions. [2024-06-14 16:04:33,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 60 transitions, 460 flow [2024-06-14 16:04:33,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 60 transitions, 440 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-14 16:04:33,992 INFO L231 Difference]: Finished difference. Result has 77 places, 37 transitions, 242 flow [2024-06-14 16:04:33,992 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=242, PETRI_PLACES=77, PETRI_TRANSITIONS=37} [2024-06-14 16:04:33,992 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 48 predicate places. [2024-06-14 16:04:33,992 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 37 transitions, 242 flow [2024-06-14 16:04:33,992 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-14 16:04:33,992 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:04:33,993 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:04:33,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-14 16:04:33,993 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-14 16:04:33,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:04:33,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1893715249, now seen corresponding path program 5 times [2024-06-14 16:04:33,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:04:33,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141501138] [2024-06-14 16:04:33,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:04:33,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:04:34,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:04:41,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:04:41,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:04:41,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141501138] [2024-06-14 16:04:41,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141501138] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:04:41,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:04:41,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 16:04:41,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411148190] [2024-06-14 16:04:41,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:04:41,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 16:04:41,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:04:41,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 16:04:41,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-14 16:04:41,277 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-14 16:04:41,277 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 37 transitions, 242 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:04:41,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:04:41,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-14 16:04:41,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:04:41,603 INFO L124 PetriNetUnfolderBase]: 96/213 cut-off events. [2024-06-14 16:04:41,603 INFO L125 PetriNetUnfolderBase]: For 1567/1567 co-relation queries the response was YES. [2024-06-14 16:04:41,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 829 conditions, 213 events. 96/213 cut-off events. For 1567/1567 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 713 event pairs, 32 based on Foata normal form. 6/218 useless extension candidates. Maximal degree in co-relation 789. Up to 128 conditions per place. [2024-06-14 16:04:41,604 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 32 selfloop transitions, 5 changer transitions 15/54 dead transitions. [2024-06-14 16:04:41,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 54 transitions, 392 flow [2024-06-14 16:04:41,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:04:41,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:04:41,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 87 transitions. [2024-06-14 16:04:41,606 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3625 [2024-06-14 16:04:41,606 INFO L175 Difference]: Start difference. First operand has 77 places, 37 transitions, 242 flow. Second operand 8 states and 87 transitions. [2024-06-14 16:04:41,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 54 transitions, 392 flow [2024-06-14 16:04:41,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 54 transitions, 360 flow, removed 5 selfloop flow, removed 11 redundant places. [2024-06-14 16:04:41,608 INFO L231 Difference]: Finished difference. Result has 67 places, 31 transitions, 179 flow [2024-06-14 16:04:41,608 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=179, PETRI_PLACES=67, PETRI_TRANSITIONS=31} [2024-06-14 16:04:41,608 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 38 predicate places. [2024-06-14 16:04:41,608 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 31 transitions, 179 flow [2024-06-14 16:04:41,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:04:41,608 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:04:41,608 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:04:41,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-14 16:04:41,608 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-14 16:04:41,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:04:41,609 INFO L85 PathProgramCache]: Analyzing trace with hash 2047933135, now seen corresponding path program 6 times [2024-06-14 16:04:41,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:04:41,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295895442] [2024-06-14 16:04:41,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:04:41,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:04:41,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:04:47,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:04:47,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:04:47,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295895442] [2024-06-14 16:04:47,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295895442] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:04:47,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:04:47,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 16:04:47,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476851504] [2024-06-14 16:04:47,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:04:47,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 16:04:47,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:04:47,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 16:04:47,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-14 16:04:47,678 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 16:04:47,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 31 transitions, 179 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-14 16:04:47,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:04:47,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 16:04:47,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:04:47,889 INFO L124 PetriNetUnfolderBase]: 66/151 cut-off events. [2024-06-14 16:04:47,889 INFO L125 PetriNetUnfolderBase]: For 1002/1002 co-relation queries the response was YES. [2024-06-14 16:04:47,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 531 conditions, 151 events. 66/151 cut-off events. For 1002/1002 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 425 event pairs, 15 based on Foata normal form. 6/156 useless extension candidates. Maximal degree in co-relation 495. Up to 87 conditions per place. [2024-06-14 16:04:47,890 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 22 selfloop transitions, 3 changer transitions 17/44 dead transitions. [2024-06-14 16:04:47,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 44 transitions, 291 flow [2024-06-14 16:04:47,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:04:47,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:04:47,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2024-06-14 16:04:47,891 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37083333333333335 [2024-06-14 16:04:47,891 INFO L175 Difference]: Start difference. First operand has 67 places, 31 transitions, 179 flow. Second operand 8 states and 89 transitions. [2024-06-14 16:04:47,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 44 transitions, 291 flow [2024-06-14 16:04:47,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 44 transitions, 266 flow, removed 3 selfloop flow, removed 11 redundant places. [2024-06-14 16:04:47,893 INFO L231 Difference]: Finished difference. Result has 59 places, 23 transitions, 125 flow [2024-06-14 16:04:47,893 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=125, PETRI_PLACES=59, PETRI_TRANSITIONS=23} [2024-06-14 16:04:47,893 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 30 predicate places. [2024-06-14 16:04:47,893 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 23 transitions, 125 flow [2024-06-14 16:04:47,893 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-14 16:04:47,893 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:04:47,893 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:04:47,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-14 16:04:47,894 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-14 16:04:47,894 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:04:47,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1526581563, now seen corresponding path program 1 times [2024-06-14 16:04:47,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:04:47,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079630211] [2024-06-14 16:04:47,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:04:47,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:04:47,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:04:54,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:04:54,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:04:54,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079630211] [2024-06-14 16:04:54,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079630211] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:04:54,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:04:54,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-14 16:04:54,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403061147] [2024-06-14 16:04:54,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:04:54,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-14 16:04:54,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:04:54,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-14 16:04:54,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-06-14 16:04:54,604 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 16:04:54,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 23 transitions, 125 flow. Second operand has 13 states, 13 states have (on average 7.3076923076923075) internal successors, (95), 13 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:04:54,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:04:54,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 16:04:54,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:04:54,874 INFO L124 PetriNetUnfolderBase]: 37/88 cut-off events. [2024-06-14 16:04:54,875 INFO L125 PetriNetUnfolderBase]: For 367/367 co-relation queries the response was YES. [2024-06-14 16:04:54,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 288 conditions, 88 events. 37/88 cut-off events. For 367/367 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 180 event pairs, 0 based on Foata normal form. 4/92 useless extension candidates. Maximal degree in co-relation 272. Up to 22 conditions per place. [2024-06-14 16:04:54,875 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 0 selfloop transitions, 0 changer transitions 41/41 dead transitions. [2024-06-14 16:04:54,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 41 transitions, 225 flow [2024-06-14 16:04:54,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 16:04:54,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 16:04:54,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 106 transitions. [2024-06-14 16:04:54,876 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3212121212121212 [2024-06-14 16:04:54,876 INFO L175 Difference]: Start difference. First operand has 59 places, 23 transitions, 125 flow. Second operand 11 states and 106 transitions. [2024-06-14 16:04:54,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 41 transitions, 225 flow [2024-06-14 16:04:54,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 41 transitions, 183 flow, removed 2 selfloop flow, removed 17 redundant places. [2024-06-14 16:04:54,876 INFO L231 Difference]: Finished difference. Result has 44 places, 0 transitions, 0 flow [2024-06-14 16:04:54,876 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=61, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=0, PETRI_PLACES=44, PETRI_TRANSITIONS=0} [2024-06-14 16:04:54,877 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 15 predicate places. [2024-06-14 16:04:54,877 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 0 transitions, 0 flow [2024-06-14 16:04:54,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.3076923076923075) internal successors, (95), 13 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:04:54,879 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 4 remaining) [2024-06-14 16:04:54,880 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 4 remaining) [2024-06-14 16:04:54,880 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-06-14 16:04:54,880 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-06-14 16:04:54,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-14 16:04:54,881 INFO L445 BasicCegarLoop]: Path program histogram: [12, 9, 8, 6, 5, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:04:54,883 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-14 16:04:54,883 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-14 16:04:54,886 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-06-14 16:04:54,886 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-06-14 16:04:54,887 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.06 04:04:54 BasicIcfg [2024-06-14 16:04:54,887 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-14 16:04:54,887 INFO L158 Benchmark]: Toolchain (without parser) took 341063.55ms. Allocated memory was 138.4MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 55.1MB in the beginning and 1.3GB in the end (delta: -1.3GB). Peak memory consumption was 403.9MB. Max. memory is 16.1GB. [2024-06-14 16:04:54,888 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 138.4MB. Free memory is still 90.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-14 16:04:54,888 INFO L158 Benchmark]: Witness Parser took 0.10ms. Allocated memory is still 138.4MB. Free memory is still 63.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-14 16:04:54,888 INFO L158 Benchmark]: CACSL2BoogieTranslator took 727.34ms. Allocated memory was 138.4MB in the beginning and 176.2MB in the end (delta: 37.7MB). Free memory was 54.9MB in the beginning and 103.9MB in the end (delta: -49.0MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. [2024-06-14 16:04:54,888 INFO L158 Benchmark]: Boogie Procedure Inliner took 98.06ms. Allocated memory is still 176.2MB. Free memory was 103.9MB in the beginning and 88.2MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-06-14 16:04:54,888 INFO L158 Benchmark]: Boogie Preprocessor took 108.64ms. Allocated memory is still 176.2MB. Free memory was 88.2MB in the beginning and 81.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-06-14 16:04:54,889 INFO L158 Benchmark]: RCFGBuilder took 964.67ms. Allocated memory is still 176.2MB. Free memory was 81.9MB in the beginning and 104.5MB in the end (delta: -22.6MB). Peak memory consumption was 55.0MB. Max. memory is 16.1GB. [2024-06-14 16:04:54,889 INFO L158 Benchmark]: TraceAbstraction took 339158.06ms. Allocated memory was 176.2MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 104.5MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 414.2MB. Max. memory is 16.1GB. [2024-06-14 16:04:54,890 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.11ms. Allocated memory is still 138.4MB. Free memory is still 90.1MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.10ms. Allocated memory is still 138.4MB. Free memory is still 63.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 727.34ms. Allocated memory was 138.4MB in the beginning and 176.2MB in the end (delta: 37.7MB). Free memory was 54.9MB in the beginning and 103.9MB in the end (delta: -49.0MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 98.06ms. Allocated memory is still 176.2MB. Free memory was 103.9MB in the beginning and 88.2MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 108.64ms. Allocated memory is still 176.2MB. Free memory was 88.2MB in the beginning and 81.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 964.67ms. Allocated memory is still 176.2MB. Free memory was 81.9MB in the beginning and 104.5MB in the end (delta: -22.6MB). Peak memory consumption was 55.0MB. Max. memory is 16.1GB. * TraceAbstraction took 339158.06ms. Allocated memory was 176.2MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 104.5MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 414.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 810]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 811]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 47 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 339.0s, OverallIterations: 59, TraceHistogramMax: 1, PathProgramHistogramMax: 12, EmptinessCheckTime: 0.0s, AutomataDifference: 27.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3640 SdHoareTripleChecker+Valid, 18.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3138 mSDsluCounter, 823 SdHoareTripleChecker+Invalid, 15.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 654 mSDsCounter, 802 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21437 IncrementalHoareTripleChecker+Invalid, 22239 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 802 mSolverCounterUnsat, 169 mSDtfsCounter, 21437 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 599 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 597 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1068 ImplicationChecksByTransitivity, 16.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=942occurred in iteration=35, InterpolantAutomatonStates: 493, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 308.8s InterpolantComputationTime, 929 NumberOfCodeBlocks, 929 NumberOfCodeBlocksAsserted, 59 NumberOfCheckSat, 870 ConstructedInterpolants, 0 QuantifiedInterpolants, 40461 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 59 InterpolantComputations, 59 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-06-14 16:04:54,938 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