./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.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/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version bcb38a6f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-bcb38a6-m [2024-06-04 17:42:27,056 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-04 17:42:27,135 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-04 17:42:27,140 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-04 17:42:27,141 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-04 17:42:27,171 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-04 17:42:27,171 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-04 17:42:27,171 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-04 17:42:27,172 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-04 17:42:27,176 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-04 17:42:27,176 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-04 17:42:27,176 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-04 17:42:27,177 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-04 17:42:27,178 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-04 17:42:27,178 INFO L153 SettingsManager]: * Use SBE=true [2024-06-04 17:42:27,178 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-04 17:42:27,179 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-04 17:42:27,179 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-04 17:42:27,179 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-04 17:42:27,179 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-04 17:42:27,180 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-04 17:42:27,180 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-04 17:42:27,180 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-04 17:42:27,181 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-04 17:42:27,181 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-04 17:42:27,181 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-04 17:42:27,181 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-04 17:42:27,182 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-04 17:42:27,182 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-04 17:42:27,182 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-04 17:42:27,183 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-04 17:42:27,183 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-04 17:42:27,184 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 17:42:27,184 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-04 17:42:27,184 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-04 17:42:27,184 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-04 17:42:27,185 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-04 17:42:27,185 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-04 17:42:27,185 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-04 17:42:27,185 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-04 17:42:27,185 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-04 17:42:27,186 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-04 17:42:27,186 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-04 17:42:27,186 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-04 17:42:27,421 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-04 17:42:27,449 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-04 17:42:27,452 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-04 17:42:27,453 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-04 17:42:27,453 INFO L274 PluginConnector]: CDTParser initialized [2024-06-04 17:42:27,454 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-06-04 17:42:28,555 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-04 17:42:28,867 INFO L384 CDTParser]: Found 1 translation units. [2024-06-04 17:42:28,867 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-06-04 17:42:28,893 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d653b86a2/54eba70d968e4fa4ae61bdc6df217932/FLAGda764765e [2024-06-04 17:42:28,904 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d653b86a2/54eba70d968e4fa4ae61bdc6df217932 [2024-06-04 17:42:28,906 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-04 17:42:28,906 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-04 17:42:28,907 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/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.yml/witness.yml [2024-06-04 17:42:29,078 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-04 17:42:29,079 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-04 17:42:29,080 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-04 17:42:29,080 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-04 17:42:29,085 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-04 17:42:29,085 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 05:42:28" (1/2) ... [2024-06-04 17:42:29,086 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76808684 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:42:29, skipping insertion in model container [2024-06-04 17:42:29,086 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 05:42:28" (1/2) ... [2024-06-04 17:42:29,088 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@44245e25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:42:29, skipping insertion in model container [2024-06-04 17:42:29,088 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 05:42:29" (2/2) ... [2024-06-04 17:42:29,089 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76808684 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:42:29, skipping insertion in model container [2024-06-04 17:42:29,089 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 05:42:29" (2/2) ... [2024-06-04 17:42:29,089 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-04 17:42:29,154 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-04 17:42:29,155 INFO L97 edCorrectnessWitness]: Location invariant before [L805-L805] ((((((((((((((((! multithreaded || (((0 <= y$w_buff0 && y$w_buff0 <= 127) && y$w_buff0 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EBX) + (long long )x >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 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_thd1 >= 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_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 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_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 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_thd1) + (long long )z >= 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) && (0LL - (long long )y$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$read_delayed >= 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 )__unbuffered_p1_EBX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )x) + (long long )y >= 0LL) && (1LL - (long long )x) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )x) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )x) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )x) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )x) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )x) + (long long )z >= 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_thd1 >= 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_thd1 >= 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 )z >= 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_thd1 >= 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_thd1 >= 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 )z >= 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_thd1 >= 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_thd1 >= 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 )z >= 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_thd1 >= 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_thd1 >= 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 )z >= 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_thd1 >= 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_thd1 >= 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 )x + (long long )z >= 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_thd1 >= 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_thd1 >= 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 + (long long )z >= 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_thd1 >= 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_thd1 >= 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$flush_delayed + (long long )z >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 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_thd1 >= 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$mem_tmp + (long long )z >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 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_thd1 >= 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_thd0 + (long long )z >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )z >= 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_thd1 >= 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_buff0_thd2 + (long long )z >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 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_thd0 + (long long )z >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )z >= 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$r_buff1_thd2 + (long long )z >= 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$read_delayed + (long long )z >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )z >= 0LL) && (long long )y$w_buff1 + (long long )z >= 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_thd1 >= 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_thd1 >= 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 )z >= 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_thd1 >= 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_thd1 >= 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) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )x >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )x >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )x >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )x >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 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_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff0_thd0 >= 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_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )x) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )x >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 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_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd1 >= 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_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd1 >= 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_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 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_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 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_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 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_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 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_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 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_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (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_thd1 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 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_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! 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) && 0 <= z) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && x <= 1) && y$w_buff0 <= 127) && y$w_buff1 <= 127) && z <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && y$w_buff0 % 2 == 0) && y$w_buff1 % 2 == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && (z == 0 || z == 1)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= y$w_buff1 && y$w_buff1 <= 127) && y$w_buff1 % 2 == 0) && (y$w_buff1 == 0 || y$w_buff1 == 2)))) && (! 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 == 0 || y == 1) || y == 2)))) && (! 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 == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-04 17:42:29,156 INFO L97 edCorrectnessWitness]: Location invariant before [L806-L806] ((((((((((((((((! multithreaded || (((0 <= y$w_buff0 && y$w_buff0 <= 127) && y$w_buff0 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EBX) + (long long )x >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 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_thd1 >= 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_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 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_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 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_thd1) + (long long )z >= 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) && (0LL - (long long )y$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$read_delayed >= 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 )__unbuffered_p1_EBX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )x) + (long long )y >= 0LL) && (1LL - (long long )x) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )x) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )x) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )x) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )x) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )x) + (long long )z >= 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_thd1 >= 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_thd1 >= 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 )z >= 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_thd1 >= 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_thd1 >= 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 )z >= 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_thd1 >= 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_thd1 >= 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 )z >= 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_thd1 >= 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_thd1 >= 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 )z >= 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_thd1 >= 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_thd1 >= 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 )x + (long long )z >= 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_thd1 >= 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_thd1 >= 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 + (long long )z >= 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_thd1 >= 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_thd1 >= 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$flush_delayed + (long long )z >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 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_thd1 >= 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$mem_tmp + (long long )z >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 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_thd1 >= 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_thd0 + (long long )z >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )z >= 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_thd1 >= 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_buff0_thd2 + (long long )z >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 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_thd0 + (long long )z >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )z >= 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$r_buff1_thd2 + (long long )z >= 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$read_delayed + (long long )z >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )z >= 0LL) && (long long )y$w_buff1 + (long long )z >= 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_thd1 >= 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_thd1 >= 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 )z >= 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_thd1 >= 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_thd1 >= 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) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )x >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )x >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )x >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )x >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 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_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff0_thd0 >= 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_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )x) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )x >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 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_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd1 >= 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_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd1 >= 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_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 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_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 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_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 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_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 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_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 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_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (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_thd1 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 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_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! 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) && 0 <= z) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && x <= 1) && y$w_buff0 <= 127) && y$w_buff1 <= 127) && z <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && y$w_buff0 % 2 == 0) && y$w_buff1 % 2 == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && (z == 0 || z == 1)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= y$w_buff1 && y$w_buff1 <= 127) && y$w_buff1 % 2 == 0) && (y$w_buff1 == 0 || y$w_buff1 == 2)))) && (! 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 == 0 || y == 1) || y == 2)))) && (! 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 == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-04 17:42:29,156 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-04 17:42:29,157 INFO L106 edCorrectnessWitness]: ghost_update [L803-L803] multithreaded = 1; [2024-06-04 17:42:29,202 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-04 17:42:29,500 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 17:42:29,514 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-04 17:42:29,865 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 17:42:29,920 INFO L206 MainTranslator]: Completed translation [2024-06-04 17:42:29,921 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:42:29 WrapperNode [2024-06-04 17:42:29,921 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-04 17:42:29,923 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-04 17:42:29,923 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-04 17:42:29,923 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-04 17:42:29,929 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 04.06 05:42:29" (1/1) ... [2024-06-04 17:42:29,962 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 04.06 05:42:29" (1/1) ... [2024-06-04 17:42:30,087 INFO L138 Inliner]: procedures = 174, calls = 38, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 139 [2024-06-04 17:42:30,088 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-04 17:42:30,089 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-04 17:42:30,089 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-04 17:42:30,089 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-04 17:42:30,100 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:42:29" (1/1) ... [2024-06-04 17:42:30,100 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:42:29" (1/1) ... [2024-06-04 17:42:30,115 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:42:29" (1/1) ... [2024-06-04 17:42:30,146 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-04 17:42:30,147 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:42:29" (1/1) ... [2024-06-04 17:42:30,147 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:42:29" (1/1) ... [2024-06-04 17:42:30,179 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:42:29" (1/1) ... [2024-06-04 17:42:30,182 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:42:29" (1/1) ... [2024-06-04 17:42:30,190 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:42:29" (1/1) ... [2024-06-04 17:42:30,196 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:42:29" (1/1) ... [2024-06-04 17:42:30,212 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-04 17:42:30,214 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-04 17:42:30,214 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-04 17:42:30,214 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-04 17:42:30,215 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:42:29" (1/1) ... [2024-06-04 17:42:30,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 17:42:30,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-04 17:42:30,249 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-04 17:42:30,253 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-04 17:42:30,288 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-04 17:42:30,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-04 17:42:30,288 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-04 17:42:30,289 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-04 17:42:30,289 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-04 17:42:30,289 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-04 17:42:30,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-04 17:42:30,289 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-04 17:42:30,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-04 17:42:30,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-04 17:42:30,291 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-04 17:42:30,403 INFO L244 CfgBuilder]: Building ICFG [2024-06-04 17:42:30,406 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-04 17:42:31,304 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-04 17:42:31,305 INFO L293 CfgBuilder]: Performing block encoding [2024-06-04 17:42:31,486 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-04 17:42:31,487 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-04 17:42:31,487 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 05:42:31 BoogieIcfgContainer [2024-06-04 17:42:31,487 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-04 17:42:31,489 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-04 17:42:31,489 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-04 17:42:31,492 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-04 17:42:31,492 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.06 05:42:28" (1/4) ... [2024-06-04 17:42:31,493 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42f9ae4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 05:42:31, skipping insertion in model container [2024-06-04 17:42:31,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 05:42:29" (2/4) ... [2024-06-04 17:42:31,493 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42f9ae4e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 05:42:31, skipping insertion in model container [2024-06-04 17:42:31,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:42:29" (3/4) ... [2024-06-04 17:42:31,494 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42f9ae4e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 05:42:31, skipping insertion in model container [2024-06-04 17:42:31,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 05:42:31" (4/4) ... [2024-06-04 17:42:31,495 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-06-04 17:42:31,510 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-04 17:42:31,511 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-04 17:42:31,511 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-04 17:42:31,586 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-04 17:42:31,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 32 transitions, 72 flow [2024-06-04 17:42:31,677 INFO L124 PetriNetUnfolderBase]: 0/30 cut-off events. [2024-06-04 17:42:31,679 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 17:42:31,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 30 events. 0/30 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 41 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-04 17:42:31,681 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 32 transitions, 72 flow [2024-06-04 17:42:31,684 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 24 transitions, 54 flow [2024-06-04 17:42:31,699 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-04 17:42:31,708 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;@25b15d75, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-04 17:42:31,709 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-04 17:42:31,717 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-04 17:42:31,717 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-04 17:42:31,717 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 17:42:31,718 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:42:31,718 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-04 17:42:31,719 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-04 17:42:31,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:42:31,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1639526218, now seen corresponding path program 1 times [2024-06-04 17:42:31,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:42:31,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694799864] [2024-06-04 17:42:31,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:42:31,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:42:32,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:42:36,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:42:36,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:42:36,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694799864] [2024-06-04 17:42:36,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694799864] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:42:36,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:42:36,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-04 17:42:36,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484719774] [2024-06-04 17:42:36,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:42:36,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-04 17:42:36,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:42:36,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-04 17:42:36,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-04 17:42:36,894 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 17:42:36,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 24 transitions, 54 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-04 17:42:36,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:42:36,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 17:42:36,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:42:37,185 INFO L124 PetriNetUnfolderBase]: 162/321 cut-off events. [2024-06-04 17:42:37,185 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-06-04 17:42:37,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 634 conditions, 321 events. 162/321 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1193 event pairs, 97 based on Foata normal form. 1/310 useless extension candidates. Maximal degree in co-relation 620. Up to 288 conditions per place. [2024-06-04 17:42:37,193 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 23 selfloop transitions, 3 changer transitions 0/30 dead transitions. [2024-06-04 17:42:37,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 30 transitions, 121 flow [2024-06-04 17:42:37,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-04 17:42:37,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-04 17:42:37,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2024-06-04 17:42:37,204 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2024-06-04 17:42:37,206 INFO L175 Difference]: Start difference. First operand has 31 places, 24 transitions, 54 flow. Second operand 3 states and 52 transitions. [2024-06-04 17:42:37,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 30 transitions, 121 flow [2024-06-04 17:42:37,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 30 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-04 17:42:37,210 INFO L231 Difference]: Finished difference. Result has 32 places, 26 transitions, 73 flow [2024-06-04 17:42:37,212 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=52, 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=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=73, PETRI_PLACES=32, PETRI_TRANSITIONS=26} [2024-06-04 17:42:37,215 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 1 predicate places. [2024-06-04 17:42:37,216 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 73 flow [2024-06-04 17:42:37,216 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-04 17:42:37,217 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:42:37,217 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:42:37,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-04 17:42:37,217 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-04 17:42:37,218 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:42:37,218 INFO L85 PathProgramCache]: Analyzing trace with hash -668275543, now seen corresponding path program 1 times [2024-06-04 17:42:37,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:42:37,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770589604] [2024-06-04 17:42:37,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:42:37,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:42:37,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:42:41,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:42:41,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:42:41,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770589604] [2024-06-04 17:42:41,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770589604] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:42:41,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:42:41,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-04 17:42:41,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868450389] [2024-06-04 17:42:41,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:42:41,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-04 17:42:41,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:42:41,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-04 17:42:41,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-04 17:42:41,068 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:42:41,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 73 flow. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:42:41,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:42:41,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:42:41,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:42:41,336 INFO L124 PetriNetUnfolderBase]: 186/349 cut-off events. [2024-06-04 17:42:41,336 INFO L125 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2024-06-04 17:42:41,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 793 conditions, 349 events. 186/349 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1264 event pairs, 94 based on Foata normal form. 2/344 useless extension candidates. Maximal degree in co-relation 778. Up to 319 conditions per place. [2024-06-04 17:42:41,340 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 28 selfloop transitions, 5 changer transitions 0/36 dead transitions. [2024-06-04 17:42:41,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 36 transitions, 165 flow [2024-06-04 17:42:41,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-04 17:42:41,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-04 17:42:41,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2024-06-04 17:42:41,342 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4921875 [2024-06-04 17:42:41,342 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 73 flow. Second operand 4 states and 63 transitions. [2024-06-04 17:42:41,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 36 transitions, 165 flow [2024-06-04 17:42:41,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 36 transitions, 162 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-04 17:42:41,344 INFO L231 Difference]: Finished difference. Result has 35 places, 28 transitions, 97 flow [2024-06-04 17:42:41,344 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=97, PETRI_PLACES=35, PETRI_TRANSITIONS=28} [2024-06-04 17:42:41,345 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 4 predicate places. [2024-06-04 17:42:41,345 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 97 flow [2024-06-04 17:42:41,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:42:41,346 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:42:41,346 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:42:41,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-04 17:42:41,346 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-04 17:42:41,347 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:42:41,347 INFO L85 PathProgramCache]: Analyzing trace with hash 758295539, now seen corresponding path program 1 times [2024-06-04 17:42:41,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:42:41,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670759315] [2024-06-04 17:42:41,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:42:41,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:42:41,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:42:44,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:42:44,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:42:44,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670759315] [2024-06-04 17:42:44,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670759315] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:42:44,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:42:44,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 17:42:44,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605240398] [2024-06-04 17:42:44,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:42:44,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 17:42:44,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:42:44,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 17:42:44,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-04 17:42:44,861 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:42:44,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 97 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-04 17:42:44,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:42:44,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:42:44,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:42:45,106 INFO L124 PetriNetUnfolderBase]: 180/341 cut-off events. [2024-06-04 17:42:45,106 INFO L125 PetriNetUnfolderBase]: For 193/193 co-relation queries the response was YES. [2024-06-04 17:42:45,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 853 conditions, 341 events. 180/341 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1220 event pairs, 52 based on Foata normal form. 4/340 useless extension candidates. Maximal degree in co-relation 836. Up to 291 conditions per place. [2024-06-04 17:42:45,110 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 33 selfloop transitions, 7 changer transitions 0/43 dead transitions. [2024-06-04 17:42:45,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 43 transitions, 217 flow [2024-06-04 17:42:45,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 17:42:45,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 17:42:45,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2024-06-04 17:42:45,112 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48125 [2024-06-04 17:42:45,112 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 97 flow. Second operand 5 states and 77 transitions. [2024-06-04 17:42:45,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 43 transitions, 217 flow [2024-06-04 17:42:45,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 43 transitions, 208 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-04 17:42:45,115 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 121 flow [2024-06-04 17:42:45,115 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=121, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2024-06-04 17:42:45,116 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 7 predicate places. [2024-06-04 17:42:45,116 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 121 flow [2024-06-04 17:42:45,116 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-04 17:42:45,116 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:42:45,116 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:42:45,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-04 17:42:45,117 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-04 17:42:45,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:42:45,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1422397774, now seen corresponding path program 1 times [2024-06-04 17:42:45,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:42:45,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595376764] [2024-06-04 17:42:45,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:42:45,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:42:45,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:42:48,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:42:48,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:42:48,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595376764] [2024-06-04 17:42:48,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595376764] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:42:48,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:42:48,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 17:42:48,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209432187] [2024-06-04 17:42:48,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:42:48,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 17:42:48,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:42:48,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 17:42:48,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-04 17:42:49,112 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:42:49,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 121 flow. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:42:49,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:42:49,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:42:49,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:42:49,388 INFO L124 PetriNetUnfolderBase]: 176/331 cut-off events. [2024-06-04 17:42:49,389 INFO L125 PetriNetUnfolderBase]: For 311/311 co-relation queries the response was YES. [2024-06-04 17:42:49,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 903 conditions, 331 events. 176/331 cut-off events. For 311/311 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1158 event pairs, 30 based on Foata normal form. 4/328 useless extension candidates. Maximal degree in co-relation 885. Up to 265 conditions per place. [2024-06-04 17:42:49,395 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 33 selfloop transitions, 8 changer transitions 0/44 dead transitions. [2024-06-04 17:42:49,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 44 transitions, 231 flow [2024-06-04 17:42:49,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:42:49,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:42:49,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 85 transitions. [2024-06-04 17:42:49,400 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4427083333333333 [2024-06-04 17:42:49,400 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 121 flow. Second operand 6 states and 85 transitions. [2024-06-04 17:42:49,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 44 transitions, 231 flow [2024-06-04 17:42:49,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 44 transitions, 216 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-04 17:42:49,403 INFO L231 Difference]: Finished difference. Result has 40 places, 29 transitions, 118 flow [2024-06-04 17:42:49,404 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=118, PETRI_PLACES=40, PETRI_TRANSITIONS=29} [2024-06-04 17:42:49,405 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 9 predicate places. [2024-06-04 17:42:49,405 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 118 flow [2024-06-04 17:42:49,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:42:49,406 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:42:49,406 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:42:49,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-04 17:42:49,406 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:42:49,407 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:42:49,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1867651097, now seen corresponding path program 1 times [2024-06-04 17:42:49,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:42:49,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400497488] [2024-06-04 17:42:49,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:42:49,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:42:49,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:42:54,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:42:54,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:42:54,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400497488] [2024-06-04 17:42:54,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400497488] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:42:54,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:42:54,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 17:42:54,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714481878] [2024-06-04 17:42:54,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:42:54,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 17:42:54,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:42:54,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 17:42:54,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-04 17:42:54,400 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:42:54,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 118 flow. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:42:54,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:42:54,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:42:54,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:42:54,690 INFO L124 PetriNetUnfolderBase]: 147/295 cut-off events. [2024-06-04 17:42:54,690 INFO L125 PetriNetUnfolderBase]: For 377/377 co-relation queries the response was YES. [2024-06-04 17:42:54,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 823 conditions, 295 events. 147/295 cut-off events. For 377/377 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1057 event pairs, 53 based on Foata normal form. 1/289 useless extension candidates. Maximal degree in co-relation 804. Up to 259 conditions per place. [2024-06-04 17:42:54,693 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 26 selfloop transitions, 6 changer transitions 0/36 dead transitions. [2024-06-04 17:42:54,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 36 transitions, 200 flow [2024-06-04 17:42:54,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 17:42:54,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 17:42:54,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2024-06-04 17:42:54,694 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-04 17:42:54,694 INFO L175 Difference]: Start difference. First operand has 40 places, 29 transitions, 118 flow. Second operand 5 states and 64 transitions. [2024-06-04 17:42:54,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 36 transitions, 200 flow [2024-06-04 17:42:54,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 36 transitions, 180 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-04 17:42:54,697 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 125 flow [2024-06-04 17:42:54,697 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=125, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2024-06-04 17:42:54,699 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 10 predicate places. [2024-06-04 17:42:54,701 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 125 flow [2024-06-04 17:42:54,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:42:54,702 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:42:54,702 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:42:54,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-04 17:42:54,707 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-04 17:42:54,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:42:54,708 INFO L85 PathProgramCache]: Analyzing trace with hash -2062607691, now seen corresponding path program 1 times [2024-06-04 17:42:54,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:42:54,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147352456] [2024-06-04 17:42:54,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:42:54,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:42:54,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:43:00,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:43:00,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:43:00,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147352456] [2024-06-04 17:43:00,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147352456] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:43:00,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:43:00,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 17:43:00,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072091512] [2024-06-04 17:43:00,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:43:00,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 17:43:00,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:43:00,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 17:43:00,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-04 17:43:00,361 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 17:43:00,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 125 flow. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:43:00,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:43:00,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 17:43:00,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:43:00,636 INFO L124 PetriNetUnfolderBase]: 172/330 cut-off events. [2024-06-04 17:43:00,637 INFO L125 PetriNetUnfolderBase]: For 581/581 co-relation queries the response was YES. [2024-06-04 17:43:00,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 974 conditions, 330 events. 172/330 cut-off events. For 581/581 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1170 event pairs, 64 based on Foata normal form. 1/330 useless extension candidates. Maximal degree in co-relation 953. Up to 298 conditions per place. [2024-06-04 17:43:00,639 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 28 selfloop transitions, 8 changer transitions 0/39 dead transitions. [2024-06-04 17:43:00,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 39 transitions, 219 flow [2024-06-04 17:43:00,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:43:00,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:43:00,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2024-06-04 17:43:00,641 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.359375 [2024-06-04 17:43:00,641 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 125 flow. Second operand 6 states and 69 transitions. [2024-06-04 17:43:00,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 39 transitions, 219 flow [2024-06-04 17:43:00,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 39 transitions, 208 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-04 17:43:00,644 INFO L231 Difference]: Finished difference. Result has 44 places, 33 transitions, 147 flow [2024-06-04 17:43:00,644 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=147, PETRI_PLACES=44, PETRI_TRANSITIONS=33} [2024-06-04 17:43:00,645 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 13 predicate places. [2024-06-04 17:43:00,645 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 147 flow [2024-06-04 17:43:00,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:43:00,645 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:43:00,645 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:43:00,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-04 17:43:00,646 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-04 17:43:00,646 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:43:00,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1868618978, now seen corresponding path program 1 times [2024-06-04 17:43:00,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:43:00,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538454637] [2024-06-04 17:43:00,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:43:00,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:43:00,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:43:05,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:43:05,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:43:05,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538454637] [2024-06-04 17:43:05,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538454637] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:43:05,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:43:05,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 17:43:05,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371806117] [2024-06-04 17:43:05,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:43:05,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 17:43:05,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:43:05,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 17:43:05,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-04 17:43:05,895 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 17:43:05,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 147 flow. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:43:05,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:43:05,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 17:43:05,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:43:06,265 INFO L124 PetriNetUnfolderBase]: 188/349 cut-off events. [2024-06-04 17:43:06,265 INFO L125 PetriNetUnfolderBase]: For 952/952 co-relation queries the response was YES. [2024-06-04 17:43:06,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1133 conditions, 349 events. 188/349 cut-off events. For 952/952 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1211 event pairs, 71 based on Foata normal form. 1/349 useless extension candidates. Maximal degree in co-relation 1111. Up to 311 conditions per place. [2024-06-04 17:43:06,268 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 32 selfloop transitions, 8 changer transitions 0/44 dead transitions. [2024-06-04 17:43:06,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 44 transitions, 257 flow [2024-06-04 17:43:06,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:43:06,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:43:06,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2024-06-04 17:43:06,270 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-04 17:43:06,270 INFO L175 Difference]: Start difference. First operand has 44 places, 33 transitions, 147 flow. Second operand 6 states and 72 transitions. [2024-06-04 17:43:06,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 44 transitions, 257 flow [2024-06-04 17:43:06,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 44 transitions, 240 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-04 17:43:06,273 INFO L231 Difference]: Finished difference. Result has 46 places, 35 transitions, 163 flow [2024-06-04 17:43:06,273 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=163, PETRI_PLACES=46, PETRI_TRANSITIONS=35} [2024-06-04 17:43:06,274 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 15 predicate places. [2024-06-04 17:43:06,274 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 35 transitions, 163 flow [2024-06-04 17:43:06,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:43:06,275 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:43:06,275 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:43:06,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-04 17:43:06,275 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-04 17:43:06,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:43:06,276 INFO L85 PathProgramCache]: Analyzing trace with hash 483664582, now seen corresponding path program 2 times [2024-06-04 17:43:06,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:43:06,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494852727] [2024-06-04 17:43:06,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:43:06,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:43:06,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:43:10,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:43:10,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:43:10,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494852727] [2024-06-04 17:43:10,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494852727] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:43:10,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:43:10,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 17:43:10,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146768880] [2024-06-04 17:43:10,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:43:10,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 17:43:10,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:43:10,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 17:43:10,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-04 17:43:10,796 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 17:43:10,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 35 transitions, 163 flow. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:43:10,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:43:10,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 17:43:10,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:43:11,043 INFO L124 PetriNetUnfolderBase]: 186/347 cut-off events. [2024-06-04 17:43:11,044 INFO L125 PetriNetUnfolderBase]: For 1246/1249 co-relation queries the response was YES. [2024-06-04 17:43:11,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1197 conditions, 347 events. 186/347 cut-off events. For 1246/1249 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1214 event pairs, 75 based on Foata normal form. 3/348 useless extension candidates. Maximal degree in co-relation 1174. Up to 302 conditions per place. [2024-06-04 17:43:11,047 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 28 selfloop transitions, 11 changer transitions 0/43 dead transitions. [2024-06-04 17:43:11,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 43 transitions, 267 flow [2024-06-04 17:43:11,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:43:11,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:43:11,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2024-06-04 17:43:11,050 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3697916666666667 [2024-06-04 17:43:11,050 INFO L175 Difference]: Start difference. First operand has 46 places, 35 transitions, 163 flow. Second operand 6 states and 71 transitions. [2024-06-04 17:43:11,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 43 transitions, 267 flow [2024-06-04 17:43:11,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 43 transitions, 250 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-04 17:43:11,054 INFO L231 Difference]: Finished difference. Result has 48 places, 37 transitions, 189 flow [2024-06-04 17:43:11,054 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=189, PETRI_PLACES=48, PETRI_TRANSITIONS=37} [2024-06-04 17:43:11,056 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 17 predicate places. [2024-06-04 17:43:11,056 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 37 transitions, 189 flow [2024-06-04 17:43:11,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:43:11,057 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:43:11,057 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:43:11,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-04 17:43:11,057 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-04 17:43:11,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:43:11,058 INFO L85 PathProgramCache]: Analyzing trace with hash 483672518, now seen corresponding path program 1 times [2024-06-04 17:43:11,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:43:11,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132919703] [2024-06-04 17:43:11,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:43:11,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:43:11,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:43:16,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:43:16,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:43:16,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132919703] [2024-06-04 17:43:16,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132919703] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:43:16,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:43:16,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:43:16,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622645302] [2024-06-04 17:43:16,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:43:16,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:43:16,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:43:16,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:43:16,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:43:16,558 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 17:43:16,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 37 transitions, 189 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-04 17:43:16,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:43:16,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 17:43:16,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:43:16,812 INFO L124 PetriNetUnfolderBase]: 171/324 cut-off events. [2024-06-04 17:43:16,813 INFO L125 PetriNetUnfolderBase]: For 1225/1225 co-relation queries the response was YES. [2024-06-04 17:43:16,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1158 conditions, 324 events. 171/324 cut-off events. For 1225/1225 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1136 event pairs, 62 based on Foata normal form. 1/324 useless extension candidates. Maximal degree in co-relation 1134. Up to 294 conditions per place. [2024-06-04 17:43:16,816 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 33 selfloop transitions, 10 changer transitions 0/46 dead transitions. [2024-06-04 17:43:16,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 46 transitions, 301 flow [2024-06-04 17:43:16,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:43:16,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:43:16,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 78 transitions. [2024-06-04 17:43:16,817 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3482142857142857 [2024-06-04 17:43:16,817 INFO L175 Difference]: Start difference. First operand has 48 places, 37 transitions, 189 flow. Second operand 7 states and 78 transitions. [2024-06-04 17:43:16,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 46 transitions, 301 flow [2024-06-04 17:43:16,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 46 transitions, 274 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-04 17:43:16,820 INFO L231 Difference]: Finished difference. Result has 51 places, 39 transitions, 201 flow [2024-06-04 17:43:16,820 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=201, PETRI_PLACES=51, PETRI_TRANSITIONS=39} [2024-06-04 17:43:16,820 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 20 predicate places. [2024-06-04 17:43:16,821 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 39 transitions, 201 flow [2024-06-04 17:43:16,821 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-04 17:43:16,821 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:43:16,821 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:43:16,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-04 17:43:16,821 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-04 17:43:16,822 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:43:16,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1931449946, now seen corresponding path program 1 times [2024-06-04 17:43:16,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:43:16,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476389531] [2024-06-04 17:43:16,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:43:16,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:43:16,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:43:21,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:43:21,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:43:21,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476389531] [2024-06-04 17:43:21,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476389531] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:43:21,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:43:21,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:43:21,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383915001] [2024-06-04 17:43:21,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:43:21,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:43:21,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:43:21,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:43:21,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:43:21,795 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 17:43:21,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 201 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-04 17:43:21,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:43:21,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 17:43:21,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:43:22,170 INFO L124 PetriNetUnfolderBase]: 188/350 cut-off events. [2024-06-04 17:43:22,171 INFO L125 PetriNetUnfolderBase]: For 1837/1837 co-relation queries the response was YES. [2024-06-04 17:43:22,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1331 conditions, 350 events. 188/350 cut-off events. For 1837/1837 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1227 event pairs, 49 based on Foata normal form. 2/351 useless extension candidates. Maximal degree in co-relation 1306. Up to 291 conditions per place. [2024-06-04 17:43:22,174 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 41 selfloop transitions, 12 changer transitions 0/57 dead transitions. [2024-06-04 17:43:22,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 57 transitions, 359 flow [2024-06-04 17:43:22,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:43:22,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:43:22,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 86 transitions. [2024-06-04 17:43:22,176 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38392857142857145 [2024-06-04 17:43:22,176 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 201 flow. Second operand 7 states and 86 transitions. [2024-06-04 17:43:22,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 57 transitions, 359 flow [2024-06-04 17:43:22,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 57 transitions, 336 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-04 17:43:22,181 INFO L231 Difference]: Finished difference. Result has 54 places, 43 transitions, 234 flow [2024-06-04 17:43:22,182 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=234, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2024-06-04 17:43:22,182 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 23 predicate places. [2024-06-04 17:43:22,184 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 234 flow [2024-06-04 17:43:22,185 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-04 17:43:22,185 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:43:22,185 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:43:22,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-04 17:43:22,185 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-04 17:43:22,186 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:43:22,186 INFO L85 PathProgramCache]: Analyzing trace with hash 2102272532, now seen corresponding path program 1 times [2024-06-04 17:43:22,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:43:22,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884204961] [2024-06-04 17:43:22,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:43:22,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:43:22,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:43:27,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:43:27,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:43:27,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884204961] [2024-06-04 17:43:27,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884204961] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:43:27,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:43:27,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:43:27,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936719571] [2024-06-04 17:43:27,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:43:27,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:43:27,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:43:27,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:43:27,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:43:27,316 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:43:27,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 43 transitions, 234 flow. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:43:27,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:43:27,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:43:27,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:43:27,629 INFO L124 PetriNetUnfolderBase]: 205/369 cut-off events. [2024-06-04 17:43:27,629 INFO L125 PetriNetUnfolderBase]: For 2148/2148 co-relation queries the response was YES. [2024-06-04 17:43:27,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1513 conditions, 369 events. 205/369 cut-off events. For 2148/2148 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1265 event pairs, 50 based on Foata normal form. 1/369 useless extension candidates. Maximal degree in co-relation 1486. Up to 345 conditions per place. [2024-06-04 17:43:27,632 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 43 selfloop transitions, 10 changer transitions 0/55 dead transitions. [2024-06-04 17:43:27,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 55 transitions, 376 flow [2024-06-04 17:43:27,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:43:27,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:43:27,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2024-06-04 17:43:27,634 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33482142857142855 [2024-06-04 17:43:27,634 INFO L175 Difference]: Start difference. First operand has 54 places, 43 transitions, 234 flow. Second operand 7 states and 75 transitions. [2024-06-04 17:43:27,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 55 transitions, 376 flow [2024-06-04 17:43:27,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 55 transitions, 356 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-04 17:43:27,640 INFO L231 Difference]: Finished difference. Result has 58 places, 45 transitions, 255 flow [2024-06-04 17:43:27,640 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=255, PETRI_PLACES=58, PETRI_TRANSITIONS=45} [2024-06-04 17:43:27,640 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 27 predicate places. [2024-06-04 17:43:27,641 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 45 transitions, 255 flow [2024-06-04 17:43:27,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:43:27,642 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:43:27,642 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:43:27,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-04 17:43:27,642 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-04 17:43:27,642 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:43:27,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1931569916, now seen corresponding path program 2 times [2024-06-04 17:43:27,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:43:27,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458975284] [2024-06-04 17:43:27,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:43:27,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:43:27,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:43:32,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:43:32,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:43:32,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458975284] [2024-06-04 17:43:32,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458975284] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:43:32,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:43:32,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:43:32,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415505222] [2024-06-04 17:43:32,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:43:32,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:43:32,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:43:32,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:43:32,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:43:32,544 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 17:43:32,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 45 transitions, 255 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-04 17:43:32,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:43:32,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 17:43:32,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:43:32,916 INFO L124 PetriNetUnfolderBase]: 204/375 cut-off events. [2024-06-04 17:43:32,916 INFO L125 PetriNetUnfolderBase]: For 2784/2784 co-relation queries the response was YES. [2024-06-04 17:43:32,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1617 conditions, 375 events. 204/375 cut-off events. For 2784/2784 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1325 event pairs, 48 based on Foata normal form. 2/376 useless extension candidates. Maximal degree in co-relation 1589. Up to 301 conditions per place. [2024-06-04 17:43:32,919 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 41 selfloop transitions, 16 changer transitions 0/62 dead transitions. [2024-06-04 17:43:32,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 62 transitions, 457 flow [2024-06-04 17:43:32,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:43:32,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:43:32,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2024-06-04 17:43:32,921 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38839285714285715 [2024-06-04 17:43:32,921 INFO L175 Difference]: Start difference. First operand has 58 places, 45 transitions, 255 flow. Second operand 7 states and 87 transitions. [2024-06-04 17:43:32,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 62 transitions, 457 flow [2024-06-04 17:43:32,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 62 transitions, 432 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-04 17:43:32,924 INFO L231 Difference]: Finished difference. Result has 60 places, 49 transitions, 303 flow [2024-06-04 17:43:32,925 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=303, PETRI_PLACES=60, PETRI_TRANSITIONS=49} [2024-06-04 17:43:32,925 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 29 predicate places. [2024-06-04 17:43:32,925 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 49 transitions, 303 flow [2024-06-04 17:43:32,925 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-04 17:43:32,926 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:43:32,926 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:43:32,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-04 17:43:32,926 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-04 17:43:32,926 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:43:32,926 INFO L85 PathProgramCache]: Analyzing trace with hash 2108701436, now seen corresponding path program 3 times [2024-06-04 17:43:32,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:43:32,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284202121] [2024-06-04 17:43:32,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:43:32,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:43:32,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:43:37,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:43:37,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:43:37,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284202121] [2024-06-04 17:43:37,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284202121] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:43:37,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:43:37,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:43:37,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145901072] [2024-06-04 17:43:37,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:43:37,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:43:37,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:43:37,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:43:37,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:43:37,912 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 17:43:37,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 49 transitions, 303 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-04 17:43:37,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:43:37,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 17:43:37,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:43:38,206 INFO L124 PetriNetUnfolderBase]: 199/370 cut-off events. [2024-06-04 17:43:38,206 INFO L125 PetriNetUnfolderBase]: For 3306/3309 co-relation queries the response was YES. [2024-06-04 17:43:38,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1655 conditions, 370 events. 199/370 cut-off events. For 3306/3309 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1321 event pairs, 58 based on Foata normal form. 2/369 useless extension candidates. Maximal degree in co-relation 1626. Up to 282 conditions per place. [2024-06-04 17:43:38,210 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 36 selfloop transitions, 20 changer transitions 0/61 dead transitions. [2024-06-04 17:43:38,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 61 transitions, 485 flow [2024-06-04 17:43:38,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:43:38,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:43:38,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 86 transitions. [2024-06-04 17:43:38,211 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38392857142857145 [2024-06-04 17:43:38,211 INFO L175 Difference]: Start difference. First operand has 60 places, 49 transitions, 303 flow. Second operand 7 states and 86 transitions. [2024-06-04 17:43:38,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 61 transitions, 485 flow [2024-06-04 17:43:38,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 61 transitions, 463 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-06-04 17:43:38,216 INFO L231 Difference]: Finished difference. Result has 64 places, 51 transitions, 350 flow [2024-06-04 17:43:38,216 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=350, PETRI_PLACES=64, PETRI_TRANSITIONS=51} [2024-06-04 17:43:38,217 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 33 predicate places. [2024-06-04 17:43:38,217 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 51 transitions, 350 flow [2024-06-04 17:43:38,217 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-04 17:43:38,217 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:43:38,217 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:43:38,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-04 17:43:38,218 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-04 17:43:38,218 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:43:38,218 INFO L85 PathProgramCache]: Analyzing trace with hash 389763270, now seen corresponding path program 2 times [2024-06-04 17:43:38,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:43:38,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145045495] [2024-06-04 17:43:38,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:43:38,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:43:38,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:43:43,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:43:43,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:43:43,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145045495] [2024-06-04 17:43:43,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145045495] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:43:43,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:43:43,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:43:43,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279641668] [2024-06-04 17:43:43,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:43:43,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:43:43,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:43:43,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:43:43,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:43:43,322 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:43:43,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 51 transitions, 350 flow. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:43:43,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:43:43,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:43:43,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:43:43,624 INFO L124 PetriNetUnfolderBase]: 215/387 cut-off events. [2024-06-04 17:43:43,625 INFO L125 PetriNetUnfolderBase]: For 3636/3642 co-relation queries the response was YES. [2024-06-04 17:43:43,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1819 conditions, 387 events. 215/387 cut-off events. For 3636/3642 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1358 event pairs, 54 based on Foata normal form. 5/390 useless extension candidates. Maximal degree in co-relation 1788. Up to 346 conditions per place. [2024-06-04 17:43:43,629 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 44 selfloop transitions, 17 changer transitions 0/63 dead transitions. [2024-06-04 17:43:43,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 63 transitions, 548 flow [2024-06-04 17:43:43,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:43:43,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:43:43,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 77 transitions. [2024-06-04 17:43:43,630 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34375 [2024-06-04 17:43:43,630 INFO L175 Difference]: Start difference. First operand has 64 places, 51 transitions, 350 flow. Second operand 7 states and 77 transitions. [2024-06-04 17:43:43,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 63 transitions, 548 flow [2024-06-04 17:43:43,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 63 transitions, 495 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-06-04 17:43:43,635 INFO L231 Difference]: Finished difference. Result has 66 places, 55 transitions, 372 flow [2024-06-04 17:43:43,635 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=372, PETRI_PLACES=66, PETRI_TRANSITIONS=55} [2024-06-04 17:43:43,636 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 35 predicate places. [2024-06-04 17:43:43,636 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 55 transitions, 372 flow [2024-06-04 17:43:43,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:43:43,636 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:43:43,636 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:43:43,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-04 17:43:43,637 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-04 17:43:43,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:43:43,637 INFO L85 PathProgramCache]: Analyzing trace with hash 2108938772, now seen corresponding path program 3 times [2024-06-04 17:43:43,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:43:43,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109124174] [2024-06-04 17:43:43,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:43:43,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:43:43,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:43:48,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:43:48,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:43:48,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109124174] [2024-06-04 17:43:48,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109124174] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:43:48,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:43:48,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:43:48,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818403480] [2024-06-04 17:43:48,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:43:48,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:43:48,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:43:48,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:43:48,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:43:48,366 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:43:48,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 55 transitions, 372 flow. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:43:48,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:43:48,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:43:48,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:43:48,661 INFO L124 PetriNetUnfolderBase]: 213/384 cut-off events. [2024-06-04 17:43:48,662 INFO L125 PetriNetUnfolderBase]: For 4023/4029 co-relation queries the response was YES. [2024-06-04 17:43:48,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1823 conditions, 384 events. 213/384 cut-off events. For 4023/4029 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1349 event pairs, 54 based on Foata normal form. 5/387 useless extension candidates. Maximal degree in co-relation 1791. Up to 344 conditions per place. [2024-06-04 17:43:48,665 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 42 selfloop transitions, 18 changer transitions 0/62 dead transitions. [2024-06-04 17:43:48,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 62 transitions, 508 flow [2024-06-04 17:43:48,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:43:48,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:43:48,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2024-06-04 17:43:48,667 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33482142857142855 [2024-06-04 17:43:48,667 INFO L175 Difference]: Start difference. First operand has 66 places, 55 transitions, 372 flow. Second operand 7 states and 75 transitions. [2024-06-04 17:43:48,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 62 transitions, 508 flow [2024-06-04 17:43:48,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 62 transitions, 472 flow, removed 11 selfloop flow, removed 3 redundant places. [2024-06-04 17:43:48,673 INFO L231 Difference]: Finished difference. Result has 70 places, 55 transitions, 377 flow [2024-06-04 17:43:48,673 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=377, PETRI_PLACES=70, PETRI_TRANSITIONS=55} [2024-06-04 17:43:48,674 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 39 predicate places. [2024-06-04 17:43:48,675 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 55 transitions, 377 flow [2024-06-04 17:43:48,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:43:48,675 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:43:48,675 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:43:48,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-04 17:43:48,675 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-04 17:43:48,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:43:48,676 INFO L85 PathProgramCache]: Analyzing trace with hash -404633819, now seen corresponding path program 1 times [2024-06-04 17:43:48,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:43:48,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20546654] [2024-06-04 17:43:48,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:43:48,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:43:48,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:43:53,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:43:53,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:43:53,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20546654] [2024-06-04 17:43:53,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20546654] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:43:53,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:43:53,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:43:53,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018150561] [2024-06-04 17:43:53,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:43:53,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:43:53,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:43:53,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:43:53,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:43:53,707 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 17:43:53,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 55 transitions, 377 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-04 17:43:53,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:43:53,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 17:43:53,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:43:54,059 INFO L124 PetriNetUnfolderBase]: 229/423 cut-off events. [2024-06-04 17:43:54,060 INFO L125 PetriNetUnfolderBase]: For 4627/4627 co-relation queries the response was YES. [2024-06-04 17:43:54,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2036 conditions, 423 events. 229/423 cut-off events. For 4627/4627 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1591 event pairs, 47 based on Foata normal form. 1/423 useless extension candidates. Maximal degree in co-relation 2002. Up to 336 conditions per place. [2024-06-04 17:43:54,064 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 55 selfloop transitions, 21 changer transitions 0/83 dead transitions. [2024-06-04 17:43:54,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 83 transitions, 677 flow [2024-06-04 17:43:54,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:43:54,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:43:54,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 98 transitions. [2024-06-04 17:43:54,066 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3828125 [2024-06-04 17:43:54,066 INFO L175 Difference]: Start difference. First operand has 70 places, 55 transitions, 377 flow. Second operand 8 states and 98 transitions. [2024-06-04 17:43:54,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 83 transitions, 677 flow [2024-06-04 17:43:54,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 83 transitions, 632 flow, removed 1 selfloop flow, removed 6 redundant places. [2024-06-04 17:43:54,072 INFO L231 Difference]: Finished difference. Result has 74 places, 68 transitions, 508 flow [2024-06-04 17:43:54,072 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=508, PETRI_PLACES=74, PETRI_TRANSITIONS=68} [2024-06-04 17:43:54,073 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 43 predicate places. [2024-06-04 17:43:54,073 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 68 transitions, 508 flow [2024-06-04 17:43:54,073 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-04 17:43:54,073 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:43:54,073 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:43:54,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-04 17:43:54,074 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-04 17:43:54,074 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:43:54,074 INFO L85 PathProgramCache]: Analyzing trace with hash -450276355, now seen corresponding path program 2 times [2024-06-04 17:43:54,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:43:54,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36019148] [2024-06-04 17:43:54,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:43:54,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:43:54,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:43:58,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:43:58,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:43:58,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36019148] [2024-06-04 17:43:58,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36019148] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:43:58,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:43:58,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:43:58,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748814260] [2024-06-04 17:43:58,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:43:58,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:43:58,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:43:58,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:43:58,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:43:59,107 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 17:43:59,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 68 transitions, 508 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-04 17:43:59,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:43:59,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 17:43:59,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:43:59,455 INFO L124 PetriNetUnfolderBase]: 228/421 cut-off events. [2024-06-04 17:43:59,456 INFO L125 PetriNetUnfolderBase]: For 5135/5135 co-relation queries the response was YES. [2024-06-04 17:43:59,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2106 conditions, 421 events. 228/421 cut-off events. For 5135/5135 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1576 event pairs, 50 based on Foata normal form. 1/421 useless extension candidates. Maximal degree in co-relation 2069. Up to 321 conditions per place. [2024-06-04 17:43:59,460 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 49 selfloop transitions, 25 changer transitions 0/81 dead transitions. [2024-06-04 17:43:59,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 81 transitions, 696 flow [2024-06-04 17:43:59,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:43:59,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:43:59,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 86 transitions. [2024-06-04 17:43:59,461 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38392857142857145 [2024-06-04 17:43:59,461 INFO L175 Difference]: Start difference. First operand has 74 places, 68 transitions, 508 flow. Second operand 7 states and 86 transitions. [2024-06-04 17:43:59,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 81 transitions, 696 flow [2024-06-04 17:43:59,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 81 transitions, 662 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-06-04 17:43:59,469 INFO L231 Difference]: Finished difference. Result has 78 places, 68 transitions, 540 flow [2024-06-04 17:43:59,469 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=540, PETRI_PLACES=78, PETRI_TRANSITIONS=68} [2024-06-04 17:43:59,469 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 47 predicate places. [2024-06-04 17:43:59,469 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 68 transitions, 540 flow [2024-06-04 17:43:59,470 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-04 17:43:59,470 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:43:59,470 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:43:59,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-04 17:43:59,470 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-04 17:43:59,471 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:43:59,471 INFO L85 PathProgramCache]: Analyzing trace with hash -450185990, now seen corresponding path program 1 times [2024-06-04 17:43:59,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:43:59,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167813565] [2024-06-04 17:43:59,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:43:59,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:43:59,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:44:04,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:44:04,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:44:04,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167813565] [2024-06-04 17:44:04,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167813565] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:44:04,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:44:04,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:44:04,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606905858] [2024-06-04 17:44:04,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:44:04,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:44:04,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:44:04,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:44:04,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:44:04,219 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:44:04,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 68 transitions, 540 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:44:04,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:44:04,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:44:04,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:44:04,582 INFO L124 PetriNetUnfolderBase]: 246/443 cut-off events. [2024-06-04 17:44:04,582 INFO L125 PetriNetUnfolderBase]: For 5920/5920 co-relation queries the response was YES. [2024-06-04 17:44:04,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2270 conditions, 443 events. 246/443 cut-off events. For 5920/5920 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1627 event pairs, 50 based on Foata normal form. 2/444 useless extension candidates. Maximal degree in co-relation 2232. Up to 359 conditions per place. [2024-06-04 17:44:04,585 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 59 selfloop transitions, 24 changer transitions 0/85 dead transitions. [2024-06-04 17:44:04,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 85 transitions, 770 flow [2024-06-04 17:44:04,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:44:04,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:44:04,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2024-06-04 17:44:04,586 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34765625 [2024-06-04 17:44:04,586 INFO L175 Difference]: Start difference. First operand has 78 places, 68 transitions, 540 flow. Second operand 8 states and 89 transitions. [2024-06-04 17:44:04,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 85 transitions, 770 flow [2024-06-04 17:44:04,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 85 transitions, 712 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-04 17:44:04,593 INFO L231 Difference]: Finished difference. Result has 80 places, 70 transitions, 558 flow [2024-06-04 17:44:04,594 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=482, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=558, PETRI_PLACES=80, PETRI_TRANSITIONS=70} [2024-06-04 17:44:04,594 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 49 predicate places. [2024-06-04 17:44:04,594 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 70 transitions, 558 flow [2024-06-04 17:44:04,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:44:04,594 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:44:04,595 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:44:04,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-04 17:44:04,595 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-04 17:44:04,595 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:44:04,595 INFO L85 PathProgramCache]: Analyzing trace with hash 745934754, now seen corresponding path program 2 times [2024-06-04 17:44:04,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:44:04,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042692730] [2024-06-04 17:44:04,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:44:04,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:44:04,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:44:09,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:44:09,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:44:09,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042692730] [2024-06-04 17:44:09,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042692730] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:44:09,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:44:09,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:44:09,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673396237] [2024-06-04 17:44:09,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:44:09,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:44:09,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:44:09,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:44:09,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:44:09,511 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:44:09,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 70 transitions, 558 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:44:09,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:44:09,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:44:09,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:44:09,864 INFO L124 PetriNetUnfolderBase]: 267/477 cut-off events. [2024-06-04 17:44:09,865 INFO L125 PetriNetUnfolderBase]: For 6624/6624 co-relation queries the response was YES. [2024-06-04 17:44:09,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2526 conditions, 477 events. 267/477 cut-off events. For 6624/6624 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1789 event pairs, 60 based on Foata normal form. 2/478 useless extension candidates. Maximal degree in co-relation 2487. Up to 348 conditions per place. [2024-06-04 17:44:09,869 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 57 selfloop transitions, 32 changer transitions 0/91 dead transitions. [2024-06-04 17:44:09,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 91 transitions, 912 flow [2024-06-04 17:44:09,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:44:09,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:44:09,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 93 transitions. [2024-06-04 17:44:09,872 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36328125 [2024-06-04 17:44:09,872 INFO L175 Difference]: Start difference. First operand has 80 places, 70 transitions, 558 flow. Second operand 8 states and 93 transitions. [2024-06-04 17:44:09,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 91 transitions, 912 flow [2024-06-04 17:44:09,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 91 transitions, 854 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-04 17:44:09,881 INFO L231 Difference]: Finished difference. Result has 82 places, 76 transitions, 639 flow [2024-06-04 17:44:09,881 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=639, PETRI_PLACES=82, PETRI_TRANSITIONS=76} [2024-06-04 17:44:09,882 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 51 predicate places. [2024-06-04 17:44:09,882 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 76 transitions, 639 flow [2024-06-04 17:44:09,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:44:09,882 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:44:09,882 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:44:09,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-04 17:44:09,883 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-04 17:44:09,883 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:44:09,883 INFO L85 PathProgramCache]: Analyzing trace with hash -250867483, now seen corresponding path program 1 times [2024-06-04 17:44:09,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:44:09,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278984882] [2024-06-04 17:44:09,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:44:09,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:44:09,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:44:15,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:44:15,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:44:15,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278984882] [2024-06-04 17:44:15,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278984882] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:44:15,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:44:15,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:44:15,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608260612] [2024-06-04 17:44:15,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:44:15,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:44:15,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:44:15,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:44:15,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:44:15,182 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:44:15,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 76 transitions, 639 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:44:15,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:44:15,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:44:15,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:44:15,495 INFO L124 PetriNetUnfolderBase]: 270/482 cut-off events. [2024-06-04 17:44:15,495 INFO L125 PetriNetUnfolderBase]: For 7311/7311 co-relation queries the response was YES. [2024-06-04 17:44:15,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2618 conditions, 482 events. 270/482 cut-off events. For 7311/7311 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1815 event pairs, 58 based on Foata normal form. 1/482 useless extension candidates. Maximal degree in co-relation 2578. Up to 448 conditions per place. [2024-06-04 17:44:15,499 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 73 selfloop transitions, 14 changer transitions 0/89 dead transitions. [2024-06-04 17:44:15,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 89 transitions, 859 flow [2024-06-04 17:44:15,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:44:15,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:44:15,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 83 transitions. [2024-06-04 17:44:15,501 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32421875 [2024-06-04 17:44:15,501 INFO L175 Difference]: Start difference. First operand has 82 places, 76 transitions, 639 flow. Second operand 8 states and 83 transitions. [2024-06-04 17:44:15,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 89 transitions, 859 flow [2024-06-04 17:44:15,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 89 transitions, 822 flow, removed 10 selfloop flow, removed 3 redundant places. [2024-06-04 17:44:15,512 INFO L231 Difference]: Finished difference. Result has 87 places, 78 transitions, 653 flow [2024-06-04 17:44:15,512 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=653, PETRI_PLACES=87, PETRI_TRANSITIONS=78} [2024-06-04 17:44:15,512 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 56 predicate places. [2024-06-04 17:44:15,513 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 78 transitions, 653 flow [2024-06-04 17:44:15,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:44:15,513 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:44:15,513 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:44:15,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-04 17:44:15,513 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-04 17:44:15,514 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:44:15,514 INFO L85 PathProgramCache]: Analyzing trace with hash -250867700, now seen corresponding path program 3 times [2024-06-04 17:44:15,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:44:15,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356182581] [2024-06-04 17:44:15,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:44:15,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:44:15,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:44:20,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:44:20,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:44:20,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356182581] [2024-06-04 17:44:20,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356182581] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:44:20,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:44:20,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:44:20,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733626315] [2024-06-04 17:44:20,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:44:20,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:44:20,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:44:20,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:44:20,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:44:20,391 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:44:20,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 78 transitions, 653 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:44:20,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:44:20,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:44:20,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:44:20,713 INFO L124 PetriNetUnfolderBase]: 266/476 cut-off events. [2024-06-04 17:44:20,714 INFO L125 PetriNetUnfolderBase]: For 7629/7629 co-relation queries the response was YES. [2024-06-04 17:44:20,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2622 conditions, 476 events. 266/476 cut-off events. For 7629/7629 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1785 event pairs, 56 based on Foata normal form. 2/477 useless extension candidates. Maximal degree in co-relation 2580. Up to 350 conditions per place. [2024-06-04 17:44:20,718 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 54 selfloop transitions, 36 changer transitions 0/92 dead transitions. [2024-06-04 17:44:20,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 92 transitions, 911 flow [2024-06-04 17:44:20,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:44:20,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:44:20,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 91 transitions. [2024-06-04 17:44:20,720 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35546875 [2024-06-04 17:44:20,720 INFO L175 Difference]: Start difference. First operand has 87 places, 78 transitions, 653 flow. Second operand 8 states and 91 transitions. [2024-06-04 17:44:20,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 92 transitions, 911 flow [2024-06-04 17:44:20,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 92 transitions, 862 flow, removed 12 selfloop flow, removed 6 redundant places. [2024-06-04 17:44:20,732 INFO L231 Difference]: Finished difference. Result has 89 places, 78 transitions, 681 flow [2024-06-04 17:44:20,732 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=604, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=681, PETRI_PLACES=89, PETRI_TRANSITIONS=78} [2024-06-04 17:44:20,733 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 58 predicate places. [2024-06-04 17:44:20,733 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 78 transitions, 681 flow [2024-06-04 17:44:20,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:44:20,733 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:44:20,734 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:44:20,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-04 17:44:20,734 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-04 17:44:20,734 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:44:20,734 INFO L85 PathProgramCache]: Analyzing trace with hash 945236544, now seen corresponding path program 4 times [2024-06-04 17:44:20,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:44:20,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596954963] [2024-06-04 17:44:20,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:44:20,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:44:20,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:44:25,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:44:25,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:44:25,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596954963] [2024-06-04 17:44:25,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596954963] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:44:25,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:44:25,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:44:25,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93218535] [2024-06-04 17:44:25,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:44:25,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:44:25,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:44:25,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:44:25,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:44:25,946 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:44:25,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 78 transitions, 681 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:44:25,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:44:25,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:44:25,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:44:26,351 INFO L124 PetriNetUnfolderBase]: 272/487 cut-off events. [2024-06-04 17:44:26,352 INFO L125 PetriNetUnfolderBase]: For 8583/8589 co-relation queries the response was YES. [2024-06-04 17:44:26,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2750 conditions, 487 events. 272/487 cut-off events. For 8583/8589 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1837 event pairs, 67 based on Foata normal form. 2/484 useless extension candidates. Maximal degree in co-relation 2707. Up to 320 conditions per place. [2024-06-04 17:44:26,357 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 51 selfloop transitions, 42 changer transitions 0/95 dead transitions. [2024-06-04 17:44:26,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 95 transitions, 1035 flow [2024-06-04 17:44:26,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:44:26,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:44:26,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 93 transitions. [2024-06-04 17:44:26,360 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36328125 [2024-06-04 17:44:26,360 INFO L175 Difference]: Start difference. First operand has 89 places, 78 transitions, 681 flow. Second operand 8 states and 93 transitions. [2024-06-04 17:44:26,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 95 transitions, 1035 flow [2024-06-04 17:44:26,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 95 transitions, 970 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-04 17:44:26,371 INFO L231 Difference]: Finished difference. Result has 91 places, 82 transitions, 761 flow [2024-06-04 17:44:26,372 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=616, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=761, PETRI_PLACES=91, PETRI_TRANSITIONS=82} [2024-06-04 17:44:26,372 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 60 predicate places. [2024-06-04 17:44:26,372 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 82 transitions, 761 flow [2024-06-04 17:44:26,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:44:26,373 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:44:26,373 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:44:26,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-04 17:44:26,373 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-04 17:44:26,373 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:44:26,374 INFO L85 PathProgramCache]: Analyzing trace with hash 945242341, now seen corresponding path program 2 times [2024-06-04 17:44:26,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:44:26,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357635747] [2024-06-04 17:44:26,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:44:26,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:44:26,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:44:31,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:44:31,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:44:31,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357635747] [2024-06-04 17:44:31,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357635747] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:44:31,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:44:31,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:44:31,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836101453] [2024-06-04 17:44:31,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:44:31,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:44:31,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:44:31,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:44:31,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:44:31,834 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:44:31,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 82 transitions, 761 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:44:31,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:44:31,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:44:31,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:44:32,107 INFO L124 PetriNetUnfolderBase]: 275/492 cut-off events. [2024-06-04 17:44:32,107 INFO L125 PetriNetUnfolderBase]: For 9233/9239 co-relation queries the response was YES. [2024-06-04 17:44:32,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2860 conditions, 492 events. 275/492 cut-off events. For 9233/9239 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1867 event pairs, 60 based on Foata normal form. 5/494 useless extension candidates. Maximal degree in co-relation 2816. Up to 430 conditions per place. [2024-06-04 17:44:32,112 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 72 selfloop transitions, 24 changer transitions 0/98 dead transitions. [2024-06-04 17:44:32,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 98 transitions, 1067 flow [2024-06-04 17:44:32,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:44:32,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:44:32,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 87 transitions. [2024-06-04 17:44:32,113 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33984375 [2024-06-04 17:44:32,114 INFO L175 Difference]: Start difference. First operand has 91 places, 82 transitions, 761 flow. Second operand 8 states and 87 transitions. [2024-06-04 17:44:32,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 98 transitions, 1067 flow [2024-06-04 17:44:32,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 98 transitions, 966 flow, removed 17 selfloop flow, removed 5 redundant places. [2024-06-04 17:44:32,124 INFO L231 Difference]: Finished difference. Result has 95 places, 88 transitions, 774 flow [2024-06-04 17:44:32,124 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=660, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=774, PETRI_PLACES=95, PETRI_TRANSITIONS=88} [2024-06-04 17:44:32,125 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 64 predicate places. [2024-06-04 17:44:32,125 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 88 transitions, 774 flow [2024-06-04 17:44:32,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:44:32,125 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:44:32,125 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:44:32,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-04 17:44:32,125 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-04 17:44:32,125 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:44:32,126 INFO L85 PathProgramCache]: Analyzing trace with hash 945242124, now seen corresponding path program 5 times [2024-06-04 17:44:32,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:44:32,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358619207] [2024-06-04 17:44:32,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:44:32,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:44:32,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:44:37,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:44:37,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:44:37,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358619207] [2024-06-04 17:44:37,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358619207] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:44:37,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:44:37,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:44:37,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304401699] [2024-06-04 17:44:37,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:44:37,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:44:37,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:44:37,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:44:37,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:44:37,340 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:44:37,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 88 transitions, 774 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:44:37,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:44:37,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:44:37,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:44:37,696 INFO L124 PetriNetUnfolderBase]: 281/502 cut-off events. [2024-06-04 17:44:37,697 INFO L125 PetriNetUnfolderBase]: For 10063/10069 co-relation queries the response was YES. [2024-06-04 17:44:37,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2899 conditions, 502 events. 281/502 cut-off events. For 10063/10069 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1902 event pairs, 67 based on Foata normal form. 2/499 useless extension candidates. Maximal degree in co-relation 2853. Up to 331 conditions per place. [2024-06-04 17:44:37,701 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 59 selfloop transitions, 43 changer transitions 0/104 dead transitions. [2024-06-04 17:44:37,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 104 transitions, 1128 flow [2024-06-04 17:44:37,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:44:37,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:44:37,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 95 transitions. [2024-06-04 17:44:37,704 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37109375 [2024-06-04 17:44:37,705 INFO L175 Difference]: Start difference. First operand has 95 places, 88 transitions, 774 flow. Second operand 8 states and 95 transitions. [2024-06-04 17:44:37,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 104 transitions, 1128 flow [2024-06-04 17:44:37,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 104 transitions, 1103 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-06-04 17:44:37,717 INFO L231 Difference]: Finished difference. Result has 100 places, 90 transitions, 862 flow [2024-06-04 17:44:37,717 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=749, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=862, PETRI_PLACES=100, PETRI_TRANSITIONS=90} [2024-06-04 17:44:37,718 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 69 predicate places. [2024-06-04 17:44:37,718 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 90 transitions, 862 flow [2024-06-04 17:44:37,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:44:37,718 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:44:37,719 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:44:37,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-04 17:44:37,719 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-04 17:44:37,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:44:37,720 INFO L85 PathProgramCache]: Analyzing trace with hash 952860901, now seen corresponding path program 3 times [2024-06-04 17:44:37,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:44:37,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912842551] [2024-06-04 17:44:37,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:44:37,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:44:37,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:44:42,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:44:42,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:44:42,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912842551] [2024-06-04 17:44:42,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912842551] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:44:42,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:44:42,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:44:42,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387332358] [2024-06-04 17:44:42,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:44:42,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:44:42,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:44:42,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:44:42,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:44:42,984 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:44:42,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 90 transitions, 862 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:44:42,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:44:42,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:44:42,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:44:43,250 INFO L124 PetriNetUnfolderBase]: 284/507 cut-off events. [2024-06-04 17:44:43,251 INFO L125 PetriNetUnfolderBase]: For 10794/10800 co-relation queries the response was YES. [2024-06-04 17:44:43,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3060 conditions, 507 events. 284/507 cut-off events. For 10794/10800 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1924 event pairs, 60 based on Foata normal form. 5/509 useless extension candidates. Maximal degree in co-relation 3012. Up to 444 conditions per place. [2024-06-04 17:44:43,254 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 71 selfloop transitions, 29 changer transitions 0/102 dead transitions. [2024-06-04 17:44:43,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 102 transitions, 1158 flow [2024-06-04 17:44:43,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:44:43,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:44:43,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 85 transitions. [2024-06-04 17:44:43,255 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33203125 [2024-06-04 17:44:43,255 INFO L175 Difference]: Start difference. First operand has 100 places, 90 transitions, 862 flow. Second operand 8 states and 85 transitions. [2024-06-04 17:44:43,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 102 transitions, 1158 flow [2024-06-04 17:44:43,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 102 transitions, 1069 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-06-04 17:44:43,266 INFO L231 Difference]: Finished difference. Result has 103 places, 92 transitions, 858 flow [2024-06-04 17:44:43,266 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=773, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=858, PETRI_PLACES=103, PETRI_TRANSITIONS=92} [2024-06-04 17:44:43,267 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 72 predicate places. [2024-06-04 17:44:43,267 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 92 transitions, 858 flow [2024-06-04 17:44:43,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:44:43,267 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:44:43,267 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:44:43,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-04 17:44:43,267 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-04 17:44:43,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:44:43,268 INFO L85 PathProgramCache]: Analyzing trace with hash 952593991, now seen corresponding path program 4 times [2024-06-04 17:44:43,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:44:43,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569056037] [2024-06-04 17:44:43,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:44:43,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:44:43,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:44:48,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-04 17:44:48,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:44:48,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569056037] [2024-06-04 17:44:48,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569056037] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:44:48,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:44:48,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:44:48,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284329999] [2024-06-04 17:44:48,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:44:48,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:44:48,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:44:48,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:44:48,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:44:48,523 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:44:48,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 92 transitions, 858 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:44:48,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:44:48,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:44:48,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:44:48,838 INFO L124 PetriNetUnfolderBase]: 282/504 cut-off events. [2024-06-04 17:44:48,838 INFO L125 PetriNetUnfolderBase]: For 11150/11156 co-relation queries the response was YES. [2024-06-04 17:44:48,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2999 conditions, 504 events. 282/504 cut-off events. For 11150/11156 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1933 event pairs, 60 based on Foata normal form. 5/506 useless extension candidates. Maximal degree in co-relation 2950. Up to 442 conditions per place. [2024-06-04 17:44:48,854 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 72 selfloop transitions, 27 changer transitions 0/101 dead transitions. [2024-06-04 17:44:48,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 101 transitions, 1082 flow [2024-06-04 17:44:48,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:44:48,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:44:48,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 85 transitions. [2024-06-04 17:44:48,859 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33203125 [2024-06-04 17:44:48,859 INFO L175 Difference]: Start difference. First operand has 103 places, 92 transitions, 858 flow. Second operand 8 states and 85 transitions. [2024-06-04 17:44:48,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 101 transitions, 1082 flow [2024-06-04 17:44:48,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 101 transitions, 1011 flow, removed 14 selfloop flow, removed 5 redundant places. [2024-06-04 17:44:48,875 INFO L231 Difference]: Finished difference. Result has 106 places, 92 transitions, 846 flow [2024-06-04 17:44:48,876 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=787, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=846, PETRI_PLACES=106, PETRI_TRANSITIONS=92} [2024-06-04 17:44:48,876 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 75 predicate places. [2024-06-04 17:44:48,877 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 92 transitions, 846 flow [2024-06-04 17:44:48,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:44:48,877 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:44:48,877 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:44:48,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-04 17:44:48,877 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-04 17:44:48,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:44:48,879 INFO L85 PathProgramCache]: Analyzing trace with hash -302369000, now seen corresponding path program 6 times [2024-06-04 17:44:48,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:44:48,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835311305] [2024-06-04 17:44:48,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:44:48,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:44:48,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:44:53,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:44:53,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:44:53,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835311305] [2024-06-04 17:44:53,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835311305] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:44:53,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:44:53,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:44:53,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177507529] [2024-06-04 17:44:53,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:44:53,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:44:53,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:44:53,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:44:53,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:44:53,878 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:44:53,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 92 transitions, 846 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:44:53,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:44:53,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:44:53,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:44:54,150 INFO L124 PetriNetUnfolderBase]: 278/498 cut-off events. [2024-06-04 17:44:54,151 INFO L125 PetriNetUnfolderBase]: For 11636/11642 co-relation queries the response was YES. [2024-06-04 17:44:54,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2940 conditions, 498 events. 278/498 cut-off events. For 11636/11642 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1892 event pairs, 62 based on Foata normal form. 2/495 useless extension candidates. Maximal degree in co-relation 2890. Up to 330 conditions per place. [2024-06-04 17:44:54,154 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 53 selfloop transitions, 49 changer transitions 0/104 dead transitions. [2024-06-04 17:44:54,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 104 transitions, 1134 flow [2024-06-04 17:44:54,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:44:54,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:44:54,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 91 transitions. [2024-06-04 17:44:54,155 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35546875 [2024-06-04 17:44:54,155 INFO L175 Difference]: Start difference. First operand has 106 places, 92 transitions, 846 flow. Second operand 8 states and 91 transitions. [2024-06-04 17:44:54,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 104 transitions, 1134 flow [2024-06-04 17:44:54,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 104 transitions, 1073 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-04 17:44:54,166 INFO L231 Difference]: Finished difference. Result has 108 places, 92 transitions, 888 flow [2024-06-04 17:44:54,166 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=785, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=888, PETRI_PLACES=108, PETRI_TRANSITIONS=92} [2024-06-04 17:44:54,166 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 77 predicate places. [2024-06-04 17:44:54,167 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 92 transitions, 888 flow [2024-06-04 17:44:54,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:44:54,167 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:44:54,167 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:44:54,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-04 17:44:54,167 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-04 17:44:54,168 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:44:54,168 INFO L85 PathProgramCache]: Analyzing trace with hash 952870821, now seen corresponding path program 1 times [2024-06-04 17:44:54,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:44:54,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563315292] [2024-06-04 17:44:54,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:44:54,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:44:54,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:44:59,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:44:59,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:44:59,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563315292] [2024-06-04 17:44:59,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563315292] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:44:59,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:44:59,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:44:59,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820488615] [2024-06-04 17:44:59,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:44:59,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:44:59,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:44:59,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:44:59,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:44:59,841 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:44:59,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 92 transitions, 888 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:44:59,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:44:59,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:44:59,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:45:00,108 INFO L124 PetriNetUnfolderBase]: 276/494 cut-off events. [2024-06-04 17:45:00,108 INFO L125 PetriNetUnfolderBase]: For 11885/11885 co-relation queries the response was YES. [2024-06-04 17:45:00,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2993 conditions, 494 events. 276/494 cut-off events. For 11885/11885 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1884 event pairs, 62 based on Foata normal form. 1/494 useless extension candidates. Maximal degree in co-relation 2942. Up to 467 conditions per place. [2024-06-04 17:45:00,111 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 87 selfloop transitions, 14 changer transitions 0/103 dead transitions. [2024-06-04 17:45:00,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 103 transitions, 1124 flow [2024-06-04 17:45:00,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:45:00,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:45:00,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 88 transitions. [2024-06-04 17:45:00,113 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3055555555555556 [2024-06-04 17:45:00,113 INFO L175 Difference]: Start difference. First operand has 108 places, 92 transitions, 888 flow. Second operand 9 states and 88 transitions. [2024-06-04 17:45:00,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 103 transitions, 1124 flow [2024-06-04 17:45:00,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 103 transitions, 1010 flow, removed 1 selfloop flow, removed 8 redundant places. [2024-06-04 17:45:00,127 INFO L231 Difference]: Finished difference. Result has 109 places, 94 transitions, 823 flow [2024-06-04 17:45:00,127 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=774, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=823, PETRI_PLACES=109, PETRI_TRANSITIONS=94} [2024-06-04 17:45:00,128 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 78 predicate places. [2024-06-04 17:45:00,128 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 94 transitions, 823 flow [2024-06-04 17:45:00,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:45:00,128 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:45:00,128 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:45:00,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-04 17:45:00,129 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-04 17:45:00,129 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:45:00,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1073724223, now seen corresponding path program 1 times [2024-06-04 17:45:00,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:45:00,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513052960] [2024-06-04 17:45:00,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:45:00,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:45:00,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:45:05,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:45:05,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:45:05,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513052960] [2024-06-04 17:45:05,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513052960] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:45:05,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:45:05,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:45:05,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465631291] [2024-06-04 17:45:05,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:45:05,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:45:05,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:45:05,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:45:05,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:45:05,948 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 17:45:05,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 94 transitions, 823 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-04 17:45:05,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:45:05,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 17:45:05,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:45:06,365 INFO L124 PetriNetUnfolderBase]: 264/486 cut-off events. [2024-06-04 17:45:06,365 INFO L125 PetriNetUnfolderBase]: For 13264/13266 co-relation queries the response was YES. [2024-06-04 17:45:06,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2946 conditions, 486 events. 264/486 cut-off events. For 13264/13266 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1927 event pairs, 33 based on Foata normal form. 2/484 useless extension candidates. Maximal degree in co-relation 2894. Up to 363 conditions per place. [2024-06-04 17:45:06,369 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 77 selfloop transitions, 19 changer transitions 0/110 dead transitions. [2024-06-04 17:45:06,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 110 transitions, 1071 flow [2024-06-04 17:45:06,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:45:06,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:45:06,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 93 transitions. [2024-06-04 17:45:06,371 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36328125 [2024-06-04 17:45:06,371 INFO L175 Difference]: Start difference. First operand has 109 places, 94 transitions, 823 flow. Second operand 8 states and 93 transitions. [2024-06-04 17:45:06,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 110 transitions, 1071 flow [2024-06-04 17:45:06,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 110 transitions, 990 flow, removed 6 selfloop flow, removed 10 redundant places. [2024-06-04 17:45:06,389 INFO L231 Difference]: Finished difference. Result has 107 places, 95 transitions, 800 flow [2024-06-04 17:45:06,389 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=742, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=800, PETRI_PLACES=107, PETRI_TRANSITIONS=95} [2024-06-04 17:45:06,390 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 76 predicate places. [2024-06-04 17:45:06,390 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 95 transitions, 800 flow [2024-06-04 17:45:06,390 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-04 17:45:06,390 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:45:06,391 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:45:06,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-04 17:45:06,391 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-04 17:45:06,391 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:45:06,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1073663773, now seen corresponding path program 2 times [2024-06-04 17:45:06,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:45:06,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431878491] [2024-06-04 17:45:06,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:45:06,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:45:06,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:45:11,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:45:11,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:45:11,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431878491] [2024-06-04 17:45:11,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431878491] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:45:11,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:45:11,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:45:11,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072323730] [2024-06-04 17:45:11,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:45:11,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:45:11,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:45:11,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:45:11,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:45:11,767 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 17:45:11,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 95 transitions, 800 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-04 17:45:11,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:45:11,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 17:45:11,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:45:12,100 INFO L124 PetriNetUnfolderBase]: 263/489 cut-off events. [2024-06-04 17:45:12,101 INFO L125 PetriNetUnfolderBase]: For 13839/13839 co-relation queries the response was YES. [2024-06-04 17:45:12,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2957 conditions, 489 events. 263/489 cut-off events. For 13839/13839 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1966 event pairs, 48 based on Foata normal form. 2/490 useless extension candidates. Maximal degree in co-relation 2905. Up to 364 conditions per place. [2024-06-04 17:45:12,104 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 71 selfloop transitions, 26 changer transitions 0/111 dead transitions. [2024-06-04 17:45:12,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 111 transitions, 1054 flow [2024-06-04 17:45:12,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:45:12,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:45:12,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 95 transitions. [2024-06-04 17:45:12,107 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37109375 [2024-06-04 17:45:12,107 INFO L175 Difference]: Start difference. First operand has 107 places, 95 transitions, 800 flow. Second operand 8 states and 95 transitions. [2024-06-04 17:45:12,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 111 transitions, 1054 flow [2024-06-04 17:45:12,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 111 transitions, 1006 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-04 17:45:12,120 INFO L231 Difference]: Finished difference. Result has 109 places, 96 transitions, 829 flow [2024-06-04 17:45:12,120 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=752, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=829, PETRI_PLACES=109, PETRI_TRANSITIONS=96} [2024-06-04 17:45:12,120 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 78 predicate places. [2024-06-04 17:45:12,121 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 96 transitions, 829 flow [2024-06-04 17:45:12,121 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-04 17:45:12,121 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:45:12,121 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:45:12,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-04 17:45:12,121 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-04 17:45:12,121 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:45:12,121 INFO L85 PathProgramCache]: Analyzing trace with hash 694771895, now seen corresponding path program 1 times [2024-06-04 17:45:12,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:45:12,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053823001] [2024-06-04 17:45:12,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:45:12,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:45:12,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:45:16,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:45:16,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:45:16,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053823001] [2024-06-04 17:45:16,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053823001] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:45:16,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:45:16,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:45:16,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059564948] [2024-06-04 17:45:16,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:45:16,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:45:16,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:45:16,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:45:16,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:45:16,804 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:45:16,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 96 transitions, 829 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:45:16,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:45:16,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:45:16,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:45:17,113 INFO L124 PetriNetUnfolderBase]: 282/507 cut-off events. [2024-06-04 17:45:17,113 INFO L125 PetriNetUnfolderBase]: For 14105/14105 co-relation queries the response was YES. [2024-06-04 17:45:17,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3043 conditions, 507 events. 282/507 cut-off events. For 14105/14105 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1979 event pairs, 50 based on Foata normal form. 1/507 useless extension candidates. Maximal degree in co-relation 2990. Up to 410 conditions per place. [2024-06-04 17:45:17,116 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 80 selfloop transitions, 29 changer transitions 0/111 dead transitions. [2024-06-04 17:45:17,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 111 transitions, 1093 flow [2024-06-04 17:45:17,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:45:17,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:45:17,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2024-06-04 17:45:17,117 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34765625 [2024-06-04 17:45:17,117 INFO L175 Difference]: Start difference. First operand has 109 places, 96 transitions, 829 flow. Second operand 8 states and 89 transitions. [2024-06-04 17:45:17,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 111 transitions, 1093 flow [2024-06-04 17:45:17,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 111 transitions, 1024 flow, removed 11 selfloop flow, removed 6 redundant places. [2024-06-04 17:45:17,130 INFO L231 Difference]: Finished difference. Result has 111 places, 96 transitions, 828 flow [2024-06-04 17:45:17,131 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=760, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=828, PETRI_PLACES=111, PETRI_TRANSITIONS=96} [2024-06-04 17:45:17,131 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 80 predicate places. [2024-06-04 17:45:17,131 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 96 transitions, 828 flow [2024-06-04 17:45:17,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:45:17,131 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:45:17,131 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:45:17,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-04 17:45:17,132 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-04 17:45:17,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:45:17,132 INFO L85 PathProgramCache]: Analyzing trace with hash 697573241, now seen corresponding path program 1 times [2024-06-04 17:45:17,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:45:17,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057740102] [2024-06-04 17:45:17,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:45:17,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:45:17,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:45:22,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:45:22,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:45:22,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057740102] [2024-06-04 17:45:22,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057740102] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:45:22,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:45:22,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:45:22,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530078233] [2024-06-04 17:45:22,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:45:22,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:45:22,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:45:22,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:45:22,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:45:22,700 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:45:22,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 96 transitions, 828 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:45:22,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:45:22,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:45:22,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:45:23,069 INFO L124 PetriNetUnfolderBase]: 288/517 cut-off events. [2024-06-04 17:45:23,070 INFO L125 PetriNetUnfolderBase]: For 15365/15365 co-relation queries the response was YES. [2024-06-04 17:45:23,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3104 conditions, 517 events. 288/517 cut-off events. For 15365/15365 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2020 event pairs, 48 based on Foata normal form. 2/518 useless extension candidates. Maximal degree in co-relation 3050. Up to 425 conditions per place. [2024-06-04 17:45:23,074 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 87 selfloop transitions, 26 changer transitions 0/115 dead transitions. [2024-06-04 17:45:23,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 115 transitions, 1126 flow [2024-06-04 17:45:23,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:45:23,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:45:23,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2024-06-04 17:45:23,075 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3402777777777778 [2024-06-04 17:45:23,076 INFO L175 Difference]: Start difference. First operand has 111 places, 96 transitions, 828 flow. Second operand 9 states and 98 transitions. [2024-06-04 17:45:23,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 115 transitions, 1126 flow [2024-06-04 17:45:23,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 115 transitions, 1039 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-04 17:45:23,098 INFO L231 Difference]: Finished difference. Result has 112 places, 98 transitions, 822 flow [2024-06-04 17:45:23,098 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=741, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=822, PETRI_PLACES=112, PETRI_TRANSITIONS=98} [2024-06-04 17:45:23,099 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 81 predicate places. [2024-06-04 17:45:23,099 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 98 transitions, 822 flow [2024-06-04 17:45:23,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:45:23,099 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:45:23,099 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:45:23,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-04 17:45:23,100 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-04 17:45:23,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:45:23,100 INFO L85 PathProgramCache]: Analyzing trace with hash 812864411, now seen corresponding path program 2 times [2024-06-04 17:45:23,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:45:23,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544743967] [2024-06-04 17:45:23,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:45:23,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:45:23,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:45:28,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:45:28,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:45:28,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544743967] [2024-06-04 17:45:28,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544743967] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:45:28,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:45:28,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:45:28,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531031105] [2024-06-04 17:45:28,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:45:28,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:45:28,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:45:28,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:45:28,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:45:28,612 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:45:28,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 98 transitions, 822 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:45:28,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:45:28,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:45:28,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:45:28,935 INFO L124 PetriNetUnfolderBase]: 309/551 cut-off events. [2024-06-04 17:45:28,935 INFO L125 PetriNetUnfolderBase]: For 17880/17880 co-relation queries the response was YES. [2024-06-04 17:45:28,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3408 conditions, 551 events. 309/551 cut-off events. For 17880/17880 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2184 event pairs, 60 based on Foata normal form. 2/552 useless extension candidates. Maximal degree in co-relation 3353. Up to 390 conditions per place. [2024-06-04 17:45:28,939 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 81 selfloop transitions, 38 changer transitions 0/121 dead transitions. [2024-06-04 17:45:28,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 121 transitions, 1304 flow [2024-06-04 17:45:28,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:45:28,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:45:28,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2024-06-04 17:45:28,940 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3611111111111111 [2024-06-04 17:45:28,940 INFO L175 Difference]: Start difference. First operand has 112 places, 98 transitions, 822 flow. Second operand 9 states and 104 transitions. [2024-06-04 17:45:28,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 121 transitions, 1304 flow [2024-06-04 17:45:28,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 121 transitions, 1239 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-04 17:45:28,960 INFO L231 Difference]: Finished difference. Result has 114 places, 104 transitions, 914 flow [2024-06-04 17:45:28,960 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=757, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=914, PETRI_PLACES=114, PETRI_TRANSITIONS=104} [2024-06-04 17:45:28,960 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 83 predicate places. [2024-06-04 17:45:28,961 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 104 transitions, 914 flow [2024-06-04 17:45:28,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:45:28,961 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:45:28,961 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:45:28,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-04 17:45:28,961 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-04 17:45:28,962 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:45:28,962 INFO L85 PathProgramCache]: Analyzing trace with hash 812859451, now seen corresponding path program 3 times [2024-06-04 17:45:28,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:45:28,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827183096] [2024-06-04 17:45:28,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:45:28,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:45:29,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:45:34,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:45:34,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:45:34,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827183096] [2024-06-04 17:45:34,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827183096] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:45:34,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:45:34,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:45:34,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197479044] [2024-06-04 17:45:34,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:45:34,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:45:34,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:45:34,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:45:34,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:45:34,287 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 17:45:34,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 104 transitions, 914 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-04 17:45:34,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:45:34,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 17:45:34,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:45:34,751 INFO L124 PetriNetUnfolderBase]: 284/526 cut-off events. [2024-06-04 17:45:34,751 INFO L125 PetriNetUnfolderBase]: For 19838/19842 co-relation queries the response was YES. [2024-06-04 17:45:34,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3403 conditions, 526 events. 284/526 cut-off events. For 19838/19842 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2183 event pairs, 51 based on Foata normal form. 2/521 useless extension candidates. Maximal degree in co-relation 3347. Up to 397 conditions per place. [2024-06-04 17:45:34,754 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 76 selfloop transitions, 28 changer transitions 0/118 dead transitions. [2024-06-04 17:45:34,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 118 transitions, 1176 flow [2024-06-04 17:45:34,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:45:34,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:45:34,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 95 transitions. [2024-06-04 17:45:34,757 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37109375 [2024-06-04 17:45:34,757 INFO L175 Difference]: Start difference. First operand has 114 places, 104 transitions, 914 flow. Second operand 8 states and 95 transitions. [2024-06-04 17:45:34,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 118 transitions, 1176 flow [2024-06-04 17:45:34,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 118 transitions, 1134 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-06-04 17:45:34,786 INFO L231 Difference]: Finished difference. Result has 118 places, 105 transitions, 952 flow [2024-06-04 17:45:34,786 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=872, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=952, PETRI_PLACES=118, PETRI_TRANSITIONS=105} [2024-06-04 17:45:34,787 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 87 predicate places. [2024-06-04 17:45:34,787 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 105 transitions, 952 flow [2024-06-04 17:45:34,787 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-04 17:45:34,787 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:45:34,787 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:45:34,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-04 17:45:34,788 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-04 17:45:34,788 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:45:34,788 INFO L85 PathProgramCache]: Analyzing trace with hash -955398153, now seen corresponding path program 3 times [2024-06-04 17:45:34,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:45:34,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567817309] [2024-06-04 17:45:34,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:45:34,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:45:34,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:45:40,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:45:40,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:45:40,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567817309] [2024-06-04 17:45:40,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567817309] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:45:40,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:45:40,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:45:40,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563302241] [2024-06-04 17:45:40,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:45:40,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:45:40,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:45:40,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:45:40,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:45:40,290 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:45:40,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 105 transitions, 952 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:45:40,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:45:40,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:45:40,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:45:40,629 INFO L124 PetriNetUnfolderBase]: 319/569 cut-off events. [2024-06-04 17:45:40,629 INFO L125 PetriNetUnfolderBase]: For 20563/20563 co-relation queries the response was YES. [2024-06-04 17:45:40,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3647 conditions, 569 events. 319/569 cut-off events. For 20563/20563 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2284 event pairs, 54 based on Foata normal form. 2/570 useless extension candidates. Maximal degree in co-relation 3589. Up to 404 conditions per place. [2024-06-04 17:45:40,633 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 78 selfloop transitions, 44 changer transitions 0/124 dead transitions. [2024-06-04 17:45:40,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 124 transitions, 1402 flow [2024-06-04 17:45:40,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:45:40,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:45:40,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 103 transitions. [2024-06-04 17:45:40,633 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3576388888888889 [2024-06-04 17:45:40,634 INFO L175 Difference]: Start difference. First operand has 118 places, 105 transitions, 952 flow. Second operand 9 states and 103 transitions. [2024-06-04 17:45:40,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 124 transitions, 1402 flow [2024-06-04 17:45:40,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 124 transitions, 1332 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-04 17:45:40,659 INFO L231 Difference]: Finished difference. Result has 121 places, 107 transitions, 1001 flow [2024-06-04 17:45:40,659 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=882, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1001, PETRI_PLACES=121, PETRI_TRANSITIONS=107} [2024-06-04 17:45:40,659 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 90 predicate places. [2024-06-04 17:45:40,659 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 107 transitions, 1001 flow [2024-06-04 17:45:40,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:45:40,660 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:45:40,660 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:45:40,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-04 17:45:40,660 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-04 17:45:40,660 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:45:40,661 INFO L85 PathProgramCache]: Analyzing trace with hash 813043901, now seen corresponding path program 4 times [2024-06-04 17:45:40,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:45:40,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527245290] [2024-06-04 17:45:40,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:45:40,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:45:40,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:45:45,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:45:45,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:45:45,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527245290] [2024-06-04 17:45:45,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527245290] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:45:45,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:45:45,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:45:45,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778659236] [2024-06-04 17:45:45,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:45:45,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:45:45,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:45:45,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:45:45,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:45:45,808 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:45:45,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 107 transitions, 1001 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:45:45,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:45:45,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:45:45,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:45:46,132 INFO L124 PetriNetUnfolderBase]: 315/563 cut-off events. [2024-06-04 17:45:46,133 INFO L125 PetriNetUnfolderBase]: For 20532/20532 co-relation queries the response was YES. [2024-06-04 17:45:46,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3604 conditions, 563 events. 315/563 cut-off events. For 20532/20532 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2255 event pairs, 53 based on Foata normal form. 2/564 useless extension candidates. Maximal degree in co-relation 3545. Up to 401 conditions per place. [2024-06-04 17:45:46,136 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 74 selfloop transitions, 47 changer transitions 0/123 dead transitions. [2024-06-04 17:45:46,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 123 transitions, 1357 flow [2024-06-04 17:45:46,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:45:46,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:45:46,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2024-06-04 17:45:46,141 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3506944444444444 [2024-06-04 17:45:46,141 INFO L175 Difference]: Start difference. First operand has 121 places, 107 transitions, 1001 flow. Second operand 9 states and 101 transitions. [2024-06-04 17:45:46,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 123 transitions, 1357 flow [2024-06-04 17:45:46,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 123 transitions, 1250 flow, removed 18 selfloop flow, removed 6 redundant places. [2024-06-04 17:45:46,170 INFO L231 Difference]: Finished difference. Result has 124 places, 107 transitions, 993 flow [2024-06-04 17:45:46,171 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=894, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=993, PETRI_PLACES=124, PETRI_TRANSITIONS=107} [2024-06-04 17:45:46,171 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 93 predicate places. [2024-06-04 17:45:46,171 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 107 transitions, 993 flow [2024-06-04 17:45:46,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:45:46,171 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:45:46,172 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:45:46,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-04 17:45:46,172 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-04 17:45:46,172 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:45:46,172 INFO L85 PathProgramCache]: Analyzing trace with hash 813044149, now seen corresponding path program 1 times [2024-06-04 17:45:46,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:45:46,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275727567] [2024-06-04 17:45:46,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:45:46,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:45:46,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:45:51,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:45:51,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:45:51,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275727567] [2024-06-04 17:45:51,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275727567] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:45:51,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:45:51,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:45:51,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577104433] [2024-06-04 17:45:51,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:45:51,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:45:51,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:45:51,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:45:51,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:45:51,760 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:45:51,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 107 transitions, 993 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:45:51,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:45:51,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:45:51,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:45:52,039 INFO L124 PetriNetUnfolderBase]: 318/568 cut-off events. [2024-06-04 17:45:52,039 INFO L125 PetriNetUnfolderBase]: For 20806/20806 co-relation queries the response was YES. [2024-06-04 17:45:52,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3653 conditions, 568 events. 318/568 cut-off events. For 20806/20806 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2269 event pairs, 59 based on Foata normal form. 1/568 useless extension candidates. Maximal degree in co-relation 3593. Up to 531 conditions per place. [2024-06-04 17:45:52,043 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 103 selfloop transitions, 16 changer transitions 0/121 dead transitions. [2024-06-04 17:45:52,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 121 transitions, 1285 flow [2024-06-04 17:45:52,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:45:52,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:45:52,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 91 transitions. [2024-06-04 17:45:52,045 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3159722222222222 [2024-06-04 17:45:52,045 INFO L175 Difference]: Start difference. First operand has 124 places, 107 transitions, 993 flow. Second operand 9 states and 91 transitions. [2024-06-04 17:45:52,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 121 transitions, 1285 flow [2024-06-04 17:45:52,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 121 transitions, 1199 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-06-04 17:45:52,081 INFO L231 Difference]: Finished difference. Result has 126 places, 109 transitions, 968 flow [2024-06-04 17:45:52,081 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=907, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=968, PETRI_PLACES=126, PETRI_TRANSITIONS=109} [2024-06-04 17:45:52,082 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 95 predicate places. [2024-06-04 17:45:52,082 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 109 transitions, 968 flow [2024-06-04 17:45:52,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:45:52,082 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:45:52,082 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:45:52,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-04 17:45:52,083 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-04 17:45:52,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:45:52,083 INFO L85 PathProgramCache]: Analyzing trace with hash 900211019, now seen corresponding path program 4 times [2024-06-04 17:45:52,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:45:52,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273858122] [2024-06-04 17:45:52,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:45:52,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:45:52,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:45:57,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:45:57,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:45:57,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273858122] [2024-06-04 17:45:57,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273858122] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:45:57,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:45:57,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:45:57,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654569058] [2024-06-04 17:45:57,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:45:57,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:45:57,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:45:57,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:45:57,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:45:57,561 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 17:45:57,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 109 transitions, 968 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-04 17:45:57,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:45:57,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 17:45:57,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:45:57,850 INFO L124 PetriNetUnfolderBase]: 286/533 cut-off events. [2024-06-04 17:45:57,850 INFO L125 PetriNetUnfolderBase]: For 21366/21374 co-relation queries the response was YES. [2024-06-04 17:45:57,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3421 conditions, 533 events. 286/533 cut-off events. For 21366/21374 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2202 event pairs, 54 based on Foata normal form. 2/528 useless extension candidates. Maximal degree in co-relation 3360. Up to 389 conditions per place. [2024-06-04 17:45:57,853 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 74 selfloop transitions, 32 changer transitions 0/120 dead transitions. [2024-06-04 17:45:57,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 120 transitions, 1210 flow [2024-06-04 17:45:57,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:45:57,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:45:57,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2024-06-04 17:45:57,858 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3671875 [2024-06-04 17:45:57,858 INFO L175 Difference]: Start difference. First operand has 126 places, 109 transitions, 968 flow. Second operand 8 states and 94 transitions. [2024-06-04 17:45:57,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 120 transitions, 1210 flow [2024-06-04 17:45:57,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 120 transitions, 1165 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-04 17:45:57,893 INFO L231 Difference]: Finished difference. Result has 127 places, 109 transitions, 991 flow [2024-06-04 17:45:57,894 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=923, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=991, PETRI_PLACES=127, PETRI_TRANSITIONS=109} [2024-06-04 17:45:57,894 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 96 predicate places. [2024-06-04 17:45:57,894 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 109 transitions, 991 flow [2024-06-04 17:45:57,895 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-04 17:45:57,895 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:45:57,895 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:45:57,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-04 17:45:57,895 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-04 17:45:57,895 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:45:57,896 INFO L85 PathProgramCache]: Analyzing trace with hash 900215979, now seen corresponding path program 5 times [2024-06-04 17:45:57,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:45:57,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114389583] [2024-06-04 17:45:57,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:45:57,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:45:57,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:46:03,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:46:03,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:46:03,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114389583] [2024-06-04 17:46:03,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114389583] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:46:03,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:46:03,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:46:03,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628296996] [2024-06-04 17:46:03,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:46:03,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:46:03,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:46:03,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:46:03,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:46:03,537 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:46:03,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 109 transitions, 991 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:46:03,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:46:03,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:46:03,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:46:03,815 INFO L124 PetriNetUnfolderBase]: 321/574 cut-off events. [2024-06-04 17:46:03,815 INFO L125 PetriNetUnfolderBase]: For 22454/22460 co-relation queries the response was YES. [2024-06-04 17:46:03,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3655 conditions, 574 events. 321/574 cut-off events. For 22454/22460 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2304 event pairs, 66 based on Foata normal form. 2/571 useless extension candidates. Maximal degree in co-relation 3593. Up to 329 conditions per place. [2024-06-04 17:46:03,820 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 69 selfloop transitions, 57 changer transitions 0/128 dead transitions. [2024-06-04 17:46:03,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 128 transitions, 1489 flow [2024-06-04 17:46:03,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:46:03,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:46:03,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2024-06-04 17:46:03,830 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3645833333333333 [2024-06-04 17:46:03,830 INFO L175 Difference]: Start difference. First operand has 127 places, 109 transitions, 991 flow. Second operand 9 states and 105 transitions. [2024-06-04 17:46:03,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 128 transitions, 1489 flow [2024-06-04 17:46:03,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 128 transitions, 1386 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-06-04 17:46:03,865 INFO L231 Difference]: Finished difference. Result has 129 places, 113 transitions, 1067 flow [2024-06-04 17:46:03,865 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=888, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1067, PETRI_PLACES=129, PETRI_TRANSITIONS=113} [2024-06-04 17:46:03,868 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 98 predicate places. [2024-06-04 17:46:03,868 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 113 transitions, 1067 flow [2024-06-04 17:46:03,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:46:03,868 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:46:03,868 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:46:03,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-04 17:46:03,869 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-04 17:46:03,869 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:46:03,869 INFO L85 PathProgramCache]: Analyzing trace with hash -762256971, now seen corresponding path program 2 times [2024-06-04 17:46:03,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:46:03,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211778915] [2024-06-04 17:46:03,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:46:03,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:46:03,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:46:09,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:46:09,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:46:09,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211778915] [2024-06-04 17:46:09,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211778915] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:46:09,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:46:09,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:46:09,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308535231] [2024-06-04 17:46:09,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:46:09,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:46:09,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:46:09,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:46:09,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:46:09,426 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:46:09,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 113 transitions, 1067 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:46:09,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:46:09,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:46:09,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:46:09,722 INFO L124 PetriNetUnfolderBase]: 324/579 cut-off events. [2024-06-04 17:46:09,722 INFO L125 PetriNetUnfolderBase]: For 22899/22905 co-relation queries the response was YES. [2024-06-04 17:46:09,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3744 conditions, 579 events. 324/579 cut-off events. For 22899/22905 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2333 event pairs, 61 based on Foata normal form. 5/581 useless extension candidates. Maximal degree in co-relation 3681. Up to 500 conditions per place. [2024-06-04 17:46:09,726 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 96 selfloop transitions, 30 changer transitions 0/128 dead transitions. [2024-06-04 17:46:09,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 128 transitions, 1473 flow [2024-06-04 17:46:09,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:46:09,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:46:09,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2024-06-04 17:46:09,728 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3368055555555556 [2024-06-04 17:46:09,729 INFO L175 Difference]: Start difference. First operand has 129 places, 113 transitions, 1067 flow. Second operand 9 states and 97 transitions. [2024-06-04 17:46:09,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 128 transitions, 1473 flow [2024-06-04 17:46:09,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 128 transitions, 1331 flow, removed 19 selfloop flow, removed 7 redundant places. [2024-06-04 17:46:09,758 INFO L231 Difference]: Finished difference. Result has 131 places, 117 transitions, 1042 flow [2024-06-04 17:46:09,758 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=925, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1042, PETRI_PLACES=131, PETRI_TRANSITIONS=117} [2024-06-04 17:46:09,758 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 100 predicate places. [2024-06-04 17:46:09,758 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 117 transitions, 1042 flow [2024-06-04 17:46:09,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:46:09,759 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:46:09,759 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:46:09,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-04 17:46:09,759 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-04 17:46:09,760 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:46:09,760 INFO L85 PathProgramCache]: Analyzing trace with hash -525784941, now seen corresponding path program 3 times [2024-06-04 17:46:09,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:46:09,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086862528] [2024-06-04 17:46:09,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:46:09,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:46:09,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:46:14,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:46:14,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:46:14,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086862528] [2024-06-04 17:46:14,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086862528] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:46:14,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:46:14,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:46:14,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791488172] [2024-06-04 17:46:14,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:46:14,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:46:14,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:46:14,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:46:14,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:46:14,997 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:46:14,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 117 transitions, 1042 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:46:14,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:46:14,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:46:14,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:46:15,315 INFO L124 PetriNetUnfolderBase]: 327/583 cut-off events. [2024-06-04 17:46:15,315 INFO L125 PetriNetUnfolderBase]: For 23658/23658 co-relation queries the response was YES. [2024-06-04 17:46:15,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3681 conditions, 583 events. 327/583 cut-off events. For 23658/23658 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2380 event pairs, 65 based on Foata normal form. 1/583 useless extension candidates. Maximal degree in co-relation 3618. Up to 556 conditions per place. [2024-06-04 17:46:15,319 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 112 selfloop transitions, 14 changer transitions 0/128 dead transitions. [2024-06-04 17:46:15,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 128 transitions, 1344 flow [2024-06-04 17:46:15,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:46:15,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:46:15,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 88 transitions. [2024-06-04 17:46:15,321 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3055555555555556 [2024-06-04 17:46:15,321 INFO L175 Difference]: Start difference. First operand has 131 places, 117 transitions, 1042 flow. Second operand 9 states and 88 transitions. [2024-06-04 17:46:15,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 128 transitions, 1344 flow [2024-06-04 17:46:15,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 128 transitions, 1297 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-06-04 17:46:15,354 INFO L231 Difference]: Finished difference. Result has 135 places, 119 transitions, 1060 flow [2024-06-04 17:46:15,354 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=995, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1060, PETRI_PLACES=135, PETRI_TRANSITIONS=119} [2024-06-04 17:46:15,354 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 104 predicate places. [2024-06-04 17:46:15,354 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 119 transitions, 1060 flow [2024-06-04 17:46:15,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:46:15,354 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:46:15,355 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:46:15,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-04 17:46:15,355 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-04 17:46:15,355 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:46:15,355 INFO L85 PathProgramCache]: Analyzing trace with hash -762257219, now seen corresponding path program 6 times [2024-06-04 17:46:15,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:46:15,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315400089] [2024-06-04 17:46:15,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:46:15,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:46:15,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:46:20,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:46:20,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:46:20,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315400089] [2024-06-04 17:46:20,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315400089] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:46:20,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:46:20,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:46:20,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389635378] [2024-06-04 17:46:20,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:46:20,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:46:20,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:46:20,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:46:20,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:46:20,718 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:46:20,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 119 transitions, 1060 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:46:20,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:46:20,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:46:20,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:46:20,996 INFO L124 PetriNetUnfolderBase]: 343/610 cut-off events. [2024-06-04 17:46:20,996 INFO L125 PetriNetUnfolderBase]: For 27309/27315 co-relation queries the response was YES. [2024-06-04 17:46:20,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3922 conditions, 610 events. 343/610 cut-off events. For 27309/27315 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2497 event pairs, 66 based on Foata normal form. 2/607 useless extension candidates. Maximal degree in co-relation 3857. Up to 354 conditions per place. [2024-06-04 17:46:21,000 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 79 selfloop transitions, 59 changer transitions 0/140 dead transitions. [2024-06-04 17:46:21,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 140 transitions, 1672 flow [2024-06-04 17:46:21,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:46:21,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:46:21,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2024-06-04 17:46:21,001 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-04 17:46:21,002 INFO L175 Difference]: Start difference. First operand has 135 places, 119 transitions, 1060 flow. Second operand 9 states and 108 transitions. [2024-06-04 17:46:21,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 140 transitions, 1672 flow [2024-06-04 17:46:21,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 140 transitions, 1627 flow, removed 10 selfloop flow, removed 7 redundant places. [2024-06-04 17:46:21,035 INFO L231 Difference]: Finished difference. Result has 137 places, 123 transitions, 1186 flow [2024-06-04 17:46:21,035 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1015, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1186, PETRI_PLACES=137, PETRI_TRANSITIONS=123} [2024-06-04 17:46:21,036 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 106 predicate places. [2024-06-04 17:46:21,036 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 123 transitions, 1186 flow [2024-06-04 17:46:21,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:46:21,036 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:46:21,037 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:46:21,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-04 17:46:21,040 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-04 17:46:21,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:46:21,040 INFO L85 PathProgramCache]: Analyzing trace with hash 906651579, now seen corresponding path program 7 times [2024-06-04 17:46:21,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:46:21,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42216] [2024-06-04 17:46:21,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:46:21,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:46:21,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:46:26,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:46:26,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:46:26,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42216] [2024-06-04 17:46:26,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42216] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:46:26,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:46:26,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:46:26,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614025404] [2024-06-04 17:46:26,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:46:26,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:46:26,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:46:26,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:46:26,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:46:26,827 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:46:26,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 123 transitions, 1186 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:46:26,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:46:26,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:46:26,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:46:27,118 INFO L124 PetriNetUnfolderBase]: 359/636 cut-off events. [2024-06-04 17:46:27,119 INFO L125 PetriNetUnfolderBase]: For 30696/30702 co-relation queries the response was YES. [2024-06-04 17:46:27,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4283 conditions, 636 events. 359/636 cut-off events. For 30696/30702 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2629 event pairs, 61 based on Foata normal form. 2/633 useless extension candidates. Maximal degree in co-relation 4217. Up to 369 conditions per place. [2024-06-04 17:46:27,122 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 74 selfloop transitions, 68 changer transitions 0/144 dead transitions. [2024-06-04 17:46:27,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 144 transitions, 1820 flow [2024-06-04 17:46:27,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:46:27,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:46:27,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 107 transitions. [2024-06-04 17:46:27,123 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3715277777777778 [2024-06-04 17:46:27,123 INFO L175 Difference]: Start difference. First operand has 137 places, 123 transitions, 1186 flow. Second operand 9 states and 107 transitions. [2024-06-04 17:46:27,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 144 transitions, 1820 flow [2024-06-04 17:46:27,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 144 transitions, 1703 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-06-04 17:46:27,168 INFO L231 Difference]: Finished difference. Result has 141 places, 127 transitions, 1266 flow [2024-06-04 17:46:27,168 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1073, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1266, PETRI_PLACES=141, PETRI_TRANSITIONS=127} [2024-06-04 17:46:27,168 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 110 predicate places. [2024-06-04 17:46:27,168 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 127 transitions, 1266 flow [2024-06-04 17:46:27,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:46:27,169 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:46:27,169 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:46:27,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-04 17:46:27,169 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-04 17:46:27,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:46:27,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1128296867, now seen corresponding path program 4 times [2024-06-04 17:46:27,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:46:27,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344283992] [2024-06-04 17:46:27,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:46:27,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:46:27,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:46:32,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:46:32,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:46:32,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344283992] [2024-06-04 17:46:32,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344283992] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:46:32,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:46:32,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:46:32,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036331263] [2024-06-04 17:46:32,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:46:32,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:46:32,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:46:32,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:46:32,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:46:32,691 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:46:32,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 127 transitions, 1266 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:46:32,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:46:32,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:46:32,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:46:32,931 INFO L124 PetriNetUnfolderBase]: 362/641 cut-off events. [2024-06-04 17:46:32,931 INFO L125 PetriNetUnfolderBase]: For 31402/31408 co-relation queries the response was YES. [2024-06-04 17:46:32,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4370 conditions, 641 events. 362/641 cut-off events. For 31402/31408 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2662 event pairs, 67 based on Foata normal form. 5/643 useless extension candidates. Maximal degree in co-relation 4303. Up to 560 conditions per place. [2024-06-04 17:46:32,935 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 103 selfloop transitions, 35 changer transitions 0/140 dead transitions. [2024-06-04 17:46:32,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 140 transitions, 1688 flow [2024-06-04 17:46:32,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:46:32,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:46:32,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 96 transitions. [2024-06-04 17:46:32,936 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2024-06-04 17:46:32,936 INFO L175 Difference]: Start difference. First operand has 141 places, 127 transitions, 1266 flow. Second operand 9 states and 96 transitions. [2024-06-04 17:46:32,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 140 transitions, 1688 flow [2024-06-04 17:46:32,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 140 transitions, 1536 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-06-04 17:46:32,975 INFO L231 Difference]: Finished difference. Result has 144 places, 129 transitions, 1221 flow [2024-06-04 17:46:32,975 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1114, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1221, PETRI_PLACES=144, PETRI_TRANSITIONS=129} [2024-06-04 17:46:32,975 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 113 predicate places. [2024-06-04 17:46:32,975 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 129 transitions, 1221 flow [2024-06-04 17:46:32,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:46:32,975 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:46:32,976 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:46:32,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-04 17:46:32,976 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-04 17:46:32,976 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:46:32,976 INFO L85 PathProgramCache]: Analyzing trace with hash 900388959, now seen corresponding path program 8 times [2024-06-04 17:46:32,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:46:32,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910889089] [2024-06-04 17:46:32,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:46:32,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:46:33,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:46:38,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:46:38,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:46:38,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910889089] [2024-06-04 17:46:38,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910889089] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:46:38,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:46:38,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:46:38,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319308777] [2024-06-04 17:46:38,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:46:38,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:46:38,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:46:38,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:46:38,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:46:38,482 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:46:38,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 129 transitions, 1221 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:46:38,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:46:38,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:46:38,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:46:38,772 INFO L124 PetriNetUnfolderBase]: 358/635 cut-off events. [2024-06-04 17:46:38,772 INFO L125 PetriNetUnfolderBase]: For 31530/31536 co-relation queries the response was YES. [2024-06-04 17:46:38,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4174 conditions, 635 events. 358/635 cut-off events. For 31530/31536 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2622 event pairs, 69 based on Foata normal form. 2/632 useless extension candidates. Maximal degree in co-relation 4106. Up to 371 conditions per place. [2024-06-04 17:46:38,776 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 81 selfloop transitions, 62 changer transitions 0/145 dead transitions. [2024-06-04 17:46:38,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 145 transitions, 1725 flow [2024-06-04 17:46:38,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:46:38,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:46:38,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2024-06-04 17:46:38,777 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-04 17:46:38,777 INFO L175 Difference]: Start difference. First operand has 144 places, 129 transitions, 1221 flow. Second operand 9 states and 108 transitions. [2024-06-04 17:46:38,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 145 transitions, 1725 flow [2024-06-04 17:46:38,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 145 transitions, 1615 flow, removed 19 selfloop flow, removed 7 redundant places. [2024-06-04 17:46:38,816 INFO L231 Difference]: Finished difference. Result has 146 places, 129 transitions, 1240 flow [2024-06-04 17:46:38,816 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1111, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1240, PETRI_PLACES=146, PETRI_TRANSITIONS=129} [2024-06-04 17:46:38,816 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 115 predicate places. [2024-06-04 17:46:38,816 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 129 transitions, 1240 flow [2024-06-04 17:46:38,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:46:38,817 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:46:38,817 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:46:38,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-04 17:46:38,817 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-04 17:46:38,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:46:38,818 INFO L85 PathProgramCache]: Analyzing trace with hash -526081611, now seen corresponding path program 5 times [2024-06-04 17:46:38,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:46:38,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844220192] [2024-06-04 17:46:38,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:46:38,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:46:38,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:46:44,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:46:44,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:46:44,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844220192] [2024-06-04 17:46:44,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844220192] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:46:44,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:46:44,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:46:44,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764469843] [2024-06-04 17:46:44,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:46:44,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:46:44,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:46:44,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:46:44,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:46:44,429 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:46:44,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 129 transitions, 1240 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:46:44,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:46:44,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:46:44,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:46:44,691 INFO L124 PetriNetUnfolderBase]: 356/632 cut-off events. [2024-06-04 17:46:44,692 INFO L125 PetriNetUnfolderBase]: For 31116/31122 co-relation queries the response was YES. [2024-06-04 17:46:44,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4191 conditions, 632 events. 356/632 cut-off events. For 31116/31122 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2624 event pairs, 66 based on Foata normal form. 5/634 useless extension candidates. Maximal degree in co-relation 4122. Up to 552 conditions per place. [2024-06-04 17:46:44,696 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 100 selfloop transitions, 37 changer transitions 0/139 dead transitions. [2024-06-04 17:46:44,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 139 transitions, 1542 flow [2024-06-04 17:46:44,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:46:44,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:46:44,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2024-06-04 17:46:44,698 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3263888888888889 [2024-06-04 17:46:44,698 INFO L175 Difference]: Start difference. First operand has 146 places, 129 transitions, 1240 flow. Second operand 9 states and 94 transitions. [2024-06-04 17:46:44,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 139 transitions, 1542 flow [2024-06-04 17:46:44,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 139 transitions, 1396 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-04 17:46:44,739 INFO L231 Difference]: Finished difference. Result has 147 places, 129 transitions, 1173 flow [2024-06-04 17:46:44,739 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1094, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1173, PETRI_PLACES=147, PETRI_TRANSITIONS=129} [2024-06-04 17:46:44,739 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 116 predicate places. [2024-06-04 17:46:44,740 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 129 transitions, 1173 flow [2024-06-04 17:46:44,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:46:44,740 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:46:44,740 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:46:44,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-04 17:46:44,740 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-04 17:46:44,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:46:44,740 INFO L85 PathProgramCache]: Analyzing trace with hash -526081859, now seen corresponding path program 9 times [2024-06-04 17:46:44,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:46:44,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878978805] [2024-06-04 17:46:44,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:46:44,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:46:44,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:46:50,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:46:50,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:46:50,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878978805] [2024-06-04 17:46:50,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878978805] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:46:50,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:46:50,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:46:50,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156590158] [2024-06-04 17:46:50,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:46:50,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:46:50,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:46:50,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:46:50,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:46:50,320 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:46:50,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 129 transitions, 1173 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:46:50,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:46:50,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:46:50,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:46:50,591 INFO L124 PetriNetUnfolderBase]: 352/626 cut-off events. [2024-06-04 17:46:50,592 INFO L125 PetriNetUnfolderBase]: For 31188/31194 co-relation queries the response was YES. [2024-06-04 17:46:50,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4005 conditions, 626 events. 352/626 cut-off events. For 31188/31194 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2587 event pairs, 52 based on Foata normal form. 2/623 useless extension candidates. Maximal degree in co-relation 3935. Up to 365 conditions per place. [2024-06-04 17:46:50,596 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 65 selfloop transitions, 76 changer transitions 0/143 dead transitions. [2024-06-04 17:46:50,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 143 transitions, 1585 flow [2024-06-04 17:46:50,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:46:50,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:46:50,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 102 transitions. [2024-06-04 17:46:50,597 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3541666666666667 [2024-06-04 17:46:50,597 INFO L175 Difference]: Start difference. First operand has 147 places, 129 transitions, 1173 flow. Second operand 9 states and 102 transitions. [2024-06-04 17:46:50,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 143 transitions, 1585 flow [2024-06-04 17:46:50,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 143 transitions, 1482 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-06-04 17:46:50,633 INFO L231 Difference]: Finished difference. Result has 148 places, 129 transitions, 1227 flow [2024-06-04 17:46:50,633 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1070, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1227, PETRI_PLACES=148, PETRI_TRANSITIONS=129} [2024-06-04 17:46:50,634 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 117 predicate places. [2024-06-04 17:46:50,634 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 129 transitions, 1227 flow [2024-06-04 17:46:50,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:46:50,634 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:46:50,634 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:46:50,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-04 17:46:50,634 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-04 17:46:50,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:46:50,635 INFO L85 PathProgramCache]: Analyzing trace with hash -534362579, now seen corresponding path program 10 times [2024-06-04 17:46:50,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:46:50,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599196956] [2024-06-04 17:46:50,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:46:50,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:46:50,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:46:56,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:46:56,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:46:56,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599196956] [2024-06-04 17:46:56,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599196956] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:46:56,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:46:56,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:46:56,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261435287] [2024-06-04 17:46:56,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:46:56,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:46:56,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:46:56,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:46:56,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:46:56,219 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:46:56,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 129 transitions, 1227 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:46:56,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:46:56,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:46:56,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:46:56,566 INFO L124 PetriNetUnfolderBase]: 348/620 cut-off events. [2024-06-04 17:46:56,567 INFO L125 PetriNetUnfolderBase]: For 30448/30454 co-relation queries the response was YES. [2024-06-04 17:46:56,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4014 conditions, 620 events. 348/620 cut-off events. For 30448/30454 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2572 event pairs, 59 based on Foata normal form. 2/617 useless extension candidates. Maximal degree in co-relation 3943. Up to 362 conditions per place. [2024-06-04 17:46:56,570 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 72 selfloop transitions, 69 changer transitions 0/143 dead transitions. [2024-06-04 17:46:56,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 143 transitions, 1641 flow [2024-06-04 17:46:56,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:46:56,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:46:56,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 103 transitions. [2024-06-04 17:46:56,572 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3576388888888889 [2024-06-04 17:46:56,572 INFO L175 Difference]: Start difference. First operand has 148 places, 129 transitions, 1227 flow. Second operand 9 states and 103 transitions. [2024-06-04 17:46:56,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 143 transitions, 1641 flow [2024-06-04 17:46:56,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 143 transitions, 1468 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-04 17:46:56,621 INFO L231 Difference]: Finished difference. Result has 149 places, 129 transitions, 1197 flow [2024-06-04 17:46:56,621 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1054, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1197, PETRI_PLACES=149, PETRI_TRANSITIONS=129} [2024-06-04 17:46:56,621 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 118 predicate places. [2024-06-04 17:46:56,621 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 129 transitions, 1197 flow [2024-06-04 17:46:56,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:46:56,621 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:46:56,621 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:46:56,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-04 17:46:56,622 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-04 17:46:56,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:46:56,622 INFO L85 PathProgramCache]: Analyzing trace with hash -525774029, now seen corresponding path program 1 times [2024-06-04 17:46:56,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:46:56,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368826443] [2024-06-04 17:46:56,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:46:56,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:46:56,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:47:03,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:47:03,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:47:03,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368826443] [2024-06-04 17:47:03,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368826443] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:47:03,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:47:03,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:47:03,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494697557] [2024-06-04 17:47:03,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:47:03,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:47:03,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:47:03,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:47:03,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:47:03,643 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:47:03,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 129 transitions, 1197 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:47:03,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:47:03,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:47:03,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:47:03,981 INFO L124 PetriNetUnfolderBase]: 345/614 cut-off events. [2024-06-04 17:47:03,981 INFO L125 PetriNetUnfolderBase]: For 29518/29518 co-relation queries the response was YES. [2024-06-04 17:47:03,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3886 conditions, 614 events. 345/614 cut-off events. For 29518/29518 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2517 event pairs, 67 based on Foata normal form. 2/615 useless extension candidates. Maximal degree in co-relation 3814. Up to 581 conditions per place. [2024-06-04 17:47:03,986 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 123 selfloop transitions, 15 changer transitions 0/140 dead transitions. [2024-06-04 17:47:03,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 140 transitions, 1499 flow [2024-06-04 17:47:03,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:47:03,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:47:03,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 95 transitions. [2024-06-04 17:47:03,987 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.296875 [2024-06-04 17:47:03,987 INFO L175 Difference]: Start difference. First operand has 149 places, 129 transitions, 1197 flow. Second operand 10 states and 95 transitions. [2024-06-04 17:47:03,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 140 transitions, 1499 flow [2024-06-04 17:47:04,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 140 transitions, 1338 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-04 17:47:04,038 INFO L231 Difference]: Finished difference. Result has 150 places, 129 transitions, 1070 flow [2024-06-04 17:47:04,038 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1036, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1070, PETRI_PLACES=150, PETRI_TRANSITIONS=129} [2024-06-04 17:47:04,038 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 119 predicate places. [2024-06-04 17:47:04,039 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 129 transitions, 1070 flow [2024-06-04 17:47:04,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:47:04,039 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:47:04,039 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:47:04,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-04 17:47:04,039 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-04 17:47:04,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:47:04,040 INFO L85 PathProgramCache]: Analyzing trace with hash 61215939, now seen corresponding path program 1 times [2024-06-04 17:47:04,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:47:04,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97410682] [2024-06-04 17:47:04,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:47:04,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:47:04,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:47:10,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:47:10,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:47:10,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97410682] [2024-06-04 17:47:10,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97410682] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:47:10,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:47:10,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:47:10,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27478061] [2024-06-04 17:47:10,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:47:10,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:47:10,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:47:10,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:47:10,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:47:10,303 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:47:10,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 129 transitions, 1070 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:47:10,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:47:10,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:47:10,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:47:10,722 INFO L124 PetriNetUnfolderBase]: 349/622 cut-off events. [2024-06-04 17:47:10,723 INFO L125 PetriNetUnfolderBase]: For 30394/30394 co-relation queries the response was YES. [2024-06-04 17:47:10,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3797 conditions, 622 events. 349/622 cut-off events. For 30394/30394 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2584 event pairs, 41 based on Foata normal form. 2/623 useless extension candidates. Maximal degree in co-relation 3724. Up to 524 conditions per place. [2024-06-04 17:47:10,727 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 125 selfloop transitions, 20 changer transitions 0/147 dead transitions. [2024-06-04 17:47:10,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 147 transitions, 1418 flow [2024-06-04 17:47:10,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:47:10,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:47:10,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2024-06-04 17:47:10,728 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3263888888888889 [2024-06-04 17:47:10,728 INFO L175 Difference]: Start difference. First operand has 150 places, 129 transitions, 1070 flow. Second operand 9 states and 94 transitions. [2024-06-04 17:47:10,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 147 transitions, 1418 flow [2024-06-04 17:47:10,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 147 transitions, 1380 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-04 17:47:10,778 INFO L231 Difference]: Finished difference. Result has 151 places, 130 transitions, 1090 flow [2024-06-04 17:47:10,778 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1032, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1090, PETRI_PLACES=151, PETRI_TRANSITIONS=130} [2024-06-04 17:47:10,779 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 120 predicate places. [2024-06-04 17:47:10,779 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 130 transitions, 1090 flow [2024-06-04 17:47:10,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:47:10,779 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:47:10,779 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:47:10,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-04 17:47:10,780 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-04 17:47:10,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:47:10,780 INFO L85 PathProgramCache]: Analyzing trace with hash 63089889, now seen corresponding path program 2 times [2024-06-04 17:47:10,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:47:10,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391116349] [2024-06-04 17:47:10,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:47:10,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:47:10,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:47:16,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:47:16,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:47:16,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391116349] [2024-06-04 17:47:16,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391116349] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:47:16,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:47:16,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:47:16,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330340759] [2024-06-04 17:47:16,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:47:16,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:47:16,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:47:16,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:47:16,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:47:16,667 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:47:16,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 130 transitions, 1090 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:47:16,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:47:16,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:47:16,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:47:17,098 INFO L124 PetriNetUnfolderBase]: 360/643 cut-off events. [2024-06-04 17:47:17,098 INFO L125 PetriNetUnfolderBase]: For 34106/34106 co-relation queries the response was YES. [2024-06-04 17:47:17,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4037 conditions, 643 events. 360/643 cut-off events. For 34106/34106 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2717 event pairs, 57 based on Foata normal form. 2/644 useless extension candidates. Maximal degree in co-relation 3963. Up to 515 conditions per place. [2024-06-04 17:47:17,103 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 120 selfloop transitions, 28 changer transitions 0/150 dead transitions. [2024-06-04 17:47:17,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 150 transitions, 1562 flow [2024-06-04 17:47:17,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:47:17,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:47:17,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions. [2024-06-04 17:47:17,105 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34375 [2024-06-04 17:47:17,105 INFO L175 Difference]: Start difference. First operand has 151 places, 130 transitions, 1090 flow. Second operand 9 states and 99 transitions. [2024-06-04 17:47:17,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 150 transitions, 1562 flow [2024-06-04 17:47:17,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 150 transitions, 1514 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-04 17:47:17,156 INFO L231 Difference]: Finished difference. Result has 153 places, 132 transitions, 1132 flow [2024-06-04 17:47:17,157 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1042, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1132, PETRI_PLACES=153, PETRI_TRANSITIONS=132} [2024-06-04 17:47:17,157 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 122 predicate places. [2024-06-04 17:47:17,157 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 132 transitions, 1132 flow [2024-06-04 17:47:17,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:47:17,157 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:47:17,157 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:47:17,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-04 17:47:17,157 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-04 17:47:17,158 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:47:17,158 INFO L85 PathProgramCache]: Analyzing trace with hash -558445011, now seen corresponding path program 3 times [2024-06-04 17:47:17,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:47:17,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291308030] [2024-06-04 17:47:17,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:47:17,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:47:17,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:47:22,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:47:22,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:47:22,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291308030] [2024-06-04 17:47:22,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291308030] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:47:22,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:47:22,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:47:22,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569761143] [2024-06-04 17:47:22,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:47:22,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:47:22,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:47:22,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:47:22,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:47:23,072 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:47:23,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 132 transitions, 1132 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:47:23,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:47:23,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:47:23,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:47:23,579 INFO L124 PetriNetUnfolderBase]: 357/638 cut-off events. [2024-06-04 17:47:23,580 INFO L125 PetriNetUnfolderBase]: For 33322/33322 co-relation queries the response was YES. [2024-06-04 17:47:23,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3954 conditions, 638 events. 357/638 cut-off events. For 33322/33322 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2692 event pairs, 56 based on Foata normal form. 2/639 useless extension candidates. Maximal degree in co-relation 3879. Up to 533 conditions per place. [2024-06-04 17:47:23,584 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 117 selfloop transitions, 30 changer transitions 0/149 dead transitions. [2024-06-04 17:47:23,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 149 transitions, 1476 flow [2024-06-04 17:47:23,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:47:23,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:47:23,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2024-06-04 17:47:23,585 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3368055555555556 [2024-06-04 17:47:23,585 INFO L175 Difference]: Start difference. First operand has 153 places, 132 transitions, 1132 flow. Second operand 9 states and 97 transitions. [2024-06-04 17:47:23,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 149 transitions, 1476 flow [2024-06-04 17:47:23,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 149 transitions, 1417 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-06-04 17:47:23,654 INFO L231 Difference]: Finished difference. Result has 157 places, 132 transitions, 1138 flow [2024-06-04 17:47:23,654 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1073, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1138, PETRI_PLACES=157, PETRI_TRANSITIONS=132} [2024-06-04 17:47:23,655 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 126 predicate places. [2024-06-04 17:47:23,655 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 132 transitions, 1138 flow [2024-06-04 17:47:23,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:47:23,661 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:47:23,661 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:47:23,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-04 17:47:23,662 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-04 17:47:23,662 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:47:23,662 INFO L85 PathProgramCache]: Analyzing trace with hash -558444856, now seen corresponding path program 1 times [2024-06-04 17:47:23,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:47:23,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045825020] [2024-06-04 17:47:23,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:47:23,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:47:23,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:47:29,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:47:29,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:47:29,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045825020] [2024-06-04 17:47:29,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045825020] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:47:29,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:47:29,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:47:29,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583990670] [2024-06-04 17:47:29,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:47:29,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:47:29,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:47:29,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:47:29,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:47:30,075 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:47:30,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 132 transitions, 1138 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:47:30,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:47:30,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:47:30,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:47:30,432 INFO L124 PetriNetUnfolderBase]: 355/635 cut-off events. [2024-06-04 17:47:30,432 INFO L125 PetriNetUnfolderBase]: For 31933/31933 co-relation queries the response was YES. [2024-06-04 17:47:30,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3920 conditions, 635 events. 355/635 cut-off events. For 31933/31933 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2665 event pairs, 55 based on Foata normal form. 1/635 useless extension candidates. Maximal degree in co-relation 3843. Up to 527 conditions per place. [2024-06-04 17:47:30,436 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 114 selfloop transitions, 33 changer transitions 0/149 dead transitions. [2024-06-04 17:47:30,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 149 transitions, 1484 flow [2024-06-04 17:47:30,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:47:30,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:47:30,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2024-06-04 17:47:30,437 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3402777777777778 [2024-06-04 17:47:30,437 INFO L175 Difference]: Start difference. First operand has 157 places, 132 transitions, 1138 flow. Second operand 9 states and 98 transitions. [2024-06-04 17:47:30,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 149 transitions, 1484 flow [2024-06-04 17:47:30,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 149 transitions, 1411 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-04 17:47:30,496 INFO L231 Difference]: Finished difference. Result has 158 places, 132 transitions, 1139 flow [2024-06-04 17:47:30,496 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1065, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1139, PETRI_PLACES=158, PETRI_TRANSITIONS=132} [2024-06-04 17:47:30,496 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 127 predicate places. [2024-06-04 17:47:30,496 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 132 transitions, 1139 flow [2024-06-04 17:47:30,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:47:30,497 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:47:30,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-04 17:47:30,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-04 17:47:30,497 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-04 17:47:30,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:47:30,497 INFO L85 PathProgramCache]: Analyzing trace with hash 149935521, now seen corresponding path program 1 times [2024-06-04 17:47:30,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:47:30,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902691347] [2024-06-04 17:47:30,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:47:30,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:47:30,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:47:36,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:47:36,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:47:36,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902691347] [2024-06-04 17:47:36,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902691347] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:47:36,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:47:36,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:47:36,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116459922] [2024-06-04 17:47:36,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:47:36,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:47:36,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:47:36,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:47:36,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:47:36,575 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:47:36,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 132 transitions, 1139 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:47:36,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:47:36,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:47:36,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:47:36,967 INFO L124 PetriNetUnfolderBase]: 361/645 cut-off events. [2024-06-04 17:47:36,968 INFO L125 PetriNetUnfolderBase]: For 34407/34407 co-relation queries the response was YES. [2024-06-04 17:47:36,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3992 conditions, 645 events. 361/645 cut-off events. For 34407/34407 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2733 event pairs, 53 based on Foata normal form. 2/646 useless extension candidates. Maximal degree in co-relation 3914. Up to 545 conditions per place. [2024-06-04 17:47:36,974 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 123 selfloop transitions, 28 changer transitions 0/153 dead transitions. [2024-06-04 17:47:36,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 153 transitions, 1523 flow [2024-06-04 17:47:36,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:47:36,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:47:36,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 107 transitions. [2024-06-04 17:47:36,975 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.334375 [2024-06-04 17:47:36,975 INFO L175 Difference]: Start difference. First operand has 158 places, 132 transitions, 1139 flow. Second operand 10 states and 107 transitions. [2024-06-04 17:47:36,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 153 transitions, 1523 flow [2024-06-04 17:47:37,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 153 transitions, 1404 flow, removed 2 selfloop flow, removed 10 redundant places. [2024-06-04 17:47:37,061 INFO L231 Difference]: Finished difference. Result has 158 places, 134 transitions, 1109 flow [2024-06-04 17:47:37,061 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1020, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1109, PETRI_PLACES=158, PETRI_TRANSITIONS=134} [2024-06-04 17:47:37,061 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 127 predicate places. [2024-06-04 17:47:37,061 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 134 transitions, 1109 flow [2024-06-04 17:47:37,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:47:37,062 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:47:37,062 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:47:37,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-04 17:47:37,062 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-04 17:47:37,062 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:47:37,062 INFO L85 PathProgramCache]: Analyzing trace with hash -416197791, now seen corresponding path program 4 times [2024-06-04 17:47:37,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:47:37,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13928370] [2024-06-04 17:47:37,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:47:37,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:47:37,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:47:42,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:47:42,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:47:42,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13928370] [2024-06-04 17:47:42,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13928370] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:47:42,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:47:42,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:47:42,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076484077] [2024-06-04 17:47:42,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:47:42,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:47:42,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:47:42,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:47:42,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:47:42,566 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:47:42,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 134 transitions, 1109 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:47:42,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:47:42,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:47:42,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:47:42,890 INFO L124 PetriNetUnfolderBase]: 365/653 cut-off events. [2024-06-04 17:47:42,891 INFO L125 PetriNetUnfolderBase]: For 35740/35740 co-relation queries the response was YES. [2024-06-04 17:47:42,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4043 conditions, 653 events. 365/653 cut-off events. For 35740/35740 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2789 event pairs, 56 based on Foata normal form. 2/654 useless extension candidates. Maximal degree in co-relation 3964. Up to 522 conditions per place. [2024-06-04 17:47:42,895 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 115 selfloop transitions, 33 changer transitions 0/150 dead transitions. [2024-06-04 17:47:42,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 150 transitions, 1463 flow [2024-06-04 17:47:42,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:47:42,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:47:42,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions. [2024-06-04 17:47:42,896 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34375 [2024-06-04 17:47:42,896 INFO L175 Difference]: Start difference. First operand has 158 places, 134 transitions, 1109 flow. Second operand 9 states and 99 transitions. [2024-06-04 17:47:42,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 150 transitions, 1463 flow [2024-06-04 17:47:42,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 150 transitions, 1390 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-06-04 17:47:42,982 INFO L231 Difference]: Finished difference. Result has 159 places, 135 transitions, 1124 flow [2024-06-04 17:47:42,982 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1036, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1124, PETRI_PLACES=159, PETRI_TRANSITIONS=135} [2024-06-04 17:47:42,983 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 128 predicate places. [2024-06-04 17:47:42,983 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 135 transitions, 1124 flow [2024-06-04 17:47:42,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:47:42,983 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:47:42,984 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:47:42,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-04 17:47:42,984 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-04 17:47:42,984 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:47:42,984 INFO L85 PathProgramCache]: Analyzing trace with hash -571005505, now seen corresponding path program 2 times [2024-06-04 17:47:42,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:47:42,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185517840] [2024-06-04 17:47:42,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:47:42,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:47:43,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:47:48,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:47:48,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:47:48,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185517840] [2024-06-04 17:47:48,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185517840] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:47:48,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:47:48,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:47:48,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342066580] [2024-06-04 17:47:48,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:47:48,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:47:48,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:47:48,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:47:48,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:47:48,681 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:47:48,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 135 transitions, 1124 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:47:48,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:47:48,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:47:48,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:47:49,029 INFO L124 PetriNetUnfolderBase]: 411/727 cut-off events. [2024-06-04 17:47:49,029 INFO L125 PetriNetUnfolderBase]: For 48708/48708 co-relation queries the response was YES. [2024-06-04 17:47:49,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4849 conditions, 727 events. 411/727 cut-off events. For 48708/48708 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3148 event pairs, 69 based on Foata normal form. 2/728 useless extension candidates. Maximal degree in co-relation 4769. Up to 488 conditions per place. [2024-06-04 17:47:49,035 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 116 selfloop transitions, 45 changer transitions 0/163 dead transitions. [2024-06-04 17:47:49,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 163 transitions, 1828 flow [2024-06-04 17:47:49,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:47:49,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:47:49,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2024-06-04 17:47:49,036 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.365625 [2024-06-04 17:47:49,036 INFO L175 Difference]: Start difference. First operand has 159 places, 135 transitions, 1124 flow. Second operand 10 states and 117 transitions. [2024-06-04 17:47:49,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 163 transitions, 1828 flow [2024-06-04 17:47:49,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 163 transitions, 1750 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-04 17:47:49,122 INFO L231 Difference]: Finished difference. Result has 164 places, 143 transitions, 1292 flow [2024-06-04 17:47:49,122 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1046, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1292, PETRI_PLACES=164, PETRI_TRANSITIONS=143} [2024-06-04 17:47:49,122 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 133 predicate places. [2024-06-04 17:47:49,122 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 143 transitions, 1292 flow [2024-06-04 17:47:49,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:47:49,123 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:47:49,123 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:47:49,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-04 17:47:49,123 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-04 17:47:49,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:47:49,123 INFO L85 PathProgramCache]: Analyzing trace with hash -565649077, now seen corresponding path program 5 times [2024-06-04 17:47:49,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:47:49,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947073017] [2024-06-04 17:47:49,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:47:49,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:47:49,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:47:54,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:47:54,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:47:54,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947073017] [2024-06-04 17:47:54,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947073017] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:47:54,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:47:54,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:47:54,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017206999] [2024-06-04 17:47:54,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:47:54,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:47:54,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:47:54,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:47:54,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:47:54,341 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:47:54,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 143 transitions, 1292 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:47:54,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:47:54,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:47:54,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:47:54,685 INFO L124 PetriNetUnfolderBase]: 415/735 cut-off events. [2024-06-04 17:47:54,685 INFO L125 PetriNetUnfolderBase]: For 50718/50718 co-relation queries the response was YES. [2024-06-04 17:47:54,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5097 conditions, 735 events. 415/735 cut-off events. For 50718/50718 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3193 event pairs, 67 based on Foata normal form. 2/736 useless extension candidates. Maximal degree in co-relation 5014. Up to 604 conditions per place. [2024-06-04 17:47:54,690 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 120 selfloop transitions, 37 changer transitions 0/159 dead transitions. [2024-06-04 17:47:54,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 159 transitions, 1666 flow [2024-06-04 17:47:54,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:47:54,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:47:54,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2024-06-04 17:47:54,691 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3402777777777778 [2024-06-04 17:47:54,691 INFO L175 Difference]: Start difference. First operand has 164 places, 143 transitions, 1292 flow. Second operand 9 states and 98 transitions. [2024-06-04 17:47:54,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 159 transitions, 1666 flow [2024-06-04 17:47:54,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 159 transitions, 1617 flow, removed 13 selfloop flow, removed 5 redundant places. [2024-06-04 17:47:54,783 INFO L231 Difference]: Finished difference. Result has 168 places, 144 transitions, 1341 flow [2024-06-04 17:47:54,783 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1243, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1341, PETRI_PLACES=168, PETRI_TRANSITIONS=144} [2024-06-04 17:47:54,784 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 137 predicate places. [2024-06-04 17:47:54,784 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 144 transitions, 1341 flow [2024-06-04 17:47:54,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:47:54,784 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:47:54,784 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:47:54,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-04 17:47:54,784 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-04 17:47:54,784 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:47:54,785 INFO L85 PathProgramCache]: Analyzing trace with hash -565441315, now seen corresponding path program 3 times [2024-06-04 17:47:54,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:47:54,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943260469] [2024-06-04 17:47:54,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:47:54,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:47:54,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:48:00,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:48:00,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:48:00,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943260469] [2024-06-04 17:48:00,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943260469] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:48:00,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:48:00,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:48:00,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720852448] [2024-06-04 17:48:00,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:48:00,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:48:00,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:48:00,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:48:00,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:48:00,838 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:48:00,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 144 transitions, 1341 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:48:00,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:48:00,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:48:00,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:48:01,225 INFO L124 PetriNetUnfolderBase]: 431/761 cut-off events. [2024-06-04 17:48:01,225 INFO L125 PetriNetUnfolderBase]: For 56008/56008 co-relation queries the response was YES. [2024-06-04 17:48:01,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5450 conditions, 761 events. 431/761 cut-off events. For 56008/56008 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3349 event pairs, 57 based on Foata normal form. 2/762 useless extension candidates. Maximal degree in co-relation 5365. Up to 501 conditions per place. [2024-06-04 17:48:01,232 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 112 selfloop transitions, 54 changer transitions 0/168 dead transitions. [2024-06-04 17:48:01,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 168 transitions, 2031 flow [2024-06-04 17:48:01,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:48:01,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:48:01,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 115 transitions. [2024-06-04 17:48:01,233 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.359375 [2024-06-04 17:48:01,233 INFO L175 Difference]: Start difference. First operand has 168 places, 144 transitions, 1341 flow. Second operand 10 states and 115 transitions. [2024-06-04 17:48:01,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 168 transitions, 2031 flow [2024-06-04 17:48:01,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 168 transitions, 1943 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-04 17:48:01,329 INFO L231 Difference]: Finished difference. Result has 171 places, 148 transitions, 1434 flow [2024-06-04 17:48:01,329 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1253, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1434, PETRI_PLACES=171, PETRI_TRANSITIONS=148} [2024-06-04 17:48:01,330 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 140 predicate places. [2024-06-04 17:48:01,330 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 148 transitions, 1434 flow [2024-06-04 17:48:01,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:48:01,330 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:48:01,330 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:48:01,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-04 17:48:01,331 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-04 17:48:01,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:48:01,332 INFO L85 PathProgramCache]: Analyzing trace with hash 447429859, now seen corresponding path program 4 times [2024-06-04 17:48:01,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:48:01,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248294172] [2024-06-04 17:48:01,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:48:01,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:48:01,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:48:06,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:48:06,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:48:06,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248294172] [2024-06-04 17:48:06,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248294172] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:48:06,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:48:06,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:48:06,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655088740] [2024-06-04 17:48:06,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:48:06,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:48:06,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:48:06,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:48:06,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:48:06,802 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:48:06,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 148 transitions, 1434 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:48:06,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:48:06,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:48:06,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:48:07,166 INFO L124 PetriNetUnfolderBase]: 427/755 cut-off events. [2024-06-04 17:48:07,167 INFO L125 PetriNetUnfolderBase]: For 54800/54800 co-relation queries the response was YES. [2024-06-04 17:48:07,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5377 conditions, 755 events. 427/755 cut-off events. For 54800/54800 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3316 event pairs, 60 based on Foata normal form. 2/756 useless extension candidates. Maximal degree in co-relation 5291. Up to 500 conditions per place. [2024-06-04 17:48:07,173 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 114 selfloop transitions, 52 changer transitions 0/168 dead transitions. [2024-06-04 17:48:07,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 168 transitions, 2062 flow [2024-06-04 17:48:07,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:48:07,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:48:07,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 116 transitions. [2024-06-04 17:48:07,174 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3625 [2024-06-04 17:48:07,174 INFO L175 Difference]: Start difference. First operand has 171 places, 148 transitions, 1434 flow. Second operand 10 states and 116 transitions. [2024-06-04 17:48:07,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 168 transitions, 2062 flow [2024-06-04 17:48:07,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 168 transitions, 1954 flow, removed 15 selfloop flow, removed 6 redundant places. [2024-06-04 17:48:07,260 INFO L231 Difference]: Finished difference. Result has 175 places, 148 transitions, 1435 flow [2024-06-04 17:48:07,260 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1326, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1435, PETRI_PLACES=175, PETRI_TRANSITIONS=148} [2024-06-04 17:48:07,261 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 144 predicate places. [2024-06-04 17:48:07,261 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 148 transitions, 1435 flow [2024-06-04 17:48:07,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:48:07,261 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:48:07,261 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:48:07,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-04 17:48:07,261 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:48:07,261 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:48:07,262 INFO L85 PathProgramCache]: Analyzing trace with hash -565433875, now seen corresponding path program 5 times [2024-06-04 17:48:07,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:48:07,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112209880] [2024-06-04 17:48:07,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:48:07,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:48:07,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:48:12,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:48:12,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:48:12,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112209880] [2024-06-04 17:48:12,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112209880] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:48:12,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:48:12,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:48:12,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209858876] [2024-06-04 17:48:12,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:48:12,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:48:12,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:48:12,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:48:12,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:48:12,505 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:48:12,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 148 transitions, 1435 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:48:12,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:48:12,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:48:12,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:48:12,914 INFO L124 PetriNetUnfolderBase]: 421/747 cut-off events. [2024-06-04 17:48:12,914 INFO L125 PetriNetUnfolderBase]: For 53352/53352 co-relation queries the response was YES. [2024-06-04 17:48:12,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5128 conditions, 747 events. 421/747 cut-off events. For 53352/53352 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3290 event pairs, 56 based on Foata normal form. 4/750 useless extension candidates. Maximal degree in co-relation 5041. Up to 499 conditions per place. [2024-06-04 17:48:12,920 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 108 selfloop transitions, 57 changer transitions 0/167 dead transitions. [2024-06-04 17:48:12,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 167 transitions, 1947 flow [2024-06-04 17:48:12,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:48:12,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:48:12,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 113 transitions. [2024-06-04 17:48:12,921 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.353125 [2024-06-04 17:48:12,921 INFO L175 Difference]: Start difference. First operand has 175 places, 148 transitions, 1435 flow. Second operand 10 states and 113 transitions. [2024-06-04 17:48:12,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 167 transitions, 1947 flow [2024-06-04 17:48:13,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 167 transitions, 1810 flow, removed 21 selfloop flow, removed 8 redundant places. [2024-06-04 17:48:13,005 INFO L231 Difference]: Finished difference. Result has 177 places, 148 transitions, 1419 flow [2024-06-04 17:48:13,005 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1298, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1419, PETRI_PLACES=177, PETRI_TRANSITIONS=148} [2024-06-04 17:48:13,005 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 146 predicate places. [2024-06-04 17:48:13,005 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 148 transitions, 1419 flow [2024-06-04 17:48:13,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:48:13,006 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:48:13,006 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:48:13,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-04 17:48:13,006 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:48:13,006 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:48:13,007 INFO L85 PathProgramCache]: Analyzing trace with hash -565433596, now seen corresponding path program 1 times [2024-06-04 17:48:13,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:48:13,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978026407] [2024-06-04 17:48:13,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:48:13,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:48:13,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:48:18,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-04 17:48:18,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:48:18,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978026407] [2024-06-04 17:48:18,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978026407] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:48:18,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:48:18,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:48:18,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695166808] [2024-06-04 17:48:18,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:48:18,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:48:18,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:48:18,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:48:18,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:48:19,100 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:48:19,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 148 transitions, 1419 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:48:19,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:48:19,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:48:19,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:48:19,452 INFO L124 PetriNetUnfolderBase]: 417/740 cut-off events. [2024-06-04 17:48:19,452 INFO L125 PetriNetUnfolderBase]: For 47958/47958 co-relation queries the response was YES. [2024-06-04 17:48:19,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5030 conditions, 740 events. 417/740 cut-off events. For 47958/47958 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3240 event pairs, 75 based on Foata normal form. 1/740 useless extension candidates. Maximal degree in co-relation 4942. Up to 700 conditions per place. [2024-06-04 17:48:19,457 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 142 selfloop transitions, 18 changer transitions 0/162 dead transitions. [2024-06-04 17:48:19,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 162 transitions, 1786 flow [2024-06-04 17:48:19,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:48:19,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:48:19,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 99 transitions. [2024-06-04 17:48:19,458 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.309375 [2024-06-04 17:48:19,458 INFO L175 Difference]: Start difference. First operand has 177 places, 148 transitions, 1419 flow. Second operand 10 states and 99 transitions. [2024-06-04 17:48:19,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 162 transitions, 1786 flow [2024-06-04 17:48:19,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 162 transitions, 1677 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-06-04 17:48:19,552 INFO L231 Difference]: Finished difference. Result has 179 places, 149 transitions, 1364 flow [2024-06-04 17:48:19,552 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1311, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1364, PETRI_PLACES=179, PETRI_TRANSITIONS=149} [2024-06-04 17:48:19,552 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 148 predicate places. [2024-06-04 17:48:19,552 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 149 transitions, 1364 flow [2024-06-04 17:48:19,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:48:19,553 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:48:19,553 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:48:19,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-04 17:48:19,553 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:48:19,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:48:19,553 INFO L85 PathProgramCache]: Analyzing trace with hash -571159327, now seen corresponding path program 6 times [2024-06-04 17:48:19,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:48:19,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560573684] [2024-06-04 17:48:19,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:48:19,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:48:19,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:48:24,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:48:24,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:48:24,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560573684] [2024-06-04 17:48:24,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560573684] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:48:24,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:48:24,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:48:24,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001889100] [2024-06-04 17:48:24,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:48:24,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:48:24,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:48:24,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:48:24,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:48:25,150 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:48:25,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 149 transitions, 1364 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:48:25,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:48:25,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:48:25,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:48:25,561 INFO L124 PetriNetUnfolderBase]: 421/748 cut-off events. [2024-06-04 17:48:25,561 INFO L125 PetriNetUnfolderBase]: For 51145/51145 co-relation queries the response was YES. [2024-06-04 17:48:25,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5014 conditions, 748 events. 421/748 cut-off events. For 51145/51145 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3296 event pairs, 65 based on Foata normal form. 2/749 useless extension candidates. Maximal degree in co-relation 4925. Up to 597 conditions per place. [2024-06-04 17:48:25,566 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 128 selfloop transitions, 35 changer transitions 0/165 dead transitions. [2024-06-04 17:48:25,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 165 transitions, 1750 flow [2024-06-04 17:48:25,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:48:25,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:48:25,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions. [2024-06-04 17:48:25,567 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34375 [2024-06-04 17:48:25,567 INFO L175 Difference]: Start difference. First operand has 179 places, 149 transitions, 1364 flow. Second operand 9 states and 99 transitions. [2024-06-04 17:48:25,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 165 transitions, 1750 flow [2024-06-04 17:48:25,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 165 transitions, 1701 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-04 17:48:25,667 INFO L231 Difference]: Finished difference. Result has 180 places, 150 transitions, 1411 flow [2024-06-04 17:48:25,668 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1315, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1411, PETRI_PLACES=180, PETRI_TRANSITIONS=150} [2024-06-04 17:48:25,668 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 149 predicate places. [2024-06-04 17:48:25,668 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 150 transitions, 1411 flow [2024-06-04 17:48:25,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:48:25,668 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:48:25,668 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:48:25,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-04 17:48:25,668 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:48:25,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:48:25,669 INFO L85 PathProgramCache]: Analyzing trace with hash 614624813, now seen corresponding path program 7 times [2024-06-04 17:48:25,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:48:25,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91237286] [2024-06-04 17:48:25,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:48:25,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:48:25,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:48:30,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:48:30,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:48:30,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91237286] [2024-06-04 17:48:30,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91237286] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:48:30,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:48:30,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:48:30,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524249162] [2024-06-04 17:48:30,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:48:30,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:48:30,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:48:30,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:48:30,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:48:30,577 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:48:30,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 150 transitions, 1411 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:48:30,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:48:30,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:48:30,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:48:30,916 INFO L124 PetriNetUnfolderBase]: 425/757 cut-off events. [2024-06-04 17:48:30,917 INFO L125 PetriNetUnfolderBase]: For 53317/53323 co-relation queries the response was YES. [2024-06-04 17:48:30,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5143 conditions, 757 events. 425/757 cut-off events. For 53317/53323 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3343 event pairs, 58 based on Foata normal form. 2/754 useless extension candidates. Maximal degree in co-relation 5053. Up to 584 conditions per place. [2024-06-04 17:48:30,923 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 112 selfloop transitions, 50 changer transitions 0/164 dead transitions. [2024-06-04 17:48:30,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 164 transitions, 1793 flow [2024-06-04 17:48:30,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:48:30,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:48:30,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2024-06-04 17:48:30,925 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3402777777777778 [2024-06-04 17:48:30,925 INFO L175 Difference]: Start difference. First operand has 180 places, 150 transitions, 1411 flow. Second operand 9 states and 98 transitions. [2024-06-04 17:48:30,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 164 transitions, 1793 flow [2024-06-04 17:48:31,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 164 transitions, 1707 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-06-04 17:48:31,030 INFO L231 Difference]: Finished difference. Result has 182 places, 151 transitions, 1453 flow [2024-06-04 17:48:31,030 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1325, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1453, PETRI_PLACES=182, PETRI_TRANSITIONS=151} [2024-06-04 17:48:31,031 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 151 predicate places. [2024-06-04 17:48:31,031 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 151 transitions, 1453 flow [2024-06-04 17:48:31,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:48:31,031 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:48:31,031 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:48:31,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-04 17:48:31,031 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:48:31,032 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:48:31,032 INFO L85 PathProgramCache]: Analyzing trace with hash 614630765, now seen corresponding path program 6 times [2024-06-04 17:48:31,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:48:31,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226891335] [2024-06-04 17:48:31,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:48:31,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:48:31,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:48:36,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:48:36,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:48:36,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226891335] [2024-06-04 17:48:36,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226891335] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:48:36,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:48:36,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:48:36,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618253109] [2024-06-04 17:48:36,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:48:36,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:48:36,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:48:36,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:48:36,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:48:36,730 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:48:36,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 151 transitions, 1453 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:48:36,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:48:36,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:48:36,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:48:37,111 INFO L124 PetriNetUnfolderBase]: 466/823 cut-off events. [2024-06-04 17:48:37,112 INFO L125 PetriNetUnfolderBase]: For 68191/68197 co-relation queries the response was YES. [2024-06-04 17:48:37,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5979 conditions, 823 events. 466/823 cut-off events. For 68191/68197 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3709 event pairs, 70 based on Foata normal form. 2/820 useless extension candidates. Maximal degree in co-relation 5888. Up to 357 conditions per place. [2024-06-04 17:48:37,119 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 101 selfloop transitions, 79 changer transitions 0/182 dead transitions. [2024-06-04 17:48:37,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 182 transitions, 2423 flow [2024-06-04 17:48:37,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:48:37,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:48:37,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 122 transitions. [2024-06-04 17:48:37,120 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38125 [2024-06-04 17:48:37,121 INFO L175 Difference]: Start difference. First operand has 182 places, 151 transitions, 1453 flow. Second operand 10 states and 122 transitions. [2024-06-04 17:48:37,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 182 transitions, 2423 flow [2024-06-04 17:48:37,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 182 transitions, 2305 flow, removed 10 selfloop flow, removed 7 redundant places. [2024-06-04 17:48:37,247 INFO L231 Difference]: Finished difference. Result has 187 places, 161 transitions, 1685 flow [2024-06-04 17:48:37,247 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1335, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1685, PETRI_PLACES=187, PETRI_TRANSITIONS=161} [2024-06-04 17:48:37,248 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 156 predicate places. [2024-06-04 17:48:37,248 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 161 transitions, 1685 flow [2024-06-04 17:48:37,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:48:37,248 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:48:37,248 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:48:37,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-04 17:48:37,249 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:48:37,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:48:37,249 INFO L85 PathProgramCache]: Analyzing trace with hash 871333085, now seen corresponding path program 7 times [2024-06-04 17:48:37,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:48:37,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478018415] [2024-06-04 17:48:37,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:48:37,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:48:37,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:48:42,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:48:42,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:48:42,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478018415] [2024-06-04 17:48:42,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478018415] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:48:42,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:48:42,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:48:42,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582584567] [2024-06-04 17:48:42,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:48:42,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:48:42,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:48:42,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:48:42,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:48:42,911 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:48:42,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 161 transitions, 1685 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:48:42,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:48:42,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:48:42,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:48:43,315 INFO L124 PetriNetUnfolderBase]: 507/889 cut-off events. [2024-06-04 17:48:43,315 INFO L125 PetriNetUnfolderBase]: For 84332/84338 co-relation queries the response was YES. [2024-06-04 17:48:43,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7064 conditions, 889 events. 507/889 cut-off events. For 84332/84338 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 4053 event pairs, 61 based on Foata normal form. 2/886 useless extension candidates. Maximal degree in co-relation 6970. Up to 383 conditions per place. [2024-06-04 17:48:43,322 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 98 selfloop transitions, 90 changer transitions 0/190 dead transitions. [2024-06-04 17:48:43,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 190 transitions, 2684 flow [2024-06-04 17:48:43,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:48:43,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:48:43,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 121 transitions. [2024-06-04 17:48:43,323 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.378125 [2024-06-04 17:48:43,323 INFO L175 Difference]: Start difference. First operand has 187 places, 161 transitions, 1685 flow. Second operand 10 states and 121 transitions. [2024-06-04 17:48:43,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 190 transitions, 2684 flow [2024-06-04 17:48:43,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 190 transitions, 2574 flow, removed 34 selfloop flow, removed 4 redundant places. [2024-06-04 17:48:43,465 INFO L231 Difference]: Finished difference. Result has 194 places, 169 transitions, 1924 flow [2024-06-04 17:48:43,465 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1595, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1924, PETRI_PLACES=194, PETRI_TRANSITIONS=169} [2024-06-04 17:48:43,465 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 163 predicate places. [2024-06-04 17:48:43,465 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 169 transitions, 1924 flow [2024-06-04 17:48:43,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:48:43,465 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:48:43,465 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:48:43,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-04 17:48:43,466 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:48:43,466 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:48:43,466 INFO L85 PathProgramCache]: Analyzing trace with hash 871340525, now seen corresponding path program 8 times [2024-06-04 17:48:43,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:48:43,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220227929] [2024-06-04 17:48:43,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:48:43,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:48:43,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:48:49,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:48:49,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:48:49,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220227929] [2024-06-04 17:48:49,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220227929] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:48:49,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:48:49,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:48:49,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168629630] [2024-06-04 17:48:49,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:48:49,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:48:49,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:48:49,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:48:49,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:48:49,292 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:48:49,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 169 transitions, 1924 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:48:49,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:48:49,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:48:49,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:48:49,709 INFO L124 PetriNetUnfolderBase]: 536/937 cut-off events. [2024-06-04 17:48:49,709 INFO L125 PetriNetUnfolderBase]: For 97417/97423 co-relation queries the response was YES. [2024-06-04 17:48:49,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7767 conditions, 937 events. 536/937 cut-off events. For 97417/97423 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4329 event pairs, 67 based on Foata normal form. 4/936 useless extension candidates. Maximal degree in co-relation 7670. Up to 406 conditions per place. [2024-06-04 17:48:49,716 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 102 selfloop transitions, 92 changer transitions 0/196 dead transitions. [2024-06-04 17:48:49,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 196 transitions, 2902 flow [2024-06-04 17:48:49,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:48:49,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:48:49,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 122 transitions. [2024-06-04 17:48:49,717 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38125 [2024-06-04 17:48:49,717 INFO L175 Difference]: Start difference. First operand has 194 places, 169 transitions, 1924 flow. Second operand 10 states and 122 transitions. [2024-06-04 17:48:49,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 196 transitions, 2902 flow [2024-06-04 17:48:49,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 196 transitions, 2740 flow, removed 21 selfloop flow, removed 5 redundant places. [2024-06-04 17:48:49,869 INFO L231 Difference]: Finished difference. Result has 200 places, 175 transitions, 2075 flow [2024-06-04 17:48:49,869 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1772, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2075, PETRI_PLACES=200, PETRI_TRANSITIONS=175} [2024-06-04 17:48:49,869 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 169 predicate places. [2024-06-04 17:48:49,869 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 175 transitions, 2075 flow [2024-06-04 17:48:49,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:48:49,869 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:48:49,869 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:48:49,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-04 17:48:49,870 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:48:49,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:48:49,870 INFO L85 PathProgramCache]: Analyzing trace with hash 874235350, now seen corresponding path program 2 times [2024-06-04 17:48:49,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:48:49,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784333155] [2024-06-04 17:48:49,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:48:49,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:48:49,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:48:55,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:48:55,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:48:55,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784333155] [2024-06-04 17:48:55,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784333155] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:48:55,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:48:55,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:48:55,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524201923] [2024-06-04 17:48:55,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:48:55,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:48:55,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:48:55,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:48:55,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:48:55,566 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:48:55,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 175 transitions, 2075 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:48:55,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:48:55,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:48:55,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:48:56,031 INFO L124 PetriNetUnfolderBase]: 539/941 cut-off events. [2024-06-04 17:48:56,031 INFO L125 PetriNetUnfolderBase]: For 95126/95126 co-relation queries the response was YES. [2024-06-04 17:48:56,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7885 conditions, 941 events. 539/941 cut-off events. For 95126/95126 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4354 event pairs, 99 based on Foata normal form. 1/941 useless extension candidates. Maximal degree in co-relation 7786. Up to 882 conditions per place. [2024-06-04 17:48:56,040 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 169 selfloop transitions, 22 changer transitions 0/193 dead transitions. [2024-06-04 17:48:56,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 193 transitions, 2815 flow [2024-06-04 17:48:56,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:48:56,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:48:56,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 111 transitions. [2024-06-04 17:48:56,041 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3153409090909091 [2024-06-04 17:48:56,041 INFO L175 Difference]: Start difference. First operand has 200 places, 175 transitions, 2075 flow. Second operand 11 states and 111 transitions. [2024-06-04 17:48:56,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 193 transitions, 2815 flow [2024-06-04 17:48:56,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 193 transitions, 2624 flow, removed 14 selfloop flow, removed 6 redundant places. [2024-06-04 17:48:56,237 INFO L231 Difference]: Finished difference. Result has 206 places, 178 transitions, 1999 flow [2024-06-04 17:48:56,237 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1886, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1999, PETRI_PLACES=206, PETRI_TRANSITIONS=178} [2024-06-04 17:48:56,237 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 175 predicate places. [2024-06-04 17:48:56,237 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 178 transitions, 1999 flow [2024-06-04 17:48:56,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:48:56,238 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:48:56,238 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:48:56,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-04 17:48:56,238 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:48:56,239 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:48:56,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1350551373, now seen corresponding path program 8 times [2024-06-04 17:48:56,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:48:56,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803654447] [2024-06-04 17:48:56,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:48:56,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:48:56,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:49:01,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:49:01,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:49:01,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803654447] [2024-06-04 17:49:01,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803654447] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:49:01,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:49:01,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:49:01,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940668134] [2024-06-04 17:49:01,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:49:01,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:49:01,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:49:01,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:49:01,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:49:01,641 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:49:01,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 178 transitions, 1999 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:49:01,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:49:01,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:49:01,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:49:02,052 INFO L124 PetriNetUnfolderBase]: 543/950 cut-off events. [2024-06-04 17:49:02,053 INFO L125 PetriNetUnfolderBase]: For 99597/99603 co-relation queries the response was YES. [2024-06-04 17:49:02,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7742 conditions, 950 events. 543/950 cut-off events. For 99597/99603 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 4405 event pairs, 86 based on Foata normal form. 2/947 useless extension candidates. Maximal degree in co-relation 7641. Up to 777 conditions per place. [2024-06-04 17:49:02,062 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 145 selfloop transitions, 45 changer transitions 0/192 dead transitions. [2024-06-04 17:49:02,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 192 transitions, 2439 flow [2024-06-04 17:49:02,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:49:02,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:49:02,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions. [2024-06-04 17:49:02,064 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34375 [2024-06-04 17:49:02,064 INFO L175 Difference]: Start difference. First operand has 206 places, 178 transitions, 1999 flow. Second operand 9 states and 99 transitions. [2024-06-04 17:49:02,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 192 transitions, 2439 flow [2024-06-04 17:49:02,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 192 transitions, 2372 flow, removed 15 selfloop flow, removed 8 redundant places. [2024-06-04 17:49:02,254 INFO L231 Difference]: Finished difference. Result has 207 places, 179 transitions, 2052 flow [2024-06-04 17:49:02,254 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1932, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2052, PETRI_PLACES=207, PETRI_TRANSITIONS=179} [2024-06-04 17:49:02,254 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 176 predicate places. [2024-06-04 17:49:02,254 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 179 transitions, 2052 flow [2024-06-04 17:49:02,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:49:02,255 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:49:02,255 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:49:02,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-04 17:49:02,255 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:49:02,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:49:02,255 INFO L85 PathProgramCache]: Analyzing trace with hash 621990134, now seen corresponding path program 3 times [2024-06-04 17:49:02,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:49:02,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363551728] [2024-06-04 17:49:02,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:49:02,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:49:02,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:49:08,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:49:08,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:49:08,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363551728] [2024-06-04 17:49:08,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363551728] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:49:08,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:49:08,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:49:08,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801625141] [2024-06-04 17:49:08,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:49:08,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:49:08,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:49:08,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:49:08,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:49:08,206 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:49:08,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 179 transitions, 2052 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:49:08,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:49:08,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:49:08,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:49:08,592 INFO L124 PetriNetUnfolderBase]: 535/937 cut-off events. [2024-06-04 17:49:08,592 INFO L125 PetriNetUnfolderBase]: For 98061/98067 co-relation queries the response was YES. [2024-06-04 17:49:08,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7534 conditions, 937 events. 535/937 cut-off events. For 98061/98067 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 4337 event pairs, 63 based on Foata normal form. 3/935 useless extension candidates. Maximal degree in co-relation 7433. Up to 540 conditions per place. [2024-06-04 17:49:08,599 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 107 selfloop transitions, 94 changer transitions 0/203 dead transitions. [2024-06-04 17:49:08,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 203 transitions, 2873 flow [2024-06-04 17:49:08,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:49:08,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:49:08,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2024-06-04 17:49:08,600 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36875 [2024-06-04 17:49:08,600 INFO L175 Difference]: Start difference. First operand has 207 places, 179 transitions, 2052 flow. Second operand 10 states and 118 transitions. [2024-06-04 17:49:08,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 203 transitions, 2873 flow [2024-06-04 17:49:08,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 203 transitions, 2737 flow, removed 24 selfloop flow, removed 7 redundant places. [2024-06-04 17:49:08,785 INFO L231 Difference]: Finished difference. Result has 212 places, 185 transitions, 2274 flow [2024-06-04 17:49:08,785 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1916, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2274, PETRI_PLACES=212, PETRI_TRANSITIONS=185} [2024-06-04 17:49:08,786 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 181 predicate places. [2024-06-04 17:49:08,786 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 185 transitions, 2274 flow [2024-06-04 17:49:08,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:49:08,786 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:49:08,786 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:49:08,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-04 17:49:08,786 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:49:08,786 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:49:08,786 INFO L85 PathProgramCache]: Analyzing trace with hash 475760982, now seen corresponding path program 4 times [2024-06-04 17:49:08,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:49:08,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094342093] [2024-06-04 17:49:08,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:49:08,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:49:08,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:49:14,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:49:14,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:49:14,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094342093] [2024-06-04 17:49:14,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094342093] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:49:14,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:49:14,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:49:14,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117260035] [2024-06-04 17:49:14,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:49:14,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:49:14,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:49:14,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:49:14,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:49:14,564 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:49:14,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 185 transitions, 2274 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:49:14,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:49:14,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:49:14,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:49:14,983 INFO L124 PetriNetUnfolderBase]: 533/933 cut-off events. [2024-06-04 17:49:14,983 INFO L125 PetriNetUnfolderBase]: For 94174/94174 co-relation queries the response was YES. [2024-06-04 17:49:14,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7694 conditions, 933 events. 533/933 cut-off events. For 94174/94174 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 4323 event pairs, 103 based on Foata normal form. 1/933 useless extension candidates. Maximal degree in co-relation 7590. Up to 903 conditions per place. [2024-06-04 17:49:14,991 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 178 selfloop transitions, 16 changer transitions 0/196 dead transitions. [2024-06-04 17:49:14,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 196 transitions, 2697 flow [2024-06-04 17:49:14,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:49:14,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:49:14,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 96 transitions. [2024-06-04 17:49:14,992 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3 [2024-06-04 17:49:14,992 INFO L175 Difference]: Start difference. First operand has 212 places, 185 transitions, 2274 flow. Second operand 10 states and 96 transitions. [2024-06-04 17:49:14,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 196 transitions, 2697 flow [2024-06-04 17:49:15,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 196 transitions, 2554 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-06-04 17:49:15,206 INFO L231 Difference]: Finished difference. Result has 215 places, 186 transitions, 2181 flow [2024-06-04 17:49:15,206 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2131, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2181, PETRI_PLACES=215, PETRI_TRANSITIONS=186} [2024-06-04 17:49:15,206 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 184 predicate places. [2024-06-04 17:49:15,206 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 186 transitions, 2181 flow [2024-06-04 17:49:15,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:49:15,206 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:49:15,206 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:49:15,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-04 17:49:15,207 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:49:15,207 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:49:15,207 INFO L85 PathProgramCache]: Analyzing trace with hash 871599995, now seen corresponding path program 9 times [2024-06-04 17:49:15,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:49:15,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948485630] [2024-06-04 17:49:15,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:49:15,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:49:15,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:49:20,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:49:20,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:49:20,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948485630] [2024-06-04 17:49:20,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948485630] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:49:20,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:49:20,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:49:20,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685895280] [2024-06-04 17:49:20,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:49:20,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:49:20,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:49:20,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:49:20,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:49:21,069 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:49:21,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 186 transitions, 2181 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:49:21,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:49:21,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:49:21,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:49:21,509 INFO L124 PetriNetUnfolderBase]: 525/921 cut-off events. [2024-06-04 17:49:21,510 INFO L125 PetriNetUnfolderBase]: For 93952/93952 co-relation queries the response was YES. [2024-06-04 17:49:21,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7210 conditions, 921 events. 525/921 cut-off events. For 93952/93952 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 4252 event pairs, 98 based on Foata normal form. 4/924 useless extension candidates. Maximal degree in co-relation 7105. Up to 860 conditions per place. [2024-06-04 17:49:21,516 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 173 selfloop transitions, 24 changer transitions 0/199 dead transitions. [2024-06-04 17:49:21,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 199 transitions, 2747 flow [2024-06-04 17:49:21,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:49:21,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:49:21,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 103 transitions. [2024-06-04 17:49:21,518 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.321875 [2024-06-04 17:49:21,518 INFO L175 Difference]: Start difference. First operand has 215 places, 186 transitions, 2181 flow. Second operand 10 states and 103 transitions. [2024-06-04 17:49:21,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 199 transitions, 2747 flow [2024-06-04 17:49:21,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 199 transitions, 2668 flow, removed 25 selfloop flow, removed 8 redundant places. [2024-06-04 17:49:21,733 INFO L231 Difference]: Finished difference. Result has 217 places, 186 transitions, 2159 flow [2024-06-04 17:49:21,734 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2102, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2159, PETRI_PLACES=217, PETRI_TRANSITIONS=186} [2024-06-04 17:49:21,734 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 186 predicate places. [2024-06-04 17:49:21,734 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 186 transitions, 2159 flow [2024-06-04 17:49:21,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:49:21,735 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:49:21,735 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:49:21,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-04 17:49:21,735 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:49:21,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:49:21,735 INFO L85 PathProgramCache]: Analyzing trace with hash 2139623755, now seen corresponding path program 9 times [2024-06-04 17:49:21,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:49:21,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807787324] [2024-06-04 17:49:21,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:49:21,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:49:21,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:49:26,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:49:26,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:49:26,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807787324] [2024-06-04 17:49:26,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807787324] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:49:26,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:49:26,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:49:26,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324729363] [2024-06-04 17:49:26,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:49:26,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:49:26,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:49:26,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:49:26,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:49:26,889 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:49:26,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 186 transitions, 2159 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:49:26,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:49:26,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:49:26,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:49:27,232 INFO L124 PetriNetUnfolderBase]: 529/930 cut-off events. [2024-06-04 17:49:27,232 INFO L125 PetriNetUnfolderBase]: For 92267/92273 co-relation queries the response was YES. [2024-06-04 17:49:27,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7288 conditions, 930 events. 529/930 cut-off events. For 92267/92273 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4333 event pairs, 87 based on Foata normal form. 2/927 useless extension candidates. Maximal degree in co-relation 7182. Up to 757 conditions per place. [2024-06-04 17:49:27,240 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 155 selfloop transitions, 44 changer transitions 0/201 dead transitions. [2024-06-04 17:49:27,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 201 transitions, 2623 flow [2024-06-04 17:49:27,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:49:27,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:49:27,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2024-06-04 17:49:27,242 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3506944444444444 [2024-06-04 17:49:27,242 INFO L175 Difference]: Start difference. First operand has 217 places, 186 transitions, 2159 flow. Second operand 9 states and 101 transitions. [2024-06-04 17:49:27,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 201 transitions, 2623 flow [2024-06-04 17:49:27,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 201 transitions, 2543 flow, removed 1 selfloop flow, removed 10 redundant places. [2024-06-04 17:49:27,419 INFO L231 Difference]: Finished difference. Result has 216 places, 187 transitions, 2199 flow [2024-06-04 17:49:27,419 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2079, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2199, PETRI_PLACES=216, PETRI_TRANSITIONS=187} [2024-06-04 17:49:27,419 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 185 predicate places. [2024-06-04 17:49:27,419 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 187 transitions, 2199 flow [2024-06-04 17:49:27,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:49:27,420 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:49:27,420 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:49:27,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-04 17:49:27,420 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:49:27,420 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:49:27,420 INFO L85 PathProgramCache]: Analyzing trace with hash 614832575, now seen corresponding path program 10 times [2024-06-04 17:49:27,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:49:27,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289810206] [2024-06-04 17:49:27,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:49:27,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:49:27,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:49:32,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:49:32,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:49:32,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289810206] [2024-06-04 17:49:32,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289810206] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:49:32,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:49:32,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:49:32,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536524442] [2024-06-04 17:49:32,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:49:32,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:49:32,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:49:32,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:49:32,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:49:33,029 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:49:33,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 187 transitions, 2199 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:49:33,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:49:33,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:49:33,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:49:33,377 INFO L124 PetriNetUnfolderBase]: 535/940 cut-off events. [2024-06-04 17:49:33,378 INFO L125 PetriNetUnfolderBase]: For 95153/95159 co-relation queries the response was YES. [2024-06-04 17:49:33,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7429 conditions, 940 events. 535/940 cut-off events. For 95153/95159 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 4393 event pairs, 77 based on Foata normal form. 2/937 useless extension candidates. Maximal degree in co-relation 7322. Up to 414 conditions per place. [2024-06-04 17:49:33,386 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 114 selfloop transitions, 94 changer transitions 0/210 dead transitions. [2024-06-04 17:49:33,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 210 transitions, 3301 flow [2024-06-04 17:49:33,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:49:33,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:49:33,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2024-06-04 17:49:33,387 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.390625 [2024-06-04 17:49:33,387 INFO L175 Difference]: Start difference. First operand has 216 places, 187 transitions, 2199 flow. Second operand 10 states and 125 transitions. [2024-06-04 17:49:33,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 210 transitions, 3301 flow [2024-06-04 17:49:33,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 210 transitions, 3191 flow, removed 12 selfloop flow, removed 7 redundant places. [2024-06-04 17:49:33,567 INFO L231 Difference]: Finished difference. Result has 219 places, 189 transitions, 2320 flow [2024-06-04 17:49:33,567 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2089, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2320, PETRI_PLACES=219, PETRI_TRANSITIONS=189} [2024-06-04 17:49:33,567 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 188 predicate places. [2024-06-04 17:49:33,567 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 189 transitions, 2320 flow [2024-06-04 17:49:33,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:49:33,567 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:49:33,567 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:49:33,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-04 17:49:33,567 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:49:33,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:49:33,568 INFO L85 PathProgramCache]: Analyzing trace with hash 2139831517, now seen corresponding path program 11 times [2024-06-04 17:49:33,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:49:33,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981773483] [2024-06-04 17:49:33,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:49:33,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:49:33,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:49:39,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:49:39,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:49:39,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981773483] [2024-06-04 17:49:39,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981773483] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:49:39,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:49:39,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:49:39,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563247986] [2024-06-04 17:49:39,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:49:39,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:49:39,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:49:39,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:49:39,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:49:39,209 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:49:39,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 189 transitions, 2320 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:49:39,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:49:39,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:49:39,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:49:39,599 INFO L124 PetriNetUnfolderBase]: 561/982 cut-off events. [2024-06-04 17:49:39,599 INFO L125 PetriNetUnfolderBase]: For 108809/108815 co-relation queries the response was YES. [2024-06-04 17:49:39,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8154 conditions, 982 events. 561/982 cut-off events. For 108809/108815 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 4618 event pairs, 92 based on Foata normal form. 2/979 useless extension candidates. Maximal degree in co-relation 8046. Up to 428 conditions per place. [2024-06-04 17:49:39,611 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 122 selfloop transitions, 93 changer transitions 0/217 dead transitions. [2024-06-04 17:49:39,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 217 transitions, 3552 flow [2024-06-04 17:49:39,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:49:39,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:49:39,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 126 transitions. [2024-06-04 17:49:39,612 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39375 [2024-06-04 17:49:39,612 INFO L175 Difference]: Start difference. First operand has 219 places, 189 transitions, 2320 flow. Second operand 10 states and 126 transitions. [2024-06-04 17:49:39,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 217 transitions, 3552 flow [2024-06-04 17:49:39,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 217 transitions, 3305 flow, removed 13 selfloop flow, removed 8 redundant places. [2024-06-04 17:49:39,852 INFO L231 Difference]: Finished difference. Result has 223 places, 196 transitions, 2442 flow [2024-06-04 17:49:39,852 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2081, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2442, PETRI_PLACES=223, PETRI_TRANSITIONS=196} [2024-06-04 17:49:39,852 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 192 predicate places. [2024-06-04 17:49:39,852 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 196 transitions, 2442 flow [2024-06-04 17:49:39,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:49:39,853 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:49:39,853 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:49:39,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-04 17:49:39,853 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:49:39,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:49:39,853 INFO L85 PathProgramCache]: Analyzing trace with hash 614840015, now seen corresponding path program 12 times [2024-06-04 17:49:39,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:49:39,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578996997] [2024-06-04 17:49:39,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:49:39,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:49:39,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:49:44,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:49:44,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:49:44,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578996997] [2024-06-04 17:49:44,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578996997] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:49:44,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:49:44,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:49:44,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758095689] [2024-06-04 17:49:44,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:49:44,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:49:44,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:49:44,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:49:44,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:49:45,092 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:49:45,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 196 transitions, 2442 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:49:45,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:49:45,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:49:45,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:49:45,506 INFO L124 PetriNetUnfolderBase]: 555/974 cut-off events. [2024-06-04 17:49:45,506 INFO L125 PetriNetUnfolderBase]: For 106770/106776 co-relation queries the response was YES. [2024-06-04 17:49:45,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7862 conditions, 974 events. 555/974 cut-off events. For 106770/106776 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 4592 event pairs, 76 based on Foata normal form. 4/973 useless extension candidates. Maximal degree in co-relation 7752. Up to 427 conditions per place. [2024-06-04 17:49:45,515 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 115 selfloop transitions, 98 changer transitions 0/215 dead transitions. [2024-06-04 17:49:45,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 215 transitions, 3360 flow [2024-06-04 17:49:45,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:49:45,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:49:45,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 123 transitions. [2024-06-04 17:49:45,517 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.384375 [2024-06-04 17:49:45,517 INFO L175 Difference]: Start difference. First operand has 223 places, 196 transitions, 2442 flow. Second operand 10 states and 123 transitions. [2024-06-04 17:49:45,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 215 transitions, 3360 flow [2024-06-04 17:49:45,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 215 transitions, 2983 flow, removed 45 selfloop flow, removed 9 redundant places. [2024-06-04 17:49:45,741 INFO L231 Difference]: Finished difference. Result has 224 places, 196 transitions, 2269 flow [2024-06-04 17:49:45,742 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2065, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2269, PETRI_PLACES=224, PETRI_TRANSITIONS=196} [2024-06-04 17:49:45,742 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 193 predicate places. [2024-06-04 17:49:45,742 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 196 transitions, 2269 flow [2024-06-04 17:49:45,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:49:45,742 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:49:45,742 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:49:45,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-04 17:49:45,742 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:49:45,743 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:49:45,743 INFO L85 PathProgramCache]: Analyzing trace with hash 617466070, now seen corresponding path program 5 times [2024-06-04 17:49:45,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:49:45,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79377358] [2024-06-04 17:49:45,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:49:45,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:49:45,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:49:51,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:49:51,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:49:51,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79377358] [2024-06-04 17:49:51,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79377358] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:49:51,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:49:51,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:49:51,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745777473] [2024-06-04 17:49:51,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:49:51,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:49:51,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:49:51,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:49:51,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:49:51,655 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:49:51,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 196 transitions, 2269 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:49:51,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:49:51,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:49:51,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:49:52,087 INFO L124 PetriNetUnfolderBase]: 547/961 cut-off events. [2024-06-04 17:49:52,087 INFO L125 PetriNetUnfolderBase]: For 98012/98018 co-relation queries the response was YES. [2024-06-04 17:49:52,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7373 conditions, 961 events. 547/961 cut-off events. For 98012/98018 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 4534 event pairs, 73 based on Foata normal form. 3/959 useless extension candidates. Maximal degree in co-relation 7263. Up to 551 conditions per place. [2024-06-04 17:49:52,095 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 118 selfloop transitions, 93 changer transitions 0/213 dead transitions. [2024-06-04 17:49:52,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 213 transitions, 2889 flow [2024-06-04 17:49:52,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:49:52,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:49:52,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2024-06-04 17:49:52,098 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36875 [2024-06-04 17:49:52,098 INFO L175 Difference]: Start difference. First operand has 224 places, 196 transitions, 2269 flow. Second operand 10 states and 118 transitions. [2024-06-04 17:49:52,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 213 transitions, 2889 flow [2024-06-04 17:49:52,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 213 transitions, 2666 flow, removed 17 selfloop flow, removed 8 redundant places. [2024-06-04 17:49:52,281 INFO L231 Difference]: Finished difference. Result has 226 places, 196 transitions, 2241 flow [2024-06-04 17:49:52,281 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2046, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2241, PETRI_PLACES=226, PETRI_TRANSITIONS=196} [2024-06-04 17:49:52,282 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 195 predicate places. [2024-06-04 17:49:52,282 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 196 transitions, 2241 flow [2024-06-04 17:49:52,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:49:52,282 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:49:52,282 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:49:52,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-04 17:49:52,282 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:49:52,282 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:49:52,282 INFO L85 PathProgramCache]: Analyzing trace with hash 2142465012, now seen corresponding path program 6 times [2024-06-04 17:49:52,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:49:52,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004438005] [2024-06-04 17:49:52,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:49:52,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:49:52,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:49:58,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:49:58,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:49:58,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004438005] [2024-06-04 17:49:58,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004438005] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:49:58,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:49:58,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:49:58,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734535273] [2024-06-04 17:49:58,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:49:58,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:49:58,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:49:58,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:49:58,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:49:58,746 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:49:58,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 196 transitions, 2241 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:49:58,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:49:58,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:49:58,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:49:59,202 INFO L124 PetriNetUnfolderBase]: 543/956 cut-off events. [2024-06-04 17:49:59,202 INFO L125 PetriNetUnfolderBase]: For 91363/91369 co-relation queries the response was YES. [2024-06-04 17:49:59,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7130 conditions, 956 events. 543/956 cut-off events. For 91363/91369 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 4500 event pairs, 83 based on Foata normal form. 3/954 useless extension candidates. Maximal degree in co-relation 7019. Up to 541 conditions per place. [2024-06-04 17:49:59,210 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 123 selfloop transitions, 90 changer transitions 0/215 dead transitions. [2024-06-04 17:49:59,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 215 transitions, 3045 flow [2024-06-04 17:49:59,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:49:59,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:49:59,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 120 transitions. [2024-06-04 17:49:59,211 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-04 17:49:59,211 INFO L175 Difference]: Start difference. First operand has 226 places, 196 transitions, 2241 flow. Second operand 10 states and 120 transitions. [2024-06-04 17:49:59,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 215 transitions, 3045 flow [2024-06-04 17:49:59,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 215 transitions, 2866 flow, removed 3 selfloop flow, removed 9 redundant places. [2024-06-04 17:49:59,403 INFO L231 Difference]: Finished difference. Result has 227 places, 197 transitions, 2277 flow [2024-06-04 17:49:59,403 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2065, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2277, PETRI_PLACES=227, PETRI_TRANSITIONS=197} [2024-06-04 17:49:59,403 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 196 predicate places. [2024-06-04 17:49:59,403 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 197 transitions, 2277 flow [2024-06-04 17:49:59,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:49:59,404 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:49:59,404 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:49:59,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-04 17:49:59,404 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:49:59,404 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:49:59,405 INFO L85 PathProgramCache]: Analyzing trace with hash 2136893103, now seen corresponding path program 13 times [2024-06-04 17:49:59,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:49:59,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453751248] [2024-06-04 17:49:59,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:49:59,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:49:59,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:50:04,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:50:04,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:50:04,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453751248] [2024-06-04 17:50:04,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453751248] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:50:04,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:50:04,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:50:04,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74875426] [2024-06-04 17:50:04,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:50:04,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:50:04,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:50:04,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:50:04,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:50:05,092 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:50:05,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 197 transitions, 2277 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:50:05,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:50:05,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:50:05,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:50:05,484 INFO L124 PetriNetUnfolderBase]: 549/966 cut-off events. [2024-06-04 17:50:05,484 INFO L125 PetriNetUnfolderBase]: For 92216/92222 co-relation queries the response was YES. [2024-06-04 17:50:05,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7233 conditions, 966 events. 549/966 cut-off events. For 92216/92222 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 4552 event pairs, 89 based on Foata normal form. 2/963 useless extension candidates. Maximal degree in co-relation 7121. Up to 421 conditions per place. [2024-06-04 17:50:05,492 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 105 selfloop transitions, 111 changer transitions 0/218 dead transitions. [2024-06-04 17:50:05,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 218 transitions, 3269 flow [2024-06-04 17:50:05,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:50:05,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:50:05,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 123 transitions. [2024-06-04 17:50:05,494 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.384375 [2024-06-04 17:50:05,494 INFO L175 Difference]: Start difference. First operand has 227 places, 197 transitions, 2277 flow. Second operand 10 states and 123 transitions. [2024-06-04 17:50:05,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 218 transitions, 3269 flow [2024-06-04 17:50:05,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 218 transitions, 3101 flow, removed 23 selfloop flow, removed 6 redundant places. [2024-06-04 17:50:05,670 INFO L231 Difference]: Finished difference. Result has 231 places, 199 transitions, 2386 flow [2024-06-04 17:50:05,670 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2114, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2386, PETRI_PLACES=231, PETRI_TRANSITIONS=199} [2024-06-04 17:50:05,670 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 200 predicate places. [2024-06-04 17:50:05,670 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 199 transitions, 2386 flow [2024-06-04 17:50:05,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:50:05,671 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:50:05,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-04 17:50:05,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-04 17:50:05,671 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:50:05,671 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:50:05,671 INFO L85 PathProgramCache]: Analyzing trace with hash 2142464733, now seen corresponding path program 14 times [2024-06-04 17:50:05,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:50:05,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346879678] [2024-06-04 17:50:05,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:50:05,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:50:05,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:50:10,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:50:10,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:50:10,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346879678] [2024-06-04 17:50:10,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346879678] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:50:10,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:50:10,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:50:10,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197040682] [2024-06-04 17:50:10,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:50:10,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:50:10,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:50:10,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:50:10,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:50:10,893 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:50:10,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 199 transitions, 2386 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:50:10,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:50:10,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:50:10,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:50:11,294 INFO L124 PetriNetUnfolderBase]: 541/954 cut-off events. [2024-06-04 17:50:11,294 INFO L125 PetriNetUnfolderBase]: For 89306/89312 co-relation queries the response was YES. [2024-06-04 17:50:11,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6923 conditions, 954 events. 541/954 cut-off events. For 89306/89312 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 4507 event pairs, 87 based on Foata normal form. 4/953 useless extension candidates. Maximal degree in co-relation 6810. Up to 417 conditions per place. [2024-06-04 17:50:11,303 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 121 selfloop transitions, 95 changer transitions 0/218 dead transitions. [2024-06-04 17:50:11,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 218 transitions, 3334 flow [2024-06-04 17:50:11,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:50:11,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:50:11,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-04 17:50:11,305 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3875 [2024-06-04 17:50:11,305 INFO L175 Difference]: Start difference. First operand has 231 places, 199 transitions, 2386 flow. Second operand 10 states and 124 transitions. [2024-06-04 17:50:11,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 218 transitions, 3334 flow [2024-06-04 17:50:11,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 218 transitions, 3099 flow, removed 33 selfloop flow, removed 7 redundant places. [2024-06-04 17:50:11,480 INFO L231 Difference]: Finished difference. Result has 234 places, 199 transitions, 2349 flow [2024-06-04 17:50:11,480 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2151, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2349, PETRI_PLACES=234, PETRI_TRANSITIONS=199} [2024-06-04 17:50:11,480 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 203 predicate places. [2024-06-04 17:50:11,480 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 199 transitions, 2349 flow [2024-06-04 17:50:11,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:50:11,481 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:50:11,481 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:50:11,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-04 17:50:11,481 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:50:11,481 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:50:11,481 INFO L85 PathProgramCache]: Analyzing trace with hash 2142255483, now seen corresponding path program 15 times [2024-06-04 17:50:11,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:50:11,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048329444] [2024-06-04 17:50:11,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:50:11,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:50:11,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:50:17,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:50:17,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:50:17,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048329444] [2024-06-04 17:50:17,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048329444] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:50:17,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:50:17,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:50:17,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717534234] [2024-06-04 17:50:17,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:50:17,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:50:17,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:50:17,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:50:17,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:50:17,232 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:50:17,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 199 transitions, 2349 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:50:17,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:50:17,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:50:17,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:50:17,628 INFO L124 PetriNetUnfolderBase]: 535/944 cut-off events. [2024-06-04 17:50:17,628 INFO L125 PetriNetUnfolderBase]: For 78841/78847 co-relation queries the response was YES. [2024-06-04 17:50:17,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6633 conditions, 944 events. 535/944 cut-off events. For 78841/78847 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 4467 event pairs, 89 based on Foata normal form. 2/941 useless extension candidates. Maximal degree in co-relation 6519. Up to 413 conditions per place. [2024-06-04 17:50:17,636 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 121 selfloop transitions, 94 changer transitions 0/217 dead transitions. [2024-06-04 17:50:17,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 217 transitions, 3143 flow [2024-06-04 17:50:17,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:50:17,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:50:17,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2024-06-04 17:50:17,639 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.390625 [2024-06-04 17:50:17,639 INFO L175 Difference]: Start difference. First operand has 234 places, 199 transitions, 2349 flow. Second operand 10 states and 125 transitions. [2024-06-04 17:50:17,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 217 transitions, 3143 flow [2024-06-04 17:50:17,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 217 transitions, 2938 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-06-04 17:50:17,810 INFO L231 Difference]: Finished difference. Result has 236 places, 199 transitions, 2337 flow [2024-06-04 17:50:17,810 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2144, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2337, PETRI_PLACES=236, PETRI_TRANSITIONS=199} [2024-06-04 17:50:17,810 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 205 predicate places. [2024-06-04 17:50:17,810 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 199 transitions, 2337 flow [2024-06-04 17:50:17,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:50:17,810 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:50:17,811 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:50:17,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-04 17:50:17,811 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:50:17,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:50:17,811 INFO L85 PathProgramCache]: Analyzing trace with hash 2136739281, now seen corresponding path program 10 times [2024-06-04 17:50:17,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:50:17,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393268612] [2024-06-04 17:50:17,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:50:17,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:50:17,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:50:23,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:50:23,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:50:23,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393268612] [2024-06-04 17:50:23,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393268612] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:50:23,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:50:23,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:50:23,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976886092] [2024-06-04 17:50:23,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:50:23,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:50:23,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:50:23,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:50:23,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:50:23,421 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:50:23,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 199 transitions, 2337 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:50:23,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:50:23,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:50:23,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:50:23,797 INFO L124 PetriNetUnfolderBase]: 532/939 cut-off events. [2024-06-04 17:50:23,797 INFO L125 PetriNetUnfolderBase]: For 74393/74399 co-relation queries the response was YES. [2024-06-04 17:50:23,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6447 conditions, 939 events. 532/939 cut-off events. For 74393/74399 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 4411 event pairs, 72 based on Foata normal form. 2/936 useless extension candidates. Maximal degree in co-relation 6332. Up to 740 conditions per place. [2024-06-04 17:50:23,806 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 162 selfloop transitions, 48 changer transitions 0/212 dead transitions. [2024-06-04 17:50:23,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 212 transitions, 2791 flow [2024-06-04 17:50:23,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:50:23,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:50:23,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions. [2024-06-04 17:50:23,808 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34375 [2024-06-04 17:50:23,808 INFO L175 Difference]: Start difference. First operand has 236 places, 199 transitions, 2337 flow. Second operand 9 states and 99 transitions. [2024-06-04 17:50:23,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 212 transitions, 2791 flow [2024-06-04 17:50:23,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 212 transitions, 2517 flow, removed 2 selfloop flow, removed 12 redundant places. [2024-06-04 17:50:23,977 INFO L231 Difference]: Finished difference. Result has 233 places, 199 transitions, 2163 flow [2024-06-04 17:50:23,977 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2063, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2163, PETRI_PLACES=233, PETRI_TRANSITIONS=199} [2024-06-04 17:50:23,977 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 202 predicate places. [2024-06-04 17:50:23,978 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 199 transitions, 2163 flow [2024-06-04 17:50:23,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:50:23,978 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:50:23,978 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-04 17:50:23,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-04 17:50:23,978 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:50:23,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:50:23,978 INFO L85 PathProgramCache]: Analyzing trace with hash -389618506, now seen corresponding path program 1 times [2024-06-04 17:50:23,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:50:23,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383018051] [2024-06-04 17:50:23,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:50:23,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:50:24,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:50:30,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:50:30,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:50:30,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383018051] [2024-06-04 17:50:30,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383018051] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:50:30,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:50:30,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:50:30,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961210537] [2024-06-04 17:50:30,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:50:30,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:50:30,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:50:30,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:50:30,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:50:30,455 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:50:30,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 199 transitions, 2163 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-04 17:50:30,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:50:30,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:50:30,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:50:30,917 INFO L124 PetriNetUnfolderBase]: 536/946 cut-off events. [2024-06-04 17:50:30,918 INFO L125 PetriNetUnfolderBase]: For 75351/75351 co-relation queries the response was YES. [2024-06-04 17:50:30,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6300 conditions, 946 events. 536/946 cut-off events. For 75351/75351 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 4475 event pairs, 69 based on Foata normal form. 2/947 useless extension candidates. Maximal degree in co-relation 6185. Up to 840 conditions per place. [2024-06-04 17:50:30,925 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 196 selfloop transitions, 21 changer transitions 0/219 dead transitions. [2024-06-04 17:50:30,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 219 transitions, 2657 flow [2024-06-04 17:50:30,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:50:30,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:50:30,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 102 transitions. [2024-06-04 17:50:30,926 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31875 [2024-06-04 17:50:30,926 INFO L175 Difference]: Start difference. First operand has 233 places, 199 transitions, 2163 flow. Second operand 10 states and 102 transitions. [2024-06-04 17:50:30,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 219 transitions, 2657 flow [2024-06-04 17:50:31,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 219 transitions, 2492 flow, removed 13 selfloop flow, removed 9 redundant places. [2024-06-04 17:50:31,073 INFO L231 Difference]: Finished difference. Result has 234 places, 200 transitions, 2056 flow [2024-06-04 17:50:31,073 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1998, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2056, PETRI_PLACES=234, PETRI_TRANSITIONS=200} [2024-06-04 17:50:31,073 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 203 predicate places. [2024-06-04 17:50:31,073 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 200 transitions, 2056 flow [2024-06-04 17:50:31,074 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-04 17:50:31,074 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:50:31,074 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-04 17:50:31,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-04 17:50:31,074 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:50:31,074 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:50:31,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1123606146, now seen corresponding path program 1 times [2024-06-04 17:50:31,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:50:31,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626950890] [2024-06-04 17:50:31,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:50:31,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:50:31,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:50:36,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:50:36,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:50:36,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626950890] [2024-06-04 17:50:36,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626950890] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:50:36,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:50:36,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:50:36,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585789487] [2024-06-04 17:50:36,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:50:36,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:50:36,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:50:36,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:50:36,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:50:36,658 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:50:36,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 200 transitions, 2056 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-04 17:50:36,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:50:36,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:50:36,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:50:37,102 INFO L124 PetriNetUnfolderBase]: 534/943 cut-off events. [2024-06-04 17:50:37,102 INFO L125 PetriNetUnfolderBase]: For 69924/69924 co-relation queries the response was YES. [2024-06-04 17:50:37,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6044 conditions, 943 events. 534/943 cut-off events. For 69924/69924 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 4471 event pairs, 82 based on Foata normal form. 1/943 useless extension candidates. Maximal degree in co-relation 5929. Up to 824 conditions per place. [2024-06-04 17:50:37,110 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 180 selfloop transitions, 37 changer transitions 0/219 dead transitions. [2024-06-04 17:50:37,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 219 transitions, 2548 flow [2024-06-04 17:50:37,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:50:37,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:50:37,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 107 transitions. [2024-06-04 17:50:37,112 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.334375 [2024-06-04 17:50:37,112 INFO L175 Difference]: Start difference. First operand has 234 places, 200 transitions, 2056 flow. Second operand 10 states and 107 transitions. [2024-06-04 17:50:37,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 219 transitions, 2548 flow [2024-06-04 17:50:37,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 219 transitions, 2444 flow, removed 12 selfloop flow, removed 10 redundant places. [2024-06-04 17:50:37,273 INFO L231 Difference]: Finished difference. Result has 234 places, 200 transitions, 2034 flow [2024-06-04 17:50:37,273 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1952, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2034, PETRI_PLACES=234, PETRI_TRANSITIONS=200} [2024-06-04 17:50:37,273 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 203 predicate places. [2024-06-04 17:50:37,273 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 200 transitions, 2034 flow [2024-06-04 17:50:37,274 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-04 17:50:37,274 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:50:37,274 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-04 17:50:37,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-04 17:50:37,274 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:50:37,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:50:37,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1955788058, now seen corresponding path program 2 times [2024-06-04 17:50:37,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:50:37,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436418610] [2024-06-04 17:50:37,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:50:37,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:50:37,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:50:43,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:50:43,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:50:43,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436418610] [2024-06-04 17:50:43,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436418610] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:50:43,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:50:43,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:50:43,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825366934] [2024-06-04 17:50:43,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:50:43,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:50:43,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:50:43,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:50:43,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:50:43,466 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:50:43,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 200 transitions, 2034 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-04 17:50:43,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:50:43,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:50:43,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:50:43,974 INFO L124 PetriNetUnfolderBase]: 545/964 cut-off events. [2024-06-04 17:50:43,975 INFO L125 PetriNetUnfolderBase]: For 82026/82026 co-relation queries the response was YES. [2024-06-04 17:50:43,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6230 conditions, 964 events. 545/964 cut-off events. For 82026/82026 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 4618 event pairs, 85 based on Foata normal form. 2/965 useless extension candidates. Maximal degree in co-relation 6116. Up to 805 conditions per place. [2024-06-04 17:50:43,986 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 189 selfloop transitions, 31 changer transitions 0/222 dead transitions. [2024-06-04 17:50:43,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 222 transitions, 2716 flow [2024-06-04 17:50:43,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:50:43,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:50:43,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 109 transitions. [2024-06-04 17:50:43,989 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.340625 [2024-06-04 17:50:43,989 INFO L175 Difference]: Start difference. First operand has 234 places, 200 transitions, 2034 flow. Second operand 10 states and 109 transitions. [2024-06-04 17:50:43,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 222 transitions, 2716 flow [2024-06-04 17:50:44,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 222 transitions, 2636 flow, removed 6 selfloop flow, removed 8 redundant places. [2024-06-04 17:50:44,244 INFO L231 Difference]: Finished difference. Result has 236 places, 202 transitions, 2046 flow [2024-06-04 17:50:44,244 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1954, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2046, PETRI_PLACES=236, PETRI_TRANSITIONS=202} [2024-06-04 17:50:44,245 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 205 predicate places. [2024-06-04 17:50:44,245 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 202 transitions, 2046 flow [2024-06-04 17:50:44,246 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-04 17:50:44,246 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:50:44,246 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-04 17:50:44,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-04 17:50:44,248 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:50:44,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:50:44,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1955903378, now seen corresponding path program 3 times [2024-06-04 17:50:44,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:50:44,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672674255] [2024-06-04 17:50:44,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:50:44,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:50:44,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:50:49,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:50:49,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:50:49,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672674255] [2024-06-04 17:50:49,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672674255] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:50:49,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:50:49,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:50:49,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056376959] [2024-06-04 17:50:49,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:50:49,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:50:49,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:50:49,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:50:49,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:50:50,058 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:50:50,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 202 transitions, 2046 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-04 17:50:50,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:50:50,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:50:50,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:50:50,543 INFO L124 PetriNetUnfolderBase]: 549/972 cut-off events. [2024-06-04 17:50:50,543 INFO L125 PetriNetUnfolderBase]: For 84242/84242 co-relation queries the response was YES. [2024-06-04 17:50:50,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6287 conditions, 972 events. 549/972 cut-off events. For 84242/84242 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 4673 event pairs, 83 based on Foata normal form. 2/973 useless extension candidates. Maximal degree in co-relation 6172. Up to 837 conditions per place. [2024-06-04 17:50:50,551 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 187 selfloop transitions, 34 changer transitions 0/223 dead transitions. [2024-06-04 17:50:50,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 223 transitions, 2724 flow [2024-06-04 17:50:50,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:50:50,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:50:50,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 108 transitions. [2024-06-04 17:50:50,553 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3375 [2024-06-04 17:50:50,553 INFO L175 Difference]: Start difference. First operand has 236 places, 202 transitions, 2046 flow. Second operand 10 states and 108 transitions. [2024-06-04 17:50:50,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 223 transitions, 2724 flow [2024-06-04 17:50:50,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 223 transitions, 2667 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-06-04 17:50:50,744 INFO L231 Difference]: Finished difference. Result has 240 places, 203 transitions, 2075 flow [2024-06-04 17:50:50,744 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1993, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2075, PETRI_PLACES=240, PETRI_TRANSITIONS=203} [2024-06-04 17:50:50,745 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 209 predicate places. [2024-06-04 17:50:50,745 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 203 transitions, 2075 flow [2024-06-04 17:50:50,745 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-04 17:50:50,745 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:50:50,745 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-04 17:50:50,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-04 17:50:50,745 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:50:50,746 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:50:50,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1955908028, now seen corresponding path program 4 times [2024-06-04 17:50:50,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:50:50,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633538504] [2024-06-04 17:50:50,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:50:50,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:50:50,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:50:57,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:50:57,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:50:57,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633538504] [2024-06-04 17:50:57,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633538504] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:50:57,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:50:57,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:50:57,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372607696] [2024-06-04 17:50:57,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:50:57,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:50:57,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:50:57,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:50:57,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:50:57,842 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:50:57,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 203 transitions, 2075 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-04 17:50:57,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:50:57,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:50:57,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:50:58,311 INFO L124 PetriNetUnfolderBase]: 546/967 cut-off events. [2024-06-04 17:50:58,311 INFO L125 PetriNetUnfolderBase]: For 79158/79158 co-relation queries the response was YES. [2024-06-04 17:50:58,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6148 conditions, 967 events. 546/967 cut-off events. For 79158/79158 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 4661 event pairs, 84 based on Foata normal form. 2/968 useless extension candidates. Maximal degree in co-relation 6031. Up to 851 conditions per place. [2024-06-04 17:50:58,320 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 186 selfloop transitions, 34 changer transitions 0/222 dead transitions. [2024-06-04 17:50:58,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 222 transitions, 2571 flow [2024-06-04 17:50:58,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:50:58,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:50:58,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 106 transitions. [2024-06-04 17:50:58,321 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33125 [2024-06-04 17:50:58,321 INFO L175 Difference]: Start difference. First operand has 240 places, 203 transitions, 2075 flow. Second operand 10 states and 106 transitions. [2024-06-04 17:50:58,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 222 transitions, 2571 flow [2024-06-04 17:50:58,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 222 transitions, 2488 flow, removed 6 selfloop flow, removed 8 redundant places. [2024-06-04 17:50:58,512 INFO L231 Difference]: Finished difference. Result has 242 places, 203 transitions, 2065 flow [2024-06-04 17:50:58,512 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1992, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2065, PETRI_PLACES=242, PETRI_TRANSITIONS=203} [2024-06-04 17:50:58,512 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 211 predicate places. [2024-06-04 17:50:58,512 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 203 transitions, 2065 flow [2024-06-04 17:50:58,512 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-04 17:50:58,513 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:50:58,513 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-04 17:50:58,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-06-04 17:50:58,513 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:50:58,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:50:58,513 INFO L85 PathProgramCache]: Analyzing trace with hash 353035416, now seen corresponding path program 1 times [2024-06-04 17:50:58,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:50:58,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596358724] [2024-06-04 17:50:58,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:50:58,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:50:58,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:51:04,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:51:04,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:51:04,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596358724] [2024-06-04 17:51:04,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596358724] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:51:04,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:51:04,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:51:04,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111239266] [2024-06-04 17:51:04,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:51:04,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:51:04,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:51:04,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:51:04,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:51:04,424 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:51:04,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 203 transitions, 2065 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-04 17:51:04,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:51:04,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:51:04,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:51:04,914 INFO L124 PetriNetUnfolderBase]: 552/977 cut-off events. [2024-06-04 17:51:04,914 INFO L125 PetriNetUnfolderBase]: For 80995/80995 co-relation queries the response was YES. [2024-06-04 17:51:04,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6199 conditions, 977 events. 552/977 cut-off events. For 80995/80995 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 4716 event pairs, 82 based on Foata normal form. 2/978 useless extension candidates. Maximal degree in co-relation 6081. Up to 869 conditions per place. [2024-06-04 17:51:04,923 INFO L140 encePairwiseOnDemand]: 19/32 looper letters, 194 selfloop transitions, 30 changer transitions 0/226 dead transitions. [2024-06-04 17:51:04,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 226 transitions, 2611 flow [2024-06-04 17:51:04,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:51:04,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:51:04,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 116 transitions. [2024-06-04 17:51:04,924 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32954545454545453 [2024-06-04 17:51:04,924 INFO L175 Difference]: Start difference. First operand has 242 places, 203 transitions, 2065 flow. Second operand 11 states and 116 transitions. [2024-06-04 17:51:04,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 226 transitions, 2611 flow [2024-06-04 17:51:05,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 226 transitions, 2540 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-04 17:51:05,110 INFO L231 Difference]: Finished difference. Result has 244 places, 205 transitions, 2097 flow [2024-06-04 17:51:05,111 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1994, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2097, PETRI_PLACES=244, PETRI_TRANSITIONS=205} [2024-06-04 17:51:05,111 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 213 predicate places. [2024-06-04 17:51:05,111 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 205 transitions, 2097 flow [2024-06-04 17:51:05,111 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-04 17:51:05,111 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:51:05,112 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-04 17:51:05,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-06-04 17:51:05,112 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:51:05,112 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:51:05,112 INFO L85 PathProgramCache]: Analyzing trace with hash 985245378, now seen corresponding path program 5 times [2024-06-04 17:51:05,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:51:05,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924238067] [2024-06-04 17:51:05,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:51:05,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:51:05,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:51:10,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:51:10,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:51:10,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924238067] [2024-06-04 17:51:10,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924238067] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:51:10,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:51:10,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:51:10,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709218703] [2024-06-04 17:51:10,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:51:10,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:51:10,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:51:10,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:51:10,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:51:10,682 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:51:10,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 205 transitions, 2097 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-04 17:51:10,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:51:10,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:51:10,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:51:11,128 INFO L124 PetriNetUnfolderBase]: 556/985 cut-off events. [2024-06-04 17:51:11,128 INFO L125 PetriNetUnfolderBase]: For 83001/83001 co-relation queries the response was YES. [2024-06-04 17:51:11,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6274 conditions, 985 events. 556/985 cut-off events. For 83001/83001 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 4789 event pairs, 77 based on Foata normal form. 2/986 useless extension candidates. Maximal degree in co-relation 6155. Up to 818 conditions per place. [2024-06-04 17:51:11,137 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 176 selfloop transitions, 45 changer transitions 0/223 dead transitions. [2024-06-04 17:51:11,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 223 transitions, 2601 flow [2024-06-04 17:51:11,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:51:11,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:51:11,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 109 transitions. [2024-06-04 17:51:11,138 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.340625 [2024-06-04 17:51:11,138 INFO L175 Difference]: Start difference. First operand has 244 places, 205 transitions, 2097 flow. Second operand 10 states and 109 transitions. [2024-06-04 17:51:11,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 223 transitions, 2601 flow [2024-06-04 17:51:11,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 223 transitions, 2526 flow, removed 9 selfloop flow, removed 9 redundant places. [2024-06-04 17:51:11,318 INFO L231 Difference]: Finished difference. Result has 245 places, 206 transitions, 2132 flow [2024-06-04 17:51:11,318 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2022, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2132, PETRI_PLACES=245, PETRI_TRANSITIONS=206} [2024-06-04 17:51:11,318 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 214 predicate places. [2024-06-04 17:51:11,318 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 206 transitions, 2132 flow [2024-06-04 17:51:11,319 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-04 17:51:11,319 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:51:11,319 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-04 17:51:11,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-06-04 17:51:11,319 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:51:11,319 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:51:11,319 INFO L85 PathProgramCache]: Analyzing trace with hash -355066130, now seen corresponding path program 2 times [2024-06-04 17:51:11,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:51:11,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454967482] [2024-06-04 17:51:11,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:51:11,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:51:11,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:51:16,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:51:16,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:51:16,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454967482] [2024-06-04 17:51:16,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454967482] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:51:16,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:51:16,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:51:16,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12166382] [2024-06-04 17:51:16,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:51:16,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:51:16,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:51:17,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:51:17,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:51:17,130 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:51:17,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 206 transitions, 2132 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-04 17:51:17,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:51:17,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:51:17,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:51:17,563 INFO L124 PetriNetUnfolderBase]: 562/995 cut-off events. [2024-06-04 17:51:17,564 INFO L125 PetriNetUnfolderBase]: For 85211/85211 co-relation queries the response was YES. [2024-06-04 17:51:17,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6372 conditions, 995 events. 562/995 cut-off events. For 85211/85211 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 4829 event pairs, 77 based on Foata normal form. 2/996 useless extension candidates. Maximal degree in co-relation 6252. Up to 782 conditions per place. [2024-06-04 17:51:17,573 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 170 selfloop transitions, 55 changer transitions 0/227 dead transitions. [2024-06-04 17:51:17,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 227 transitions, 2676 flow [2024-06-04 17:51:17,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:51:17,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:51:17,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 121 transitions. [2024-06-04 17:51:17,574 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34375 [2024-06-04 17:51:17,574 INFO L175 Difference]: Start difference. First operand has 245 places, 206 transitions, 2132 flow. Second operand 11 states and 121 transitions. [2024-06-04 17:51:17,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 227 transitions, 2676 flow [2024-06-04 17:51:17,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 227 transitions, 2576 flow, removed 6 selfloop flow, removed 8 redundant places. [2024-06-04 17:51:17,785 INFO L231 Difference]: Finished difference. Result has 248 places, 208 transitions, 2189 flow [2024-06-04 17:51:17,786 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2032, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2189, PETRI_PLACES=248, PETRI_TRANSITIONS=208} [2024-06-04 17:51:17,786 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 217 predicate places. [2024-06-04 17:51:17,786 INFO L495 AbstractCegarLoop]: Abstraction has has 248 places, 208 transitions, 2189 flow [2024-06-04 17:51:17,786 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-04 17:51:17,786 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:51:17,786 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-04 17:51:17,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-06-04 17:51:17,786 INFO L420 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:51:17,787 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:51:17,787 INFO L85 PathProgramCache]: Analyzing trace with hash -348816964, now seen corresponding path program 6 times [2024-06-04 17:51:17,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:51:17,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411356498] [2024-06-04 17:51:17,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:51:17,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:51:17,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:51:22,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:51:22,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:51:22,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411356498] [2024-06-04 17:51:22,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411356498] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:51:22,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:51:22,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:51:22,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814677311] [2024-06-04 17:51:22,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:51:22,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:51:22,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:51:22,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:51:22,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:51:22,672 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:51:22,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 208 transitions, 2189 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-04 17:51:22,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:51:22,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:51:22,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:51:23,091 INFO L124 PetriNetUnfolderBase]: 566/1003 cut-off events. [2024-06-04 17:51:23,091 INFO L125 PetriNetUnfolderBase]: For 87299/87299 co-relation queries the response was YES. [2024-06-04 17:51:23,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6454 conditions, 1003 events. 566/1003 cut-off events. For 87299/87299 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 4912 event pairs, 79 based on Foata normal form. 2/1004 useless extension candidates. Maximal degree in co-relation 6333. Up to 836 conditions per place. [2024-06-04 17:51:23,101 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 176 selfloop transitions, 48 changer transitions 0/226 dead transitions. [2024-06-04 17:51:23,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 226 transitions, 2701 flow [2024-06-04 17:51:23,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:51:23,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:51:23,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 108 transitions. [2024-06-04 17:51:23,103 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3375 [2024-06-04 17:51:23,103 INFO L175 Difference]: Start difference. First operand has 248 places, 208 transitions, 2189 flow. Second operand 10 states and 108 transitions. [2024-06-04 17:51:23,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 226 transitions, 2701 flow [2024-06-04 17:51:23,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 226 transitions, 2492 flow, removed 11 selfloop flow, removed 10 redundant places. [2024-06-04 17:51:23,293 INFO L231 Difference]: Finished difference. Result has 248 places, 209 transitions, 2098 flow [2024-06-04 17:51:23,293 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1980, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2098, PETRI_PLACES=248, PETRI_TRANSITIONS=209} [2024-06-04 17:51:23,293 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 217 predicate places. [2024-06-04 17:51:23,294 INFO L495 AbstractCegarLoop]: Abstraction has has 248 places, 209 transitions, 2098 flow [2024-06-04 17:51:23,294 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-04 17:51:23,294 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:51:23,294 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-04 17:51:23,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-06-04 17:51:23,294 INFO L420 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:51:23,294 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:51:23,294 INFO L85 PathProgramCache]: Analyzing trace with hash -355250704, now seen corresponding path program 7 times [2024-06-04 17:51:23,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:51:23,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554520953] [2024-06-04 17:51:23,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:51:23,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:51:23,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:51:28,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:51:28,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:51:28,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554520953] [2024-06-04 17:51:28,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554520953] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:51:28,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:51:28,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:51:28,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593809380] [2024-06-04 17:51:28,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:51:28,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:51:28,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:51:28,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:51:28,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:51:29,061 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:51:29,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 209 transitions, 2098 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-04 17:51:29,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:51:29,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:51:29,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:51:29,460 INFO L124 PetriNetUnfolderBase]: 570/1011 cut-off events. [2024-06-04 17:51:29,460 INFO L125 PetriNetUnfolderBase]: For 88593/88593 co-relation queries the response was YES. [2024-06-04 17:51:29,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6457 conditions, 1011 events. 570/1011 cut-off events. For 88593/88593 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 4964 event pairs, 79 based on Foata normal form. 2/1012 useless extension candidates. Maximal degree in co-relation 6335. Up to 824 conditions per place. [2024-06-04 17:51:29,470 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 178 selfloop transitions, 47 changer transitions 0/227 dead transitions. [2024-06-04 17:51:29,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 227 transitions, 2612 flow [2024-06-04 17:51:29,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:51:29,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:51:29,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 109 transitions. [2024-06-04 17:51:29,471 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.340625 [2024-06-04 17:51:29,472 INFO L175 Difference]: Start difference. First operand has 248 places, 209 transitions, 2098 flow. Second operand 10 states and 109 transitions. [2024-06-04 17:51:29,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 227 transitions, 2612 flow [2024-06-04 17:51:29,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 227 transitions, 2504 flow, removed 7 selfloop flow, removed 8 redundant places. [2024-06-04 17:51:29,688 INFO L231 Difference]: Finished difference. Result has 250 places, 210 transitions, 2108 flow [2024-06-04 17:51:29,689 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1990, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2108, PETRI_PLACES=250, PETRI_TRANSITIONS=210} [2024-06-04 17:51:29,689 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 219 predicate places. [2024-06-04 17:51:29,689 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 210 transitions, 2108 flow [2024-06-04 17:51:29,689 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-04 17:51:29,689 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:51:29,689 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-04 17:51:29,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-06-04 17:51:29,689 INFO L420 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:51:29,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:51:29,690 INFO L85 PathProgramCache]: Analyzing trace with hash -348579380, now seen corresponding path program 3 times [2024-06-04 17:51:29,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:51:29,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152613822] [2024-06-04 17:51:29,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:51:29,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:51:29,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:51:35,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:51:35,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:51:35,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152613822] [2024-06-04 17:51:35,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152613822] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:51:35,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:51:35,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:51:35,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883105774] [2024-06-04 17:51:35,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:51:35,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:51:35,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:51:35,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:51:35,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:51:35,319 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:51:35,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 210 transitions, 2108 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:51:35,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:51:35,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:51:35,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:51:35,688 INFO L124 PetriNetUnfolderBase]: 566/1005 cut-off events. [2024-06-04 17:51:35,688 INFO L125 PetriNetUnfolderBase]: For 82449/82449 co-relation queries the response was YES. [2024-06-04 17:51:35,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6244 conditions, 1005 events. 566/1005 cut-off events. For 82449/82449 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 4940 event pairs, 76 based on Foata normal form. 2/1006 useless extension candidates. Maximal degree in co-relation 6121. Up to 763 conditions per place. [2024-06-04 17:51:35,698 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 158 selfloop transitions, 67 changer transitions 0/227 dead transitions. [2024-06-04 17:51:35,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 227 transitions, 2608 flow [2024-06-04 17:51:35,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:51:35,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:51:35,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 111 transitions. [2024-06-04 17:51:35,698 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.346875 [2024-06-04 17:51:35,699 INFO L175 Difference]: Start difference. First operand has 250 places, 210 transitions, 2108 flow. Second operand 10 states and 111 transitions. [2024-06-04 17:51:35,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 227 transitions, 2608 flow [2024-06-04 17:51:35,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 227 transitions, 2488 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-06-04 17:51:35,889 INFO L231 Difference]: Finished difference. Result has 252 places, 210 transitions, 2139 flow [2024-06-04 17:51:35,890 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1988, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2139, PETRI_PLACES=252, PETRI_TRANSITIONS=210} [2024-06-04 17:51:35,890 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 221 predicate places. [2024-06-04 17:51:35,890 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 210 transitions, 2139 flow [2024-06-04 17:51:35,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:51:35,890 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:51:35,890 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-04 17:51:35,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-06-04 17:51:35,890 INFO L420 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:51:35,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:51:35,891 INFO L85 PathProgramCache]: Analyzing trace with hash 991920732, now seen corresponding path program 1 times [2024-06-04 17:51:35,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:51:35,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985794915] [2024-06-04 17:51:35,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:51:35,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:51:35,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:51:41,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:51:41,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:51:41,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985794915] [2024-06-04 17:51:41,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985794915] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:51:41,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:51:41,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:51:41,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101141159] [2024-06-04 17:51:41,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:51:41,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:51:41,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:51:41,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:51:41,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:51:41,618 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:51:41,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 210 transitions, 2139 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-04 17:51:41,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:51:41,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:51:41,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:51:42,071 INFO L124 PetriNetUnfolderBase]: 586/1049 cut-off events. [2024-06-04 17:51:42,071 INFO L125 PetriNetUnfolderBase]: For 124341/124341 co-relation queries the response was YES. [2024-06-04 17:51:42,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6473 conditions, 1049 events. 586/1049 cut-off events. For 124341/124341 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 5225 event pairs, 84 based on Foata normal form. 12/1060 useless extension candidates. Maximal degree in co-relation 6349. Up to 747 conditions per place. [2024-06-04 17:51:42,081 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 159 selfloop transitions, 56 changer transitions 17/234 dead transitions. [2024-06-04 17:51:42,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 234 transitions, 2711 flow [2024-06-04 17:51:42,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:51:42,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:51:42,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 123 transitions. [2024-06-04 17:51:42,082 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3494318181818182 [2024-06-04 17:51:42,082 INFO L175 Difference]: Start difference. First operand has 252 places, 210 transitions, 2139 flow. Second operand 11 states and 123 transitions. [2024-06-04 17:51:42,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 234 transitions, 2711 flow [2024-06-04 17:51:42,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 234 transitions, 2439 flow, removed 5 selfloop flow, removed 12 redundant places. [2024-06-04 17:51:42,298 INFO L231 Difference]: Finished difference. Result has 251 places, 199 transitions, 1890 flow [2024-06-04 17:51:42,299 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1867, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1890, PETRI_PLACES=251, PETRI_TRANSITIONS=199} [2024-06-04 17:51:42,299 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 220 predicate places. [2024-06-04 17:51:42,299 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 199 transitions, 1890 flow [2024-06-04 17:51:42,299 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-04 17:51:42,299 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:51:42,300 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-04 17:51:42,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-06-04 17:51:42,300 INFO L420 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:51:42,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:51:42,300 INFO L85 PathProgramCache]: Analyzing trace with hash -525948484, now seen corresponding path program 8 times [2024-06-04 17:51:42,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:51:42,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292713471] [2024-06-04 17:51:42,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:51:42,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:51:42,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:51:48,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:51:48,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:51:48,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292713471] [2024-06-04 17:51:48,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292713471] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:51:48,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:51:48,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:51:48,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138030728] [2024-06-04 17:51:48,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:51:48,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:51:48,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:51:48,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:51:48,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:51:48,320 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:51:48,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 199 transitions, 1890 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:51:48,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:51:48,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:51:48,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:51:48,704 INFO L124 PetriNetUnfolderBase]: 534/969 cut-off events. [2024-06-04 17:51:48,704 INFO L125 PetriNetUnfolderBase]: For 80704/80704 co-relation queries the response was YES. [2024-06-04 17:51:48,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5960 conditions, 969 events. 534/969 cut-off events. For 80704/80704 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 4841 event pairs, 90 based on Foata normal form. 2/970 useless extension candidates. Maximal degree in co-relation 5848. Up to 802 conditions per place. [2024-06-04 17:51:48,713 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 174 selfloop transitions, 41 changer transitions 0/217 dead transitions. [2024-06-04 17:51:48,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 217 transitions, 2388 flow [2024-06-04 17:51:48,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:51:48,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:51:48,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 110 transitions. [2024-06-04 17:51:48,714 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34375 [2024-06-04 17:51:48,714 INFO L175 Difference]: Start difference. First operand has 251 places, 199 transitions, 1890 flow. Second operand 10 states and 110 transitions. [2024-06-04 17:51:48,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 217 transitions, 2388 flow [2024-06-04 17:51:48,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 217 transitions, 2250 flow, removed 11 selfloop flow, removed 11 redundant places. [2024-06-04 17:51:48,966 INFO L231 Difference]: Finished difference. Result has 248 places, 200 transitions, 1860 flow [2024-06-04 17:51:48,966 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1752, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1860, PETRI_PLACES=248, PETRI_TRANSITIONS=200} [2024-06-04 17:51:48,966 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 217 predicate places. [2024-06-04 17:51:48,966 INFO L495 AbstractCegarLoop]: Abstraction has has 248 places, 200 transitions, 1860 flow [2024-06-04 17:51:48,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:51:48,966 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:51:48,966 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-04 17:51:48,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-06-04 17:51:48,967 INFO L420 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:51:48,968 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:51:48,968 INFO L85 PathProgramCache]: Analyzing trace with hash -525953134, now seen corresponding path program 9 times [2024-06-04 17:51:48,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:51:48,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54563851] [2024-06-04 17:51:48,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:51:48,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:51:49,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:51:55,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:51:55,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:51:55,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54563851] [2024-06-04 17:51:55,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54563851] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:51:55,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:51:55,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:51:55,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903086617] [2024-06-04 17:51:55,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:51:55,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:51:55,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:51:55,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:51:55,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:51:55,311 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:51:55,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 200 transitions, 1860 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-04 17:51:55,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:51:55,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:51:55,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:51:55,936 INFO L124 PetriNetUnfolderBase]: 538/977 cut-off events. [2024-06-04 17:51:55,937 INFO L125 PetriNetUnfolderBase]: For 82340/82340 co-relation queries the response was YES. [2024-06-04 17:51:55,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5958 conditions, 977 events. 538/977 cut-off events. For 82340/82340 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 4911 event pairs, 90 based on Foata normal form. 2/978 useless extension candidates. Maximal degree in co-relation 5846. Up to 796 conditions per place. [2024-06-04 17:51:55,949 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 174 selfloop transitions, 42 changer transitions 0/218 dead transitions. [2024-06-04 17:51:55,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 218 transitions, 2360 flow [2024-06-04 17:51:55,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:51:55,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:51:55,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 111 transitions. [2024-06-04 17:51:55,950 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.346875 [2024-06-04 17:51:55,950 INFO L175 Difference]: Start difference. First operand has 248 places, 200 transitions, 1860 flow. Second operand 10 states and 111 transitions. [2024-06-04 17:51:55,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 218 transitions, 2360 flow [2024-06-04 17:51:56,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 218 transitions, 2262 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-06-04 17:51:56,176 INFO L231 Difference]: Finished difference. Result has 250 places, 201 transitions, 1874 flow [2024-06-04 17:51:56,176 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1762, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1874, PETRI_PLACES=250, PETRI_TRANSITIONS=201} [2024-06-04 17:51:56,176 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 219 predicate places. [2024-06-04 17:51:56,176 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 201 transitions, 1874 flow [2024-06-04 17:51:56,177 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-04 17:51:56,177 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:51:56,177 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-04 17:51:56,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2024-06-04 17:51:56,177 INFO L420 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:51:56,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:51:56,177 INFO L85 PathProgramCache]: Analyzing trace with hash -526068454, now seen corresponding path program 10 times [2024-06-04 17:51:56,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:51:56,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049647124] [2024-06-04 17:51:56,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:51:56,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:51:56,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:52:03,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:52:03,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:52:03,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049647124] [2024-06-04 17:52:03,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049647124] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:52:03,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:52:03,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:52:03,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332316526] [2024-06-04 17:52:03,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:52:03,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:52:03,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:52:03,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:52:03,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:52:03,694 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:52:03,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 201 transitions, 1874 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-04 17:52:03,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:52:03,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:52:03,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:52:04,127 INFO L124 PetriNetUnfolderBase]: 542/985 cut-off events. [2024-06-04 17:52:04,127 INFO L125 PetriNetUnfolderBase]: For 84348/84348 co-relation queries the response was YES. [2024-06-04 17:52:04,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6017 conditions, 985 events. 542/985 cut-off events. For 84348/84348 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 4977 event pairs, 92 based on Foata normal form. 2/986 useless extension candidates. Maximal degree in co-relation 5904. Up to 756 conditions per place. [2024-06-04 17:52:04,136 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 171 selfloop transitions, 46 changer transitions 0/219 dead transitions. [2024-06-04 17:52:04,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 219 transitions, 2376 flow [2024-06-04 17:52:04,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:52:04,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:52:04,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 110 transitions. [2024-06-04 17:52:04,137 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34375 [2024-06-04 17:52:04,137 INFO L175 Difference]: Start difference. First operand has 250 places, 201 transitions, 1874 flow. Second operand 10 states and 110 transitions. [2024-06-04 17:52:04,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 219 transitions, 2376 flow [2024-06-04 17:52:04,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 219 transitions, 2274 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-06-04 17:52:04,354 INFO L231 Difference]: Finished difference. Result has 252 places, 202 transitions, 1894 flow [2024-06-04 17:52:04,354 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1772, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1894, PETRI_PLACES=252, PETRI_TRANSITIONS=202} [2024-06-04 17:52:04,354 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 221 predicate places. [2024-06-04 17:52:04,354 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 202 transitions, 1894 flow [2024-06-04 17:52:04,354 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-04 17:52:04,354 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:52:04,354 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-04 17:52:04,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2024-06-04 17:52:04,355 INFO L420 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:52:04,355 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:52:04,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1526853930, now seen corresponding path program 4 times [2024-06-04 17:52:04,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:52:04,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605087878] [2024-06-04 17:52:04,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:52:04,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:52:04,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:52:10,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:52:10,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:52:10,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605087878] [2024-06-04 17:52:10,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605087878] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:52:10,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:52:10,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:52:10,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350851574] [2024-06-04 17:52:10,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:52:10,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:52:10,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:52:10,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:52:10,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:52:10,719 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:52:10,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 202 transitions, 1894 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-04 17:52:10,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:52:10,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:52:10,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:52:11,144 INFO L124 PetriNetUnfolderBase]: 538/979 cut-off events. [2024-06-04 17:52:11,145 INFO L125 PetriNetUnfolderBase]: For 77652/77652 co-relation queries the response was YES. [2024-06-04 17:52:11,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5813 conditions, 979 events. 538/979 cut-off events. For 77652/77652 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 4961 event pairs, 104 based on Foata normal form. 2/980 useless extension candidates. Maximal degree in co-relation 5699. Up to 921 conditions per place. [2024-06-04 17:52:11,155 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 189 selfloop transitions, 24 changer transitions 0/215 dead transitions. [2024-06-04 17:52:11,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 215 transitions, 2354 flow [2024-06-04 17:52:11,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:52:11,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:52:11,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 109 transitions. [2024-06-04 17:52:11,156 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3096590909090909 [2024-06-04 17:52:11,156 INFO L175 Difference]: Start difference. First operand has 252 places, 202 transitions, 1894 flow. Second operand 11 states and 109 transitions. [2024-06-04 17:52:11,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 215 transitions, 2354 flow [2024-06-04 17:52:11,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 215 transitions, 2228 flow, removed 18 selfloop flow, removed 8 redundant places. [2024-06-04 17:52:11,371 INFO L231 Difference]: Finished difference. Result has 255 places, 202 transitions, 1821 flow [2024-06-04 17:52:11,371 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1768, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1821, PETRI_PLACES=255, PETRI_TRANSITIONS=202} [2024-06-04 17:52:11,371 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 224 predicate places. [2024-06-04 17:52:11,371 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 202 transitions, 1821 flow [2024-06-04 17:52:11,371 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-04 17:52:11,371 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:52:11,372 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-04 17:52:11,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2024-06-04 17:52:11,372 INFO L420 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:52:11,372 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:52:11,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1526862610, now seen corresponding path program 2 times [2024-06-04 17:52:11,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:52:11,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949731976] [2024-06-04 17:52:11,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:52:11,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:52:11,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:52:17,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:52:17,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:52:17,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949731976] [2024-06-04 17:52:17,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949731976] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:52:17,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:52:17,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:52:17,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164569237] [2024-06-04 17:52:17,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:52:17,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:52:17,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:52:17,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:52:17,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:52:17,533 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:52:17,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 202 transitions, 1821 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-04 17:52:17,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:52:17,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:52:17,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:52:17,993 INFO L124 PetriNetUnfolderBase]: 558/1023 cut-off events. [2024-06-04 17:52:17,993 INFO L125 PetriNetUnfolderBase]: For 121529/121529 co-relation queries the response was YES. [2024-06-04 17:52:18,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5893 conditions, 1023 events. 558/1023 cut-off events. For 121529/121529 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 5210 event pairs, 108 based on Foata normal form. 12/1034 useless extension candidates. Maximal degree in co-relation 5778. Up to 931 conditions per place. [2024-06-04 17:52:18,003 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 194 selfloop transitions, 17 changer transitions 8/221 dead transitions. [2024-06-04 17:52:18,003 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 221 transitions, 2351 flow [2024-06-04 17:52:18,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:52:18,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:52:18,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 112 transitions. [2024-06-04 17:52:18,004 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3181818181818182 [2024-06-04 17:52:18,004 INFO L175 Difference]: Start difference. First operand has 255 places, 202 transitions, 1821 flow. Second operand 11 states and 112 transitions. [2024-06-04 17:52:18,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 221 transitions, 2351 flow [2024-06-04 17:52:18,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 221 transitions, 2285 flow, removed 1 selfloop flow, removed 11 redundant places. [2024-06-04 17:52:18,233 INFO L231 Difference]: Finished difference. Result has 255 places, 200 transitions, 1799 flow [2024-06-04 17:52:18,234 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1755, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1799, PETRI_PLACES=255, PETRI_TRANSITIONS=200} [2024-06-04 17:52:18,234 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 224 predicate places. [2024-06-04 17:52:18,234 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 200 transitions, 1799 flow [2024-06-04 17:52:18,234 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-04 17:52:18,234 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:52:18,234 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-04 17:52:18,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2024-06-04 17:52:18,234 INFO L420 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:52:18,235 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:52:18,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1536981940, now seen corresponding path program 3 times [2024-06-04 17:52:18,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:52:18,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859551213] [2024-06-04 17:52:18,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:52:18,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:52:18,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:52:23,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:52:23,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:52:23,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859551213] [2024-06-04 17:52:23,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859551213] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:52:23,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:52:23,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:52:23,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133093111] [2024-06-04 17:52:23,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:52:23,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:52:23,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:52:23,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:52:23,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:52:24,134 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:52:24,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 200 transitions, 1799 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-04 17:52:24,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:52:24,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:52:24,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:52:24,511 INFO L124 PetriNetUnfolderBase]: 536/981 cut-off events. [2024-06-04 17:52:24,511 INFO L125 PetriNetUnfolderBase]: For 81245/81245 co-relation queries the response was YES. [2024-06-04 17:52:24,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5774 conditions, 981 events. 536/981 cut-off events. For 81245/81245 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 5006 event pairs, 104 based on Foata normal form. 2/982 useless extension candidates. Maximal degree in co-relation 5658. Up to 933 conditions per place. [2024-06-04 17:52:24,521 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 192 selfloop transitions, 21 changer transitions 0/215 dead transitions. [2024-06-04 17:52:24,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 215 transitions, 2287 flow [2024-06-04 17:52:24,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 17:52:24,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 17:52:24,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 115 transitions. [2024-06-04 17:52:24,523 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2994791666666667 [2024-06-04 17:52:24,523 INFO L175 Difference]: Start difference. First operand has 255 places, 200 transitions, 1799 flow. Second operand 12 states and 115 transitions. [2024-06-04 17:52:24,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 215 transitions, 2287 flow [2024-06-04 17:52:24,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 215 transitions, 2229 flow, removed 13 selfloop flow, removed 10 redundant places. [2024-06-04 17:52:24,734 INFO L231 Difference]: Finished difference. Result has 256 places, 201 transitions, 1817 flow [2024-06-04 17:52:24,734 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1741, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1817, PETRI_PLACES=256, PETRI_TRANSITIONS=201} [2024-06-04 17:52:24,734 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 225 predicate places. [2024-06-04 17:52:24,735 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 201 transitions, 1817 flow [2024-06-04 17:52:24,735 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-04 17:52:24,735 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:52:24,735 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-04 17:52:24,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2024-06-04 17:52:24,735 INFO L420 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:52:24,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:52:24,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1320720592, now seen corresponding path program 11 times [2024-06-04 17:52:24,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:52:24,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471132523] [2024-06-04 17:52:24,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:52:24,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:52:24,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:52:30,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:52:30,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:52:30,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471132523] [2024-06-04 17:52:30,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471132523] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:52:30,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:52:30,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:52:30,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981959883] [2024-06-04 17:52:30,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:52:30,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:52:30,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:52:30,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:52:30,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:52:30,490 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:52:30,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 201 transitions, 1817 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-04 17:52:30,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:52:30,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:52:30,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:52:30,943 INFO L124 PetriNetUnfolderBase]: 540/990 cut-off events. [2024-06-04 17:52:30,944 INFO L125 PetriNetUnfolderBase]: For 81369/81375 co-relation queries the response was YES. [2024-06-04 17:52:30,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5811 conditions, 990 events. 540/990 cut-off events. For 81369/81375 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 5057 event pairs, 70 based on Foata normal form. 2/987 useless extension candidates. Maximal degree in co-relation 5695. Up to 727 conditions per place. [2024-06-04 17:52:30,958 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 147 selfloop transitions, 69 changer transitions 0/218 dead transitions. [2024-06-04 17:52:30,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 218 transitions, 2321 flow [2024-06-04 17:52:30,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:52:30,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:52:30,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2024-06-04 17:52:30,959 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35 [2024-06-04 17:52:30,959 INFO L175 Difference]: Start difference. First operand has 256 places, 201 transitions, 1817 flow. Second operand 10 states and 112 transitions. [2024-06-04 17:52:30,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 218 transitions, 2321 flow [2024-06-04 17:52:31,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 218 transitions, 2255 flow, removed 13 selfloop flow, removed 10 redundant places. [2024-06-04 17:52:31,168 INFO L231 Difference]: Finished difference. Result has 256 places, 202 transitions, 1921 flow [2024-06-04 17:52:31,169 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1751, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1921, PETRI_PLACES=256, PETRI_TRANSITIONS=202} [2024-06-04 17:52:31,169 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 225 predicate places. [2024-06-04 17:52:31,169 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 202 transitions, 1921 flow [2024-06-04 17:52:31,169 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-04 17:52:31,169 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:52:31,170 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-04 17:52:31,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2024-06-04 17:52:31,170 INFO L420 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:52:31,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:52:31,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1985232170, now seen corresponding path program 12 times [2024-06-04 17:52:31,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:52:31,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379286982] [2024-06-04 17:52:31,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:52:31,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:52:31,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:52:37,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:52:37,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:52:37,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379286982] [2024-06-04 17:52:37,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379286982] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:52:37,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:52:37,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:52:37,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193148294] [2024-06-04 17:52:37,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:52:37,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:52:37,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:52:37,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:52:37,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:52:37,725 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:52:37,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 202 transitions, 1921 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-04 17:52:37,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:52:37,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:52:37,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:52:38,103 INFO L124 PetriNetUnfolderBase]: 544/998 cut-off events. [2024-06-04 17:52:38,103 INFO L125 PetriNetUnfolderBase]: For 83338/83344 co-relation queries the response was YES. [2024-06-04 17:52:38,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5984 conditions, 998 events. 544/998 cut-off events. For 83338/83344 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 5122 event pairs, 80 based on Foata normal form. 2/995 useless extension candidates. Maximal degree in co-relation 5867. Up to 735 conditions per place. [2024-06-04 17:52:38,116 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 154 selfloop transitions, 63 changer transitions 0/219 dead transitions. [2024-06-04 17:52:38,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 219 transitions, 2429 flow [2024-06-04 17:52:38,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:52:38,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:52:38,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 114 transitions. [2024-06-04 17:52:38,117 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35625 [2024-06-04 17:52:38,117 INFO L175 Difference]: Start difference. First operand has 256 places, 202 transitions, 1921 flow. Second operand 10 states and 114 transitions. [2024-06-04 17:52:38,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 219 transitions, 2429 flow [2024-06-04 17:52:38,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 219 transitions, 2269 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-06-04 17:52:38,325 INFO L231 Difference]: Finished difference. Result has 258 places, 203 transitions, 1921 flow [2024-06-04 17:52:38,325 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1761, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1921, PETRI_PLACES=258, PETRI_TRANSITIONS=203} [2024-06-04 17:52:38,325 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 227 predicate places. [2024-06-04 17:52:38,326 INFO L495 AbstractCegarLoop]: Abstraction has has 258 places, 203 transitions, 1921 flow [2024-06-04 17:52:38,326 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-04 17:52:38,326 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:52:38,326 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-04 17:52:38,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2024-06-04 17:52:38,326 INFO L420 AbstractCegarLoop]: === Iteration 102 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:52:38,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:52:38,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1618737186, now seen corresponding path program 4 times [2024-06-04 17:52:38,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:52:38,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091476309] [2024-06-04 17:52:38,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:52:38,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:52:38,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:52:44,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:52:44,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:52:44,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091476309] [2024-06-04 17:52:44,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091476309] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:52:44,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:52:44,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:52:44,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115138387] [2024-06-04 17:52:44,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:52:44,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:52:44,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:52:44,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:52:44,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:52:44,721 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:52:44,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 203 transitions, 1921 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-04 17:52:44,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:52:44,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:52:44,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:52:45,155 INFO L124 PetriNetUnfolderBase]: 548/1005 cut-off events. [2024-06-04 17:52:45,155 INFO L125 PetriNetUnfolderBase]: For 85097/85097 co-relation queries the response was YES. [2024-06-04 17:52:45,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6018 conditions, 1005 events. 548/1005 cut-off events. For 85097/85097 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 5174 event pairs, 104 based on Foata normal form. 2/1006 useless extension candidates. Maximal degree in co-relation 5900. Up to 943 conditions per place. [2024-06-04 17:52:45,165 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 193 selfloop transitions, 23 changer transitions 0/218 dead transitions. [2024-06-04 17:52:45,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 218 transitions, 2415 flow [2024-06-04 17:52:45,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 17:52:45,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 17:52:45,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 113 transitions. [2024-06-04 17:52:45,166 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2942708333333333 [2024-06-04 17:52:45,166 INFO L175 Difference]: Start difference. First operand has 258 places, 203 transitions, 1921 flow. Second operand 12 states and 113 transitions. [2024-06-04 17:52:45,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 218 transitions, 2415 flow [2024-06-04 17:52:45,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 218 transitions, 2265 flow, removed 13 selfloop flow, removed 8 redundant places. [2024-06-04 17:52:45,407 INFO L231 Difference]: Finished difference. Result has 262 places, 204 transitions, 1853 flow [2024-06-04 17:52:45,407 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1771, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1853, PETRI_PLACES=262, PETRI_TRANSITIONS=204} [2024-06-04 17:52:45,407 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 231 predicate places. [2024-06-04 17:52:45,407 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 204 transitions, 1853 flow [2024-06-04 17:52:45,407 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-04 17:52:45,408 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:52:45,408 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-04 17:52:45,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2024-06-04 17:52:45,408 INFO L420 AbstractCegarLoop]: === Iteration 103 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:52:45,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:52:45,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1096449776, now seen corresponding path program 13 times [2024-06-04 17:52:45,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:52:45,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142780527] [2024-06-04 17:52:45,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:52:45,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:52:45,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:52:50,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:52:50,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:52:50,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142780527] [2024-06-04 17:52:50,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142780527] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:52:50,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:52:50,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:52:50,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713249422] [2024-06-04 17:52:50,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:52:50,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:52:50,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:52:50,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:52:50,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:52:50,959 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:52:50,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 204 transitions, 1853 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-04 17:52:50,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:52:50,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:52:50,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:52:51,322 INFO L124 PetriNetUnfolderBase]: 552/1014 cut-off events. [2024-06-04 17:52:51,322 INFO L125 PetriNetUnfolderBase]: For 86852/86858 co-relation queries the response was YES. [2024-06-04 17:52:51,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5968 conditions, 1014 events. 552/1014 cut-off events. For 86852/86858 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 5224 event pairs, 68 based on Foata normal form. 2/1011 useless extension candidates. Maximal degree in co-relation 5849. Up to 751 conditions per place. [2024-06-04 17:52:51,332 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 141 selfloop transitions, 77 changer transitions 0/220 dead transitions. [2024-06-04 17:52:51,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 220 transitions, 2361 flow [2024-06-04 17:52:51,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:52:51,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:52:51,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 109 transitions. [2024-06-04 17:52:51,336 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.340625 [2024-06-04 17:52:51,336 INFO L175 Difference]: Start difference. First operand has 262 places, 204 transitions, 1853 flow. Second operand 10 states and 109 transitions. [2024-06-04 17:52:51,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 220 transitions, 2361 flow [2024-06-04 17:52:51,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 220 transitions, 2289 flow, removed 14 selfloop flow, removed 10 redundant places. [2024-06-04 17:52:51,540 INFO L231 Difference]: Finished difference. Result has 262 places, 205 transitions, 1971 flow [2024-06-04 17:52:51,540 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1781, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1971, PETRI_PLACES=262, PETRI_TRANSITIONS=205} [2024-06-04 17:52:51,540 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 231 predicate places. [2024-06-04 17:52:51,540 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 205 transitions, 1971 flow [2024-06-04 17:52:51,540 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-04 17:52:51,540 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:52:51,541 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-04 17:52:51,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2024-06-04 17:52:51,541 INFO L420 AbstractCegarLoop]: === Iteration 104 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:52:51,541 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:52:51,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1241762740, now seen corresponding path program 5 times [2024-06-04 17:52:51,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:52:51,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578498831] [2024-06-04 17:52:51,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:52:51,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:52:51,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:52:57,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:52:57,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:52:57,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578498831] [2024-06-04 17:52:57,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578498831] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:52:57,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:52:57,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:52:57,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731027504] [2024-06-04 17:52:57,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:52:57,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:52:57,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:52:57,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:52:57,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:52:57,454 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:52:57,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 205 transitions, 1971 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-04 17:52:57,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:52:57,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:52:57,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:52:57,941 INFO L124 PetriNetUnfolderBase]: 572/1058 cut-off events. [2024-06-04 17:52:57,941 INFO L125 PetriNetUnfolderBase]: For 136185/136191 co-relation queries the response was YES. [2024-06-04 17:52:57,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6279 conditions, 1058 events. 572/1058 cut-off events. For 136185/136191 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 5484 event pairs, 78 based on Foata normal form. 12/1065 useless extension candidates. Maximal degree in co-relation 6159. Up to 607 conditions per place. [2024-06-04 17:52:57,952 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 124 selfloop transitions, 94 changer transitions 8/228 dead transitions. [2024-06-04 17:52:57,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 228 transitions, 2537 flow [2024-06-04 17:52:57,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:52:57,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:52:57,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 128 transitions. [2024-06-04 17:52:57,953 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2024-06-04 17:52:57,954 INFO L175 Difference]: Start difference. First operand has 262 places, 205 transitions, 1971 flow. Second operand 11 states and 128 transitions. [2024-06-04 17:52:57,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 228 transitions, 2537 flow [2024-06-04 17:52:58,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 228 transitions, 2357 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-06-04 17:52:58,216 INFO L231 Difference]: Finished difference. Result has 265 places, 203 transitions, 1991 flow [2024-06-04 17:52:58,217 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1791, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1991, PETRI_PLACES=265, PETRI_TRANSITIONS=203} [2024-06-04 17:52:58,217 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 234 predicate places. [2024-06-04 17:52:58,217 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 203 transitions, 1991 flow [2024-06-04 17:52:58,217 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-04 17:52:58,217 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:52:58,217 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-04 17:52:58,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2024-06-04 17:52:58,217 INFO L420 AbstractCegarLoop]: === Iteration 105 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:52:58,218 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:52:58,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1961580578, now seen corresponding path program 6 times [2024-06-04 17:52:58,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:52:58,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963464094] [2024-06-04 17:52:58,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:52:58,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:52:58,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:53:04,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:53:04,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:53:04,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963464094] [2024-06-04 17:53:04,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963464094] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:53:04,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:53:04,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:53:04,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836438123] [2024-06-04 17:53:04,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:53:04,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:53:04,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:53:04,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:53:04,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:53:04,237 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:53:04,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 203 transitions, 1991 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-04 17:53:04,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:53:04,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:53:04,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:53:04,651 INFO L124 PetriNetUnfolderBase]: 562/1048 cut-off events. [2024-06-04 17:53:04,651 INFO L125 PetriNetUnfolderBase]: For 139179/139185 co-relation queries the response was YES. [2024-06-04 17:53:04,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6274 conditions, 1048 events. 562/1048 cut-off events. For 139179/139185 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 5465 event pairs, 86 based on Foata normal form. 12/1055 useless extension candidates. Maximal degree in co-relation 6153. Up to 593 conditions per place. [2024-06-04 17:53:04,661 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 131 selfloop transitions, 84 changer transitions 9/226 dead transitions. [2024-06-04 17:53:04,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 226 transitions, 2555 flow [2024-06-04 17:53:04,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:53:04,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:53:04,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 129 transitions. [2024-06-04 17:53:04,662 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3664772727272727 [2024-06-04 17:53:04,662 INFO L175 Difference]: Start difference. First operand has 265 places, 203 transitions, 1991 flow. Second operand 11 states and 129 transitions. [2024-06-04 17:53:04,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 226 transitions, 2555 flow [2024-06-04 17:53:05,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 226 transitions, 2339 flow, removed 15 selfloop flow, removed 9 redundant places. [2024-06-04 17:53:05,047 INFO L231 Difference]: Finished difference. Result has 267 places, 200 transitions, 1948 flow [2024-06-04 17:53:05,047 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1775, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1948, PETRI_PLACES=267, PETRI_TRANSITIONS=200} [2024-06-04 17:53:05,047 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 236 predicate places. [2024-06-04 17:53:05,047 INFO L495 AbstractCegarLoop]: Abstraction has has 267 places, 200 transitions, 1948 flow [2024-06-04 17:53:05,047 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-04 17:53:05,047 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:53:05,047 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-04 17:53:05,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2024-06-04 17:53:05,048 INFO L420 AbstractCegarLoop]: === Iteration 106 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:53:05,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:53:05,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1814529740, now seen corresponding path program 14 times [2024-06-04 17:53:05,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:53:05,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244887322] [2024-06-04 17:53:05,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:53:05,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:53:05,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:53:11,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:53:11,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:53:11,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244887322] [2024-06-04 17:53:11,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244887322] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:53:11,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:53:11,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:53:11,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590921085] [2024-06-04 17:53:11,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:53:11,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:53:11,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:53:11,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:53:11,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:53:11,634 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:53:11,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 200 transitions, 1948 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:53:11,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:53:11,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:53:11,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:53:11,970 INFO L124 PetriNetUnfolderBase]: 532/998 cut-off events. [2024-06-04 17:53:11,970 INFO L125 PetriNetUnfolderBase]: For 92795/92801 co-relation queries the response was YES. [2024-06-04 17:53:11,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6061 conditions, 998 events. 532/998 cut-off events. For 92795/92801 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 5271 event pairs, 82 based on Foata normal form. 2/995 useless extension candidates. Maximal degree in co-relation 5939. Up to 735 conditions per place. [2024-06-04 17:53:11,981 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 148 selfloop transitions, 66 changer transitions 0/216 dead transitions. [2024-06-04 17:53:11,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 216 transitions, 2450 flow [2024-06-04 17:53:11,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:53:11,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:53:11,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 111 transitions. [2024-06-04 17:53:11,982 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.346875 [2024-06-04 17:53:11,982 INFO L175 Difference]: Start difference. First operand has 267 places, 200 transitions, 1948 flow. Second operand 10 states and 111 transitions. [2024-06-04 17:53:11,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 216 transitions, 2450 flow [2024-06-04 17:53:12,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 216 transitions, 2252 flow, removed 16 selfloop flow, removed 9 redundant places. [2024-06-04 17:53:12,241 INFO L231 Difference]: Finished difference. Result has 268 places, 201 transitions, 1920 flow [2024-06-04 17:53:12,241 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1750, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1920, PETRI_PLACES=268, PETRI_TRANSITIONS=201} [2024-06-04 17:53:12,241 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 237 predicate places. [2024-06-04 17:53:12,241 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 201 transitions, 1920 flow [2024-06-04 17:53:12,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:53:12,242 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:53:12,242 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-04 17:53:12,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2024-06-04 17:53:12,242 INFO L420 AbstractCegarLoop]: === Iteration 107 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:53:12,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:53:12,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1873506168, now seen corresponding path program 15 times [2024-06-04 17:53:12,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:53:12,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134520897] [2024-06-04 17:53:12,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:53:12,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:53:12,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:53:18,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:53:18,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:53:18,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134520897] [2024-06-04 17:53:18,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134520897] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:53:18,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:53:18,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:53:18,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542524812] [2024-06-04 17:53:18,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:53:18,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:53:18,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:53:18,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:53:18,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:53:18,515 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:53:18,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 201 transitions, 1920 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-04 17:53:18,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:53:18,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:53:18,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:53:18,889 INFO L124 PetriNetUnfolderBase]: 536/1006 cut-off events. [2024-06-04 17:53:18,889 INFO L125 PetriNetUnfolderBase]: For 94457/94463 co-relation queries the response was YES. [2024-06-04 17:53:18,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6072 conditions, 1006 events. 536/1006 cut-off events. For 94457/94463 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 5332 event pairs, 74 based on Foata normal form. 2/1003 useless extension candidates. Maximal degree in co-relation 5949. Up to 743 conditions per place. [2024-06-04 17:53:18,900 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 145 selfloop transitions, 70 changer transitions 0/217 dead transitions. [2024-06-04 17:53:18,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 217 transitions, 2426 flow [2024-06-04 17:53:18,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:53:18,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:53:18,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 110 transitions. [2024-06-04 17:53:18,901 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34375 [2024-06-04 17:53:18,901 INFO L175 Difference]: Start difference. First operand has 268 places, 201 transitions, 1920 flow. Second operand 10 states and 110 transitions. [2024-06-04 17:53:18,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 217 transitions, 2426 flow [2024-06-04 17:53:19,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 217 transitions, 2266 flow, removed 15 selfloop flow, removed 8 redundant places. [2024-06-04 17:53:19,142 INFO L231 Difference]: Finished difference. Result has 270 places, 202 transitions, 1940 flow [2024-06-04 17:53:19,142 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1760, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1940, PETRI_PLACES=270, PETRI_TRANSITIONS=202} [2024-06-04 17:53:19,142 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 239 predicate places. [2024-06-04 17:53:19,142 INFO L495 AbstractCegarLoop]: Abstraction has has 270 places, 202 transitions, 1940 flow [2024-06-04 17:53:19,142 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-04 17:53:19,142 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:53:19,142 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-04 17:53:19,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2024-06-04 17:53:19,142 INFO L420 AbstractCegarLoop]: === Iteration 108 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:53:19,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:53:19,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1873501518, now seen corresponding path program 16 times [2024-06-04 17:53:19,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:53:19,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954549271] [2024-06-04 17:53:19,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:53:19,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:53:19,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:53:24,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:53:24,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:53:24,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954549271] [2024-06-04 17:53:24,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954549271] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:53:24,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:53:24,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:53:24,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898039913] [2024-06-04 17:53:24,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:53:24,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:53:24,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:53:24,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:53:24,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:53:24,762 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:53:24,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 202 transitions, 1940 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-04 17:53:24,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:53:24,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:53:24,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:53:25,109 INFO L124 PetriNetUnfolderBase]: 540/1014 cut-off events. [2024-06-04 17:53:25,109 INFO L125 PetriNetUnfolderBase]: For 96349/96355 co-relation queries the response was YES. [2024-06-04 17:53:25,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6139 conditions, 1014 events. 540/1014 cut-off events. For 96349/96355 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 5373 event pairs, 76 based on Foata normal form. 2/1011 useless extension candidates. Maximal degree in co-relation 6015. Up to 725 conditions per place. [2024-06-04 17:53:25,119 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 143 selfloop transitions, 73 changer transitions 0/218 dead transitions. [2024-06-04 17:53:25,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 218 transitions, 2448 flow [2024-06-04 17:53:25,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:53:25,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:53:25,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 110 transitions. [2024-06-04 17:53:25,121 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34375 [2024-06-04 17:53:25,121 INFO L175 Difference]: Start difference. First operand has 270 places, 202 transitions, 1940 flow. Second operand 10 states and 110 transitions. [2024-06-04 17:53:25,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 218 transitions, 2448 flow [2024-06-04 17:53:25,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 218 transitions, 2278 flow, removed 16 selfloop flow, removed 8 redundant places. [2024-06-04 17:53:25,395 INFO L231 Difference]: Finished difference. Result has 272 places, 203 transitions, 1958 flow [2024-06-04 17:53:25,395 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1770, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1958, PETRI_PLACES=272, PETRI_TRANSITIONS=203} [2024-06-04 17:53:25,395 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 241 predicate places. [2024-06-04 17:53:25,396 INFO L495 AbstractCegarLoop]: Abstraction has has 272 places, 203 transitions, 1958 flow [2024-06-04 17:53:25,396 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-04 17:53:25,396 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:53:25,396 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-04 17:53:25,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2024-06-04 17:53:25,396 INFO L420 AbstractCegarLoop]: === Iteration 109 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:53:25,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:53:25,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1733126034, now seen corresponding path program 17 times [2024-06-04 17:53:25,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:53:25,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104262155] [2024-06-04 17:53:25,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:53:25,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:53:25,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:53:31,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:53:31,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:53:31,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104262155] [2024-06-04 17:53:31,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104262155] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:53:31,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:53:31,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:53:31,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476244893] [2024-06-04 17:53:31,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:53:31,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:53:31,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:53:31,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:53:31,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:53:31,942 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:53:31,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 203 transitions, 1958 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-04 17:53:31,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:53:31,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:53:31,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:53:32,394 INFO L124 PetriNetUnfolderBase]: 544/1022 cut-off events. [2024-06-04 17:53:32,394 INFO L125 PetriNetUnfolderBase]: For 98362/98368 co-relation queries the response was YES. [2024-06-04 17:53:32,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6204 conditions, 1022 events. 544/1022 cut-off events. For 98362/98368 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 5412 event pairs, 86 based on Foata normal form. 2/1019 useless extension candidates. Maximal degree in co-relation 6079. Up to 745 conditions per place. [2024-06-04 17:53:32,404 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 150 selfloop transitions, 67 changer transitions 0/219 dead transitions. [2024-06-04 17:53:32,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 219 transitions, 2470 flow [2024-06-04 17:53:32,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:53:32,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:53:32,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2024-06-04 17:53:32,405 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35 [2024-06-04 17:53:32,405 INFO L175 Difference]: Start difference. First operand has 272 places, 203 transitions, 1958 flow. Second operand 10 states and 112 transitions. [2024-06-04 17:53:32,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 219 transitions, 2470 flow [2024-06-04 17:53:32,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 219 transitions, 2292 flow, removed 17 selfloop flow, removed 8 redundant places. [2024-06-04 17:53:32,698 INFO L231 Difference]: Finished difference. Result has 274 places, 204 transitions, 1958 flow [2024-06-04 17:53:32,698 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1780, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1958, PETRI_PLACES=274, PETRI_TRANSITIONS=204} [2024-06-04 17:53:32,699 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 243 predicate places. [2024-06-04 17:53:32,699 INFO L495 AbstractCegarLoop]: Abstraction has has 274 places, 204 transitions, 1958 flow [2024-06-04 17:53:32,699 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-04 17:53:32,699 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:53:32,699 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-04 17:53:32,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2024-06-04 17:53:32,699 INFO L420 AbstractCegarLoop]: === Iteration 110 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:53:32,699 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:53:32,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1903828464, now seen corresponding path program 18 times [2024-06-04 17:53:32,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:53:32,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054465791] [2024-06-04 17:53:32,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:53:32,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:53:32,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:53:38,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:53:38,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:53:38,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054465791] [2024-06-04 17:53:38,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054465791] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:53:38,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:53:38,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:53:38,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604290597] [2024-06-04 17:53:38,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:53:38,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:53:38,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:53:38,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:53:38,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:53:38,456 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:53:38,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 204 transitions, 1958 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-04 17:53:38,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:53:38,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:53:38,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:53:38,857 INFO L124 PetriNetUnfolderBase]: 555/1043 cut-off events. [2024-06-04 17:53:38,857 INFO L125 PetriNetUnfolderBase]: For 111978/111984 co-relation queries the response was YES. [2024-06-04 17:53:38,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6585 conditions, 1043 events. 555/1043 cut-off events. For 111978/111984 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 5558 event pairs, 89 based on Foata normal form. 2/1040 useless extension candidates. Maximal degree in co-relation 6459. Up to 757 conditions per place. [2024-06-04 17:53:38,865 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 156 selfloop transitions, 65 changer transitions 0/223 dead transitions. [2024-06-04 17:53:38,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 223 transitions, 2734 flow [2024-06-04 17:53:38,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:53:38,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:53:38,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 115 transitions. [2024-06-04 17:53:38,867 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.359375 [2024-06-04 17:53:38,867 INFO L175 Difference]: Start difference. First operand has 274 places, 204 transitions, 1958 flow. Second operand 10 states and 115 transitions. [2024-06-04 17:53:38,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 223 transitions, 2734 flow [2024-06-04 17:53:39,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 223 transitions, 2566 flow, removed 18 selfloop flow, removed 8 redundant places. [2024-06-04 17:53:39,142 INFO L231 Difference]: Finished difference. Result has 276 places, 206 transitions, 2006 flow [2024-06-04 17:53:39,142 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1790, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2006, PETRI_PLACES=276, PETRI_TRANSITIONS=206} [2024-06-04 17:53:39,142 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 245 predicate places. [2024-06-04 17:53:39,142 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 206 transitions, 2006 flow [2024-06-04 17:53:39,142 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-04 17:53:39,142 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:53:39,142 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-04 17:53:39,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2024-06-04 17:53:39,142 INFO L420 AbstractCegarLoop]: === Iteration 111 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:53:39,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:53:39,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1733010714, now seen corresponding path program 19 times [2024-06-04 17:53:39,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:53:39,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297082562] [2024-06-04 17:53:39,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:53:39,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:53:39,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:53:45,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:53:45,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:53:45,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297082562] [2024-06-04 17:53:45,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297082562] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:53:45,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:53:45,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:53:45,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889752928] [2024-06-04 17:53:45,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:53:45,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:53:45,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:53:45,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:53:45,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:53:46,068 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:53:46,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 206 transitions, 2006 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-04 17:53:46,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:53:46,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:53:46,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:53:46,421 INFO L124 PetriNetUnfolderBase]: 552/1038 cut-off events. [2024-06-04 17:53:46,421 INFO L125 PetriNetUnfolderBase]: For 102631/102637 co-relation queries the response was YES. [2024-06-04 17:53:46,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6286 conditions, 1038 events. 552/1038 cut-off events. For 102631/102637 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 5538 event pairs, 90 based on Foata normal form. 2/1035 useless extension candidates. Maximal degree in co-relation 6159. Up to 678 conditions per place. [2024-06-04 17:53:46,432 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 145 selfloop transitions, 75 changer transitions 0/222 dead transitions. [2024-06-04 17:53:46,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 222 transitions, 2696 flow [2024-06-04 17:53:46,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:53:46,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:53:46,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2024-06-04 17:53:46,433 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35 [2024-06-04 17:53:46,433 INFO L175 Difference]: Start difference. First operand has 276 places, 206 transitions, 2006 flow. Second operand 10 states and 112 transitions. [2024-06-04 17:53:46,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 222 transitions, 2696 flow [2024-06-04 17:53:46,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 222 transitions, 2574 flow, removed 22 selfloop flow, removed 6 redundant places. [2024-06-04 17:53:46,900 INFO L231 Difference]: Finished difference. Result has 280 places, 206 transitions, 2038 flow [2024-06-04 17:53:46,900 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1884, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2038, PETRI_PLACES=280, PETRI_TRANSITIONS=206} [2024-06-04 17:53:46,900 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 249 predicate places. [2024-06-04 17:53:46,900 INFO L495 AbstractCegarLoop]: Abstraction has has 280 places, 206 transitions, 2038 flow [2024-06-04 17:53:46,900 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-04 17:53:46,900 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:53:46,901 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-04 17:53:46,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2024-06-04 17:53:46,901 INFO L420 AbstractCegarLoop]: === Iteration 112 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:53:46,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:53:46,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1910262204, now seen corresponding path program 20 times [2024-06-04 17:53:46,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:53:46,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556588143] [2024-06-04 17:53:46,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:53:46,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:53:46,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:53:51,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:53:51,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:53:51,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556588143] [2024-06-04 17:53:51,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556588143] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:53:51,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:53:51,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:53:51,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024870951] [2024-06-04 17:53:51,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:53:51,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:53:51,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:53:51,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:53:51,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:53:51,860 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:53:51,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 206 transitions, 2038 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-04 17:53:51,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:53:51,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:53:51,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:53:52,232 INFO L124 PetriNetUnfolderBase]: 549/1033 cut-off events. [2024-06-04 17:53:52,232 INFO L125 PetriNetUnfolderBase]: For 92551/92557 co-relation queries the response was YES. [2024-06-04 17:53:52,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6119 conditions, 1033 events. 549/1033 cut-off events. For 92551/92557 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 5528 event pairs, 87 based on Foata normal form. 2/1030 useless extension candidates. Maximal degree in co-relation 5990. Up to 770 conditions per place. [2024-06-04 17:53:52,242 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 156 selfloop transitions, 64 changer transitions 0/222 dead transitions. [2024-06-04 17:53:52,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 222 transitions, 2524 flow [2024-06-04 17:53:52,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:53:52,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:53:52,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 113 transitions. [2024-06-04 17:53:52,244 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.353125 [2024-06-04 17:53:52,244 INFO L175 Difference]: Start difference. First operand has 280 places, 206 transitions, 2038 flow. Second operand 10 states and 113 transitions. [2024-06-04 17:53:52,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 222 transitions, 2524 flow [2024-06-04 17:53:52,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 222 transitions, 2250 flow, removed 35 selfloop flow, removed 10 redundant places. [2024-06-04 17:53:52,498 INFO L231 Difference]: Finished difference. Result has 280 places, 206 transitions, 1896 flow [2024-06-04 17:53:52,498 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1764, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1896, PETRI_PLACES=280, PETRI_TRANSITIONS=206} [2024-06-04 17:53:52,499 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 249 predicate places. [2024-06-04 17:53:52,499 INFO L495 AbstractCegarLoop]: Abstraction has has 280 places, 206 transitions, 1896 flow [2024-06-04 17:53:52,499 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-04 17:53:52,499 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:53:52,499 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-04 17:53:52,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2024-06-04 17:53:52,499 INFO L420 AbstractCegarLoop]: === Iteration 113 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:53:52,499 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:53:52,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1910508468, now seen corresponding path program 7 times [2024-06-04 17:53:52,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:53:52,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630668405] [2024-06-04 17:53:52,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:53:52,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:53:52,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:53:58,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:53:58,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:53:58,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630668405] [2024-06-04 17:53:58,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630668405] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:53:58,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:53:58,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:53:58,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901646541] [2024-06-04 17:53:58,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:53:58,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:53:58,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:53:58,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:53:58,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:53:58,596 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:53:58,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 206 transitions, 1896 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-04 17:53:58,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:53:58,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:53:58,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:53:59,076 INFO L124 PetriNetUnfolderBase]: 562/1064 cut-off events. [2024-06-04 17:53:59,076 INFO L125 PetriNetUnfolderBase]: For 137723/137729 co-relation queries the response was YES. [2024-06-04 17:53:59,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5668 conditions, 1064 events. 562/1064 cut-off events. For 137723/137729 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 5668 event pairs, 104 based on Foata normal form. 12/1071 useless extension candidates. Maximal degree in co-relation 5540. Up to 605 conditions per place. [2024-06-04 17:53:59,089 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 140 selfloop transitions, 76 changer transitions 10/228 dead transitions. [2024-06-04 17:53:59,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 228 transitions, 2430 flow [2024-06-04 17:53:59,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:53:59,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:53:59,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 130 transitions. [2024-06-04 17:53:59,090 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3693181818181818 [2024-06-04 17:53:59,090 INFO L175 Difference]: Start difference. First operand has 280 places, 206 transitions, 1896 flow. Second operand 11 states and 130 transitions. [2024-06-04 17:53:59,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 228 transitions, 2430 flow [2024-06-04 17:53:59,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 228 transitions, 2172 flow, removed 4 selfloop flow, removed 12 redundant places. [2024-06-04 17:53:59,403 INFO L231 Difference]: Finished difference. Result has 279 places, 201 transitions, 1756 flow [2024-06-04 17:53:59,403 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1640, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1756, PETRI_PLACES=279, PETRI_TRANSITIONS=201} [2024-06-04 17:53:59,404 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 248 predicate places. [2024-06-04 17:53:59,404 INFO L495 AbstractCegarLoop]: Abstraction has has 279 places, 201 transitions, 1756 flow [2024-06-04 17:53:59,404 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-04 17:53:59,404 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:53:59,404 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-04 17:53:59,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2024-06-04 17:53:59,405 INFO L420 AbstractCegarLoop]: === Iteration 114 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:53:59,405 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:53:59,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1709995652, now seen corresponding path program 1 times [2024-06-04 17:53:59,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:53:59,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075247907] [2024-06-04 17:53:59,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:53:59,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:53:59,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:54:05,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:54:05,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:54:05,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075247907] [2024-06-04 17:54:05,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075247907] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:54:05,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:54:05,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 17:54:05,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954039099] [2024-06-04 17:54:05,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:54:05,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 17:54:05,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:54:05,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 17:54:05,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-06-04 17:54:05,409 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:54:05,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 201 transitions, 1756 flow. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 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-04 17:54:05,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:54:05,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:54:05,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:54:05,802 INFO L124 PetriNetUnfolderBase]: 528/1009 cut-off events. [2024-06-04 17:54:05,803 INFO L125 PetriNetUnfolderBase]: For 82615/82615 co-relation queries the response was YES. [2024-06-04 17:54:05,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5269 conditions, 1009 events. 528/1009 cut-off events. For 82615/82615 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 5460 event pairs, 82 based on Foata normal form. 2/1010 useless extension candidates. Maximal degree in co-relation 5142. Up to 895 conditions per place. [2024-06-04 17:54:05,815 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 199 selfloop transitions, 22 changer transitions 0/223 dead transitions. [2024-06-04 17:54:05,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 223 transitions, 2272 flow [2024-06-04 17:54:05,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:54:05,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:54:05,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 110 transitions. [2024-06-04 17:54:05,816 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3125 [2024-06-04 17:54:05,816 INFO L175 Difference]: Start difference. First operand has 279 places, 201 transitions, 1756 flow. Second operand 11 states and 110 transitions. [2024-06-04 17:54:05,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 223 transitions, 2272 flow [2024-06-04 17:54:06,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 223 transitions, 2001 flow, removed 16 selfloop flow, removed 13 redundant places. [2024-06-04 17:54:06,165 INFO L231 Difference]: Finished difference. Result has 277 places, 202 transitions, 1555 flow [2024-06-04 17:54:06,165 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1485, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1555, PETRI_PLACES=277, PETRI_TRANSITIONS=202} [2024-06-04 17:54:06,166 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 246 predicate places. [2024-06-04 17:54:06,166 INFO L495 AbstractCegarLoop]: Abstraction has has 277 places, 202 transitions, 1555 flow [2024-06-04 17:54:06,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 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-04 17:54:06,166 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:54:06,166 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-04 17:54:06,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2024-06-04 17:54:06,167 INFO L420 AbstractCegarLoop]: === Iteration 115 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:54:06,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:54:06,167 INFO L85 PathProgramCache]: Analyzing trace with hash 503464104, now seen corresponding path program 2 times [2024-06-04 17:54:06,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:54:06,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651428817] [2024-06-04 17:54:06,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:54:06,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:54:06,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:54:12,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:54:12,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:54:12,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651428817] [2024-06-04 17:54:12,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651428817] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:54:12,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:54:12,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 17:54:12,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160853009] [2024-06-04 17:54:12,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:54:12,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 17:54:12,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:54:12,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 17:54:12,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-06-04 17:54:12,700 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:54:12,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 202 transitions, 1555 flow. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 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-04 17:54:12,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:54:12,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:54:12,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:54:13,265 INFO L124 PetriNetUnfolderBase]: 539/1030 cut-off events. [2024-06-04 17:54:13,266 INFO L125 PetriNetUnfolderBase]: For 95191/95191 co-relation queries the response was YES. [2024-06-04 17:54:13,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5387 conditions, 1030 events. 539/1030 cut-off events. For 95191/95191 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 5608 event pairs, 92 based on Foata normal form. 2/1031 useless extension candidates. Maximal degree in co-relation 5262. Up to 864 conditions per place. [2024-06-04 17:54:13,277 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 189 selfloop transitions, 35 changer transitions 0/226 dead transitions. [2024-06-04 17:54:13,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 226 transitions, 2325 flow [2024-06-04 17:54:13,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:54:13,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:54:13,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 117 transitions. [2024-06-04 17:54:13,279 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33238636363636365 [2024-06-04 17:54:13,279 INFO L175 Difference]: Start difference. First operand has 277 places, 202 transitions, 1555 flow. Second operand 11 states and 117 transitions. [2024-06-04 17:54:13,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 226 transitions, 2325 flow [2024-06-04 17:54:13,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 226 transitions, 2265 flow, removed 9 selfloop flow, removed 9 redundant places. [2024-06-04 17:54:13,555 INFO L231 Difference]: Finished difference. Result has 279 places, 204 transitions, 1615 flow [2024-06-04 17:54:13,555 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1495, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1615, PETRI_PLACES=279, PETRI_TRANSITIONS=204} [2024-06-04 17:54:13,556 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 248 predicate places. [2024-06-04 17:54:13,556 INFO L495 AbstractCegarLoop]: Abstraction has has 279 places, 204 transitions, 1615 flow [2024-06-04 17:54:13,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 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-04 17:54:13,556 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:54:13,556 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-04 17:54:13,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2024-06-04 17:54:13,557 INFO L420 AbstractCegarLoop]: === Iteration 116 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:54:13,557 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:54:13,557 INFO L85 PathProgramCache]: Analyzing trace with hash 503613834, now seen corresponding path program 3 times [2024-06-04 17:54:13,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:54:13,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936836860] [2024-06-04 17:54:13,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:54:13,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:54:13,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:54:20,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:54:20,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:54:20,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936836860] [2024-06-04 17:54:20,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936836860] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:54:20,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:54:20,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 17:54:20,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506790602] [2024-06-04 17:54:20,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:54:20,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 17:54:20,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:54:20,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 17:54:20,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-06-04 17:54:20,636 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:54:20,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 204 transitions, 1615 flow. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 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-04 17:54:20,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:54:20,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:54:20,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:54:21,251 INFO L124 PetriNetUnfolderBase]: 543/1038 cut-off events. [2024-06-04 17:54:21,252 INFO L125 PetriNetUnfolderBase]: For 98207/98207 co-relation queries the response was YES. [2024-06-04 17:54:21,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5470 conditions, 1038 events. 543/1038 cut-off events. For 98207/98207 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 5674 event pairs, 98 based on Foata normal form. 2/1039 useless extension candidates. Maximal degree in co-relation 5344. Up to 911 conditions per place. [2024-06-04 17:54:21,265 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 188 selfloop transitions, 36 changer transitions 0/226 dead transitions. [2024-06-04 17:54:21,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 226 transitions, 2149 flow [2024-06-04 17:54:21,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:54:21,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:54:21,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 114 transitions. [2024-06-04 17:54:21,266 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32386363636363635 [2024-06-04 17:54:21,266 INFO L175 Difference]: Start difference. First operand has 279 places, 204 transitions, 1615 flow. Second operand 11 states and 114 transitions. [2024-06-04 17:54:21,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 226 transitions, 2149 flow [2024-06-04 17:54:21,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 226 transitions, 2066 flow, removed 18 selfloop flow, removed 7 redundant places. [2024-06-04 17:54:21,611 INFO L231 Difference]: Finished difference. Result has 283 places, 205 transitions, 1635 flow [2024-06-04 17:54:21,612 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1540, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1635, PETRI_PLACES=283, PETRI_TRANSITIONS=205} [2024-06-04 17:54:21,612 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 252 predicate places. [2024-06-04 17:54:21,612 INFO L495 AbstractCegarLoop]: Abstraction has has 283 places, 205 transitions, 1635 flow [2024-06-04 17:54:21,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 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-04 17:54:21,612 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:54:21,612 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-04 17:54:21,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2024-06-04 17:54:21,613 INFO L420 AbstractCegarLoop]: === Iteration 117 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:54:21,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:54:21,613 INFO L85 PathProgramCache]: Analyzing trace with hash 499889184, now seen corresponding path program 4 times [2024-06-04 17:54:21,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:54:21,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491708102] [2024-06-04 17:54:21,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:54:21,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:54:21,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:54:28,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:54:28,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:54:28,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491708102] [2024-06-04 17:54:28,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491708102] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:54:28,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:54:28,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 17:54:28,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479884616] [2024-06-04 17:54:28,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:54:28,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 17:54:28,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:54:28,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 17:54:28,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-06-04 17:54:28,346 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:54:28,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 205 transitions, 1635 flow. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 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-04 17:54:28,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:54:28,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:54:28,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:54:28,871 INFO L124 PetriNetUnfolderBase]: 547/1046 cut-off events. [2024-06-04 17:54:28,871 INFO L125 PetriNetUnfolderBase]: For 99909/99909 co-relation queries the response was YES. [2024-06-04 17:54:28,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5525 conditions, 1046 events. 547/1046 cut-off events. For 99909/99909 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 5718 event pairs, 98 based on Foata normal form. 2/1047 useless extension candidates. Maximal degree in co-relation 5397. Up to 840 conditions per place. [2024-06-04 17:54:28,880 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 192 selfloop transitions, 34 changer transitions 0/228 dead transitions. [2024-06-04 17:54:28,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 228 transitions, 2391 flow [2024-06-04 17:54:28,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:54:28,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:54:28,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 118 transitions. [2024-06-04 17:54:28,882 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3352272727272727 [2024-06-04 17:54:28,882 INFO L175 Difference]: Start difference. First operand has 283 places, 205 transitions, 1635 flow. Second operand 11 states and 118 transitions. [2024-06-04 17:54:28,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 228 transitions, 2391 flow [2024-06-04 17:54:29,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 228 transitions, 2310 flow, removed 6 selfloop flow, removed 9 redundant places. [2024-06-04 17:54:29,225 INFO L231 Difference]: Finished difference. Result has 285 places, 206 transitions, 1652 flow [2024-06-04 17:54:29,225 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1554, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1652, PETRI_PLACES=285, PETRI_TRANSITIONS=206} [2024-06-04 17:54:29,226 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 254 predicate places. [2024-06-04 17:54:29,226 INFO L495 AbstractCegarLoop]: Abstraction has has 285 places, 206 transitions, 1652 flow [2024-06-04 17:54:29,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 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-04 17:54:29,226 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:54:29,226 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-04 17:54:29,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2024-06-04 17:54:29,226 INFO L420 AbstractCegarLoop]: === Iteration 118 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:54:29,227 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:54:29,227 INFO L85 PathProgramCache]: Analyzing trace with hash 503608254, now seen corresponding path program 5 times [2024-06-04 17:54:29,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:54:29,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747967903] [2024-06-04 17:54:29,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:54:29,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:54:29,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:54:35,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:54:35,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:54:35,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747967903] [2024-06-04 17:54:35,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747967903] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:54:35,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:54:35,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 17:54:35,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718950118] [2024-06-04 17:54:35,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:54:35,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 17:54:35,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:54:35,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 17:54:35,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-06-04 17:54:35,893 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:54:35,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 206 transitions, 1652 flow. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 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-04 17:54:35,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:54:35,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:54:35,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:54:36,396 INFO L124 PetriNetUnfolderBase]: 544/1041 cut-off events. [2024-06-04 17:54:36,397 INFO L125 PetriNetUnfolderBase]: For 89222/89222 co-relation queries the response was YES. [2024-06-04 17:54:36,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5280 conditions, 1041 events. 544/1041 cut-off events. For 89222/89222 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 5703 event pairs, 95 based on Foata normal form. 2/1042 useless extension candidates. Maximal degree in co-relation 5151. Up to 898 conditions per place. [2024-06-04 17:54:36,408 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 189 selfloop transitions, 36 changer transitions 0/227 dead transitions. [2024-06-04 17:54:36,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 227 transitions, 2162 flow [2024-06-04 17:54:36,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:54:36,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:54:36,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 115 transitions. [2024-06-04 17:54:36,409 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32670454545454547 [2024-06-04 17:54:36,409 INFO L175 Difference]: Start difference. First operand has 285 places, 206 transitions, 1652 flow. Second operand 11 states and 115 transitions. [2024-06-04 17:54:36,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 227 transitions, 2162 flow [2024-06-04 17:54:36,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 227 transitions, 2062 flow, removed 17 selfloop flow, removed 9 redundant places. [2024-06-04 17:54:36,691 INFO L231 Difference]: Finished difference. Result has 287 places, 206 transitions, 1628 flow [2024-06-04 17:54:36,691 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1552, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1628, PETRI_PLACES=287, PETRI_TRANSITIONS=206} [2024-06-04 17:54:36,691 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 256 predicate places. [2024-06-04 17:54:36,692 INFO L495 AbstractCegarLoop]: Abstraction has has 287 places, 206 transitions, 1628 flow [2024-06-04 17:54:36,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 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-04 17:54:36,692 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:54:36,692 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-04 17:54:36,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2024-06-04 17:54:36,692 INFO L420 AbstractCegarLoop]: === Iteration 119 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:54:36,692 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:54:36,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1014001440, now seen corresponding path program 6 times [2024-06-04 17:54:36,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:54:36,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337862739] [2024-06-04 17:54:36,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:54:36,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:54:36,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:54:43,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:54:43,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:54:43,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337862739] [2024-06-04 17:54:43,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337862739] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:54:43,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:54:43,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 17:54:43,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440942522] [2024-06-04 17:54:43,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:54:43,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 17:54:43,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:54:43,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 17:54:43,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-06-04 17:54:43,194 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:54:43,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 206 transitions, 1628 flow. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 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-04 17:54:43,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:54:43,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:54:43,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:54:43,744 INFO L124 PetriNetUnfolderBase]: 548/1049 cut-off events. [2024-06-04 17:54:43,744 INFO L125 PetriNetUnfolderBase]: For 90769/90769 co-relation queries the response was YES. [2024-06-04 17:54:43,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5299 conditions, 1049 events. 548/1049 cut-off events. For 90769/90769 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 5759 event pairs, 97 based on Foata normal form. 2/1050 useless extension candidates. Maximal degree in co-relation 5169. Up to 829 conditions per place. [2024-06-04 17:54:43,756 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 177 selfloop transitions, 47 changer transitions 0/226 dead transitions. [2024-06-04 17:54:43,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 226 transitions, 2156 flow [2024-06-04 17:54:43,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:54:43,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:54:43,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 121 transitions. [2024-06-04 17:54:43,756 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34375 [2024-06-04 17:54:43,757 INFO L175 Difference]: Start difference. First operand has 287 places, 206 transitions, 1628 flow. Second operand 11 states and 121 transitions. [2024-06-04 17:54:43,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 226 transitions, 2156 flow [2024-06-04 17:54:44,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 226 transitions, 2075 flow, removed 1 selfloop flow, removed 10 redundant places. [2024-06-04 17:54:44,035 INFO L231 Difference]: Finished difference. Result has 288 places, 207 transitions, 1673 flow [2024-06-04 17:54:44,035 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1547, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1673, PETRI_PLACES=288, PETRI_TRANSITIONS=207} [2024-06-04 17:54:44,035 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 257 predicate places. [2024-06-04 17:54:44,036 INFO L495 AbstractCegarLoop]: Abstraction has has 288 places, 207 transitions, 1673 flow [2024-06-04 17:54:44,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 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-04 17:54:44,036 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:54:44,036 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-04 17:54:44,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2024-06-04 17:54:44,036 INFO L420 AbstractCegarLoop]: === Iteration 120 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:54:44,036 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:54:44,036 INFO L85 PathProgramCache]: Analyzing trace with hash 875467710, now seen corresponding path program 7 times [2024-06-04 17:54:44,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:54:44,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988264805] [2024-06-04 17:54:44,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:54:44,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:54:44,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:54:50,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:54:50,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:54:50,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988264805] [2024-06-04 17:54:50,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988264805] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:54:50,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:54:50,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 17:54:50,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998427756] [2024-06-04 17:54:50,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:54:50,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 17:54:50,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:54:50,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 17:54:50,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-06-04 17:54:50,666 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:54:50,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 207 transitions, 1673 flow. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 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-04 17:54:50,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:54:50,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:54:50,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:54:51,214 INFO L124 PetriNetUnfolderBase]: 552/1057 cut-off events. [2024-06-04 17:54:51,214 INFO L125 PetriNetUnfolderBase]: For 92654/92654 co-relation queries the response was YES. [2024-06-04 17:54:51,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5394 conditions, 1057 events. 552/1057 cut-off events. For 92654/92654 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 5818 event pairs, 97 based on Foata normal form. 2/1058 useless extension candidates. Maximal degree in co-relation 5263. Up to 823 conditions per place. [2024-06-04 17:54:51,224 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 177 selfloop transitions, 48 changer transitions 0/227 dead transitions. [2024-06-04 17:54:51,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 227 transitions, 2203 flow [2024-06-04 17:54:51,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:54:51,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:54:51,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 122 transitions. [2024-06-04 17:54:51,225 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3465909090909091 [2024-06-04 17:54:51,225 INFO L175 Difference]: Start difference. First operand has 288 places, 207 transitions, 1673 flow. Second operand 11 states and 122 transitions. [2024-06-04 17:54:51,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 227 transitions, 2203 flow [2024-06-04 17:54:51,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 227 transitions, 2087 flow, removed 12 selfloop flow, removed 9 redundant places. [2024-06-04 17:54:51,512 INFO L231 Difference]: Finished difference. Result has 290 places, 208 transitions, 1687 flow [2024-06-04 17:54:51,512 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1557, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1687, PETRI_PLACES=290, PETRI_TRANSITIONS=208} [2024-06-04 17:54:51,512 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 259 predicate places. [2024-06-04 17:54:51,513 INFO L495 AbstractCegarLoop]: Abstraction has has 290 places, 208 transitions, 1687 flow [2024-06-04 17:54:51,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 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-04 17:54:51,513 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:54:51,513 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-04 17:54:51,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2024-06-04 17:54:51,513 INFO L420 AbstractCegarLoop]: === Iteration 121 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:54:51,514 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:54:51,514 INFO L85 PathProgramCache]: Analyzing trace with hash -519115008, now seen corresponding path program 8 times [2024-06-04 17:54:51,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:54:51,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135204331] [2024-06-04 17:54:51,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:54:51,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:54:51,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:54:57,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:54:57,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:54:57,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135204331] [2024-06-04 17:54:57,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135204331] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:54:57,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:54:57,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 17:54:57,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765840236] [2024-06-04 17:54:57,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:54:57,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 17:54:57,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:54:57,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 17:54:57,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-06-04 17:54:58,121 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:54:58,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 208 transitions, 1687 flow. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 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-04 17:54:58,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:54:58,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:54:58,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:54:58,589 INFO L124 PetriNetUnfolderBase]: 556/1065 cut-off events. [2024-06-04 17:54:58,590 INFO L125 PetriNetUnfolderBase]: For 94394/94394 co-relation queries the response was YES. [2024-06-04 17:54:58,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5447 conditions, 1065 events. 556/1065 cut-off events. For 94394/94394 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 5869 event pairs, 97 based on Foata normal form. 2/1066 useless extension candidates. Maximal degree in co-relation 5315. Up to 809 conditions per place. [2024-06-04 17:54:58,601 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 177 selfloop transitions, 49 changer transitions 0/228 dead transitions. [2024-06-04 17:54:58,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 228 transitions, 2219 flow [2024-06-04 17:54:58,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:54:58,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:54:58,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 123 transitions. [2024-06-04 17:54:58,602 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3494318181818182 [2024-06-04 17:54:58,602 INFO L175 Difference]: Start difference. First operand has 290 places, 208 transitions, 1687 flow. Second operand 11 states and 123 transitions. [2024-06-04 17:54:58,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 228 transitions, 2219 flow [2024-06-04 17:54:58,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 228 transitions, 2099 flow, removed 13 selfloop flow, removed 9 redundant places. [2024-06-04 17:54:58,886 INFO L231 Difference]: Finished difference. Result has 292 places, 209 transitions, 1701 flow [2024-06-04 17:54:58,886 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1567, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1701, PETRI_PLACES=292, PETRI_TRANSITIONS=209} [2024-06-04 17:54:58,886 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 261 predicate places. [2024-06-04 17:54:58,886 INFO L495 AbstractCegarLoop]: Abstraction has has 292 places, 209 transitions, 1701 flow [2024-06-04 17:54:58,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 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-04 17:54:58,886 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:54:58,886 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-04 17:54:58,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2024-06-04 17:54:58,887 INFO L420 AbstractCegarLoop]: === Iteration 122 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:54:58,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:54:58,887 INFO L85 PathProgramCache]: Analyzing trace with hash -522689928, now seen corresponding path program 9 times [2024-06-04 17:54:58,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:54:58,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025452252] [2024-06-04 17:54:58,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:54:58,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:54:58,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:55:04,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:55:04,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:55:04,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025452252] [2024-06-04 17:55:04,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025452252] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:55:04,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:55:04,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 17:55:04,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401385493] [2024-06-04 17:55:04,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:55:04,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 17:55:04,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:55:04,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 17:55:04,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-06-04 17:55:04,763 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:55:04,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 209 transitions, 1701 flow. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 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-04 17:55:04,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:55:04,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:55:04,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:55:05,190 INFO L124 PetriNetUnfolderBase]: 567/1086 cut-off events. [2024-06-04 17:55:05,190 INFO L125 PetriNetUnfolderBase]: For 110238/110238 co-relation queries the response was YES. [2024-06-04 17:55:05,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5850 conditions, 1086 events. 567/1086 cut-off events. For 110238/110238 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 6026 event pairs, 108 based on Foata normal form. 2/1087 useless extension candidates. Maximal degree in co-relation 5717. Up to 758 conditions per place. [2024-06-04 17:55:05,201 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 181 selfloop transitions, 48 changer transitions 0/231 dead transitions. [2024-06-04 17:55:05,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 231 transitions, 2505 flow [2024-06-04 17:55:05,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:55:05,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:55:05,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 121 transitions. [2024-06-04 17:55:05,203 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34375 [2024-06-04 17:55:05,204 INFO L175 Difference]: Start difference. First operand has 292 places, 209 transitions, 1701 flow. Second operand 11 states and 121 transitions. [2024-06-04 17:55:05,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 231 transitions, 2505 flow [2024-06-04 17:55:05,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 231 transitions, 2381 flow, removed 14 selfloop flow, removed 9 redundant places. [2024-06-04 17:55:05,536 INFO L231 Difference]: Finished difference. Result has 294 places, 211 transitions, 1743 flow [2024-06-04 17:55:05,536 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1577, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1743, PETRI_PLACES=294, PETRI_TRANSITIONS=211} [2024-06-04 17:55:05,536 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 263 predicate places. [2024-06-04 17:55:05,536 INFO L495 AbstractCegarLoop]: Abstraction has has 294 places, 211 transitions, 1743 flow [2024-06-04 17:55:05,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 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-04 17:55:05,536 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:55:05,536 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-04 17:55:05,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2024-06-04 17:55:05,536 INFO L420 AbstractCegarLoop]: === Iteration 123 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:55:05,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:55:05,537 INFO L85 PathProgramCache]: Analyzing trace with hash 677144546, now seen corresponding path program 10 times [2024-06-04 17:55:05,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:55:05,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472355040] [2024-06-04 17:55:05,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:55:05,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:55:05,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:55:11,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:55:11,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:55:11,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472355040] [2024-06-04 17:55:11,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472355040] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:55:11,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:55:11,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 17:55:11,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310369694] [2024-06-04 17:55:11,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:55:11,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 17:55:11,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:55:11,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 17:55:11,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-06-04 17:55:11,881 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:55:11,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 211 transitions, 1743 flow. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 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-04 17:55:11,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:55:11,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:55:11,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:55:12,432 INFO L124 PetriNetUnfolderBase]: 571/1094 cut-off events. [2024-06-04 17:55:12,432 INFO L125 PetriNetUnfolderBase]: For 112411/112411 co-relation queries the response was YES. [2024-06-04 17:55:12,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5905 conditions, 1094 events. 571/1094 cut-off events. For 112411/112411 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 6106 event pairs, 96 based on Foata normal form. 2/1095 useless extension candidates. Maximal degree in co-relation 5771. Up to 874 conditions per place. [2024-06-04 17:55:12,443 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 175 selfloop transitions, 54 changer transitions 0/231 dead transitions. [2024-06-04 17:55:12,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 231 transitions, 2289 flow [2024-06-04 17:55:12,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:55:12,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:55:12,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 119 transitions. [2024-06-04 17:55:12,444 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3380681818181818 [2024-06-04 17:55:12,444 INFO L175 Difference]: Start difference. First operand has 294 places, 211 transitions, 1743 flow. Second operand 11 states and 119 transitions. [2024-06-04 17:55:12,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 231 transitions, 2289 flow [2024-06-04 17:55:12,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 231 transitions, 2181 flow, removed 25 selfloop flow, removed 7 redundant places. [2024-06-04 17:55:12,765 INFO L231 Difference]: Finished difference. Result has 298 places, 212 transitions, 1783 flow [2024-06-04 17:55:12,765 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1645, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1783, PETRI_PLACES=298, PETRI_TRANSITIONS=212} [2024-06-04 17:55:12,765 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 267 predicate places. [2024-06-04 17:55:12,765 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 212 transitions, 1783 flow [2024-06-04 17:55:12,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 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-04 17:55:12,765 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:55:12,765 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-04 17:55:12,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2024-06-04 17:55:12,766 INFO L420 AbstractCegarLoop]: === Iteration 124 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:55:12,766 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:55:12,766 INFO L85 PathProgramCache]: Analyzing trace with hash -623970308, now seen corresponding path program 11 times [2024-06-04 17:55:12,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:55:12,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327061862] [2024-06-04 17:55:12,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:55:12,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:55:12,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:55:19,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:55:19,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:55:19,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327061862] [2024-06-04 17:55:19,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327061862] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:55:19,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:55:19,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 17:55:19,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441311229] [2024-06-04 17:55:19,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:55:19,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 17:55:19,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:55:19,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 17:55:19,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-06-04 17:55:19,381 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:55:19,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 212 transitions, 1783 flow. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 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-04 17:55:19,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:55:19,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:55:19,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:55:19,927 INFO L124 PetriNetUnfolderBase]: 582/1115 cut-off events. [2024-06-04 17:55:19,928 INFO L125 PetriNetUnfolderBase]: For 127824/127824 co-relation queries the response was YES. [2024-06-04 17:55:19,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6312 conditions, 1115 events. 582/1115 cut-off events. For 127824/127824 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 6238 event pairs, 99 based on Foata normal form. 2/1116 useless extension candidates. Maximal degree in co-relation 6176. Up to 881 conditions per place. [2024-06-04 17:55:19,936 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 179 selfloop transitions, 53 changer transitions 0/234 dead transitions. [2024-06-04 17:55:19,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 234 transitions, 2589 flow [2024-06-04 17:55:19,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:55:19,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:55:19,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 119 transitions. [2024-06-04 17:55:19,938 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3380681818181818 [2024-06-04 17:55:19,938 INFO L175 Difference]: Start difference. First operand has 298 places, 212 transitions, 1783 flow. Second operand 11 states and 119 transitions. [2024-06-04 17:55:19,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 234 transitions, 2589 flow [2024-06-04 17:55:20,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 234 transitions, 2463 flow, removed 10 selfloop flow, removed 9 redundant places. [2024-06-04 17:55:20,269 INFO L231 Difference]: Finished difference. Result has 300 places, 214 transitions, 1821 flow [2024-06-04 17:55:20,269 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1657, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1821, PETRI_PLACES=300, PETRI_TRANSITIONS=214} [2024-06-04 17:55:20,269 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 269 predicate places. [2024-06-04 17:55:20,269 INFO L495 AbstractCegarLoop]: Abstraction has has 300 places, 214 transitions, 1821 flow [2024-06-04 17:55:20,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 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-04 17:55:20,269 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:55:20,270 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-04 17:55:20,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2024-06-04 17:55:20,270 INFO L420 AbstractCegarLoop]: === Iteration 125 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:55:20,270 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:55:20,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1872281324, now seen corresponding path program 12 times [2024-06-04 17:55:20,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:55:20,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052204259] [2024-06-04 17:55:20,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:55:20,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:55:20,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:55:26,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:55:26,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:55:26,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052204259] [2024-06-04 17:55:26,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052204259] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:55:26,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:55:26,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 17:55:26,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639931044] [2024-06-04 17:55:26,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:55:26,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 17:55:26,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:55:26,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 17:55:26,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-06-04 17:55:26,781 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:55:26,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 214 transitions, 1821 flow. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 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-04 17:55:26,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:55:26,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:55:26,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:55:27,275 INFO L124 PetriNetUnfolderBase]: 586/1123 cut-off events. [2024-06-04 17:55:27,275 INFO L125 PetriNetUnfolderBase]: For 130188/130188 co-relation queries the response was YES. [2024-06-04 17:55:27,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6371 conditions, 1123 events. 586/1123 cut-off events. For 130188/130188 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 6295 event pairs, 101 based on Foata normal form. 2/1124 useless extension candidates. Maximal degree in co-relation 6234. Up to 903 conditions per place. [2024-06-04 17:55:27,286 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 181 selfloop transitions, 51 changer transitions 0/234 dead transitions. [2024-06-04 17:55:27,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 234 transitions, 2367 flow [2024-06-04 17:55:27,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:55:27,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:55:27,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 120 transitions. [2024-06-04 17:55:27,287 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3409090909090909 [2024-06-04 17:55:27,287 INFO L175 Difference]: Start difference. First operand has 300 places, 214 transitions, 1821 flow. Second operand 11 states and 120 transitions. [2024-06-04 17:55:27,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 234 transitions, 2367 flow [2024-06-04 17:55:27,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 234 transitions, 2270 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-04 17:55:27,608 INFO L231 Difference]: Finished difference. Result has 304 places, 215 transitions, 1860 flow [2024-06-04 17:55:27,609 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1724, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1860, PETRI_PLACES=304, PETRI_TRANSITIONS=215} [2024-06-04 17:55:27,609 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 273 predicate places. [2024-06-04 17:55:27,609 INFO L495 AbstractCegarLoop]: Abstraction has has 304 places, 215 transitions, 1860 flow [2024-06-04 17:55:27,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 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-04 17:55:27,609 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:55:27,610 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-04 17:55:27,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124 [2024-06-04 17:55:27,610 INFO L420 AbstractCegarLoop]: === Iteration 126 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:55:27,610 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:55:27,610 INFO L85 PathProgramCache]: Analyzing trace with hash -616613078, now seen corresponding path program 13 times [2024-06-04 17:55:27,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:55:27,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913379795] [2024-06-04 17:55:27,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:55:27,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:55:27,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:55:33,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:55:33,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:55:33,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913379795] [2024-06-04 17:55:33,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913379795] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:55:33,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:55:33,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 17:55:33,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429357515] [2024-06-04 17:55:33,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:55:33,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 17:55:33,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:55:33,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 17:55:33,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-06-04 17:55:33,863 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:55:33,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 215 transitions, 1860 flow. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 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-04 17:55:33,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:55:33,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:55:33,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:55:34,369 INFO L124 PetriNetUnfolderBase]: 599/1154 cut-off events. [2024-06-04 17:55:34,369 INFO L125 PetriNetUnfolderBase]: For 188562/188562 co-relation queries the response was YES. [2024-06-04 17:55:34,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6250 conditions, 1154 events. 599/1154 cut-off events. For 188562/188562 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 6502 event pairs, 104 based on Foata normal form. 12/1165 useless extension candidates. Maximal degree in co-relation 6111. Up to 892 conditions per place. [2024-06-04 17:55:34,382 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 174 selfloop transitions, 55 changer transitions 7/238 dead transitions. [2024-06-04 17:55:34,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 238 transitions, 2414 flow [2024-06-04 17:55:34,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:55:34,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:55:34,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 123 transitions. [2024-06-04 17:55:34,383 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3494318181818182 [2024-06-04 17:55:34,383 INFO L175 Difference]: Start difference. First operand has 304 places, 215 transitions, 1860 flow. Second operand 11 states and 123 transitions. [2024-06-04 17:55:34,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 238 transitions, 2414 flow [2024-06-04 17:55:34,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 238 transitions, 2270 flow, removed 22 selfloop flow, removed 9 redundant places. [2024-06-04 17:55:34,718 INFO L231 Difference]: Finished difference. Result has 306 places, 212 transitions, 1810 flow [2024-06-04 17:55:34,718 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1716, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1810, PETRI_PLACES=306, PETRI_TRANSITIONS=212} [2024-06-04 17:55:34,718 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 275 predicate places. [2024-06-04 17:55:34,718 INFO L495 AbstractCegarLoop]: Abstraction has has 306 places, 212 transitions, 1810 flow [2024-06-04 17:55:34,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 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-04 17:55:34,718 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:55:34,718 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-04 17:55:34,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable125 [2024-06-04 17:55:34,718 INFO L420 AbstractCegarLoop]: === Iteration 127 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:55:34,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:55:34,719 INFO L85 PathProgramCache]: Analyzing trace with hash -616336372, now seen corresponding path program 1 times [2024-06-04 17:55:34,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:55:34,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748479220] [2024-06-04 17:55:34,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:55:34,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:55:34,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:55:40,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-04 17:55:40,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:55:40,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748479220] [2024-06-04 17:55:40,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748479220] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:55:40,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:55:40,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:55:40,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020245803] [2024-06-04 17:55:40,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:55:40,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:55:40,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:55:40,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:55:40,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:55:40,910 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:55:40,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 212 transitions, 1810 flow. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:55:40,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:55:40,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:55:40,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:55:41,381 INFO L124 PetriNetUnfolderBase]: 602/1167 cut-off events. [2024-06-04 17:55:41,381 INFO L125 PetriNetUnfolderBase]: For 205638/205638 co-relation queries the response was YES. [2024-06-04 17:55:41,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6929 conditions, 1167 events. 602/1167 cut-off events. For 205638/205638 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 6561 event pairs, 113 based on Foata normal form. 8/1174 useless extension candidates. Maximal degree in co-relation 6789. Up to 836 conditions per place. [2024-06-04 17:55:41,394 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 175 selfloop transitions, 52 changer transitions 8/237 dead transitions. [2024-06-04 17:55:41,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 237 transitions, 2606 flow [2024-06-04 17:55:41,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:55:41,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:55:41,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 124 transitions. [2024-06-04 17:55:41,395 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3522727272727273 [2024-06-04 17:55:41,395 INFO L175 Difference]: Start difference. First operand has 306 places, 212 transitions, 1810 flow. Second operand 11 states and 124 transitions. [2024-06-04 17:55:41,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 237 transitions, 2606 flow [2024-06-04 17:55:41,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 237 transitions, 2458 flow, removed 2 selfloop flow, removed 13 redundant places. [2024-06-04 17:55:41,875 INFO L231 Difference]: Finished difference. Result has 304 places, 209 transitions, 1748 flow [2024-06-04 17:55:41,875 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1662, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1748, PETRI_PLACES=304, PETRI_TRANSITIONS=209} [2024-06-04 17:55:41,875 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 273 predicate places. [2024-06-04 17:55:41,876 INFO L495 AbstractCegarLoop]: Abstraction has has 304 places, 209 transitions, 1748 flow [2024-06-04 17:55:41,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:55:41,876 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:55:41,876 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-04 17:55:41,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126 [2024-06-04 17:55:41,876 INFO L420 AbstractCegarLoop]: === Iteration 128 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:55:41,877 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:55:41,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1872275744, now seen corresponding path program 14 times [2024-06-04 17:55:41,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:55:41,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374117542] [2024-06-04 17:55:41,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:55:41,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:55:41,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:55:47,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:55:47,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:55:47,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374117542] [2024-06-04 17:55:47,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374117542] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:55:47,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:55:47,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 17:55:47,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361419804] [2024-06-04 17:55:47,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:55:47,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 17:55:47,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:55:47,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 17:55:47,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-06-04 17:55:47,754 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:55:47,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 209 transitions, 1748 flow. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 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-04 17:55:47,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:55:47,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:55:47,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:55:48,218 INFO L124 PetriNetUnfolderBase]: 587/1134 cut-off events. [2024-06-04 17:55:48,218 INFO L125 PetriNetUnfolderBase]: For 165464/165464 co-relation queries the response was YES. [2024-06-04 17:55:48,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6821 conditions, 1134 events. 587/1134 cut-off events. For 165464/165464 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 6330 event pairs, 115 based on Foata normal form. 2/1135 useless extension candidates. Maximal degree in co-relation 6681. Up to 909 conditions per place. [2024-06-04 17:55:48,230 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 179 selfloop transitions, 48 changer transitions 0/229 dead transitions. [2024-06-04 17:55:48,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 229 transitions, 2284 flow [2024-06-04 17:55:48,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:55:48,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:55:48,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 118 transitions. [2024-06-04 17:55:48,233 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3352272727272727 [2024-06-04 17:55:48,233 INFO L175 Difference]: Start difference. First operand has 304 places, 209 transitions, 1748 flow. Second operand 11 states and 118 transitions. [2024-06-04 17:55:48,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 229 transitions, 2284 flow [2024-06-04 17:55:48,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 229 transitions, 2180 flow, removed 3 selfloop flow, removed 11 redundant places. [2024-06-04 17:55:48,663 INFO L231 Difference]: Finished difference. Result has 301 places, 210 transitions, 1776 flow [2024-06-04 17:55:48,663 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1644, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1776, PETRI_PLACES=301, PETRI_TRANSITIONS=210} [2024-06-04 17:55:48,663 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 270 predicate places. [2024-06-04 17:55:48,663 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 210 transitions, 1776 flow [2024-06-04 17:55:48,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 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-04 17:55:48,664 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:55:48,664 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-04 17:55:48,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable127 [2024-06-04 17:55:48,664 INFO L420 AbstractCegarLoop]: === Iteration 129 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:55:48,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:55:48,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1872131594, now seen corresponding path program 15 times [2024-06-04 17:55:48,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:55:48,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823820429] [2024-06-04 17:55:48,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:55:48,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:55:48,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:55:54,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:55:54,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:55:54,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823820429] [2024-06-04 17:55:54,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823820429] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:55:54,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:55:54,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 17:55:54,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434779549] [2024-06-04 17:55:54,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:55:54,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 17:55:54,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:55:54,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 17:55:54,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-06-04 17:55:54,873 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:55:54,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 210 transitions, 1776 flow. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 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-04 17:55:54,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:55:54,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:55:54,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:55:55,253 INFO L124 PetriNetUnfolderBase]: 584/1129 cut-off events. [2024-06-04 17:55:55,253 INFO L125 PetriNetUnfolderBase]: For 145960/145960 co-relation queries the response was YES. [2024-06-04 17:55:55,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6507 conditions, 1129 events. 584/1129 cut-off events. For 145960/145960 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 6311 event pairs, 116 based on Foata normal form. 2/1130 useless extension candidates. Maximal degree in co-relation 6369. Up to 856 conditions per place. [2024-06-04 17:55:55,264 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 175 selfloop transitions, 52 changer transitions 0/229 dead transitions. [2024-06-04 17:55:55,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 229 transitions, 2280 flow [2024-06-04 17:55:55,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:55:55,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:55:55,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 118 transitions. [2024-06-04 17:55:55,266 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3352272727272727 [2024-06-04 17:55:55,266 INFO L175 Difference]: Start difference. First operand has 301 places, 210 transitions, 1776 flow. Second operand 11 states and 118 transitions. [2024-06-04 17:55:55,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 229 transitions, 2280 flow [2024-06-04 17:55:55,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 229 transitions, 2146 flow, removed 20 selfloop flow, removed 9 redundant places. [2024-06-04 17:55:55,681 INFO L231 Difference]: Finished difference. Result has 303 places, 210 transitions, 1750 flow [2024-06-04 17:55:55,681 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1642, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1750, PETRI_PLACES=303, PETRI_TRANSITIONS=210} [2024-06-04 17:55:55,681 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 272 predicate places. [2024-06-04 17:55:55,682 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 210 transitions, 1750 flow [2024-06-04 17:55:55,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 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-04 17:55:55,682 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:55:55,682 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-04 17:55:55,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable128 [2024-06-04 17:55:55,682 INFO L420 AbstractCegarLoop]: === Iteration 130 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:55:55,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:55:55,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1939284358, now seen corresponding path program 16 times [2024-06-04 17:55:55,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:55:55,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503610783] [2024-06-04 17:55:55,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:55:55,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:55:55,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:56:01,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:56:01,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:56:01,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503610783] [2024-06-04 17:56:01,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503610783] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:56:01,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:56:01,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 17:56:01,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567891068] [2024-06-04 17:56:01,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:56:01,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 17:56:01,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:56:01,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 17:56:01,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-06-04 17:56:01,553 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:56:01,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 210 transitions, 1750 flow. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 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-04 17:56:01,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:56:01,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:56:01,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:56:02,027 INFO L124 PetriNetUnfolderBase]: 588/1138 cut-off events. [2024-06-04 17:56:02,027 INFO L125 PetriNetUnfolderBase]: For 148198/148204 co-relation queries the response was YES. [2024-06-04 17:56:02,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6547 conditions, 1138 events. 588/1138 cut-off events. For 148198/148204 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 6373 event pairs, 111 based on Foata normal form. 2/1135 useless extension candidates. Maximal degree in co-relation 6408. Up to 744 conditions per place. [2024-06-04 17:56:02,040 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 140 selfloop transitions, 86 changer transitions 0/228 dead transitions. [2024-06-04 17:56:02,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 228 transitions, 2282 flow [2024-06-04 17:56:02,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:56:02,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:56:02,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 119 transitions. [2024-06-04 17:56:02,041 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3380681818181818 [2024-06-04 17:56:02,041 INFO L175 Difference]: Start difference. First operand has 303 places, 210 transitions, 1750 flow. Second operand 11 states and 119 transitions. [2024-06-04 17:56:02,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 228 transitions, 2282 flow [2024-06-04 17:56:02,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 228 transitions, 2121 flow, removed 7 selfloop flow, removed 11 redundant places. [2024-06-04 17:56:02,474 INFO L231 Difference]: Finished difference. Result has 303 places, 211 transitions, 1799 flow [2024-06-04 17:56:02,474 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1589, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1799, PETRI_PLACES=303, PETRI_TRANSITIONS=211} [2024-06-04 17:56:02,475 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 272 predicate places. [2024-06-04 17:56:02,475 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 211 transitions, 1799 flow [2024-06-04 17:56:02,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 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-04 17:56:02,475 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:56:02,475 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-04 17:56:02,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable129 [2024-06-04 17:56:02,476 INFO L420 AbstractCegarLoop]: === Iteration 131 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:56:02,476 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:56:02,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1585199376, now seen corresponding path program 17 times [2024-06-04 17:56:02,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:56:02,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569086488] [2024-06-04 17:56:02,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:56:02,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:56:02,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15