./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/mutex-meet/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 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/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-bcb38a6-m [2024-06-04 17:42:28,018 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-04 17:42:28,088 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:28,095 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-04 17:42:28,096 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-04 17:42:28,112 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-04 17:42:28,113 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-04 17:42:28,114 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-04 17:42:28,114 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-04 17:42:28,117 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-04 17:42:28,117 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-04 17:42:28,117 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-04 17:42:28,118 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-04 17:42:28,119 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-04 17:42:28,119 INFO L153 SettingsManager]: * Use SBE=true [2024-06-04 17:42:28,119 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-04 17:42:28,120 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-04 17:42:28,120 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-04 17:42:28,120 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-04 17:42:28,120 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-04 17:42:28,120 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-04 17:42:28,121 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-04 17:42:28,121 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-04 17:42:28,121 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-04 17:42:28,121 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-04 17:42:28,121 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-04 17:42:28,122 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-04 17:42:28,122 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-04 17:42:28,123 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-04 17:42:28,123 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-04 17:42:28,123 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-04 17:42:28,124 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-04 17:42:28,124 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 17:42:28,124 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-04 17:42:28,124 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-04 17:42:28,124 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-04 17:42:28,124 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-04 17:42:28,125 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-04 17:42:28,125 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-04 17:42:28,125 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-04 17:42:28,125 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-04 17:42:28,125 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-04 17:42:28,125 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-04 17:42:28,126 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:28,301 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-04 17:42:28,333 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-04 17:42:28,335 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-04 17:42:28,336 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-04 17:42:28,337 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-04 17:42:28,338 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/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml [2024-06-04 17:42:28,511 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-04 17:42:28,511 INFO L274 PluginConnector]: CDTParser initialized [2024-06-04 17:42:28,512 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-04 17:42:29,461 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-04 17:42:29,661 INFO L384 CDTParser]: Found 1 translation units. [2024-06-04 17:42:29,662 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-04 17:42:29,672 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22577190d/a7c0696d1c944dac96e3a352be259c33/FLAG0c2cd14c8 [2024-06-04 17:42:29,682 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22577190d/a7c0696d1c944dac96e3a352be259c33 [2024-06-04 17:42:29,682 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-04 17:42:29,683 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-04 17:42:29,684 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-04 17:42:29,684 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-04 17:42:29,688 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-04 17:42:29,688 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:28" (1/2) ... [2024-06-04 17:42:29,689 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e9c93c7 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,689 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:28" (1/2) ... [2024-06-04 17:42:29,690 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@38be397e 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,690 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 05:42:29" (2/2) ... [2024-06-04 17:42:29,691 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e9c93c7 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,691 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 05:42:29" (2/2) ... [2024-06-04 17:42:29,691 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-04 17:42:29,743 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-04 17:42:29,744 INFO L97 edCorrectnessWitness]: Location invariant before [L816-L816] ((((((((((((((((! multithreaded || (((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 2) && __unbuffered_p1_EAX <= 127) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 2) && __unbuffered_p1_EBX <= 127) && ((__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1) || __unbuffered_p1_EBX == 2)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 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 )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (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 )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 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 )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 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 )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y >= 0LL) && (2LL + (long long )__unbuffered_p0_EAX) - (long long )y >= 0LL) && (2LL + (long long )__unbuffered_p1_EAX) - (long long )y >= 0LL) && (2LL + (long long )__unbuffered_p1_EBX) - (long long )y >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y >= 0LL) && (2LL + (long long )x) - (long long )y >= 0LL) && (2LL + (long long )x$flush_delayed) - (long long )y >= 0LL) && (2LL + (long long )x$mem_tmp) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd2) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd2) - (long long )y >= 0LL) && (2LL + (long long )x$read_delayed) - (long long )y >= 0LL) && (2LL + (long long )x$w_buff0) - (long long )y >= 0LL) && (2LL + (long long )x$w_buff1) - (long long )y >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (2LL - (long long )x$read_delayed) - (long long )y >= 0LL) && (3LL - (long long )weak$$choice0) - (long long )y >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && __unbuffered_p0_EAX <= 1) && __unbuffered_p1_EAX <= 127) && __unbuffered_p1_EBX <= 127) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 1) && y <= 2) && y <= 127) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (x == 0 || x == 1)) && (x$mem_tmp == 0 || x$mem_tmp == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 1)) && (x$w_buff1 == 0 || x$w_buff1 == 1)) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)) && ((__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1) || __unbuffered_p1_EBX == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1))) [2024-06-04 17:42:29,744 INFO L97 edCorrectnessWitness]: Location invariant before [L817-L817] ((((((((((((((((! multithreaded || (((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 2) && __unbuffered_p1_EAX <= 127) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 2) && __unbuffered_p1_EBX <= 127) && ((__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1) || __unbuffered_p1_EBX == 2)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 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 )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (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 )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 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 )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 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 )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y >= 0LL) && (2LL + (long long )__unbuffered_p0_EAX) - (long long )y >= 0LL) && (2LL + (long long )__unbuffered_p1_EAX) - (long long )y >= 0LL) && (2LL + (long long )__unbuffered_p1_EBX) - (long long )y >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y >= 0LL) && (2LL + (long long )x) - (long long )y >= 0LL) && (2LL + (long long )x$flush_delayed) - (long long )y >= 0LL) && (2LL + (long long )x$mem_tmp) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd2) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd2) - (long long )y >= 0LL) && (2LL + (long long )x$read_delayed) - (long long )y >= 0LL) && (2LL + (long long )x$w_buff0) - (long long )y >= 0LL) && (2LL + (long long )x$w_buff1) - (long long )y >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (2LL - (long long )x$read_delayed) - (long long )y >= 0LL) && (3LL - (long long )weak$$choice0) - (long long )y >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && __unbuffered_p0_EAX <= 1) && __unbuffered_p1_EAX <= 127) && __unbuffered_p1_EBX <= 127) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 1) && y <= 2) && y <= 127) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (x == 0 || x == 1)) && (x$mem_tmp == 0 || x$mem_tmp == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 1)) && (x$w_buff1 == 0 || x$w_buff1 == 1)) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)) && ((__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1) || __unbuffered_p1_EBX == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1))) [2024-06-04 17:42:29,745 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-04 17:42:29,745 INFO L106 edCorrectnessWitness]: ghost_update [L814-L814] multithreaded = 1; [2024-06-04 17:42:29,787 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-04 17:42:30,055 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 17:42:30,064 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-04 17:42:30,352 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 17:42:30,380 INFO L206 MainTranslator]: Completed translation [2024-06-04 17:42:30,380 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:42:30 WrapperNode [2024-06-04 17:42:30,381 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-04 17:42:30,382 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-04 17:42:30,382 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-04 17:42:30,383 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-04 17:42:30,388 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:42:30" (1/1) ... [2024-06-04 17:42:30,424 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:42:30" (1/1) ... [2024-06-04 17:42:30,509 INFO L138 Inliner]: procedures = 174, calls = 40, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 120 [2024-06-04 17:42:30,510 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-04 17:42:30,510 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-04 17:42:30,511 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-04 17:42:30,511 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-04 17:42:30,520 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:42:30" (1/1) ... [2024-06-04 17:42:30,520 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:42:30" (1/1) ... [2024-06-04 17:42:30,537 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:42:30" (1/1) ... [2024-06-04 17:42:30,569 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,570 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:42:30" (1/1) ... [2024-06-04 17:42:30,570 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:42:30" (1/1) ... [2024-06-04 17:42:30,591 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:42:30" (1/1) ... [2024-06-04 17:42:30,601 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:42:30" (1/1) ... [2024-06-04 17:42:30,609 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:42:30" (1/1) ... [2024-06-04 17:42:30,614 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:42:30" (1/1) ... [2024-06-04 17:42:30,635 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-04 17:42:30,636 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-04 17:42:30,636 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-04 17:42:30,636 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-04 17:42:30,637 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:42:30" (1/1) ... [2024-06-04 17:42:30,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 17:42:30,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-04 17:42:30,660 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,670 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,693 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-04 17:42:30,693 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-04 17:42:30,693 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-04 17:42:30,693 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-04 17:42:30,694 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-04 17:42:30,694 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-04 17:42:30,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-04 17:42:30,694 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-04 17:42:30,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-04 17:42:30,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-04 17:42:30,695 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,809 INFO L244 CfgBuilder]: Building ICFG [2024-06-04 17:42:30,810 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-04 17:42:31,477 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-04 17:42:31,477 INFO L293 CfgBuilder]: Performing block encoding [2024-06-04 17:42:31,649 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-04 17:42:31,649 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-04 17:42:31,651 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 05:42:31 BoogieIcfgContainer [2024-06-04 17:42:31,651 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-04 17:42:31,654 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-04 17:42:31,654 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-04 17:42:31,657 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-04 17:42:31,657 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:28" (1/4) ... [2024-06-04 17:42:31,658 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58e77d51 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,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.06 05:42:29" (2/4) ... [2024-06-04 17:42:31,665 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58e77d51 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,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:42:30" (3/4) ... [2024-06-04 17:42:31,666 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58e77d51 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,666 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 05:42:31" (4/4) ... [2024-06-04 17:42:31,667 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-04 17:42:31,681 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-04 17:42:31,682 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-04 17:42:31,682 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-04 17:42:31,742 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-04 17:42:31,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 33 transitions, 74 flow [2024-06-04 17:42:31,806 INFO L124 PetriNetUnfolderBase]: 0/31 cut-off events. [2024-06-04 17:42:31,806 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 17:42:31,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 31 events. 0/31 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 44 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-04 17:42:31,808 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 33 transitions, 74 flow [2024-06-04 17:42:31,810 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 25 transitions, 56 flow [2024-06-04 17:42:31,821 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-04 17:42:31,855 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;@d5fad2c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-04 17:42:31,855 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-04 17:42:31,876 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-04 17:42:31,877 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-04 17:42:31,877 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 17:42:31,877 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:42:31,878 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-04 17:42:31,878 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,882 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:42:31,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1491043083, now seen corresponding path program 1 times [2024-06-04 17:42:31,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:42:31,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604714922] [2024-06-04 17:42:31,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:42:31,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:42:32,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:42:35,823 INFO 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:35,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:42:35,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604714922] [2024-06-04 17:42:35,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604714922] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:42:35,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:42:35,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-04 17:42:35,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426592956] [2024-06-04 17:42:35,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:42:35,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-04 17:42:35,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:42:35,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-04 17:42:35,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-04 17:42:35,917 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 33 [2024-06-04 17:42:35,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 25 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:42:35,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:42:35,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 33 [2024-06-04 17:42:35,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:42:36,128 INFO L124 PetriNetUnfolderBase]: 131/270 cut-off events. [2024-06-04 17:42:36,129 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-06-04 17:42:36,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 528 conditions, 270 events. 131/270 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1073 event pairs, 75 based on Foata normal form. 1/258 useless extension candidates. Maximal degree in co-relation 514. Up to 235 conditions per place. [2024-06-04 17:42:36,134 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 22 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2024-06-04 17:42:36,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 31 transitions, 121 flow [2024-06-04 17:42:36,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-04 17:42:36,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-04 17:42:36,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2024-06-04 17:42:36,145 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6060606060606061 [2024-06-04 17:42:36,146 INFO L175 Difference]: Start difference. First operand has 32 places, 25 transitions, 56 flow. Second operand 3 states and 60 transitions. [2024-06-04 17:42:36,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 31 transitions, 121 flow [2024-06-04 17:42:36,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 31 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-04 17:42:36,150 INFO L231 Difference]: Finished difference. Result has 33 places, 27 transitions, 75 flow [2024-06-04 17:42:36,151 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=75, PETRI_PLACES=33, PETRI_TRANSITIONS=27} [2024-06-04 17:42:36,155 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 1 predicate places. [2024-06-04 17:42:36,155 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 27 transitions, 75 flow [2024-06-04 17:42:36,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:42:36,156 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:42:36,156 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:42:36,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-04 17:42:36,156 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:36,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:42:36,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1626464162, now seen corresponding path program 1 times [2024-06-04 17:42:36,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:42:36,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139092387] [2024-06-04 17:42:36,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:42:36,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:42:36,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:42:39,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:42:39,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:42:39,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139092387] [2024-06-04 17:42:39,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139092387] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:42:39,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:42:39,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-04 17:42:39,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9100108] [2024-06-04 17:42:39,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:42:39,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-04 17:42:39,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:42:39,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-04 17:42:39,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-04 17:42:39,111 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2024-06-04 17:42:39,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 27 transitions, 75 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 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:39,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:42:39,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2024-06-04 17:42:39,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:42:39,290 INFO L124 PetriNetUnfolderBase]: 172/323 cut-off events. [2024-06-04 17:42:39,290 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2024-06-04 17:42:39,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 738 conditions, 323 events. 172/323 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1254 event pairs, 79 based on Foata normal form. 2/324 useless extension candidates. Maximal degree in co-relation 723. Up to 295 conditions per place. [2024-06-04 17:42:39,295 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 28 selfloop transitions, 5 changer transitions 0/37 dead transitions. [2024-06-04 17:42:39,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 37 transitions, 167 flow [2024-06-04 17:42:39,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-04 17:42:39,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-04 17:42:39,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2024-06-04 17:42:39,299 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5378787878787878 [2024-06-04 17:42:39,299 INFO L175 Difference]: Start difference. First operand has 33 places, 27 transitions, 75 flow. Second operand 4 states and 71 transitions. [2024-06-04 17:42:39,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 37 transitions, 167 flow [2024-06-04 17:42:39,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 37 transitions, 164 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-04 17:42:39,303 INFO L231 Difference]: Finished difference. Result has 36 places, 29 transitions, 99 flow [2024-06-04 17:42:39,303 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=99, PETRI_PLACES=36, PETRI_TRANSITIONS=29} [2024-06-04 17:42:39,304 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 4 predicate places. [2024-06-04 17:42:39,305 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 29 transitions, 99 flow [2024-06-04 17:42:39,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 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:39,305 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:42:39,305 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:42:39,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-04 17:42:39,306 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:39,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:42:39,308 INFO L85 PathProgramCache]: Analyzing trace with hash 169841225, now seen corresponding path program 1 times [2024-06-04 17:42:39,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:42:39,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549651251] [2024-06-04 17:42:39,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:42:39,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:42:39,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:42:43,037 INFO 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:43,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:42:43,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549651251] [2024-06-04 17:42:43,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549651251] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:42:43,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:42:43,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 17:42:43,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48053375] [2024-06-04 17:42:43,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:42:43,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 17:42:43,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:42:43,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 17:42:43,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-04 17:42:43,093 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2024-06-04 17:42:43,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 29 transitions, 99 flow. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 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:42:43,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:42:43,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2024-06-04 17:42:43,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:42:43,378 INFO L124 PetriNetUnfolderBase]: 169/318 cut-off events. [2024-06-04 17:42:43,378 INFO L125 PetriNetUnfolderBase]: For 197/197 co-relation queries the response was YES. [2024-06-04 17:42:43,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 809 conditions, 318 events. 169/318 cut-off events. For 197/197 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1228 event pairs, 55 based on Foata normal form. 2/319 useless extension candidates. Maximal degree in co-relation 792. Up to 281 conditions per place. [2024-06-04 17:42:43,381 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 32 selfloop transitions, 7 changer transitions 0/43 dead transitions. [2024-06-04 17:42:43,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 43 transitions, 215 flow [2024-06-04 17:42:43,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 17:42:43,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 17:42:43,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2024-06-04 17:42:43,385 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5212121212121212 [2024-06-04 17:42:43,385 INFO L175 Difference]: Start difference. First operand has 36 places, 29 transitions, 99 flow. Second operand 5 states and 86 transitions. [2024-06-04 17:42:43,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 43 transitions, 215 flow [2024-06-04 17:42:43,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 43 transitions, 206 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-04 17:42:43,387 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 123 flow [2024-06-04 17:42:43,388 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=123, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2024-06-04 17:42:43,389 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 7 predicate places. [2024-06-04 17:42:43,389 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 123 flow [2024-06-04 17:42:43,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 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:42:43,390 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:42:43,390 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:42:43,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-04 17:42:43,390 INFO L420 AbstractCegarLoop]: === Iteration 4 === 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:43,391 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:42:43,391 INFO L85 PathProgramCache]: Analyzing trace with hash 211099886, now seen corresponding path program 1 times [2024-06-04 17:42:43,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:42:43,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344197147] [2024-06-04 17:42:43,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:42:43,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:42:43,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:42:48,636 INFO 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,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:42:48,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344197147] [2024-06-04 17:42:48,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344197147] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:42:48,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:42:48,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 17:42:48,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766934629] [2024-06-04 17:42:48,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:42:48,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 17:42:48,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:42:48,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 17:42:48,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-04 17:42:48,736 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2024-06-04 17:42:48,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 123 flow. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 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:42:48,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:42:48,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2024-06-04 17:42:48,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:42:48,921 INFO L124 PetriNetUnfolderBase]: 123/265 cut-off events. [2024-06-04 17:42:48,921 INFO L125 PetriNetUnfolderBase]: For 265/265 co-relation queries the response was YES. [2024-06-04 17:42:48,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 711 conditions, 265 events. 123/265 cut-off events. For 265/265 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1039 event pairs, 38 based on Foata normal form. 1/262 useless extension candidates. Maximal degree in co-relation 693. Up to 219 conditions per place. [2024-06-04 17:42:48,923 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 26 selfloop transitions, 6 changer transitions 0/38 dead transitions. [2024-06-04 17:42:48,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 38 transitions, 205 flow [2024-06-04 17:42:48,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 17:42:48,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 17:42:48,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2024-06-04 17:42:48,926 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47878787878787876 [2024-06-04 17:42:48,926 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 123 flow. Second operand 5 states and 79 transitions. [2024-06-04 17:42:48,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 38 transitions, 205 flow [2024-06-04 17:42:48,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 38 transitions, 190 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-04 17:42:48,929 INFO L231 Difference]: Finished difference. Result has 41 places, 33 transitions, 135 flow [2024-06-04 17:42:48,929 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=135, PETRI_PLACES=41, PETRI_TRANSITIONS=33} [2024-06-04 17:42:48,930 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 9 predicate places. [2024-06-04 17:42:48,930 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 33 transitions, 135 flow [2024-06-04 17:42:48,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 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:42:48,930 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:42:48,931 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:42:48,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-04 17:42:48,931 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:42:48,931 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:42:48,931 INFO L85 PathProgramCache]: Analyzing trace with hash 8700904, now seen corresponding path program 1 times [2024-06-04 17:42:48,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:42:48,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924522643] [2024-06-04 17:42:48,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:42:48,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:42:48,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:42:52,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:42:52,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:42:52,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924522643] [2024-06-04 17:42:52,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924522643] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:42:52,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:42:52,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 17:42:52,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443378059] [2024-06-04 17:42:52,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:42:52,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 17:42:52,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:42:52,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 17:42:52,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-04 17:42:52,242 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2024-06-04 17:42:52,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 33 transitions, 135 flow. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call 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:52,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:42:52,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2024-06-04 17:42:52,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:42:52,497 INFO L124 PetriNetUnfolderBase]: 163/307 cut-off events. [2024-06-04 17:42:52,498 INFO L125 PetriNetUnfolderBase]: For 475/475 co-relation queries the response was YES. [2024-06-04 17:42:52,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 910 conditions, 307 events. 163/307 cut-off events. For 475/475 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1168 event pairs, 29 based on Foata normal form. 4/310 useless extension candidates. Maximal degree in co-relation 890. Up to 252 conditions per place. [2024-06-04 17:42:52,501 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 34 selfloop transitions, 8 changer transitions 0/46 dead transitions. [2024-06-04 17:42:52,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 46 transitions, 245 flow [2024-06-04 17:42:52,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:42:52,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:42:52,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions. [2024-06-04 17:42:52,502 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486 [2024-06-04 17:42:52,503 INFO L175 Difference]: Start difference. First operand has 41 places, 33 transitions, 135 flow. Second operand 6 states and 96 transitions. [2024-06-04 17:42:52,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 46 transitions, 245 flow [2024-06-04 17:42:52,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 46 transitions, 234 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-04 17:42:52,506 INFO L231 Difference]: Finished difference. Result has 43 places, 32 transitions, 136 flow [2024-06-04 17:42:52,507 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=136, PETRI_PLACES=43, PETRI_TRANSITIONS=32} [2024-06-04 17:42:52,511 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 11 predicate places. [2024-06-04 17:42:52,511 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 32 transitions, 136 flow [2024-06-04 17:42:52,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call 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:52,511 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:42:52,512 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:42:52,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-04 17:42:52,513 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:52,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:42:52,513 INFO L85 PathProgramCache]: Analyzing trace with hash -2045837293, now seen corresponding path program 1 times [2024-06-04 17:42:52,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:42:52,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541171313] [2024-06-04 17:42:52,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:42:52,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:42:52,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:42:57,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:42:57,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:42:57,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541171313] [2024-06-04 17:42:57,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541171313] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:42:57,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:42:57,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 17:42:57,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783281904] [2024-06-04 17:42:57,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:42:57,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 17:42:57,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:42:57,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 17:42:57,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-04 17:42:57,596 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:42:57,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 32 transitions, 136 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 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:42:57,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:42:57,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:42:57,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:42:57,794 INFO L124 PetriNetUnfolderBase]: 179/337 cut-off events. [2024-06-04 17:42:57,795 INFO L125 PetriNetUnfolderBase]: For 705/705 co-relation queries the response was YES. [2024-06-04 17:42:57,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1037 conditions, 337 events. 179/337 cut-off events. For 705/705 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1350 event pairs, 49 based on Foata normal form. 3/338 useless extension candidates. Maximal degree in co-relation 1017. Up to 269 conditions per place. [2024-06-04 17:42:57,797 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 31 selfloop transitions, 12 changer transitions 0/47 dead transitions. [2024-06-04 17:42:57,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 47 transitions, 278 flow [2024-06-04 17:42:57,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:42:57,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:42:57,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2024-06-04 17:42:57,798 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-06-04 17:42:57,798 INFO L175 Difference]: Start difference. First operand has 43 places, 32 transitions, 136 flow. Second operand 6 states and 88 transitions. [2024-06-04 17:42:57,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 47 transitions, 278 flow [2024-06-04 17:42:57,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 47 transitions, 258 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-04 17:42:57,801 INFO L231 Difference]: Finished difference. Result has 46 places, 38 transitions, 184 flow [2024-06-04 17:42:57,801 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=184, PETRI_PLACES=46, PETRI_TRANSITIONS=38} [2024-06-04 17:42:57,802 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 14 predicate places. [2024-06-04 17:42:57,802 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 38 transitions, 184 flow [2024-06-04 17:42:57,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 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:42:57,802 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:42:57,802 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:42:57,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-04 17:42:57,803 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:42:57,803 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:42:57,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1316054797, now seen corresponding path program 1 times [2024-06-04 17:42:57,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:42:57,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038205843] [2024-06-04 17:42:57,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:42:57,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:42:57,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:43:02,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:43:02,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:43:02,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038205843] [2024-06-04 17:43:02,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038205843] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:43:02,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:43:02,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 17:43:02,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58617654] [2024-06-04 17:43:02,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:43:02,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 17:43:02,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:43:02,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 17:43:02,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-04 17:43:02,556 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:43:02,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 38 transitions, 184 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 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:02,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:43:02,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:43:02,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:43:02,773 INFO L124 PetriNetUnfolderBase]: 189/360 cut-off events. [2024-06-04 17:43:02,773 INFO L125 PetriNetUnfolderBase]: For 1011/1011 co-relation queries the response was YES. [2024-06-04 17:43:02,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1247 conditions, 360 events. 189/360 cut-off events. For 1011/1011 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1453 event pairs, 53 based on Foata normal form. 2/361 useless extension candidates. Maximal degree in co-relation 1224. Up to 315 conditions per place. [2024-06-04 17:43:02,775 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 39 selfloop transitions, 11 changer transitions 0/54 dead transitions. [2024-06-04 17:43:02,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 54 transitions, 346 flow [2024-06-04 17:43:02,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:43:02,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:43:02,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 97 transitions. [2024-06-04 17:43:02,789 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4199134199134199 [2024-06-04 17:43:02,789 INFO L175 Difference]: Start difference. First operand has 46 places, 38 transitions, 184 flow. Second operand 7 states and 97 transitions. [2024-06-04 17:43:02,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 54 transitions, 346 flow [2024-06-04 17:43:02,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 54 transitions, 332 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-06-04 17:43:02,792 INFO L231 Difference]: Finished difference. Result has 52 places, 43 transitions, 239 flow [2024-06-04 17:43:02,792 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=239, PETRI_PLACES=52, PETRI_TRANSITIONS=43} [2024-06-04 17:43:02,793 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 20 predicate places. [2024-06-04 17:43:02,793 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 43 transitions, 239 flow [2024-06-04 17:43:02,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 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:02,793 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:43:02,793 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:43:02,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-04 17:43:02,796 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:02,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:43:02,797 INFO L85 PathProgramCache]: Analyzing trace with hash 110298893, now seen corresponding path program 2 times [2024-06-04 17:43:02,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:43:02,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282645222] [2024-06-04 17:43:02,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:43:02,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:43:02,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:43:07,793 INFO 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:07,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:43:07,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282645222] [2024-06-04 17:43:07,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282645222] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:43:07,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:43:07,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 17:43:07,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534470588] [2024-06-04 17:43:07,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:43:07,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 17:43:07,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:43:07,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 17:43:07,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-04 17:43:07,855 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:43:07,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 239 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 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:07,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:43:07,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:43:07,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:43:08,141 INFO L124 PetriNetUnfolderBase]: 195/374 cut-off events. [2024-06-04 17:43:08,141 INFO L125 PetriNetUnfolderBase]: For 1378/1378 co-relation queries the response was YES. [2024-06-04 17:43:08,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1384 conditions, 374 events. 195/374 cut-off events. For 1378/1378 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1535 event pairs, 50 based on Foata normal form. 2/375 useless extension candidates. Maximal degree in co-relation 1358. Up to 319 conditions per place. [2024-06-04 17:43:08,143 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 38 selfloop transitions, 12 changer transitions 0/54 dead transitions. [2024-06-04 17:43:08,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 54 transitions, 384 flow [2024-06-04 17:43:08,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:43:08,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:43:08,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 85 transitions. [2024-06-04 17:43:08,145 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4292929292929293 [2024-06-04 17:43:08,145 INFO L175 Difference]: Start difference. First operand has 52 places, 43 transitions, 239 flow. Second operand 6 states and 85 transitions. [2024-06-04 17:43:08,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 54 transitions, 384 flow [2024-06-04 17:43:08,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 54 transitions, 363 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-04 17:43:08,147 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 273 flow [2024-06-04 17:43:08,147 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=273, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2024-06-04 17:43:08,148 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 22 predicate places. [2024-06-04 17:43:08,148 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 273 flow [2024-06-04 17:43:08,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 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:08,148 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:43:08,148 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:43:08,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-04 17:43:08,149 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:08,149 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:43:08,149 INFO L85 PathProgramCache]: Analyzing trace with hash 116965133, now seen corresponding path program 3 times [2024-06-04 17:43:08,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:43:08,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221788749] [2024-06-04 17:43:08,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:43:08,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:43:08,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:43:12,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:43:12,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:43:12,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221788749] [2024-06-04 17:43:12,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221788749] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:43:12,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:43:12,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 17:43:12,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856373836] [2024-06-04 17:43:12,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:43:12,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 17:43:12,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:43:12,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 17:43:12,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-04 17:43:13,082 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:43:13,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 273 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 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:13,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:43:13,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:43:13,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:43:13,295 INFO L124 PetriNetUnfolderBase]: 185/356 cut-off events. [2024-06-04 17:43:13,295 INFO L125 PetriNetUnfolderBase]: For 1675/1675 co-relation queries the response was YES. [2024-06-04 17:43:13,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1347 conditions, 356 events. 185/356 cut-off events. For 1675/1675 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1459 event pairs, 52 based on Foata normal form. 4/357 useless extension candidates. Maximal degree in co-relation 1320. Up to 269 conditions per place. [2024-06-04 17:43:13,298 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 33 selfloop transitions, 16 changer transitions 0/53 dead transitions. [2024-06-04 17:43:13,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 53 transitions, 395 flow [2024-06-04 17:43:13,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:43:13,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:43:13,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2024-06-04 17:43:13,299 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4393939393939394 [2024-06-04 17:43:13,299 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 273 flow. Second operand 6 states and 87 transitions. [2024-06-04 17:43:13,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 53 transitions, 395 flow [2024-06-04 17:43:13,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 53 transitions, 365 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-04 17:43:13,301 INFO L231 Difference]: Finished difference. Result has 56 places, 45 transitions, 282 flow [2024-06-04 17:43:13,301 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=282, PETRI_PLACES=56, PETRI_TRANSITIONS=45} [2024-06-04 17:43:13,302 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 24 predicate places. [2024-06-04 17:43:13,302 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 45 transitions, 282 flow [2024-06-04 17:43:13,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 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:13,302 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:43:13,302 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:43:13,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-04 17:43:13,303 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:13,303 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:43:13,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1003554221, now seen corresponding path program 1 times [2024-06-04 17:43:13,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:43:13,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032554769] [2024-06-04 17:43:13,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:43:13,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:43:13,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:43:18,417 INFO 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:18,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:43:18,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032554769] [2024-06-04 17:43:18,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032554769] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:43:18,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:43:18,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:43:18,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067038472] [2024-06-04 17:43:18,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:43:18,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:43:18,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:43:18,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:43:18,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:43:18,520 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:43:18,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 45 transitions, 282 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 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:43:18,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:43:18,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:43:18,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:43:18,761 INFO L124 PetriNetUnfolderBase]: 194/371 cut-off events. [2024-06-04 17:43:18,761 INFO L125 PetriNetUnfolderBase]: For 1613/1613 co-relation queries the response was YES. [2024-06-04 17:43:18,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1396 conditions, 371 events. 194/371 cut-off events. For 1613/1613 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1532 event pairs, 51 based on Foata normal form. 3/371 useless extension candidates. Maximal degree in co-relation 1368. Up to 260 conditions per place. [2024-06-04 17:43:18,764 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 35 selfloop transitions, 22 changer transitions 0/61 dead transitions. [2024-06-04 17:43:18,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 61 transitions, 468 flow [2024-06-04 17:43:18,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:43:18,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:43:18,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 102 transitions. [2024-06-04 17:43:18,767 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44155844155844154 [2024-06-04 17:43:18,767 INFO L175 Difference]: Start difference. First operand has 56 places, 45 transitions, 282 flow. Second operand 7 states and 102 transitions. [2024-06-04 17:43:18,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 61 transitions, 468 flow [2024-06-04 17:43:18,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 61 transitions, 423 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-04 17:43:18,770 INFO L231 Difference]: Finished difference. Result has 58 places, 50 transitions, 317 flow [2024-06-04 17:43:18,771 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=317, PETRI_PLACES=58, PETRI_TRANSITIONS=50} [2024-06-04 17:43:18,772 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 26 predicate places. [2024-06-04 17:43:18,772 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 50 transitions, 317 flow [2024-06-04 17:43:18,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 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:43:18,772 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:43:18,772 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:43:18,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-04 17:43:18,773 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:18,773 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:43:18,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1045410674, now seen corresponding path program 1 times [2024-06-04 17:43:18,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:43:18,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688499906] [2024-06-04 17:43:18,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:43:18,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:43:18,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:43:24,311 INFO 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:24,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:43:24,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688499906] [2024-06-04 17:43:24,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688499906] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:43:24,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:43:24,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:43:24,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929311778] [2024-06-04 17:43:24,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:43:24,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:43:24,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:43:24,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:43:24,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:43:24,418 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:43:24,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 50 transitions, 317 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:43:24,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:43:24,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:43:24,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:43:24,690 INFO L124 PetriNetUnfolderBase]: 203/386 cut-off events. [2024-06-04 17:43:24,690 INFO L125 PetriNetUnfolderBase]: For 1939/1939 co-relation queries the response was YES. [2024-06-04 17:43:24,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1530 conditions, 386 events. 203/386 cut-off events. For 1939/1939 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1607 event pairs, 54 based on Foata normal form. 3/386 useless extension candidates. Maximal degree in co-relation 1501. Up to 249 conditions per place. [2024-06-04 17:43:24,693 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 38 selfloop transitions, 26 changer transitions 0/68 dead transitions. [2024-06-04 17:43:24,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 68 transitions, 531 flow [2024-06-04 17:43:24,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:43:24,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:43:24,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 116 transitions. [2024-06-04 17:43:24,694 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4393939393939394 [2024-06-04 17:43:24,694 INFO L175 Difference]: Start difference. First operand has 58 places, 50 transitions, 317 flow. Second operand 8 states and 116 transitions. [2024-06-04 17:43:24,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 68 transitions, 531 flow [2024-06-04 17:43:24,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 68 transitions, 506 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-04 17:43:24,697 INFO L231 Difference]: Finished difference. Result has 63 places, 55 transitions, 386 flow [2024-06-04 17:43:24,698 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=386, PETRI_PLACES=63, PETRI_TRANSITIONS=55} [2024-06-04 17:43:24,698 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 31 predicate places. [2024-06-04 17:43:24,698 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 55 transitions, 386 flow [2024-06-04 17:43:24,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:43:24,698 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:43:24,699 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:24,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-04 17:43:24,699 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:24,699 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:43:24,699 INFO L85 PathProgramCache]: Analyzing trace with hash 407007084, now seen corresponding path program 1 times [2024-06-04 17:43:24,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:43:24,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477105358] [2024-06-04 17:43:24,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:43:24,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:43:24,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:43:29,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:43:29,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:43:29,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477105358] [2024-06-04 17:43:29,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477105358] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:43:29,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:43:29,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:43:29,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804894043] [2024-06-04 17:43:29,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:43:29,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:43:29,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:43:29,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:43:29,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:43:29,475 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:43:29,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 55 transitions, 386 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 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:43:29,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:43:29,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:43:29,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:43:29,754 INFO L124 PetriNetUnfolderBase]: 201/385 cut-off events. [2024-06-04 17:43:29,755 INFO L125 PetriNetUnfolderBase]: For 2258/2258 co-relation queries the response was YES. [2024-06-04 17:43:29,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1646 conditions, 385 events. 201/385 cut-off events. For 2258/2258 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1595 event pairs, 56 based on Foata normal form. 1/385 useless extension candidates. Maximal degree in co-relation 1615. Up to 327 conditions per place. [2024-06-04 17:43:29,757 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 53 selfloop transitions, 12 changer transitions 0/69 dead transitions. [2024-06-04 17:43:29,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 69 transitions, 566 flow [2024-06-04 17:43:29,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:43:29,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:43:29,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 98 transitions. [2024-06-04 17:43:29,758 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2024-06-04 17:43:29,758 INFO L175 Difference]: Start difference. First operand has 63 places, 55 transitions, 386 flow. Second operand 7 states and 98 transitions. [2024-06-04 17:43:29,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 69 transitions, 566 flow [2024-06-04 17:43:29,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 69 transitions, 533 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-06-04 17:43:29,762 INFO L231 Difference]: Finished difference. Result has 66 places, 57 transitions, 402 flow [2024-06-04 17:43:29,762 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=402, PETRI_PLACES=66, PETRI_TRANSITIONS=57} [2024-06-04 17:43:29,762 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 34 predicate places. [2024-06-04 17:43:29,763 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 57 transitions, 402 flow [2024-06-04 17:43:29,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 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:43:29,763 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:43:29,763 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:29,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-04 17:43:29,763 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:29,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:43:29,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1952314130, now seen corresponding path program 1 times [2024-06-04 17:43:29,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:43:29,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546210572] [2024-06-04 17:43:29,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:43:29,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:43:29,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:43:35,175 INFO 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:35,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:43:35,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546210572] [2024-06-04 17:43:35,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546210572] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:43:35,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:43:35,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:43:35,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993052469] [2024-06-04 17:43:35,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:43:35,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:43:35,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:43:35,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:43:35,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:43:35,290 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:43:35,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 57 transitions, 402 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:43:35,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:43:35,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:43:35,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:43:35,502 INFO L124 PetriNetUnfolderBase]: 207/401 cut-off events. [2024-06-04 17:43:35,502 INFO L125 PetriNetUnfolderBase]: For 2722/2722 co-relation queries the response was YES. [2024-06-04 17:43:35,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1742 conditions, 401 events. 207/401 cut-off events. For 2722/2722 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1708 event pairs, 51 based on Foata normal form. 2/400 useless extension candidates. Maximal degree in co-relation 1709. Up to 278 conditions per place. [2024-06-04 17:43:35,505 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 44 selfloop transitions, 22 changer transitions 0/70 dead transitions. [2024-06-04 17:43:35,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 70 transitions, 602 flow [2024-06-04 17:43:35,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:43:35,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:43:35,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 102 transitions. [2024-06-04 17:43:35,506 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44155844155844154 [2024-06-04 17:43:35,506 INFO L175 Difference]: Start difference. First operand has 66 places, 57 transitions, 402 flow. Second operand 7 states and 102 transitions. [2024-06-04 17:43:35,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 70 transitions, 602 flow [2024-06-04 17:43:35,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 70 transitions, 569 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-04 17:43:35,512 INFO L231 Difference]: Finished difference. Result has 68 places, 59 transitions, 432 flow [2024-06-04 17:43:35,512 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=369, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=432, PETRI_PLACES=68, PETRI_TRANSITIONS=59} [2024-06-04 17:43:35,513 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 36 predicate places. [2024-06-04 17:43:35,513 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 59 transitions, 432 flow [2024-06-04 17:43:35,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:43:35,514 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:43:35,514 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:35,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-04 17:43:35,514 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:35,514 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:43:35,514 INFO L85 PathProgramCache]: Analyzing trace with hash 742652384, now seen corresponding path program 2 times [2024-06-04 17:43:35,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:43:35,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555137725] [2024-06-04 17:43:35,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:43:35,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:43:35,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:43:41,207 INFO 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:41,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:43:41,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555137725] [2024-06-04 17:43:41,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555137725] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:43:41,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:43:41,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:43:41,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126375938] [2024-06-04 17:43:41,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:43:41,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:43:41,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:43:41,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:43:41,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:43:41,334 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:43:41,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 59 transitions, 432 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:43:41,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:43:41,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:43:41,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:43:41,646 INFO L124 PetriNetUnfolderBase]: 203/391 cut-off events. [2024-06-04 17:43:41,646 INFO L125 PetriNetUnfolderBase]: For 2991/2991 co-relation queries the response was YES. [2024-06-04 17:43:41,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1750 conditions, 391 events. 203/391 cut-off events. For 2991/2991 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1638 event pairs, 47 based on Foata normal form. 2/390 useless extension candidates. Maximal degree in co-relation 1716. Up to 275 conditions per place. [2024-06-04 17:43:41,649 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 43 selfloop transitions, 24 changer transitions 0/71 dead transitions. [2024-06-04 17:43:41,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 71 transitions, 602 flow [2024-06-04 17:43:41,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:43:41,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:43:41,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 113 transitions. [2024-06-04 17:43:41,650 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42803030303030304 [2024-06-04 17:43:41,651 INFO L175 Difference]: Start difference. First operand has 68 places, 59 transitions, 432 flow. Second operand 8 states and 113 transitions. [2024-06-04 17:43:41,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 71 transitions, 602 flow [2024-06-04 17:43:41,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 71 transitions, 547 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-04 17:43:41,655 INFO L231 Difference]: Finished difference. Result has 71 places, 59 transitions, 430 flow [2024-06-04 17:43:41,655 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=377, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=430, PETRI_PLACES=71, PETRI_TRANSITIONS=59} [2024-06-04 17:43:41,655 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 39 predicate places. [2024-06-04 17:43:41,655 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 59 transitions, 430 flow [2024-06-04 17:43:41,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:43:41,656 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:43:41,656 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:41,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-04 17:43:41,656 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:41,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:43:41,657 INFO L85 PathProgramCache]: Analyzing trace with hash 742951596, now seen corresponding path program 1 times [2024-06-04 17:43:41,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:43:41,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498184462] [2024-06-04 17:43:41,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:43:41,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:43:41,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:43:48,073 INFO 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,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:43:48,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498184462] [2024-06-04 17:43:48,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498184462] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:43:48,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:43:48,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:43:48,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869939348] [2024-06-04 17:43:48,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:43:48,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:43:48,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:43:48,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:43:48,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:43:48,216 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:43:48,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 59 transitions, 430 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call 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,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:43:48,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:43:48,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:43:48,498 INFO L124 PetriNetUnfolderBase]: 207/398 cut-off events. [2024-06-04 17:43:48,498 INFO L125 PetriNetUnfolderBase]: For 3337/3337 co-relation queries the response was YES. [2024-06-04 17:43:48,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1797 conditions, 398 events. 207/398 cut-off events. For 3337/3337 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1667 event pairs, 48 based on Foata normal form. 3/398 useless extension candidates. Maximal degree in co-relation 1762. Up to 245 conditions per place. [2024-06-04 17:43:48,501 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 42 selfloop transitions, 31 changer transitions 0/77 dead transitions. [2024-06-04 17:43:48,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 77 transitions, 672 flow [2024-06-04 17:43:48,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:43:48,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:43:48,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 129 transitions. [2024-06-04 17:43:48,502 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43434343434343436 [2024-06-04 17:43:48,502 INFO L175 Difference]: Start difference. First operand has 71 places, 59 transitions, 430 flow. Second operand 9 states and 129 transitions. [2024-06-04 17:43:48,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 77 transitions, 672 flow [2024-06-04 17:43:48,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 77 transitions, 617 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-04 17:43:48,506 INFO L231 Difference]: Finished difference. Result has 73 places, 63 transitions, 482 flow [2024-06-04 17:43:48,506 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=482, PETRI_PLACES=73, PETRI_TRANSITIONS=63} [2024-06-04 17:43:48,506 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 41 predicate places. [2024-06-04 17:43:48,507 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 63 transitions, 482 flow [2024-06-04 17:43:48,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call 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,507 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:43:48,507 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:43:48,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-04 17:43:48,507 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,507 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:43:48,507 INFO L85 PathProgramCache]: Analyzing trace with hash 766856593, now seen corresponding path program 1 times [2024-06-04 17:43:48,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:43:48,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719216622] [2024-06-04 17:43:48,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:43:48,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:43:48,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:43:53,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:43:53,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:43:53,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719216622] [2024-06-04 17:43:53,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719216622] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:43:53,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:43:53,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:43:53,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744473849] [2024-06-04 17:43:53,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:43:53,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:43:53,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:43:53,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:43:53,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:43:54,020 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:43:54,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 63 transitions, 482 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:43:54,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:43:54,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:43:54,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:43:54,280 INFO L124 PetriNetUnfolderBase]: 205/392 cut-off events. [2024-06-04 17:43:54,280 INFO L125 PetriNetUnfolderBase]: For 3493/3493 co-relation queries the response was YES. [2024-06-04 17:43:54,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1890 conditions, 392 events. 205/392 cut-off events. For 3493/3493 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1656 event pairs, 47 based on Foata normal form. 1/389 useless extension candidates. Maximal degree in co-relation 1854. Up to 286 conditions per place. [2024-06-04 17:43:54,282 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 47 selfloop transitions, 22 changer transitions 0/73 dead transitions. [2024-06-04 17:43:54,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 73 transitions, 666 flow [2024-06-04 17:43:54,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:43:54,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:43:54,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2024-06-04 17:43:54,284 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-06-04 17:43:54,284 INFO L175 Difference]: Start difference. First operand has 73 places, 63 transitions, 482 flow. Second operand 6 states and 88 transitions. [2024-06-04 17:43:54,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 73 transitions, 666 flow [2024-06-04 17:43:54,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 73 transitions, 587 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-04 17:43:54,289 INFO L231 Difference]: Finished difference. Result has 72 places, 65 transitions, 481 flow [2024-06-04 17:43:54,289 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=481, PETRI_PLACES=72, PETRI_TRANSITIONS=65} [2024-06-04 17:43:54,289 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 40 predicate places. [2024-06-04 17:43:54,290 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 65 transitions, 481 flow [2024-06-04 17:43:54,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:43:54,290 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:43:54,290 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:43:54,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-04 17:43:54,290 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,291 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:43:54,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1547128849, now seen corresponding path program 1 times [2024-06-04 17:43:54,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:43:54,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005457360] [2024-06-04 17:43:54,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:43:54,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:43:54,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:43:59,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:43:59,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:43:59,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005457360] [2024-06-04 17:43:59,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005457360] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:43:59,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:43:59,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:43:59,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942348151] [2024-06-04 17:43:59,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:43:59,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:43:59,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:43:59,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:43:59,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:43:59,978 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:43:59,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 65 transitions, 481 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call 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,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:43:59,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:43:59,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:44:00,234 INFO L124 PetriNetUnfolderBase]: 211/413 cut-off events. [2024-06-04 17:44:00,234 INFO L125 PetriNetUnfolderBase]: For 4033/4033 co-relation queries the response was YES. [2024-06-04 17:44:00,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1949 conditions, 413 events. 211/413 cut-off events. For 4033/4033 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1799 event pairs, 49 based on Foata normal form. 2/412 useless extension candidates. Maximal degree in co-relation 1912. Up to 257 conditions per place. [2024-06-04 17:44:00,237 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 49 selfloop transitions, 27 changer transitions 0/80 dead transitions. [2024-06-04 17:44:00,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 80 transitions, 723 flow [2024-06-04 17:44:00,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:44:00,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:44:00,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 116 transitions. [2024-06-04 17:44:00,238 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4393939393939394 [2024-06-04 17:44:00,238 INFO L175 Difference]: Start difference. First operand has 72 places, 65 transitions, 481 flow. Second operand 8 states and 116 transitions. [2024-06-04 17:44:00,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 80 transitions, 723 flow [2024-06-04 17:44:00,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 80 transitions, 685 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-04 17:44:00,247 INFO L231 Difference]: Finished difference. Result has 76 places, 67 transitions, 516 flow [2024-06-04 17:44:00,247 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=443, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=516, PETRI_PLACES=76, PETRI_TRANSITIONS=67} [2024-06-04 17:44:00,248 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 44 predicate places. [2024-06-04 17:44:00,248 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 67 transitions, 516 flow [2024-06-04 17:44:00,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call 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:00,248 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:44:00,248 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:44:00,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-04 17:44:00,248 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:44:00,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:44:00,249 INFO L85 PathProgramCache]: Analyzing trace with hash -382671791, now seen corresponding path program 2 times [2024-06-04 17:44:00,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:44:00,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301590201] [2024-06-04 17:44:00,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:44:00,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:44:00,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:44:06,081 INFO 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:06,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:44:06,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301590201] [2024-06-04 17:44:06,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301590201] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:44:06,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:44:06,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:44:06,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901885906] [2024-06-04 17:44:06,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:44:06,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:44:06,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:44:06,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:44:06,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:44:06,226 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:44:06,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 67 transitions, 516 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call 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:06,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:44:06,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:44:06,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:44:06,541 INFO L124 PetriNetUnfolderBase]: 217/419 cut-off events. [2024-06-04 17:44:06,541 INFO L125 PetriNetUnfolderBase]: For 4478/4478 co-relation queries the response was YES. [2024-06-04 17:44:06,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2048 conditions, 419 events. 217/419 cut-off events. For 4478/4478 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1810 event pairs, 49 based on Foata normal form. 2/418 useless extension candidates. Maximal degree in co-relation 2010. Up to 263 conditions per place. [2024-06-04 17:44:06,544 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 49 selfloop transitions, 31 changer transitions 0/84 dead transitions. [2024-06-04 17:44:06,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 84 transitions, 780 flow [2024-06-04 17:44:06,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:44:06,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:44:06,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 128 transitions. [2024-06-04 17:44:06,545 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43097643097643096 [2024-06-04 17:44:06,545 INFO L175 Difference]: Start difference. First operand has 76 places, 67 transitions, 516 flow. Second operand 9 states and 128 transitions. [2024-06-04 17:44:06,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 84 transitions, 780 flow [2024-06-04 17:44:06,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 84 transitions, 710 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-04 17:44:06,550 INFO L231 Difference]: Finished difference. Result has 79 places, 69 transitions, 531 flow [2024-06-04 17:44:06,550 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=450, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=531, PETRI_PLACES=79, PETRI_TRANSITIONS=69} [2024-06-04 17:44:06,551 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 47 predicate places. [2024-06-04 17:44:06,551 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 69 transitions, 531 flow [2024-06-04 17:44:06,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call 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:06,552 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:44:06,552 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:44:06,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-04 17:44:06,552 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:06,552 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:44:06,552 INFO L85 PathProgramCache]: Analyzing trace with hash -382998221, now seen corresponding path program 3 times [2024-06-04 17:44:06,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:44:06,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125264763] [2024-06-04 17:44:06,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:44:06,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:44:06,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:44:12,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:44:12,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:44:12,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125264763] [2024-06-04 17:44:12,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125264763] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:44:12,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:44:12,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:44:12,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328766442] [2024-06-04 17:44:12,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:44:12,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:44:12,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:44:12,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:44:12,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:44:12,584 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:44:12,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 69 transitions, 531 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call 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:12,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:44:12,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:44:12,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:44:12,903 INFO L124 PetriNetUnfolderBase]: 213/413 cut-off events. [2024-06-04 17:44:12,903 INFO L125 PetriNetUnfolderBase]: For 4600/4600 co-relation queries the response was YES. [2024-06-04 17:44:12,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2030 conditions, 413 events. 213/413 cut-off events. For 4600/4600 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1777 event pairs, 46 based on Foata normal form. 2/412 useless extension candidates. Maximal degree in co-relation 1991. Up to 260 conditions per place. [2024-06-04 17:44:12,906 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 48 selfloop transitions, 31 changer transitions 0/83 dead transitions. [2024-06-04 17:44:12,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 83 transitions, 741 flow [2024-06-04 17:44:12,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:44:12,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:44:12,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 128 transitions. [2024-06-04 17:44:12,908 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43097643097643096 [2024-06-04 17:44:12,908 INFO L175 Difference]: Start difference. First operand has 79 places, 69 transitions, 531 flow. Second operand 9 states and 128 transitions. [2024-06-04 17:44:12,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 83 transitions, 741 flow [2024-06-04 17:44:12,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 83 transitions, 692 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-04 17:44:12,913 INFO L231 Difference]: Finished difference. Result has 82 places, 69 transitions, 549 flow [2024-06-04 17:44:12,914 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=482, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=549, PETRI_PLACES=82, PETRI_TRANSITIONS=69} [2024-06-04 17:44:12,914 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 50 predicate places. [2024-06-04 17:44:12,914 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 69 transitions, 549 flow [2024-06-04 17:44:12,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call 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:12,914 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:44:12,915 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:44:12,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-04 17:44:12,915 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:12,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:44:12,915 INFO L85 PathProgramCache]: Analyzing trace with hash -382659887, now seen corresponding path program 1 times [2024-06-04 17:44:12,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:44:12,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751968462] [2024-06-04 17:44:12,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:44:12,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:44:12,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:44:19,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:44:19,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:44:19,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751968462] [2024-06-04 17:44:19,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751968462] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:44:19,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:44:19,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:44:19,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784452380] [2024-06-04 17:44:19,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:44:19,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:44:19,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:44:19,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:44:19,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:44:19,525 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:44:19,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 69 transitions, 549 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call 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:19,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:44:19,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:44:19,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:44:19,795 INFO L124 PetriNetUnfolderBase]: 214/428 cut-off events. [2024-06-04 17:44:19,795 INFO L125 PetriNetUnfolderBase]: For 5256/5256 co-relation queries the response was YES. [2024-06-04 17:44:19,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2041 conditions, 428 events. 214/428 cut-off events. For 5256/5256 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1901 event pairs, 42 based on Foata normal form. 4/429 useless extension candidates. Maximal degree in co-relation 2001. Up to 297 conditions per place. [2024-06-04 17:44:19,798 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 65 selfloop transitions, 29 changer transitions 0/98 dead transitions. [2024-06-04 17:44:19,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 98 transitions, 913 flow [2024-06-04 17:44:19,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:44:19,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:44:19,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 134 transitions. [2024-06-04 17:44:19,799 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40606060606060607 [2024-06-04 17:44:19,799 INFO L175 Difference]: Start difference. First operand has 82 places, 69 transitions, 549 flow. Second operand 10 states and 134 transitions. [2024-06-04 17:44:19,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 98 transitions, 913 flow [2024-06-04 17:44:19,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 98 transitions, 795 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-04 17:44:19,805 INFO L231 Difference]: Finished difference. Result has 88 places, 84 transitions, 677 flow [2024-06-04 17:44:19,805 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=677, PETRI_PLACES=88, PETRI_TRANSITIONS=84} [2024-06-04 17:44:19,806 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 56 predicate places. [2024-06-04 17:44:19,806 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 84 transitions, 677 flow [2024-06-04 17:44:19,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call 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:19,806 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:44:19,806 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:44:19,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-04 17:44:19,806 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:19,807 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:44:19,807 INFO L85 PathProgramCache]: Analyzing trace with hash 288948555, now seen corresponding path program 1 times [2024-06-04 17:44:19,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:44:19,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652960578] [2024-06-04 17:44:19,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:44:19,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:44:19,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:44:25,333 INFO 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,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:44:25,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652960578] [2024-06-04 17:44:25,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652960578] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:44:25,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:44:25,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:44:25,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369788551] [2024-06-04 17:44:25,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:44:25,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:44:25,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:44:25,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:44:25,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:44:25,438 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:44:25,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 84 transitions, 677 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:44:25,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:44:25,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:44:25,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:44:25,751 INFO L124 PetriNetUnfolderBase]: 218/430 cut-off events. [2024-06-04 17:44:25,752 INFO L125 PetriNetUnfolderBase]: For 5225/5225 co-relation queries the response was YES. [2024-06-04 17:44:25,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2174 conditions, 430 events. 218/430 cut-off events. For 5225/5225 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1875 event pairs, 23 based on Foata normal form. 2/431 useless extension candidates. Maximal degree in co-relation 2128. Up to 337 conditions per place. [2024-06-04 17:44:25,755 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 84 selfloop transitions, 12 changer transitions 0/100 dead transitions. [2024-06-04 17:44:25,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 100 transitions, 917 flow [2024-06-04 17:44:25,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:44:25,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:44:25,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 108 transitions. [2024-06-04 17:44:25,757 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2024-06-04 17:44:25,757 INFO L175 Difference]: Start difference. First operand has 88 places, 84 transitions, 677 flow. Second operand 8 states and 108 transitions. [2024-06-04 17:44:25,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 100 transitions, 917 flow [2024-06-04 17:44:25,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 100 transitions, 877 flow, removed 16 selfloop flow, removed 2 redundant places. [2024-06-04 17:44:25,764 INFO L231 Difference]: Finished difference. Result has 94 places, 85 transitions, 675 flow [2024-06-04 17:44:25,764 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=637, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=675, PETRI_PLACES=94, PETRI_TRANSITIONS=85} [2024-06-04 17:44:25,765 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 62 predicate places. [2024-06-04 17:44:25,765 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 85 transitions, 675 flow [2024-06-04 17:44:25,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:44:25,765 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:44:25,765 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:44:25,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-04 17:44:25,766 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:25,766 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:44:25,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1272914161, now seen corresponding path program 2 times [2024-06-04 17:44:25,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:44:25,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139723617] [2024-06-04 17:44:25,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:44:25,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:44:25,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:44:30,619 INFO 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:30,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:44:30,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139723617] [2024-06-04 17:44:30,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139723617] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:44:30,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:44:30,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 17:44:30,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065634795] [2024-06-04 17:44:30,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:44:30,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 17:44:30,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:44:30,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 17:44:30,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-04 17:44:30,764 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2024-06-04 17:44:30,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 85 transitions, 675 flow. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 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:44:30,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:44:30,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2024-06-04 17:44:30,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:44:31,006 INFO L124 PetriNetUnfolderBase]: 222/438 cut-off events. [2024-06-04 17:44:31,006 INFO L125 PetriNetUnfolderBase]: For 5574/5574 co-relation queries the response was YES. [2024-06-04 17:44:31,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2194 conditions, 438 events. 222/438 cut-off events. For 5574/5574 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1942 event pairs, 43 based on Foata normal form. 2/439 useless extension candidates. Maximal degree in co-relation 2146. Up to 362 conditions per place. [2024-06-04 17:44:31,010 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 84 selfloop transitions, 12 changer transitions 0/100 dead transitions. [2024-06-04 17:44:31,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 100 transitions, 915 flow [2024-06-04 17:44:31,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:44:31,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:44:31,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 108 transitions. [2024-06-04 17:44:31,011 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4675324675324675 [2024-06-04 17:44:31,011 INFO L175 Difference]: Start difference. First operand has 94 places, 85 transitions, 675 flow. Second operand 7 states and 108 transitions. [2024-06-04 17:44:31,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 100 transitions, 915 flow [2024-06-04 17:44:31,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 100 transitions, 872 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-04 17:44:31,019 INFO L231 Difference]: Finished difference. Result has 94 places, 86 transitions, 672 flow [2024-06-04 17:44:31,019 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=632, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=672, PETRI_PLACES=94, PETRI_TRANSITIONS=86} [2024-06-04 17:44:31,020 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 62 predicate places. [2024-06-04 17:44:31,020 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 86 transitions, 672 flow [2024-06-04 17:44:31,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 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:44:31,020 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:44:31,020 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:44:31,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-04 17:44:31,021 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:31,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:44:31,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1272909201, now seen corresponding path program 1 times [2024-06-04 17:44:31,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:44:31,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240312326] [2024-06-04 17:44:31,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:44:31,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:44:31,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:44:36,583 INFO 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:36,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:44:36,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240312326] [2024-06-04 17:44:36,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240312326] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:44:36,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:44:36,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:44:36,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532522455] [2024-06-04 17:44:36,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:44:36,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:44:36,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:44:36,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:44:36,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:44:36,740 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-04 17:44:36,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 86 transitions, 672 flow. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:44:36,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:44:36,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-04 17:44:36,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:44:36,977 INFO L124 PetriNetUnfolderBase]: 220/430 cut-off events. [2024-06-04 17:44:36,977 INFO L125 PetriNetUnfolderBase]: For 5229/5229 co-relation queries the response was YES. [2024-06-04 17:44:36,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2144 conditions, 430 events. 220/430 cut-off events. For 5229/5229 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1898 event pairs, 45 based on Foata normal form. 1/427 useless extension candidates. Maximal degree in co-relation 2097. Up to 288 conditions per place. [2024-06-04 17:44:36,981 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 57 selfloop transitions, 35 changer transitions 0/96 dead transitions. [2024-06-04 17:44:36,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 96 transitions, 899 flow [2024-06-04 17:44:36,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:44:36,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:44:36,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 95 transitions. [2024-06-04 17:44:36,982 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41125541125541126 [2024-06-04 17:44:36,982 INFO L175 Difference]: Start difference. First operand has 94 places, 86 transitions, 672 flow. Second operand 7 states and 95 transitions. [2024-06-04 17:44:36,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 96 transitions, 899 flow [2024-06-04 17:44:36,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 96 transitions, 869 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-04 17:44:36,988 INFO L231 Difference]: Finished difference. Result has 96 places, 88 transitions, 747 flow [2024-06-04 17:44:36,989 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=642, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=747, PETRI_PLACES=96, PETRI_TRANSITIONS=88} [2024-06-04 17:44:36,989 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 64 predicate places. [2024-06-04 17:44:36,989 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 88 transitions, 747 flow [2024-06-04 17:44:36,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:44:36,989 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:44:36,989 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:44:36,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-04 17:44:36,990 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:36,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:44:36,990 INFO L85 PathProgramCache]: Analyzing trace with hash -2122222325, now seen corresponding path program 3 times [2024-06-04 17:44:36,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:44:36,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507448804] [2024-06-04 17:44:36,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:44:36,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:44:37,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:44:42,559 INFO 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,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:44:42,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507448804] [2024-06-04 17:44:42,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507448804] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:44:42,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:44:42,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:44:42,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075734939] [2024-06-04 17:44:42,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:44:42,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:44:42,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:44:42,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:44:42,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:44:42,672 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:44:42,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 88 transitions, 747 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:44:42,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:44:42,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:44:42,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:44:42,993 INFO L124 PetriNetUnfolderBase]: 224/445 cut-off events. [2024-06-04 17:44:42,993 INFO L125 PetriNetUnfolderBase]: For 5924/5924 co-relation queries the response was YES. [2024-06-04 17:44:42,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2273 conditions, 445 events. 224/445 cut-off events. For 5924/5924 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1981 event pairs, 42 based on Foata normal form. 2/446 useless extension candidates. Maximal degree in co-relation 2224. Up to 368 conditions per place. [2024-06-04 17:44:42,996 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 81 selfloop transitions, 16 changer transitions 0/101 dead transitions. [2024-06-04 17:44:42,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 101 transitions, 986 flow [2024-06-04 17:44:42,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:44:42,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:44:42,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 106 transitions. [2024-06-04 17:44:42,998 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4015151515151515 [2024-06-04 17:44:42,998 INFO L175 Difference]: Start difference. First operand has 96 places, 88 transitions, 747 flow. Second operand 8 states and 106 transitions. [2024-06-04 17:44:42,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 101 transitions, 986 flow [2024-06-04 17:44:43,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 101 transitions, 907 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-04 17:44:43,007 INFO L231 Difference]: Finished difference. Result has 99 places, 90 transitions, 731 flow [2024-06-04 17:44:43,007 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=668, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=731, PETRI_PLACES=99, PETRI_TRANSITIONS=90} [2024-06-04 17:44:43,007 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 67 predicate places. [2024-06-04 17:44:43,007 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 90 transitions, 731 flow [2024-06-04 17:44:43,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:44:43,008 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:44:43,008 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:44:43,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-04 17:44:43,008 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:43,008 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:44:43,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1348093643, now seen corresponding path program 4 times [2024-06-04 17:44:43,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:44:43,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153988559] [2024-06-04 17:44:43,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:44:43,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:44:43,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:44:48,662 INFO 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,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:44:48,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153988559] [2024-06-04 17:44:48,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153988559] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:44:48,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:44:48,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:44:48,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655018556] [2024-06-04 17:44:48,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:44:48,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:44:48,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:44:48,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:44:48,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:44:48,793 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:44:48,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 90 transitions, 731 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:44:48,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:44:48,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:44:48,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:44:49,094 INFO L124 PetriNetUnfolderBase]: 225/446 cut-off events. [2024-06-04 17:44:49,094 INFO L125 PetriNetUnfolderBase]: For 5957/5957 co-relation queries the response was YES. [2024-06-04 17:44:49,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2212 conditions, 446 events. 225/446 cut-off events. For 5957/5957 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1997 event pairs, 40 based on Foata normal form. 4/447 useless extension candidates. Maximal degree in co-relation 2162. Up to 333 conditions per place. [2024-06-04 17:44:49,097 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 76 selfloop transitions, 22 changer transitions 0/102 dead transitions. [2024-06-04 17:44:49,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 102 transitions, 970 flow [2024-06-04 17:44:49,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:44:49,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:44:49,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 110 transitions. [2024-06-04 17:44:49,098 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2024-06-04 17:44:49,098 INFO L175 Difference]: Start difference. First operand has 99 places, 90 transitions, 731 flow. Second operand 8 states and 110 transitions. [2024-06-04 17:44:49,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 102 transitions, 970 flow [2024-06-04 17:44:49,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 102 transitions, 929 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-06-04 17:44:49,106 INFO L231 Difference]: Finished difference. Result has 103 places, 93 transitions, 769 flow [2024-06-04 17:44:49,106 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=690, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=769, PETRI_PLACES=103, PETRI_TRANSITIONS=93} [2024-06-04 17:44:49,106 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 71 predicate places. [2024-06-04 17:44:49,106 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 93 transitions, 769 flow [2024-06-04 17:44:49,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:44:49,106 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:44:49,107 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:44:49,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-04 17:44:49,107 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:49,107 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:44:49,107 INFO L85 PathProgramCache]: Analyzing trace with hash 726858093, now seen corresponding path program 1 times [2024-06-04 17:44:49,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:44:49,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208059009] [2024-06-04 17:44:49,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:44:49,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:44:49,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:44:55,259 INFO 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:55,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:44:55,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208059009] [2024-06-04 17:44:55,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208059009] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:44:55,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:44:55,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:44:55,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043000706] [2024-06-04 17:44:55,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:44:55,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:44:55,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:44:55,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:44:55,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:44:55,366 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:44:55,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 93 transitions, 769 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:44:55,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:44:55,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:44:55,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:44:55,606 INFO L124 PetriNetUnfolderBase]: 228/453 cut-off events. [2024-06-04 17:44:55,607 INFO L125 PetriNetUnfolderBase]: For 5709/5709 co-relation queries the response was YES. [2024-06-04 17:44:55,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2284 conditions, 453 events. 228/453 cut-off events. For 5709/5709 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2041 event pairs, 37 based on Foata normal form. 1/451 useless extension candidates. Maximal degree in co-relation 2232. Up to 341 conditions per place. [2024-06-04 17:44:55,610 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 76 selfloop transitions, 28 changer transitions 0/108 dead transitions. [2024-06-04 17:44:55,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 108 transitions, 1043 flow [2024-06-04 17:44:55,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:44:55,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:44:55,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 122 transitions. [2024-06-04 17:44:55,613 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4107744107744108 [2024-06-04 17:44:55,613 INFO L175 Difference]: Start difference. First operand has 103 places, 93 transitions, 769 flow. Second operand 9 states and 122 transitions. [2024-06-04 17:44:55,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 108 transitions, 1043 flow [2024-06-04 17:44:55,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 108 transitions, 968 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-04 17:44:55,622 INFO L231 Difference]: Finished difference. Result has 107 places, 98 transitions, 801 flow [2024-06-04 17:44:55,622 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=694, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=801, PETRI_PLACES=107, PETRI_TRANSITIONS=98} [2024-06-04 17:44:55,623 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 75 predicate places. [2024-06-04 17:44:55,623 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 98 transitions, 801 flow [2024-06-04 17:44:55,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:44:55,623 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:44:55,623 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:44:55,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-04 17:44:55,623 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:55,624 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:44:55,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1011957963, now seen corresponding path program 2 times [2024-06-04 17:44:55,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:44:55,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739801189] [2024-06-04 17:44:55,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:44:55,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:44:55,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:45:02,238 INFO 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:02,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:45:02,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739801189] [2024-06-04 17:45:02,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739801189] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:45:02,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:45:02,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:45:02,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212626083] [2024-06-04 17:45:02,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:45:02,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:45:02,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:45:02,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:45:02,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:45:02,349 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:45:02,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 98 transitions, 801 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call 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:02,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:45:02,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:45:02,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:45:02,660 INFO L124 PetriNetUnfolderBase]: 231/458 cut-off events. [2024-06-04 17:45:02,660 INFO L125 PetriNetUnfolderBase]: For 5966/5966 co-relation queries the response was YES. [2024-06-04 17:45:02,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2313 conditions, 458 events. 231/458 cut-off events. For 5966/5966 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2070 event pairs, 37 based on Foata normal form. 1/456 useless extension candidates. Maximal degree in co-relation 2260. Up to 346 conditions per place. [2024-06-04 17:45:02,663 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 77 selfloop transitions, 31 changer transitions 0/112 dead transitions. [2024-06-04 17:45:02,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 112 transitions, 1075 flow [2024-06-04 17:45:02,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:45:02,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:45:02,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 134 transitions. [2024-06-04 17:45:02,669 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40606060606060607 [2024-06-04 17:45:02,669 INFO L175 Difference]: Start difference. First operand has 107 places, 98 transitions, 801 flow. Second operand 10 states and 134 transitions. [2024-06-04 17:45:02,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 112 transitions, 1075 flow [2024-06-04 17:45:02,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 112 transitions, 993 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-04 17:45:02,679 INFO L231 Difference]: Finished difference. Result has 112 places, 102 transitions, 831 flow [2024-06-04 17:45:02,679 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=723, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=831, PETRI_PLACES=112, PETRI_TRANSITIONS=102} [2024-06-04 17:45:02,679 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 80 predicate places. [2024-06-04 17:45:02,679 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 102 transitions, 831 flow [2024-06-04 17:45:02,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call 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:02,680 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:45:02,680 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:45:02,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-04 17:45:02,680 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:45:02,680 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:45:02,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1022433483, now seen corresponding path program 3 times [2024-06-04 17:45:02,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:45:02,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553774236] [2024-06-04 17:45:02,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:45:02,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:45:02,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:45:08,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:45:08,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:45:08,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553774236] [2024-06-04 17:45:08,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553774236] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:45:08,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:45:08,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:45:08,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862577871] [2024-06-04 17:45:08,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:45:08,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:45:08,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:45:08,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:45:08,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:45:08,986 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:45:08,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 102 transitions, 831 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call 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:08,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:45:08,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:45:08,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:45:09,309 INFO L124 PetriNetUnfolderBase]: 234/463 cut-off events. [2024-06-04 17:45:09,309 INFO L125 PetriNetUnfolderBase]: For 6442/6442 co-relation queries the response was YES. [2024-06-04 17:45:09,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2372 conditions, 463 events. 234/463 cut-off events. For 6442/6442 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2093 event pairs, 37 based on Foata normal form. 1/461 useless extension candidates. Maximal degree in co-relation 2318. Up to 341 conditions per place. [2024-06-04 17:45:09,312 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 78 selfloop transitions, 37 changer transitions 0/119 dead transitions. [2024-06-04 17:45:09,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 119 transitions, 1187 flow [2024-06-04 17:45:09,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:45:09,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:45:09,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 146 transitions. [2024-06-04 17:45:09,316 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4022038567493113 [2024-06-04 17:45:09,316 INFO L175 Difference]: Start difference. First operand has 112 places, 102 transitions, 831 flow. Second operand 11 states and 146 transitions. [2024-06-04 17:45:09,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 119 transitions, 1187 flow [2024-06-04 17:45:09,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 119 transitions, 1100 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-06-04 17:45:09,325 INFO L231 Difference]: Finished difference. Result has 115 places, 107 transitions, 877 flow [2024-06-04 17:45:09,326 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=748, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=877, PETRI_PLACES=115, PETRI_TRANSITIONS=107} [2024-06-04 17:45:09,326 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 83 predicate places. [2024-06-04 17:45:09,326 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 107 transitions, 877 flow [2024-06-04 17:45:09,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call 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:09,326 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:45:09,326 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:45:09,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-04 17:45:09,327 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:09,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:45:09,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1022077293, now seen corresponding path program 4 times [2024-06-04 17:45:09,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:45:09,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070235342] [2024-06-04 17:45:09,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:45:09,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:45:09,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:45:16,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:45:16,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:45:16,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070235342] [2024-06-04 17:45:16,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070235342] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:45:16,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:45:16,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:45:16,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618081198] [2024-06-04 17:45:16,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:45:16,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:45:16,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:45:16,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:45:16,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:45:16,223 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:45:16,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 107 transitions, 877 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call 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,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:45:16,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:45:16,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:45:16,519 INFO L124 PetriNetUnfolderBase]: 232/462 cut-off events. [2024-06-04 17:45:16,519 INFO L125 PetriNetUnfolderBase]: For 6633/6633 co-relation queries the response was YES. [2024-06-04 17:45:16,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2361 conditions, 462 events. 232/462 cut-off events. For 6633/6633 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2104 event pairs, 37 based on Foata normal form. 1/460 useless extension candidates. Maximal degree in co-relation 2307. Up to 348 conditions per place. [2024-06-04 17:45:16,522 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 81 selfloop transitions, 32 changer transitions 0/117 dead transitions. [2024-06-04 17:45:16,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 117 transitions, 1127 flow [2024-06-04 17:45:16,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:45:16,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:45:16,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2024-06-04 17:45:16,524 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.403030303030303 [2024-06-04 17:45:16,524 INFO L175 Difference]: Start difference. First operand has 115 places, 107 transitions, 877 flow. Second operand 10 states and 133 transitions. [2024-06-04 17:45:16,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 117 transitions, 1127 flow [2024-06-04 17:45:16,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 117 transitions, 1078 flow, removed 13 selfloop flow, removed 5 redundant places. [2024-06-04 17:45:16,534 INFO L231 Difference]: Finished difference. Result has 120 places, 107 transitions, 897 flow [2024-06-04 17:45:16,534 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=828, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=897, PETRI_PLACES=120, PETRI_TRANSITIONS=107} [2024-06-04 17:45:16,535 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 88 predicate places. [2024-06-04 17:45:16,535 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 107 transitions, 897 flow [2024-06-04 17:45:16,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call 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,535 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:45:16,535 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:45:16,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-04 17:45:16,536 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:16,536 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:45:16,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1930116050, now seen corresponding path program 1 times [2024-06-04 17:45:16,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:45:16,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276457038] [2024-06-04 17:45:16,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:45:16,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:45:16,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:45:22,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:45:22,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:45:22,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276457038] [2024-06-04 17:45:22,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276457038] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:45:22,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:45:22,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:45:22,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132914053] [2024-06-04 17:45:22,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:45:22,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:45:22,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:45:22,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:45:22,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:45:22,513 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:45:22,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 107 transitions, 897 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call 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,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:45:22,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:45:22,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:45:22,738 INFO L124 PetriNetUnfolderBase]: 236/467 cut-off events. [2024-06-04 17:45:22,738 INFO L125 PetriNetUnfolderBase]: For 7460/7460 co-relation queries the response was YES. [2024-06-04 17:45:22,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2442 conditions, 467 events. 236/467 cut-off events. For 7460/7460 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2137 event pairs, 20 based on Foata normal form. 2/465 useless extension candidates. Maximal degree in co-relation 2386. Up to 365 conditions per place. [2024-06-04 17:45:22,741 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 104 selfloop transitions, 10 changer transitions 0/118 dead transitions. [2024-06-04 17:45:22,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 118 transitions, 1157 flow [2024-06-04 17:45:22,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:45:22,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:45:22,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 93 transitions. [2024-06-04 17:45:22,742 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4025974025974026 [2024-06-04 17:45:22,742 INFO L175 Difference]: Start difference. First operand has 120 places, 107 transitions, 897 flow. Second operand 7 states and 93 transitions. [2024-06-04 17:45:22,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 118 transitions, 1157 flow [2024-06-04 17:45:22,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 118 transitions, 1083 flow, removed 3 selfloop flow, removed 9 redundant places. [2024-06-04 17:45:22,753 INFO L231 Difference]: Finished difference. Result has 118 places, 108 transitions, 857 flow [2024-06-04 17:45:22,753 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=823, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=857, PETRI_PLACES=118, PETRI_TRANSITIONS=108} [2024-06-04 17:45:22,754 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 86 predicate places. [2024-06-04 17:45:22,754 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 108 transitions, 857 flow [2024-06-04 17:45:22,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call 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,754 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:45:22,754 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:45:22,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-04 17:45:22,754 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:22,754 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:45:22,754 INFO L85 PathProgramCache]: Analyzing trace with hash -631592012, now seen corresponding path program 2 times [2024-06-04 17:45:22,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:45:22,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818496071] [2024-06-04 17:45:22,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:45:22,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:45:22,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:45:29,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:45:29,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:45:29,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818496071] [2024-06-04 17:45:29,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818496071] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:45:29,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:45:29,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:45:29,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633556689] [2024-06-04 17:45:29,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:45:29,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:45:29,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:45:29,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:45:29,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:45:29,227 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:45:29,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 108 transitions, 857 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call 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:29,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:45:29,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:45:29,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:45:29,494 INFO L124 PetriNetUnfolderBase]: 240/475 cut-off events. [2024-06-04 17:45:29,494 INFO L125 PetriNetUnfolderBase]: For 7916/7916 co-relation queries the response was YES. [2024-06-04 17:45:29,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2444 conditions, 475 events. 240/475 cut-off events. For 7916/7916 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2189 event pairs, 41 based on Foata normal form. 2/473 useless extension candidates. Maximal degree in co-relation 2387. Up to 370 conditions per place. [2024-06-04 17:45:29,497 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 91 selfloop transitions, 22 changer transitions 0/117 dead transitions. [2024-06-04 17:45:29,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 117 transitions, 1113 flow [2024-06-04 17:45:29,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:45:29,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:45:29,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 99 transitions. [2024-06-04 17:45:29,498 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-04 17:45:29,498 INFO L175 Difference]: Start difference. First operand has 118 places, 108 transitions, 857 flow. Second operand 7 states and 99 transitions. [2024-06-04 17:45:29,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 117 transitions, 1113 flow [2024-06-04 17:45:29,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 117 transitions, 1089 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-04 17:45:29,510 INFO L231 Difference]: Finished difference. Result has 120 places, 109 transitions, 893 flow [2024-06-04 17:45:29,510 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=833, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=893, PETRI_PLACES=120, PETRI_TRANSITIONS=109} [2024-06-04 17:45:29,510 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 88 predicate places. [2024-06-04 17:45:29,510 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 109 transitions, 893 flow [2024-06-04 17:45:29,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call 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:29,511 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:45:29,511 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:45:29,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-04 17:45:29,511 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:29,511 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:45:29,511 INFO L85 PathProgramCache]: Analyzing trace with hash -631739882, now seen corresponding path program 3 times [2024-06-04 17:45:29,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:45:29,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909279695] [2024-06-04 17:45:29,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:45:29,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:45:29,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:45:35,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:45:35,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:45:35,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909279695] [2024-06-04 17:45:35,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909279695] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:45:35,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:45:35,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:45:35,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572545244] [2024-06-04 17:45:35,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:45:35,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:45:35,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:45:35,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:45:35,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:45:35,739 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:45:35,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 109 transitions, 893 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call 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:35,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:45:35,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:45:35,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:45:36,000 INFO L124 PetriNetUnfolderBase]: 244/483 cut-off events. [2024-06-04 17:45:36,001 INFO L125 PetriNetUnfolderBase]: For 8638/8638 co-relation queries the response was YES. [2024-06-04 17:45:36,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2527 conditions, 483 events. 244/483 cut-off events. For 8638/8638 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2241 event pairs, 39 based on Foata normal form. 2/481 useless extension candidates. Maximal degree in co-relation 2469. Up to 306 conditions per place. [2024-06-04 17:45:36,004 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 91 selfloop transitions, 25 changer transitions 0/120 dead transitions. [2024-06-04 17:45:36,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 120 transitions, 1217 flow [2024-06-04 17:45:36,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:45:36,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:45:36,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 99 transitions. [2024-06-04 17:45:36,005 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-04 17:45:36,005 INFO L175 Difference]: Start difference. First operand has 120 places, 109 transitions, 893 flow. Second operand 7 states and 99 transitions. [2024-06-04 17:45:36,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 120 transitions, 1217 flow [2024-06-04 17:45:36,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 120 transitions, 1163 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-04 17:45:36,018 INFO L231 Difference]: Finished difference. Result has 122 places, 110 transitions, 907 flow [2024-06-04 17:45:36,018 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=839, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=907, PETRI_PLACES=122, PETRI_TRANSITIONS=110} [2024-06-04 17:45:36,019 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 90 predicate places. [2024-06-04 17:45:36,019 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 110 transitions, 907 flow [2024-06-04 17:45:36,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call 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:36,019 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:45:36,019 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:45:36,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-04 17:45:36,019 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:36,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:45:36,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1949200052, now seen corresponding path program 1 times [2024-06-04 17:45:36,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:45:36,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188769678] [2024-06-04 17:45:36,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:45:36,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:45:36,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:45:42,250 INFO 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:42,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:45:42,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188769678] [2024-06-04 17:45:42,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188769678] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:45:42,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:45:42,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:45:42,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57920680] [2024-06-04 17:45:42,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:45:42,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:45:42,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:45:42,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:45:42,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:45:42,378 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:45:42,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 110 transitions, 907 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:45:42,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:45:42,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:45:42,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:45:42,616 INFO L124 PetriNetUnfolderBase]: 242/480 cut-off events. [2024-06-04 17:45:42,616 INFO L125 PetriNetUnfolderBase]: For 8447/8447 co-relation queries the response was YES. [2024-06-04 17:45:42,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2504 conditions, 480 events. 242/480 cut-off events. For 8447/8447 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2214 event pairs, 40 based on Foata normal form. 1/477 useless extension candidates. Maximal degree in co-relation 2445. Up to 296 conditions per place. [2024-06-04 17:45:42,619 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 68 selfloop transitions, 48 changer transitions 0/120 dead transitions. [2024-06-04 17:45:42,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 120 transitions, 1181 flow [2024-06-04 17:45:42,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:45:42,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:45:42,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 116 transitions. [2024-06-04 17:45:42,620 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4393939393939394 [2024-06-04 17:45:42,620 INFO L175 Difference]: Start difference. First operand has 122 places, 110 transitions, 907 flow. Second operand 8 states and 116 transitions. [2024-06-04 17:45:42,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 120 transitions, 1181 flow [2024-06-04 17:45:42,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 120 transitions, 1135 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-04 17:45:42,634 INFO L231 Difference]: Finished difference. Result has 126 places, 112 transitions, 994 flow [2024-06-04 17:45:42,634 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=861, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=994, PETRI_PLACES=126, PETRI_TRANSITIONS=112} [2024-06-04 17:45:42,634 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 94 predicate places. [2024-06-04 17:45:42,634 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 112 transitions, 994 flow [2024-06-04 17:45:42,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:45:42,634 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:45:42,634 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:45:42,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-04 17:45:42,635 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:42,635 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:45:42,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1358871552, now seen corresponding path program 4 times [2024-06-04 17:45:42,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:45:42,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129600078] [2024-06-04 17:45:42,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:45:42,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:45:42,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:45:48,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:45:48,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:45:48,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129600078] [2024-06-04 17:45:48,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129600078] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:45:48,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:45:48,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:45:48,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461466462] [2024-06-04 17:45:48,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:45:48,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:45:48,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:45:48,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:45:48,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:45:48,523 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:45:48,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 112 transitions, 994 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call 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:48,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:45:48,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:45:48,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:45:48,797 INFO L124 PetriNetUnfolderBase]: 249/496 cut-off events. [2024-06-04 17:45:48,797 INFO L125 PetriNetUnfolderBase]: For 9455/9455 co-relation queries the response was YES. [2024-06-04 17:45:48,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2654 conditions, 496 events. 249/496 cut-off events. For 9455/9455 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2303 event pairs, 36 based on Foata normal form. 2/495 useless extension candidates. Maximal degree in co-relation 2594. Up to 384 conditions per place. [2024-06-04 17:45:48,800 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 93 selfloop transitions, 27 changer transitions 0/124 dead transitions. [2024-06-04 17:45:48,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 124 transitions, 1289 flow [2024-06-04 17:45:48,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:45:48,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:45:48,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 109 transitions. [2024-06-04 17:45:48,801 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4128787878787879 [2024-06-04 17:45:48,801 INFO L175 Difference]: Start difference. First operand has 126 places, 112 transitions, 994 flow. Second operand 8 states and 109 transitions. [2024-06-04 17:45:48,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 124 transitions, 1289 flow [2024-06-04 17:45:48,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 124 transitions, 1176 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-04 17:45:48,815 INFO L231 Difference]: Finished difference. Result has 127 places, 115 transitions, 974 flow [2024-06-04 17:45:48,815 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=885, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=974, PETRI_PLACES=127, PETRI_TRANSITIONS=115} [2024-06-04 17:45:48,816 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 95 predicate places. [2024-06-04 17:45:48,816 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 115 transitions, 974 flow [2024-06-04 17:45:48,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call 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:48,816 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:45:48,816 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:45:48,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-04 17:45:48,816 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:48,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:45:48,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1364233932, now seen corresponding path program 5 times [2024-06-04 17:45:48,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:45:48,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044108693] [2024-06-04 17:45:48,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:45:48,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:45:48,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:45:55,142 INFO 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:55,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:45:55,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044108693] [2024-06-04 17:45:55,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044108693] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:45:55,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:45:55,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:45:55,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354201300] [2024-06-04 17:45:55,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:45:55,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:45:55,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:45:55,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:45:55,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:45:55,249 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:45:55,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 115 transitions, 974 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call 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:55,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:45:55,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:45:55,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:45:55,581 INFO L124 PetriNetUnfolderBase]: 246/491 cut-off events. [2024-06-04 17:45:55,582 INFO L125 PetriNetUnfolderBase]: For 8418/8418 co-relation queries the response was YES. [2024-06-04 17:45:55,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2521 conditions, 491 events. 246/491 cut-off events. For 8418/8418 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2282 event pairs, 35 based on Foata normal form. 2/490 useless extension candidates. Maximal degree in co-relation 2461. Up to 379 conditions per place. [2024-06-04 17:45:55,585 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 96 selfloop transitions, 24 changer transitions 0/124 dead transitions. [2024-06-04 17:45:55,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 124 transitions, 1236 flow [2024-06-04 17:45:55,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:45:55,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:45:55,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2024-06-04 17:45:55,586 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4053030303030303 [2024-06-04 17:45:55,587 INFO L175 Difference]: Start difference. First operand has 127 places, 115 transitions, 974 flow. Second operand 8 states and 107 transitions. [2024-06-04 17:45:55,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 124 transitions, 1236 flow [2024-06-04 17:45:55,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 124 transitions, 1172 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-06-04 17:45:55,601 INFO L231 Difference]: Finished difference. Result has 130 places, 115 transitions, 962 flow [2024-06-04 17:45:55,601 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=910, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=962, PETRI_PLACES=130, PETRI_TRANSITIONS=115} [2024-06-04 17:45:55,602 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 98 predicate places. [2024-06-04 17:45:55,602 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 115 transitions, 962 flow [2024-06-04 17:45:55,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call 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:55,602 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:45:55,602 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:45:55,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-04 17:45:55,602 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:55,602 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:45:55,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1057765360, now seen corresponding path program 1 times [2024-06-04 17:45:55,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:45:55,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133807874] [2024-06-04 17:45:55,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:45:55,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:45:55,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:46:02,535 INFO 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:02,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:46:02,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133807874] [2024-06-04 17:46:02,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133807874] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:46:02,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:46:02,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:46:02,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709783818] [2024-06-04 17:46:02,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:46:02,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:46:02,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:46:02,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:46:02,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:46:02,687 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:46:02,687 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 115 transitions, 962 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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:02,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:46:02,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:46:02,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:46:03,041 INFO L124 PetriNetUnfolderBase]: 265/532 cut-off events. [2024-06-04 17:46:03,042 INFO L125 PetriNetUnfolderBase]: For 13037/13037 co-relation queries the response was YES. [2024-06-04 17:46:03,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2701 conditions, 532 events. 265/532 cut-off events. For 13037/13037 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2527 event pairs, 39 based on Foata normal form. 11/540 useless extension candidates. Maximal degree in co-relation 2640. Up to 322 conditions per place. [2024-06-04 17:46:03,045 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 83 selfloop transitions, 39 changer transitions 6/132 dead transitions. [2024-06-04 17:46:03,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 132 transitions, 1320 flow [2024-06-04 17:46:03,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:46:03,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:46:03,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 142 transitions. [2024-06-04 17:46:03,046 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4303030303030303 [2024-06-04 17:46:03,047 INFO L175 Difference]: Start difference. First operand has 130 places, 115 transitions, 962 flow. Second operand 10 states and 142 transitions. [2024-06-04 17:46:03,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 132 transitions, 1320 flow [2024-06-04 17:46:03,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 132 transitions, 1238 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-04 17:46:03,064 INFO L231 Difference]: Finished difference. Result has 133 places, 115 transitions, 980 flow [2024-06-04 17:46:03,064 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=880, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=980, PETRI_PLACES=133, PETRI_TRANSITIONS=115} [2024-06-04 17:46:03,065 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 101 predicate places. [2024-06-04 17:46:03,065 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 115 transitions, 980 flow [2024-06-04 17:46:03,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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,065 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:46:03,065 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:46:03,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-04 17:46:03,065 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:46:03,066 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:46:03,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1305926738, now seen corresponding path program 2 times [2024-06-04 17:46:03,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:46:03,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721974555] [2024-06-04 17:46:03,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:46:03,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:46:03,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:46:10,132 INFO 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:10,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:46:10,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721974555] [2024-06-04 17:46:10,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721974555] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:46:10,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:46:10,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:46:10,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380528367] [2024-06-04 17:46:10,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:46:10,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:46:10,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:46:10,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:46:10,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:46:10,323 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:46:10,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 115 transitions, 980 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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:10,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:46:10,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:46:10,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:46:10,653 INFO L124 PetriNetUnfolderBase]: 252/507 cut-off events. [2024-06-04 17:46:10,654 INFO L125 PetriNetUnfolderBase]: For 10102/10102 co-relation queries the response was YES. [2024-06-04 17:46:10,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2638 conditions, 507 events. 252/507 cut-off events. For 10102/10102 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2405 event pairs, 37 based on Foata normal form. 2/506 useless extension candidates. Maximal degree in co-relation 2576. Up to 385 conditions per place. [2024-06-04 17:46:10,657 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 91 selfloop transitions, 33 changer transitions 0/128 dead transitions. [2024-06-04 17:46:10,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 128 transitions, 1272 flow [2024-06-04 17:46:10,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:46:10,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:46:10,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 145 transitions. [2024-06-04 17:46:10,658 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39944903581267216 [2024-06-04 17:46:10,659 INFO L175 Difference]: Start difference. First operand has 133 places, 115 transitions, 980 flow. Second operand 11 states and 145 transitions. [2024-06-04 17:46:10,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 128 transitions, 1272 flow [2024-06-04 17:46:10,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 128 transitions, 1184 flow, removed 6 selfloop flow, removed 8 redundant places. [2024-06-04 17:46:10,680 INFO L231 Difference]: Finished difference. Result has 136 places, 116 transitions, 980 flow [2024-06-04 17:46:10,680 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=892, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=980, PETRI_PLACES=136, PETRI_TRANSITIONS=116} [2024-06-04 17:46:10,680 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 104 predicate places. [2024-06-04 17:46:10,680 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 116 transitions, 980 flow [2024-06-04 17:46:10,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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:10,681 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:46:10,681 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:46:10,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-04 17:46:10,681 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:46:10,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:46:10,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1316381620, now seen corresponding path program 3 times [2024-06-04 17:46:10,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:46:10,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315934876] [2024-06-04 17:46:10,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:46:10,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:46:10,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:46:18,462 INFO 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:18,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:46:18,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315934876] [2024-06-04 17:46:18,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315934876] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:46:18,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:46:18,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:46:18,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988760608] [2024-06-04 17:46:18,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:46:18,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:46:18,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:46:18,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:46:18,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:46:18,611 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:46:18,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 116 transitions, 980 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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:18,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:46:18,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:46:18,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:46:19,066 INFO L124 PetriNetUnfolderBase]: 290/584 cut-off events. [2024-06-04 17:46:19,066 INFO L125 PetriNetUnfolderBase]: For 17215/17215 co-relation queries the response was YES. [2024-06-04 17:46:19,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3339 conditions, 584 events. 290/584 cut-off events. For 17215/17215 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2829 event pairs, 48 based on Foata normal form. 2/583 useless extension candidates. Maximal degree in co-relation 3276. Up to 291 conditions per place. [2024-06-04 17:46:19,069 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 80 selfloop transitions, 55 changer transitions 0/139 dead transitions. [2024-06-04 17:46:19,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 139 transitions, 1516 flow [2024-06-04 17:46:19,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 17:46:19,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 17:46:19,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 168 transitions. [2024-06-04 17:46:19,071 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2024-06-04 17:46:19,071 INFO L175 Difference]: Start difference. First operand has 136 places, 116 transitions, 980 flow. Second operand 12 states and 168 transitions. [2024-06-04 17:46:19,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 139 transitions, 1516 flow [2024-06-04 17:46:19,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 139 transitions, 1438 flow, removed 7 selfloop flow, removed 9 redundant places. [2024-06-04 17:46:19,097 INFO L231 Difference]: Finished difference. Result has 140 places, 119 transitions, 1086 flow [2024-06-04 17:46:19,098 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=902, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1086, PETRI_PLACES=140, PETRI_TRANSITIONS=119} [2024-06-04 17:46:19,098 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 108 predicate places. [2024-06-04 17:46:19,098 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 119 transitions, 1086 flow [2024-06-04 17:46:19,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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:19,098 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:46:19,098 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:46:19,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-04 17:46:19,098 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:46:19,099 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:46:19,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1619625968, now seen corresponding path program 4 times [2024-06-04 17:46:19,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:46:19,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548130762] [2024-06-04 17:46:19,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:46:19,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:46:19,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:46:26,242 INFO 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,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:46:26,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548130762] [2024-06-04 17:46:26,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548130762] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:46:26,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:46:26,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:46:26,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160074901] [2024-06-04 17:46:26,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:46:26,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:46:26,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:46:26,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:46:26,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:46:26,420 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:46:26,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 119 transitions, 1086 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:46:26,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:46:26,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:46:26,809 INFO L124 PetriNetUnfolderBase]: 294/590 cut-off events. [2024-06-04 17:46:26,809 INFO L125 PetriNetUnfolderBase]: For 18350/18350 co-relation queries the response was YES. [2024-06-04 17:46:26,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3505 conditions, 590 events. 294/590 cut-off events. For 18350/18350 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2866 event pairs, 50 based on Foata normal form. 2/589 useless extension candidates. Maximal degree in co-relation 3440. Up to 468 conditions per place. [2024-06-04 17:46:26,815 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 95 selfloop transitions, 33 changer transitions 0/132 dead transitions. [2024-06-04 17:46:26,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 132 transitions, 1390 flow [2024-06-04 17:46:26,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:46:26,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:46:26,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 144 transitions. [2024-06-04 17:46:26,816 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39669421487603307 [2024-06-04 17:46:26,816 INFO L175 Difference]: Start difference. First operand has 140 places, 119 transitions, 1086 flow. Second operand 11 states and 144 transitions. [2024-06-04 17:46:26,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 132 transitions, 1390 flow [2024-06-04 17:46:26,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 132 transitions, 1285 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-06-04 17:46:26,843 INFO L231 Difference]: Finished difference. Result has 143 places, 120 transitions, 1073 flow [2024-06-04 17:46:26,843 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=982, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1073, PETRI_PLACES=143, PETRI_TRANSITIONS=120} [2024-06-04 17:46:26,843 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 111 predicate places. [2024-06-04 17:46:26,843 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 120 transitions, 1073 flow [2024-06-04 17:46:26,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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,844 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:46:26,844 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:46:26,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-04 17:46:26,844 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:26,844 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:46:26,844 INFO L85 PathProgramCache]: Analyzing trace with hash -74549848, now seen corresponding path program 5 times [2024-06-04 17:46:26,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:46:26,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136024109] [2024-06-04 17:46:26,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:46:26,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:46:26,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:46:33,367 INFO 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:33,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:46:33,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136024109] [2024-06-04 17:46:33,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136024109] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:46:33,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:46:33,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:46:33,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217513727] [2024-06-04 17:46:33,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:46:33,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:46:33,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:46:33,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:46:33,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:46:33,555 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:46:33,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 120 transitions, 1073 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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:33,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:46:33,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:46:33,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:46:33,978 INFO L124 PetriNetUnfolderBase]: 291/585 cut-off events. [2024-06-04 17:46:33,978 INFO L125 PetriNetUnfolderBase]: For 17774/17774 co-relation queries the response was YES. [2024-06-04 17:46:33,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3379 conditions, 585 events. 291/585 cut-off events. For 17774/17774 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2818 event pairs, 49 based on Foata normal form. 2/584 useless extension candidates. Maximal degree in co-relation 3313. Up to 454 conditions per place. [2024-06-04 17:46:33,982 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 91 selfloop transitions, 38 changer transitions 0/133 dead transitions. [2024-06-04 17:46:33,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 133 transitions, 1361 flow [2024-06-04 17:46:33,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 17:46:33,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 17:46:33,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 156 transitions. [2024-06-04 17:46:33,998 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3939393939393939 [2024-06-04 17:46:33,998 INFO L175 Difference]: Start difference. First operand has 143 places, 120 transitions, 1073 flow. Second operand 12 states and 156 transitions. [2024-06-04 17:46:33,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 133 transitions, 1361 flow [2024-06-04 17:46:34,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 133 transitions, 1281 flow, removed 8 selfloop flow, removed 9 redundant places. [2024-06-04 17:46:34,027 INFO L231 Difference]: Finished difference. Result has 146 places, 120 transitions, 1073 flow [2024-06-04 17:46:34,027 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=993, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1073, PETRI_PLACES=146, PETRI_TRANSITIONS=120} [2024-06-04 17:46:34,027 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 114 predicate places. [2024-06-04 17:46:34,028 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 120 transitions, 1073 flow [2024-06-04 17:46:34,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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:34,028 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:46:34,028 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:46:34,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-04 17:46:34,028 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:34,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:46:34,029 INFO L85 PathProgramCache]: Analyzing trace with hash -295943730, now seen corresponding path program 1 times [2024-06-04 17:46:34,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:46:34,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511799293] [2024-06-04 17:46:34,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:46:34,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:46:34,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:46:39,883 INFO 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:39,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:46:39,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511799293] [2024-06-04 17:46:39,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511799293] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:46:39,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:46:39,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:46:39,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611811362] [2024-06-04 17:46:39,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:46:39,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:46:39,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:46:39,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:46:39,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:46:40,066 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:46:40,066 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 120 transitions, 1073 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:46:40,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:46:40,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:46:40,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:46:40,346 INFO L124 PetriNetUnfolderBase]: 295/590 cut-off events. [2024-06-04 17:46:40,347 INFO L125 PetriNetUnfolderBase]: For 18582/18582 co-relation queries the response was YES. [2024-06-04 17:46:40,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3411 conditions, 590 events. 295/590 cut-off events. For 18582/18582 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2870 event pairs, 33 based on Foata normal form. 2/588 useless extension candidates. Maximal degree in co-relation 3344. Up to 478 conditions per place. [2024-06-04 17:46:40,350 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 118 selfloop transitions, 11 changer transitions 0/133 dead transitions. [2024-06-04 17:46:40,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 133 transitions, 1365 flow [2024-06-04 17:46:40,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:46:40,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:46:40,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 104 transitions. [2024-06-04 17:46:40,361 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3939393939393939 [2024-06-04 17:46:40,361 INFO L175 Difference]: Start difference. First operand has 146 places, 120 transitions, 1073 flow. Second operand 8 states and 104 transitions. [2024-06-04 17:46:40,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 133 transitions, 1365 flow [2024-06-04 17:46:40,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 133 transitions, 1240 flow, removed 9 selfloop flow, removed 12 redundant places. [2024-06-04 17:46:40,391 INFO L231 Difference]: Finished difference. Result has 142 places, 121 transitions, 982 flow [2024-06-04 17:46:40,391 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=948, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=982, PETRI_PLACES=142, PETRI_TRANSITIONS=121} [2024-06-04 17:46:40,391 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 110 predicate places. [2024-06-04 17:46:40,392 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 121 transitions, 982 flow [2024-06-04 17:46:40,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:46:40,392 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:46:40,392 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:46:40,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-04 17:46:40,392 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:40,392 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:46:40,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1891020972, now seen corresponding path program 2 times [2024-06-04 17:46:40,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:46:40,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240110971] [2024-06-04 17:46:40,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:46:40,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:46:40,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:46:47,041 INFO 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:47,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:46:47,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240110971] [2024-06-04 17:46:47,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240110971] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:46:47,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:46:47,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:46:47,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129555163] [2024-06-04 17:46:47,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:46:47,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:46:47,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:46:47,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:46:47,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:46:47,184 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:46:47,184 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 121 transitions, 982 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:46:47,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:46:47,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:46:47,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:46:47,456 INFO L124 PetriNetUnfolderBase]: 270/539 cut-off events. [2024-06-04 17:46:47,457 INFO L125 PetriNetUnfolderBase]: For 12082/12082 co-relation queries the response was YES. [2024-06-04 17:46:47,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2694 conditions, 539 events. 270/539 cut-off events. For 12082/12082 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2603 event pairs, 40 based on Foata normal form. 2/537 useless extension candidates. Maximal degree in co-relation 2627. Up to 417 conditions per place. [2024-06-04 17:46:47,460 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 97 selfloop transitions, 30 changer transitions 0/131 dead transitions. [2024-06-04 17:46:47,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 131 transitions, 1266 flow [2024-06-04 17:46:47,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:46:47,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:46:47,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 113 transitions. [2024-06-04 17:46:47,465 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42803030303030304 [2024-06-04 17:46:47,465 INFO L175 Difference]: Start difference. First operand has 142 places, 121 transitions, 982 flow. Second operand 8 states and 113 transitions. [2024-06-04 17:46:47,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 131 transitions, 1266 flow [2024-06-04 17:46:47,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 131 transitions, 1233 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-04 17:46:47,488 INFO L231 Difference]: Finished difference. Result has 143 places, 122 transitions, 1023 flow [2024-06-04 17:46:47,488 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=949, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1023, PETRI_PLACES=143, PETRI_TRANSITIONS=122} [2024-06-04 17:46:47,488 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 111 predicate places. [2024-06-04 17:46:47,488 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 122 transitions, 1023 flow [2024-06-04 17:46:47,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:46:47,489 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:46:47,489 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:46:47,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-04 17:46:47,489 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:47,489 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:46:47,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1895484972, now seen corresponding path program 3 times [2024-06-04 17:46:47,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:46:47,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429502531] [2024-06-04 17:46:47,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:46:47,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:46:47,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:46:53,443 INFO 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:53,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:46:53,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429502531] [2024-06-04 17:46:53,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429502531] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:46:53,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:46:53,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:46:53,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106739849] [2024-06-04 17:46:53,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:46:53,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:46:53,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:46:53,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:46:53,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:46:53,619 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:46:53,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 122 transitions, 1023 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:46:53,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:46:53,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:46:53,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:46:53,902 INFO L124 PetriNetUnfolderBase]: 281/560 cut-off events. [2024-06-04 17:46:53,902 INFO L125 PetriNetUnfolderBase]: For 13713/13713 co-relation queries the response was YES. [2024-06-04 17:46:53,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2882 conditions, 560 events. 281/560 cut-off events. For 13713/13713 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2713 event pairs, 41 based on Foata normal form. 2/558 useless extension candidates. Maximal degree in co-relation 2815. Up to 358 conditions per place. [2024-06-04 17:46:53,906 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 90 selfloop transitions, 41 changer transitions 0/135 dead transitions. [2024-06-04 17:46:53,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 135 transitions, 1407 flow [2024-06-04 17:46:53,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:46:53,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:46:53,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 114 transitions. [2024-06-04 17:46:53,918 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4318181818181818 [2024-06-04 17:46:53,918 INFO L175 Difference]: Start difference. First operand has 143 places, 122 transitions, 1023 flow. Second operand 8 states and 114 transitions. [2024-06-04 17:46:53,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 135 transitions, 1407 flow [2024-06-04 17:46:53,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 135 transitions, 1358 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-04 17:46:53,943 INFO L231 Difference]: Finished difference. Result has 146 places, 124 transitions, 1084 flow [2024-06-04 17:46:53,944 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=974, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1084, PETRI_PLACES=146, PETRI_TRANSITIONS=124} [2024-06-04 17:46:53,944 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 114 predicate places. [2024-06-04 17:46:53,944 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 124 transitions, 1084 flow [2024-06-04 17:46:53,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:46:53,944 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:46:53,945 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:46:53,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-04 17:46:53,945 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:53,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:46:53,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1890901002, now seen corresponding path program 4 times [2024-06-04 17:46:53,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:46:53,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416085041] [2024-06-04 17:46:53,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:46:53,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:46:53,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:47:00,192 INFO 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:00,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:47:00,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416085041] [2024-06-04 17:47:00,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416085041] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:47:00,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:47:00,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:47:00,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751606149] [2024-06-04 17:47:00,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:47:00,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:47:00,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:47:00,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:47:00,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:47:00,290 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:47:00,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 124 transitions, 1084 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:47:00,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:47:00,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:47:00,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:47:00,569 INFO L124 PetriNetUnfolderBase]: 285/568 cut-off events. [2024-06-04 17:47:00,570 INFO L125 PetriNetUnfolderBase]: For 14595/14595 co-relation queries the response was YES. [2024-06-04 17:47:00,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2973 conditions, 568 events. 285/568 cut-off events. For 14595/14595 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2775 event pairs, 41 based on Foata normal form. 2/566 useless extension candidates. Maximal degree in co-relation 2905. Up to 301 conditions per place. [2024-06-04 17:47:00,573 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 99 selfloop transitions, 34 changer transitions 0/137 dead transitions. [2024-06-04 17:47:00,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 137 transitions, 1468 flow [2024-06-04 17:47:00,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:47:00,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:47:00,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 112 transitions. [2024-06-04 17:47:00,575 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2024-06-04 17:47:00,576 INFO L175 Difference]: Start difference. First operand has 146 places, 124 transitions, 1084 flow. Second operand 8 states and 112 transitions. [2024-06-04 17:47:00,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 137 transitions, 1468 flow [2024-06-04 17:47:00,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 137 transitions, 1408 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-06-04 17:47:00,602 INFO L231 Difference]: Finished difference. Result has 150 places, 125 transitions, 1108 flow [2024-06-04 17:47:00,603 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1024, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1108, PETRI_PLACES=150, PETRI_TRANSITIONS=125} [2024-06-04 17:47:00,603 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 118 predicate places. [2024-06-04 17:47:00,603 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 125 transitions, 1108 flow [2024-06-04 17:47:00,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:47:00,603 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:47:00,603 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:47:00,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-04 17:47:00,604 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:47:00,604 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:47:00,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1895669546, now seen corresponding path program 1 times [2024-06-04 17:47:00,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:47:00,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509871436] [2024-06-04 17:47:00,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:47:00,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:47:00,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:47:06,979 INFO 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:06,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:47:06,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509871436] [2024-06-04 17:47:06,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509871436] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:47:06,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:47:06,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:47:06,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297502458] [2024-06-04 17:47:06,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:47:06,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:47:06,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:47:06,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:47:06,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:47:07,124 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:47:07,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 125 transitions, 1108 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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:07,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:47:07,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:47:07,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:47:07,426 INFO L124 PetriNetUnfolderBase]: 288/575 cut-off events. [2024-06-04 17:47:07,426 INFO L125 PetriNetUnfolderBase]: For 14699/14699 co-relation queries the response was YES. [2024-06-04 17:47:07,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3082 conditions, 575 events. 288/575 cut-off events. For 14699/14699 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2824 event pairs, 42 based on Foata normal form. 1/572 useless extension candidates. Maximal degree in co-relation 3012. Up to 430 conditions per place. [2024-06-04 17:47:07,430 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 89 selfloop transitions, 43 changer transitions 0/136 dead transitions. [2024-06-04 17:47:07,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 136 transitions, 1430 flow [2024-06-04 17:47:07,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:47:07,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:47:07,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 129 transitions. [2024-06-04 17:47:07,442 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43434343434343436 [2024-06-04 17:47:07,442 INFO L175 Difference]: Start difference. First operand has 150 places, 125 transitions, 1108 flow. Second operand 9 states and 129 transitions. [2024-06-04 17:47:07,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 136 transitions, 1430 flow [2024-06-04 17:47:07,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 136 transitions, 1370 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-04 17:47:07,471 INFO L231 Difference]: Finished difference. Result has 154 places, 127 transitions, 1183 flow [2024-06-04 17:47:07,472 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1048, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1183, PETRI_PLACES=154, PETRI_TRANSITIONS=127} [2024-06-04 17:47:07,472 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 122 predicate places. [2024-06-04 17:47:07,472 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 127 transitions, 1183 flow [2024-06-04 17:47:07,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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:07,472 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:47:07,472 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:47:07,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-04 17:47:07,473 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:47:07,473 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:47:07,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1525078390, now seen corresponding path program 5 times [2024-06-04 17:47:07,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:47:07,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96363607] [2024-06-04 17:47:07,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:47:07,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:47:07,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:47:13,055 INFO 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:13,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:47:13,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96363607] [2024-06-04 17:47:13,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96363607] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:47:13,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:47:13,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:47:13,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476689199] [2024-06-04 17:47:13,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:47:13,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:47:13,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:47:13,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:47:13,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:47:13,179 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:47:13,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 127 transitions, 1183 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:47:13,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:47:13,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:47:13,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:47:13,462 INFO L124 PetriNetUnfolderBase]: 295/591 cut-off events. [2024-06-04 17:47:13,462 INFO L125 PetriNetUnfolderBase]: For 16066/16066 co-relation queries the response was YES. [2024-06-04 17:47:13,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3202 conditions, 591 events. 295/591 cut-off events. For 16066/16066 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2898 event pairs, 40 based on Foata normal form. 2/590 useless extension candidates. Maximal degree in co-relation 3131. Up to 447 conditions per place. [2024-06-04 17:47:13,466 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 99 selfloop transitions, 37 changer transitions 0/140 dead transitions. [2024-06-04 17:47:13,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 140 transitions, 1509 flow [2024-06-04 17:47:13,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:47:13,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:47:13,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 123 transitions. [2024-06-04 17:47:13,467 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41414141414141414 [2024-06-04 17:47:13,467 INFO L175 Difference]: Start difference. First operand has 154 places, 127 transitions, 1183 flow. Second operand 9 states and 123 transitions. [2024-06-04 17:47:13,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 140 transitions, 1509 flow [2024-06-04 17:47:13,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 140 transitions, 1405 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-04 17:47:13,495 INFO L231 Difference]: Finished difference. Result has 156 places, 130 transitions, 1189 flow [2024-06-04 17:47:13,495 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1080, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1189, PETRI_PLACES=156, PETRI_TRANSITIONS=130} [2024-06-04 17:47:13,495 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 124 predicate places. [2024-06-04 17:47:13,495 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 130 transitions, 1189 flow [2024-06-04 17:47:13,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:47:13,496 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:47:13,496 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:47:13,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-04 17:47:13,496 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:47:13,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:47:13,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1752979540, now seen corresponding path program 6 times [2024-06-04 17:47:13,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:47:13,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285169088] [2024-06-04 17:47:13,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:47:13,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:47:13,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:47:19,417 INFO 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:19,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:47:19,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285169088] [2024-06-04 17:47:19,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285169088] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:47:19,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:47:19,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:47:19,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522021576] [2024-06-04 17:47:19,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:47:19,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:47:19,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:47:19,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:47:19,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:47:19,522 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:47:19,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 130 transitions, 1189 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:47:19,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:47:19,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:47:19,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:47:19,755 INFO L124 PetriNetUnfolderBase]: 302/604 cut-off events. [2024-06-04 17:47:19,755 INFO L125 PetriNetUnfolderBase]: For 16952/16952 co-relation queries the response was YES. [2024-06-04 17:47:19,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3264 conditions, 604 events. 302/604 cut-off events. For 16952/16952 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3002 event pairs, 38 based on Foata normal form. 2/603 useless extension candidates. Maximal degree in co-relation 3192. Up to 459 conditions per place. [2024-06-04 17:47:19,760 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 101 selfloop transitions, 38 changer transitions 0/143 dead transitions. [2024-06-04 17:47:19,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 143 transitions, 1526 flow [2024-06-04 17:47:19,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:47:19,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:47:19,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 123 transitions. [2024-06-04 17:47:19,766 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41414141414141414 [2024-06-04 17:47:19,766 INFO L175 Difference]: Start difference. First operand has 156 places, 130 transitions, 1189 flow. Second operand 9 states and 123 transitions. [2024-06-04 17:47:19,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 143 transitions, 1526 flow [2024-06-04 17:47:19,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 143 transitions, 1444 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-04 17:47:19,801 INFO L231 Difference]: Finished difference. Result has 159 places, 133 transitions, 1224 flow [2024-06-04 17:47:19,801 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1111, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1224, PETRI_PLACES=159, PETRI_TRANSITIONS=133} [2024-06-04 17:47:19,801 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 127 predicate places. [2024-06-04 17:47:19,801 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 133 transitions, 1224 flow [2024-06-04 17:47:19,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:47:19,802 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:47:19,802 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:47:19,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-04 17:47:19,802 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:47:19,802 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:47:19,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1975874800, now seen corresponding path program 7 times [2024-06-04 17:47:19,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:47:19,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101144439] [2024-06-04 17:47:19,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:47:19,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:47:19,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:47:26,313 INFO 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:26,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:47:26,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101144439] [2024-06-04 17:47:26,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101144439] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:47:26,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:47:26,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:47:26,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239962832] [2024-06-04 17:47:26,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:47:26,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:47:26,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:47:26,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:47:26,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:47:26,450 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:47:26,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 133 transitions, 1224 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:47:26,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:47:26,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:47:26,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:47:26,865 INFO L124 PetriNetUnfolderBase]: 299/599 cut-off events. [2024-06-04 17:47:26,865 INFO L125 PetriNetUnfolderBase]: For 15824/15824 co-relation queries the response was YES. [2024-06-04 17:47:26,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3169 conditions, 599 events. 299/599 cut-off events. For 15824/15824 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 2976 event pairs, 39 based on Foata normal form. 2/598 useless extension candidates. Maximal degree in co-relation 3096. Up to 454 conditions per place. [2024-06-04 17:47:26,869 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 103 selfloop transitions, 36 changer transitions 0/143 dead transitions. [2024-06-04 17:47:26,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 143 transitions, 1526 flow [2024-06-04 17:47:26,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:47:26,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:47:26,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 120 transitions. [2024-06-04 17:47:26,871 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40404040404040403 [2024-06-04 17:47:26,871 INFO L175 Difference]: Start difference. First operand has 159 places, 133 transitions, 1224 flow. Second operand 9 states and 120 transitions. [2024-06-04 17:47:26,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 143 transitions, 1526 flow [2024-06-04 17:47:26,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 143 transitions, 1456 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-06-04 17:47:26,903 INFO L231 Difference]: Finished difference. Result has 163 places, 133 transitions, 1230 flow [2024-06-04 17:47:26,903 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1154, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1230, PETRI_PLACES=163, PETRI_TRANSITIONS=133} [2024-06-04 17:47:26,903 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 131 predicate places. [2024-06-04 17:47:26,903 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 133 transitions, 1230 flow [2024-06-04 17:47:26,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:47:26,903 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:47:26,903 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:47:26,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-04 17:47:26,904 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:47:26,904 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:47:26,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1516500566, now seen corresponding path program 2 times [2024-06-04 17:47:26,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:47:26,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508951614] [2024-06-04 17:47:26,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:47:26,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:47:26,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:47:33,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:47:33,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:47:33,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508951614] [2024-06-04 17:47:33,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508951614] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:47:33,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:47:33,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:47:33,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644701154] [2024-06-04 17:47:33,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:47:33,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:47:33,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:47:33,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:47:33,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:47:33,557 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:47:33,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 133 transitions, 1230 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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:33,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:47:33,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:47:33,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:47:33,852 INFO L124 PetriNetUnfolderBase]: 302/606 cut-off events. [2024-06-04 17:47:33,852 INFO L125 PetriNetUnfolderBase]: For 15632/15632 co-relation queries the response was YES. [2024-06-04 17:47:33,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3228 conditions, 606 events. 302/606 cut-off events. For 15632/15632 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3019 event pairs, 39 based on Foata normal form. 1/604 useless extension candidates. Maximal degree in co-relation 3154. Up to 416 conditions per place. [2024-06-04 17:47:33,856 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 89 selfloop transitions, 52 changer transitions 0/145 dead transitions. [2024-06-04 17:47:33,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 145 transitions, 1576 flow [2024-06-04 17:47:33,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:47:33,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:47:33,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 139 transitions. [2024-06-04 17:47:33,857 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4212121212121212 [2024-06-04 17:47:33,858 INFO L175 Difference]: Start difference. First operand has 163 places, 133 transitions, 1230 flow. Second operand 10 states and 139 transitions. [2024-06-04 17:47:33,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 145 transitions, 1576 flow [2024-06-04 17:47:33,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 145 transitions, 1478 flow, removed 6 selfloop flow, removed 10 redundant places. [2024-06-04 17:47:33,899 INFO L231 Difference]: Finished difference. Result has 163 places, 135 transitions, 1285 flow [2024-06-04 17:47:33,899 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1132, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1285, PETRI_PLACES=163, PETRI_TRANSITIONS=135} [2024-06-04 17:47:33,900 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 131 predicate places. [2024-06-04 17:47:33,900 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 135 transitions, 1285 flow [2024-06-04 17:47:33,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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:33,900 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:47:33,900 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:47:33,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-04 17:47:33,900 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:33,900 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:47:33,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1805678736, now seen corresponding path program 8 times [2024-06-04 17:47:33,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:47:33,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568362348] [2024-06-04 17:47:33,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:47:33,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:47:33,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:47:40,321 INFO 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:40,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:47:40,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568362348] [2024-06-04 17:47:40,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568362348] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:47:40,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:47:40,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:47:40,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511438593] [2024-06-04 17:47:40,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:47:40,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:47:40,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:47:40,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:47:40,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:47:40,482 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:47:40,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 135 transitions, 1285 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:47:40,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:47:40,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:47:40,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:47:40,721 INFO L124 PetriNetUnfolderBase]: 306/614 cut-off events. [2024-06-04 17:47:40,722 INFO L125 PetriNetUnfolderBase]: For 17454/17454 co-relation queries the response was YES. [2024-06-04 17:47:40,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3278 conditions, 614 events. 306/614 cut-off events. For 17454/17454 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3070 event pairs, 37 based on Foata normal form. 2/613 useless extension candidates. Maximal degree in co-relation 3206. Up to 442 conditions per place. [2024-06-04 17:47:40,726 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 107 selfloop transitions, 37 changer transitions 0/148 dead transitions. [2024-06-04 17:47:40,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 148 transitions, 1702 flow [2024-06-04 17:47:40,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:47:40,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:47:40,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 126 transitions. [2024-06-04 17:47:40,727 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2024-06-04 17:47:40,727 INFO L175 Difference]: Start difference. First operand has 163 places, 135 transitions, 1285 flow. Second operand 9 states and 126 transitions. [2024-06-04 17:47:40,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 148 transitions, 1702 flow [2024-06-04 17:47:40,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 148 transitions, 1565 flow, removed 18 selfloop flow, removed 8 redundant places. [2024-06-04 17:47:40,766 INFO L231 Difference]: Finished difference. Result has 164 places, 136 transitions, 1237 flow [2024-06-04 17:47:40,767 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1148, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1237, PETRI_PLACES=164, PETRI_TRANSITIONS=136} [2024-06-04 17:47:40,767 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 132 predicate places. [2024-06-04 17:47:40,767 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 136 transitions, 1237 flow [2024-06-04 17:47:40,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:47:40,767 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:47:40,768 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:47:40,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-04 17:47:40,768 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:40,768 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:47:40,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1805501106, now seen corresponding path program 9 times [2024-06-04 17:47:40,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:47:40,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789119801] [2024-06-04 17:47:40,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:47:40,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:47:40,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:47:47,232 INFO 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:47,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:47:47,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789119801] [2024-06-04 17:47:47,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789119801] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:47:47,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:47:47,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:47:47,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615144327] [2024-06-04 17:47:47,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:47:47,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:47:47,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:47:47,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:47:47,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:47:47,364 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:47:47,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 136 transitions, 1237 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:47:47,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:47:47,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:47:47,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:47:47,589 INFO L124 PetriNetUnfolderBase]: 313/629 cut-off events. [2024-06-04 17:47:47,589 INFO L125 PetriNetUnfolderBase]: For 18149/18149 co-relation queries the response was YES. [2024-06-04 17:47:47,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3309 conditions, 629 events. 313/629 cut-off events. For 18149/18149 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3151 event pairs, 39 based on Foata normal form. 2/628 useless extension candidates. Maximal degree in co-relation 3236. Up to 479 conditions per place. [2024-06-04 17:47:47,593 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 108 selfloop transitions, 37 changer transitions 0/149 dead transitions. [2024-06-04 17:47:47,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 149 transitions, 1586 flow [2024-06-04 17:47:47,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:47:47,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:47:47,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 123 transitions. [2024-06-04 17:47:47,596 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41414141414141414 [2024-06-04 17:47:47,596 INFO L175 Difference]: Start difference. First operand has 164 places, 136 transitions, 1237 flow. Second operand 9 states and 123 transitions. [2024-06-04 17:47:47,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 149 transitions, 1586 flow [2024-06-04 17:47:47,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 149 transitions, 1405 flow, removed 6 selfloop flow, removed 10 redundant places. [2024-06-04 17:47:47,640 INFO L231 Difference]: Finished difference. Result has 163 places, 139 transitions, 1171 flow [2024-06-04 17:47:47,640 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1066, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1171, PETRI_PLACES=163, PETRI_TRANSITIONS=139} [2024-06-04 17:47:47,641 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 131 predicate places. [2024-06-04 17:47:47,641 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 139 transitions, 1171 flow [2024-06-04 17:47:47,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:47:47,641 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:47:47,641 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:47:47,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-04 17:47:47,641 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:47,641 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:47:47,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1820435466, now seen corresponding path program 10 times [2024-06-04 17:47:47,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:47:47,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872653228] [2024-06-04 17:47:47,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:47:47,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:47:47,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:47:53,861 INFO 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:53,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:47:53,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872653228] [2024-06-04 17:47:53,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872653228] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:47:53,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:47:53,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:47:53,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210800871] [2024-06-04 17:47:53,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:47:53,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:47:53,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:47:53,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:47:53,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:47:53,967 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-04 17:47:53,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 139 transitions, 1171 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call 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:53,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:47:53,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-04 17:47:53,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:47:54,370 INFO L124 PetriNetUnfolderBase]: 317/637 cut-off events. [2024-06-04 17:47:54,370 INFO L125 PetriNetUnfolderBase]: For 18667/18667 co-relation queries the response was YES. [2024-06-04 17:47:54,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3214 conditions, 637 events. 317/637 cut-off events. For 18667/18667 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3205 event pairs, 39 based on Foata normal form. 2/636 useless extension candidates. Maximal degree in co-relation 3141. Up to 487 conditions per place. [2024-06-04 17:47:54,373 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 106 selfloop transitions, 41 changer transitions 0/151 dead transitions. [2024-06-04 17:47:54,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 151 transitions, 1502 flow [2024-06-04 17:47:54,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:47:54,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:47:54,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-04 17:47:54,374 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37575757575757573 [2024-06-04 17:47:54,374 INFO L175 Difference]: Start difference. First operand has 163 places, 139 transitions, 1171 flow. Second operand 10 states and 124 transitions. [2024-06-04 17:47:54,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 151 transitions, 1502 flow [2024-06-04 17:47:54,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 151 transitions, 1426 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-04 17:47:54,417 INFO L231 Difference]: Finished difference. Result has 167 places, 140 transitions, 1194 flow [2024-06-04 17:47:54,417 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1095, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1194, PETRI_PLACES=167, PETRI_TRANSITIONS=140} [2024-06-04 17:47:54,418 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 135 predicate places. [2024-06-04 17:47:54,418 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 140 transitions, 1194 flow [2024-06-04 17:47:54,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call 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,418 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:47:54,418 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:47:54,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-04 17:47:54,419 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:54,419 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:47:54,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1577599956, now seen corresponding path program 11 times [2024-06-04 17:47:54,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:47:54,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069909532] [2024-06-04 17:47:54,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:47:54,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:47:54,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:48:01,046 INFO 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:01,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:48:01,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069909532] [2024-06-04 17:48:01,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069909532] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:48:01,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:48:01,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:48:01,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787796410] [2024-06-04 17:48:01,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:48:01,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:48:01,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:48:01,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:48:01,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:48:01,183 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:48:01,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 140 transitions, 1194 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:48:01,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:48:01,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:48:01,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:48:01,394 INFO L124 PetriNetUnfolderBase]: 314/630 cut-off events. [2024-06-04 17:48:01,394 INFO L125 PetriNetUnfolderBase]: For 17081/17081 co-relation queries the response was YES. [2024-06-04 17:48:01,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3121 conditions, 630 events. 314/630 cut-off events. For 17081/17081 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3176 event pairs, 38 based on Foata normal form. 2/629 useless extension candidates. Maximal degree in co-relation 3047. Up to 482 conditions per place. [2024-06-04 17:48:01,398 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 110 selfloop transitions, 36 changer transitions 0/150 dead transitions. [2024-06-04 17:48:01,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 150 transitions, 1510 flow [2024-06-04 17:48:01,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:48:01,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:48:01,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 123 transitions. [2024-06-04 17:48:01,399 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41414141414141414 [2024-06-04 17:48:01,399 INFO L175 Difference]: Start difference. First operand has 167 places, 140 transitions, 1194 flow. Second operand 9 states and 123 transitions. [2024-06-04 17:48:01,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 150 transitions, 1510 flow [2024-06-04 17:48:01,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 150 transitions, 1403 flow, removed 7 selfloop flow, removed 9 redundant places. [2024-06-04 17:48:01,443 INFO L231 Difference]: Finished difference. Result has 167 places, 140 transitions, 1163 flow [2024-06-04 17:48:01,443 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1087, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1163, PETRI_PLACES=167, PETRI_TRANSITIONS=140} [2024-06-04 17:48:01,443 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 135 predicate places. [2024-06-04 17:48:01,443 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 140 transitions, 1163 flow [2024-06-04 17:48:01,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:48:01,443 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:48:01,443 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:48:01,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-04 17:48:01,444 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:48:01,444 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:48:01,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1828716620, now seen corresponding path program 3 times [2024-06-04 17:48:01,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:48:01,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097576582] [2024-06-04 17:48:01,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:48:01,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:48:01,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:48:09,176 INFO 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:09,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:48:09,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097576582] [2024-06-04 17:48:09,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097576582] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:48:09,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:48:09,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:48:09,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497758381] [2024-06-04 17:48:09,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:48:09,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:48:09,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:48:09,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:48:09,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:48:09,331 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:48:09,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 140 transitions, 1163 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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:09,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:48:09,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:48:09,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:48:09,721 INFO L124 PetriNetUnfolderBase]: 320/639 cut-off events. [2024-06-04 17:48:09,721 INFO L125 PetriNetUnfolderBase]: For 16633/16633 co-relation queries the response was YES. [2024-06-04 17:48:09,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3161 conditions, 639 events. 320/639 cut-off events. For 16633/16633 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3252 event pairs, 42 based on Foata normal form. 1/636 useless extension candidates. Maximal degree in co-relation 3086. Up to 431 conditions per place. [2024-06-04 17:48:09,747 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 95 selfloop transitions, 56 changer transitions 0/155 dead transitions. [2024-06-04 17:48:09,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 155 transitions, 1547 flow [2024-06-04 17:48:09,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:48:09,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:48:09,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 151 transitions. [2024-06-04 17:48:09,748 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41597796143250687 [2024-06-04 17:48:09,748 INFO L175 Difference]: Start difference. First operand has 167 places, 140 transitions, 1163 flow. Second operand 11 states and 151 transitions. [2024-06-04 17:48:09,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 155 transitions, 1547 flow [2024-06-04 17:48:09,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 155 transitions, 1417 flow, removed 2 selfloop flow, removed 10 redundant places. [2024-06-04 17:48:09,789 INFO L231 Difference]: Finished difference. Result has 168 places, 144 transitions, 1210 flow [2024-06-04 17:48:09,789 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1033, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1210, PETRI_PLACES=168, PETRI_TRANSITIONS=144} [2024-06-04 17:48:09,789 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 136 predicate places. [2024-06-04 17:48:09,789 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 144 transitions, 1210 flow [2024-06-04 17:48:09,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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:09,790 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:48:09,790 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:48:09,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-04 17:48:09,790 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:48:09,791 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:48:09,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1829013290, now seen corresponding path program 4 times [2024-06-04 17:48:09,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:48:09,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590307282] [2024-06-04 17:48:09,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:48:09,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:48:09,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:48:15,971 INFO 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:15,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:48:15,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590307282] [2024-06-04 17:48:15,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590307282] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:48:15,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:48:15,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:48:15,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984095426] [2024-06-04 17:48:15,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:48:15,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:48:15,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:48:15,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:48:15,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:48:16,179 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:48:16,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 144 transitions, 1210 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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:16,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:48:16,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:48:16,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:48:16,561 INFO L124 PetriNetUnfolderBase]: 328/654 cut-off events. [2024-06-04 17:48:16,561 INFO L125 PetriNetUnfolderBase]: For 18962/18962 co-relation queries the response was YES. [2024-06-04 17:48:16,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3359 conditions, 654 events. 328/654 cut-off events. For 18962/18962 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3348 event pairs, 42 based on Foata normal form. 1/651 useless extension candidates. Maximal degree in co-relation 3283. Up to 434 conditions per place. [2024-06-04 17:48:16,566 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 95 selfloop transitions, 61 changer transitions 0/160 dead transitions. [2024-06-04 17:48:16,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 160 transitions, 1746 flow [2024-06-04 17:48:16,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:48:16,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:48:16,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 153 transitions. [2024-06-04 17:48:16,567 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4214876033057851 [2024-06-04 17:48:16,567 INFO L175 Difference]: Start difference. First operand has 168 places, 144 transitions, 1210 flow. Second operand 11 states and 153 transitions. [2024-06-04 17:48:16,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 160 transitions, 1746 flow [2024-06-04 17:48:16,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 160 transitions, 1597 flow, removed 21 selfloop flow, removed 8 redundant places. [2024-06-04 17:48:16,609 INFO L231 Difference]: Finished difference. Result has 171 places, 148 transitions, 1288 flow [2024-06-04 17:48:16,609 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1061, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1288, PETRI_PLACES=171, PETRI_TRANSITIONS=148} [2024-06-04 17:48:16,610 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 139 predicate places. [2024-06-04 17:48:16,610 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 148 transitions, 1288 flow [2024-06-04 17:48:16,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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:16,610 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:48:16,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:48:16,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-04 17:48:16,610 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:48:16,610 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:48:16,610 INFO L85 PathProgramCache]: Analyzing trace with hash -988913878, now seen corresponding path program 5 times [2024-06-04 17:48:16,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:48:16,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965041724] [2024-06-04 17:48:16,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:48:16,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:48:16,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:48:22,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:48:22,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:48:22,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965041724] [2024-06-04 17:48:22,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965041724] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:48:22,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:48:22,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:48:22,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162478681] [2024-06-04 17:48:22,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:48:22,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:48:22,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:48:22,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:48:22,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:48:22,737 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:48:22,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 148 transitions, 1288 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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:22,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:48:22,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:48:22,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:48:23,096 INFO L124 PetriNetUnfolderBase]: 336/671 cut-off events. [2024-06-04 17:48:23,096 INFO L125 PetriNetUnfolderBase]: For 21554/21554 co-relation queries the response was YES. [2024-06-04 17:48:23,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3570 conditions, 671 events. 336/671 cut-off events. For 21554/21554 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3463 event pairs, 42 based on Foata normal form. 1/668 useless extension candidates. Maximal degree in co-relation 3493. Up to 428 conditions per place. [2024-06-04 17:48:23,101 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 88 selfloop transitions, 73 changer transitions 0/165 dead transitions. [2024-06-04 17:48:23,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 165 transitions, 1846 flow [2024-06-04 17:48:23,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 17:48:23,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 17:48:23,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 164 transitions. [2024-06-04 17:48:23,102 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41414141414141414 [2024-06-04 17:48:23,102 INFO L175 Difference]: Start difference. First operand has 171 places, 148 transitions, 1288 flow. Second operand 12 states and 164 transitions. [2024-06-04 17:48:23,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 165 transitions, 1846 flow [2024-06-04 17:48:23,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 165 transitions, 1703 flow, removed 34 selfloop flow, removed 7 redundant places. [2024-06-04 17:48:23,154 INFO L231 Difference]: Finished difference. Result has 176 places, 152 transitions, 1404 flow [2024-06-04 17:48:23,154 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1404, PETRI_PLACES=176, PETRI_TRANSITIONS=152} [2024-06-04 17:48:23,154 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 144 predicate places. [2024-06-04 17:48:23,154 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 152 transitions, 1404 flow [2024-06-04 17:48:23,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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:23,154 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:48:23,155 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:48:23,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-04 17:48:23,155 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:48:23,155 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:48:23,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1569022132, now seen corresponding path program 6 times [2024-06-04 17:48:23,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:48:23,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753103939] [2024-06-04 17:48:23,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:48:23,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:48:23,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:48:29,561 INFO 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:29,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:48:29,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753103939] [2024-06-04 17:48:29,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753103939] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:48:29,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:48:29,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:48:29,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980775969] [2024-06-04 17:48:29,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:48:29,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:48:29,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:48:29,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:48:29,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:48:29,694 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:48:29,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 152 transitions, 1404 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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:29,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:48:29,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:48:29,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:48:29,950 INFO L124 PetriNetUnfolderBase]: 334/668 cut-off events. [2024-06-04 17:48:29,950 INFO L125 PetriNetUnfolderBase]: For 20455/20455 co-relation queries the response was YES. [2024-06-04 17:48:29,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3551 conditions, 668 events. 334/668 cut-off events. For 20455/20455 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3454 event pairs, 42 based on Foata normal form. 1/665 useless extension candidates. Maximal degree in co-relation 3472. Up to 451 conditions per place. [2024-06-04 17:48:29,955 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 109 selfloop transitions, 51 changer transitions 0/164 dead transitions. [2024-06-04 17:48:29,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 164 transitions, 1800 flow [2024-06-04 17:48:29,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:48:29,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:48:29,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 138 transitions. [2024-06-04 17:48:29,956 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41818181818181815 [2024-06-04 17:48:29,956 INFO L175 Difference]: Start difference. First operand has 176 places, 152 transitions, 1404 flow. Second operand 10 states and 138 transitions. [2024-06-04 17:48:29,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 164 transitions, 1800 flow [2024-06-04 17:48:30,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 164 transitions, 1654 flow, removed 31 selfloop flow, removed 8 redundant places. [2024-06-04 17:48:30,005 INFO L231 Difference]: Finished difference. Result has 178 places, 154 transitions, 1421 flow [2024-06-04 17:48:30,005 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1264, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1421, PETRI_PLACES=178, PETRI_TRANSITIONS=154} [2024-06-04 17:48:30,006 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 146 predicate places. [2024-06-04 17:48:30,006 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 154 transitions, 1421 flow [2024-06-04 17:48:30,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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,006 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:48:30,006 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:48:30,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-04 17:48:30,006 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:48:30,006 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:48:30,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1857310462, now seen corresponding path program 7 times [2024-06-04 17:48:30,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:48:30,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952515825] [2024-06-04 17:48:30,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:48:30,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:48:30,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:48:36,408 INFO 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,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:48:36,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952515825] [2024-06-04 17:48:36,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952515825] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:48:36,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:48:36,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:48:36,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957114080] [2024-06-04 17:48:36,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:48:36,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:48:36,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:48:36,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:48:36,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:48:36,648 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:48:36,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 154 transitions, 1421 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:48:36,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:48:36,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:48:37,121 INFO L124 PetriNetUnfolderBase]: 332/665 cut-off events. [2024-06-04 17:48:37,121 INFO L125 PetriNetUnfolderBase]: For 19326/19326 co-relation queries the response was YES. [2024-06-04 17:48:37,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3479 conditions, 665 events. 332/665 cut-off events. For 19326/19326 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3451 event pairs, 42 based on Foata normal form. 1/662 useless extension candidates. Maximal degree in co-relation 3398. Up to 451 conditions per place. [2024-06-04 17:48:37,126 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 104 selfloop transitions, 57 changer transitions 0/165 dead transitions. [2024-06-04 17:48:37,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 165 transitions, 1769 flow [2024-06-04 17:48:37,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:48:37,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:48:37,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 150 transitions. [2024-06-04 17:48:37,127 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4132231404958678 [2024-06-04 17:48:37,127 INFO L175 Difference]: Start difference. First operand has 178 places, 154 transitions, 1421 flow. Second operand 11 states and 150 transitions. [2024-06-04 17:48:37,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 165 transitions, 1769 flow [2024-06-04 17:48:37,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 165 transitions, 1602 flow, removed 34 selfloop flow, removed 8 redundant places. [2024-06-04 17:48:37,171 INFO L231 Difference]: Finished difference. Result has 181 places, 154 transitions, 1373 flow [2024-06-04 17:48:37,172 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1254, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1373, PETRI_PLACES=181, PETRI_TRANSITIONS=154} [2024-06-04 17:48:37,172 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 149 predicate places. [2024-06-04 17:48:37,172 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 154 transitions, 1373 flow [2024-06-04 17:48:37,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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,172 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:48:37,172 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:48:37,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-04 17:48:37,173 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:37,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:48:37,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1767965896, now seen corresponding path program 8 times [2024-06-04 17:48:37,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:48:37,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344159712] [2024-06-04 17:48:37,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:48:37,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:48:37,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:48:43,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:48:43,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:48:43,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344159712] [2024-06-04 17:48:43,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344159712] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:48:43,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:48:43,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:48:43,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44965417] [2024-06-04 17:48:43,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:48:43,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:48:43,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:48:43,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:48:43,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:48:43,305 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:48:43,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 154 transitions, 1373 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:48:43,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:48:43,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:48:43,687 INFO L124 PetriNetUnfolderBase]: 330/665 cut-off events. [2024-06-04 17:48:43,687 INFO L125 PetriNetUnfolderBase]: For 18139/18139 co-relation queries the response was YES. [2024-06-04 17:48:43,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3366 conditions, 665 events. 330/665 cut-off events. For 18139/18139 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3429 event pairs, 38 based on Foata normal form. 1/663 useless extension candidates. Maximal degree in co-relation 3284. Up to 465 conditions per place. [2024-06-04 17:48:43,692 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 108 selfloop transitions, 54 changer transitions 0/166 dead transitions. [2024-06-04 17:48:43,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 166 transitions, 1833 flow [2024-06-04 17:48:43,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:48:43,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:48:43,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 151 transitions. [2024-06-04 17:48:43,693 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41597796143250687 [2024-06-04 17:48:43,693 INFO L175 Difference]: Start difference. First operand has 181 places, 154 transitions, 1373 flow. Second operand 11 states and 151 transitions. [2024-06-04 17:48:43,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 166 transitions, 1833 flow [2024-06-04 17:48:43,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 166 transitions, 1689 flow, removed 5 selfloop flow, removed 10 redundant places. [2024-06-04 17:48:43,738 INFO L231 Difference]: Finished difference. Result has 182 places, 154 transitions, 1342 flow [2024-06-04 17:48:43,738 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1229, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1342, PETRI_PLACES=182, PETRI_TRANSITIONS=154} [2024-06-04 17:48:43,739 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 150 predicate places. [2024-06-04 17:48:43,739 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 154 transitions, 1342 flow [2024-06-04 17:48:43,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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,739 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:48:43,739 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:48:43,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-04 17:48:43,739 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:43,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:48:43,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1459909806, now seen corresponding path program 9 times [2024-06-04 17:48:43,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:48:43,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229955876] [2024-06-04 17:48:43,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:48:43,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:48:43,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:48:49,425 INFO 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,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:48:49,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229955876] [2024-06-04 17:48:49,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229955876] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:48:49,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:48:49,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:48:49,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208633003] [2024-06-04 17:48:49,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:48:49,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:48:49,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:48:49,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:48:49,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:48:49,585 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:48:49,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 154 transitions, 1342 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:48:49,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:48:49,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:48:49,958 INFO L124 PetriNetUnfolderBase]: 328/662 cut-off events. [2024-06-04 17:48:49,958 INFO L125 PetriNetUnfolderBase]: For 17271/17271 co-relation queries the response was YES. [2024-06-04 17:48:49,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3260 conditions, 662 events. 328/662 cut-off events. For 17271/17271 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3424 event pairs, 38 based on Foata normal form. 1/660 useless extension candidates. Maximal degree in co-relation 3178. Up to 469 conditions per place. [2024-06-04 17:48:49,962 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 110 selfloop transitions, 51 changer transitions 0/165 dead transitions. [2024-06-04 17:48:49,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 165 transitions, 1690 flow [2024-06-04 17:48:49,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:48:49,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:48:49,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 148 transitions. [2024-06-04 17:48:49,963 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40771349862258954 [2024-06-04 17:48:49,963 INFO L175 Difference]: Start difference. First operand has 182 places, 154 transitions, 1342 flow. Second operand 11 states and 148 transitions. [2024-06-04 17:48:49,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 165 transitions, 1690 flow [2024-06-04 17:48:50,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 165 transitions, 1501 flow, removed 29 selfloop flow, removed 10 redundant places. [2024-06-04 17:48:50,003 INFO L231 Difference]: Finished difference. Result has 183 places, 154 transitions, 1260 flow [2024-06-04 17:48:50,003 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1260, PETRI_PLACES=183, PETRI_TRANSITIONS=154} [2024-06-04 17:48:50,003 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 151 predicate places. [2024-06-04 17:48:50,003 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 154 transitions, 1260 flow [2024-06-04 17:48:50,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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:50,004 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:48:50,004 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:48:50,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-04 17:48:50,004 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:50,005 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:48:50,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1208260559, now seen corresponding path program 1 times [2024-06-04 17:48:50,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:48:50,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497109138] [2024-06-04 17:48:50,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:48:50,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:48:50,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:48:55,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:48:55,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:48:55,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497109138] [2024-06-04 17:48:55,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497109138] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:48:55,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:48:55,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:48:55,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247988505] [2024-06-04 17:48:55,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:48:55,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:48:55,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:48:55,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:48:55,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:48:56,100 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:48:56,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 154 transitions, 1260 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:48:56,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:48:56,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:48:56,347 INFO L124 PetriNetUnfolderBase]: 332/667 cut-off events. [2024-06-04 17:48:56,348 INFO L125 PetriNetUnfolderBase]: For 19104/19104 co-relation queries the response was YES. [2024-06-04 17:48:56,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3216 conditions, 667 events. 332/667 cut-off events. For 19104/19104 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3469 event pairs, 25 based on Foata normal form. 2/665 useless extension candidates. Maximal degree in co-relation 3133. Up to 535 conditions per place. [2024-06-04 17:48:56,352 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 153 selfloop transitions, 12 changer transitions 0/169 dead transitions. [2024-06-04 17:48:56,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 169 transitions, 1628 flow [2024-06-04 17:48:56,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:48:56,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:48:56,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 115 transitions. [2024-06-04 17:48:56,353 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3872053872053872 [2024-06-04 17:48:56,353 INFO L175 Difference]: Start difference. First operand has 183 places, 154 transitions, 1260 flow. Second operand 9 states and 115 transitions. [2024-06-04 17:48:56,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 169 transitions, 1628 flow [2024-06-04 17:48:56,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 169 transitions, 1511 flow, removed 1 selfloop flow, removed 11 redundant places. [2024-06-04 17:48:56,397 INFO L231 Difference]: Finished difference. Result has 181 places, 155 transitions, 1179 flow [2024-06-04 17:48:56,397 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1143, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1179, PETRI_PLACES=181, PETRI_TRANSITIONS=155} [2024-06-04 17:48:56,397 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 149 predicate places. [2024-06-04 17:48:56,397 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 155 transitions, 1179 flow [2024-06-04 17:48:56,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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,398 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:48:56,398 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:48:56,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-04 17:48:56,398 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:56,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:48:56,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1364000587, now seen corresponding path program 2 times [2024-06-04 17:48:56,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:48:56,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280040207] [2024-06-04 17:48:56,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:48:56,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:48:56,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:49:03,661 INFO 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:03,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:49:03,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280040207] [2024-06-04 17:49:03,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280040207] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:49:03,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:49:03,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:49:03,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995575765] [2024-06-04 17:49:03,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:49:03,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:49:03,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:49:03,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:49:03,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:49:03,870 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:49:03,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 155 transitions, 1179 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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:03,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:49:03,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:49:03,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:49:04,234 INFO L124 PetriNetUnfolderBase]: 373/760 cut-off events. [2024-06-04 17:49:04,234 INFO L125 PetriNetUnfolderBase]: For 44682/44682 co-relation queries the response was YES. [2024-06-04 17:49:04,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4104 conditions, 760 events. 373/760 cut-off events. For 44682/44682 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4050 event pairs, 52 based on Foata normal form. 8/764 useless extension candidates. Maximal degree in co-relation 4020. Up to 472 conditions per place. [2024-06-04 17:49:04,240 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 118 selfloop transitions, 45 changer transitions 7/174 dead transitions. [2024-06-04 17:49:04,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 174 transitions, 1751 flow [2024-06-04 17:49:04,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:49:04,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:49:04,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 136 transitions. [2024-06-04 17:49:04,241 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45791245791245794 [2024-06-04 17:49:04,242 INFO L175 Difference]: Start difference. First operand has 181 places, 155 transitions, 1179 flow. Second operand 9 states and 136 transitions. [2024-06-04 17:49:04,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 174 transitions, 1751 flow [2024-06-04 17:49:04,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 174 transitions, 1725 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-06-04 17:49:04,306 INFO L231 Difference]: Finished difference. Result has 183 places, 153 transitions, 1230 flow [2024-06-04 17:49:04,307 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1230, PETRI_PLACES=183, PETRI_TRANSITIONS=153} [2024-06-04 17:49:04,307 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 151 predicate places. [2024-06-04 17:49:04,307 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 153 transitions, 1230 flow [2024-06-04 17:49:04,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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:04,307 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:49:04,307 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:49:04,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-04 17:49:04,307 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:49:04,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:49:04,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1363793197, now seen corresponding path program 3 times [2024-06-04 17:49:04,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:49:04,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963327461] [2024-06-04 17:49:04,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:49:04,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:49:04,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:49:10,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:49:10,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:49:10,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963327461] [2024-06-04 17:49:10,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963327461] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:49:10,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:49:10,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:49:10,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697592658] [2024-06-04 17:49:10,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:49:10,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:49:10,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:49:10,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:49:10,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:49:11,169 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:49:11,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 153 transitions, 1230 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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:11,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:49:11,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:49:11,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:49:11,531 INFO L124 PetriNetUnfolderBase]: 346/707 cut-off events. [2024-06-04 17:49:11,531 INFO L125 PetriNetUnfolderBase]: For 33287/33287 co-relation queries the response was YES. [2024-06-04 17:49:11,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3619 conditions, 707 events. 346/707 cut-off events. For 33287/33287 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3709 event pairs, 41 based on Foata normal form. 6/709 useless extension candidates. Maximal degree in co-relation 3534. Up to 500 conditions per place. [2024-06-04 17:49:11,536 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 114 selfloop transitions, 49 changer transitions 0/167 dead transitions. [2024-06-04 17:49:11,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 167 transitions, 1640 flow [2024-06-04 17:49:11,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:49:11,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:49:11,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 132 transitions. [2024-06-04 17:49:11,537 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-06-04 17:49:11,537 INFO L175 Difference]: Start difference. First operand has 183 places, 153 transitions, 1230 flow. Second operand 9 states and 132 transitions. [2024-06-04 17:49:11,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 167 transitions, 1640 flow [2024-06-04 17:49:11,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 167 transitions, 1546 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-04 17:49:11,598 INFO L231 Difference]: Finished difference. Result has 181 places, 155 transitions, 1298 flow [2024-06-04 17:49:11,598 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1136, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1298, PETRI_PLACES=181, PETRI_TRANSITIONS=155} [2024-06-04 17:49:11,599 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 149 predicate places. [2024-06-04 17:49:11,599 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 155 transitions, 1298 flow [2024-06-04 17:49:11,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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:11,599 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:49:11,599 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:49:11,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-04 17:49:11,599 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:49:11,599 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:49:11,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1369507117, now seen corresponding path program 4 times [2024-06-04 17:49:11,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:49:11,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245829151] [2024-06-04 17:49:11,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:49:11,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:49:11,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:49:18,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:49:18,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:49:18,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245829151] [2024-06-04 17:49:18,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245829151] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:49:18,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:49:18,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:49:18,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395994003] [2024-06-04 17:49:18,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:49:18,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:49:18,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:49:18,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:49:18,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:49:18,990 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:49:18,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 155 transitions, 1298 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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:18,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:49:18,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:49:18,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:49:19,335 INFO L124 PetriNetUnfolderBase]: 362/743 cut-off events. [2024-06-04 17:49:19,335 INFO L125 PetriNetUnfolderBase]: For 34999/34999 co-relation queries the response was YES. [2024-06-04 17:49:19,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3774 conditions, 743 events. 362/743 cut-off events. For 34999/34999 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3967 event pairs, 47 based on Foata normal form. 8/747 useless extension candidates. Maximal degree in co-relation 3690. Up to 462 conditions per place. [2024-06-04 17:49:19,340 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 118 selfloop transitions, 42 changer transitions 10/174 dead transitions. [2024-06-04 17:49:19,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 174 transitions, 1827 flow [2024-06-04 17:49:19,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:49:19,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:49:19,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 135 transitions. [2024-06-04 17:49:19,341 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2024-06-04 17:49:19,341 INFO L175 Difference]: Start difference. First operand has 181 places, 155 transitions, 1298 flow. Second operand 9 states and 135 transitions. [2024-06-04 17:49:19,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 174 transitions, 1827 flow [2024-06-04 17:49:19,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 174 transitions, 1688 flow, removed 23 selfloop flow, removed 8 redundant places. [2024-06-04 17:49:19,406 INFO L231 Difference]: Finished difference. Result has 183 places, 153 transitions, 1230 flow [2024-06-04 17:49:19,406 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1161, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1230, PETRI_PLACES=183, PETRI_TRANSITIONS=153} [2024-06-04 17:49:19,407 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 151 predicate places. [2024-06-04 17:49:19,407 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 153 transitions, 1230 flow [2024-06-04 17:49:19,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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:19,407 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:49:19,407 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:49:19,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-04 17:49:19,408 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:49:19,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:49:19,408 INFO L85 PathProgramCache]: Analyzing trace with hash 427713653, now seen corresponding path program 5 times [2024-06-04 17:49:19,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:49:19,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47452029] [2024-06-04 17:49:19,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:49:19,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:49:19,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:49:26,381 INFO 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,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:49:26,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47452029] [2024-06-04 17:49:26,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47452029] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:49:26,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:49:26,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:49:26,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230007109] [2024-06-04 17:49:26,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:49:26,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:49:26,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:49:26,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:49:26,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:49:26,529 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:49:26,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 153 transitions, 1230 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:49:26,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:49:26,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:49:26,927 INFO L124 PetriNetUnfolderBase]: 360/741 cut-off events. [2024-06-04 17:49:26,927 INFO L125 PetriNetUnfolderBase]: For 35402/35402 co-relation queries the response was YES. [2024-06-04 17:49:26,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3657 conditions, 741 events. 360/741 cut-off events. For 35402/35402 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3962 event pairs, 49 based on Foata normal form. 8/745 useless extension candidates. Maximal degree in co-relation 3572. Up to 420 conditions per place. [2024-06-04 17:49:26,931 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 121 selfloop transitions, 36 changer transitions 13/174 dead transitions. [2024-06-04 17:49:26,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 174 transitions, 1766 flow [2024-06-04 17:49:26,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:49:26,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:49:26,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 129 transitions. [2024-06-04 17:49:26,932 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43434343434343436 [2024-06-04 17:49:26,933 INFO L175 Difference]: Start difference. First operand has 183 places, 153 transitions, 1230 flow. Second operand 9 states and 129 transitions. [2024-06-04 17:49:26,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 174 transitions, 1766 flow [2024-06-04 17:49:26,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 174 transitions, 1672 flow, removed 5 selfloop flow, removed 9 redundant places. [2024-06-04 17:49:26,988 INFO L231 Difference]: Finished difference. Result has 182 places, 151 transitions, 1204 flow [2024-06-04 17:49:26,988 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1140, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1204, PETRI_PLACES=182, PETRI_TRANSITIONS=151} [2024-06-04 17:49:26,988 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 150 predicate places. [2024-06-04 17:49:26,988 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 151 transitions, 1204 flow [2024-06-04 17:49:26,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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,988 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:49:26,988 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:49:26,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-04 17:49:26,989 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:49:26,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:49:26,989 INFO L85 PathProgramCache]: Analyzing trace with hash -480288197, now seen corresponding path program 6 times [2024-06-04 17:49:26,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:49:26,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120480968] [2024-06-04 17:49:26,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:49:26,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:49:27,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:49:32,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:49:32,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:49:32,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120480968] [2024-06-04 17:49:32,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120480968] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:49:32,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:49:32,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:49:32,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963648022] [2024-06-04 17:49:32,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:49:32,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:49:32,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:49:32,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:49:32,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:49:32,270 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2024-06-04 17:49:32,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 151 transitions, 1204 flow. Second operand has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call 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:32,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:49:32,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2024-06-04 17:49:32,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:49:32,481 INFO L124 PetriNetUnfolderBase]: 341/703 cut-off events. [2024-06-04 17:49:32,481 INFO L125 PetriNetUnfolderBase]: For 25559/25559 co-relation queries the response was YES. [2024-06-04 17:49:32,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3518 conditions, 703 events. 341/703 cut-off events. For 25559/25559 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3676 event pairs, 46 based on Foata normal form. 2/702 useless extension candidates. Maximal degree in co-relation 3433. Up to 500 conditions per place. [2024-06-04 17:49:32,486 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 109 selfloop transitions, 52 changer transitions 0/165 dead transitions. [2024-06-04 17:49:32,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 165 transitions, 1578 flow [2024-06-04 17:49:32,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:49:32,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:49:32,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 147 transitions. [2024-06-04 17:49:32,487 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44545454545454544 [2024-06-04 17:49:32,487 INFO L175 Difference]: Start difference. First operand has 182 places, 151 transitions, 1204 flow. Second operand 10 states and 147 transitions. [2024-06-04 17:49:32,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 165 transitions, 1578 flow [2024-06-04 17:49:32,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 165 transitions, 1498 flow, removed 4 selfloop flow, removed 9 redundant places. [2024-06-04 17:49:32,536 INFO L231 Difference]: Finished difference. Result has 179 places, 154 transitions, 1260 flow [2024-06-04 17:49:32,536 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1124, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1260, PETRI_PLACES=179, PETRI_TRANSITIONS=154} [2024-06-04 17:49:32,537 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 147 predicate places. [2024-06-04 17:49:32,537 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 154 transitions, 1260 flow [2024-06-04 17:49:32,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call 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:32,537 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:49:32,537 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:49:32,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-04 17:49:32,537 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:49:32,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:49:32,537 INFO L85 PathProgramCache]: Analyzing trace with hash -736788707, now seen corresponding path program 7 times [2024-06-04 17:49:32,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:49:32,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254486358] [2024-06-04 17:49:32,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:49:32,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:49:32,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:49:40,239 INFO 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:40,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:49:40,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254486358] [2024-06-04 17:49:40,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254486358] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:49:40,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:49:40,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:49:40,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207578816] [2024-06-04 17:49:40,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:49:40,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:49:40,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:49:40,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:49:40,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:49:40,385 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:49:40,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 154 transitions, 1260 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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:40,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:49:40,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:49:40,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:49:40,625 INFO L124 PetriNetUnfolderBase]: 340/696 cut-off events. [2024-06-04 17:49:40,626 INFO L125 PetriNetUnfolderBase]: For 18648/18648 co-relation queries the response was YES. [2024-06-04 17:49:40,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3336 conditions, 696 events. 340/696 cut-off events. For 18648/18648 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 3675 event pairs, 40 based on Foata normal form. 2/695 useless extension candidates. Maximal degree in co-relation 3254. Up to 492 conditions per place. [2024-06-04 17:49:40,631 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 112 selfloop transitions, 52 changer transitions 0/168 dead transitions. [2024-06-04 17:49:40,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 168 transitions, 1646 flow [2024-06-04 17:49:40,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:49:40,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:49:40,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 137 transitions. [2024-06-04 17:49:40,632 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41515151515151516 [2024-06-04 17:49:40,632 INFO L175 Difference]: Start difference. First operand has 179 places, 154 transitions, 1260 flow. Second operand 10 states and 137 transitions. [2024-06-04 17:49:40,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 168 transitions, 1646 flow [2024-06-04 17:49:40,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 168 transitions, 1534 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-04 17:49:40,670 INFO L231 Difference]: Finished difference. Result has 182 places, 157 transitions, 1290 flow [2024-06-04 17:49:40,671 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1152, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1290, PETRI_PLACES=182, PETRI_TRANSITIONS=157} [2024-06-04 17:49:40,671 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 150 predicate places. [2024-06-04 17:49:40,671 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 157 transitions, 1290 flow [2024-06-04 17:49:40,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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:40,671 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:49:40,671 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:49:40,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-04 17:49:40,671 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:49:40,671 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:49:40,671 INFO L85 PathProgramCache]: Analyzing trace with hash -736996097, now seen corresponding path program 8 times [2024-06-04 17:49:40,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:49:40,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449828551] [2024-06-04 17:49:40,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:49:40,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:49:40,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:49:46,760 INFO 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:46,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:49:46,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449828551] [2024-06-04 17:49:46,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449828551] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:49:46,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:49:46,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:49:46,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811564058] [2024-06-04 17:49:46,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:49:46,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:49:46,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:49:46,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:49:46,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:49:46,906 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:49:46,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 157 transitions, 1290 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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:46,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:49:46,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:49:46,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:49:47,231 INFO L124 PetriNetUnfolderBase]: 344/704 cut-off events. [2024-06-04 17:49:47,231 INFO L125 PetriNetUnfolderBase]: For 19327/19327 co-relation queries the response was YES. [2024-06-04 17:49:47,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3381 conditions, 704 events. 344/704 cut-off events. For 19327/19327 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3742 event pairs, 40 based on Foata normal form. 2/703 useless extension candidates. Maximal degree in co-relation 3298. Up to 480 conditions per place. [2024-06-04 17:49:47,236 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 112 selfloop transitions, 54 changer transitions 0/170 dead transitions. [2024-06-04 17:49:47,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 170 transitions, 1662 flow [2024-06-04 17:49:47,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:49:47,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:49:47,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 138 transitions. [2024-06-04 17:49:47,237 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41818181818181815 [2024-06-04 17:49:47,237 INFO L175 Difference]: Start difference. First operand has 182 places, 157 transitions, 1290 flow. Second operand 10 states and 138 transitions. [2024-06-04 17:49:47,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 170 transitions, 1662 flow [2024-06-04 17:49:47,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 170 transitions, 1565 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-04 17:49:47,278 INFO L231 Difference]: Finished difference. Result has 186 places, 158 transitions, 1319 flow [2024-06-04 17:49:47,278 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1193, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1319, PETRI_PLACES=186, PETRI_TRANSITIONS=158} [2024-06-04 17:49:47,279 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 154 predicate places. [2024-06-04 17:49:47,279 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 158 transitions, 1319 flow [2024-06-04 17:49:47,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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:47,279 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:49:47,279 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:49:47,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-04 17:49:47,279 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:47,280 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:49:47,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1389351917, now seen corresponding path program 9 times [2024-06-04 17:49:47,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:49:47,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142006894] [2024-06-04 17:49:47,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:49:47,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:49:47,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:49:53,511 INFO 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:53,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:49:53,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142006894] [2024-06-04 17:49:53,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142006894] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:49:53,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:49:53,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:49:53,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261466200] [2024-06-04 17:49:53,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:49:53,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:49:53,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:49:53,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:49:53,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:49:53,709 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:49:53,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 158 transitions, 1319 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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:53,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:49:53,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:49:53,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:49:54,039 INFO L124 PetriNetUnfolderBase]: 362/738 cut-off events. [2024-06-04 17:49:54,040 INFO L125 PetriNetUnfolderBase]: For 23452/23452 co-relation queries the response was YES. [2024-06-04 17:49:54,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3678 conditions, 738 events. 362/738 cut-off events. For 23452/23452 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 3960 event pairs, 43 based on Foata normal form. 2/737 useless extension candidates. Maximal degree in co-relation 3594. Up to 498 conditions per place. [2024-06-04 17:49:54,045 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 119 selfloop transitions, 54 changer transitions 0/177 dead transitions. [2024-06-04 17:49:54,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 177 transitions, 1866 flow [2024-06-04 17:49:54,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:49:54,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:49:54,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 138 transitions. [2024-06-04 17:49:54,047 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41818181818181815 [2024-06-04 17:49:54,047 INFO L175 Difference]: Start difference. First operand has 186 places, 158 transitions, 1319 flow. Second operand 10 states and 138 transitions. [2024-06-04 17:49:54,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 177 transitions, 1866 flow [2024-06-04 17:49:54,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 177 transitions, 1746 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-04 17:49:54,101 INFO L231 Difference]: Finished difference. Result has 189 places, 163 transitions, 1372 flow [2024-06-04 17:49:54,101 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1203, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1372, PETRI_PLACES=189, PETRI_TRANSITIONS=163} [2024-06-04 17:49:54,102 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 157 predicate places. [2024-06-04 17:49:54,102 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 163 transitions, 1372 flow [2024-06-04 17:49:54,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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:54,102 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:49:54,102 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:49:54,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-04 17:49:54,102 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:54,103 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:49:54,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1383637997, now seen corresponding path program 10 times [2024-06-04 17:49:54,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:49:54,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598587704] [2024-06-04 17:49:54,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:49:54,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:49:54,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:50:00,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:50:00,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:50:00,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598587704] [2024-06-04 17:50:00,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598587704] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:50:00,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:50:00,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:50:00,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892775140] [2024-06-04 17:50:00,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:50:00,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:50:00,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:50:00,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:50:00,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:50:00,614 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:50:00,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 163 transitions, 1372 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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:00,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:50:00,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:50:00,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:50:00,872 INFO L124 PetriNetUnfolderBase]: 366/746 cut-off events. [2024-06-04 17:50:00,872 INFO L125 PetriNetUnfolderBase]: For 24359/24359 co-relation queries the response was YES. [2024-06-04 17:50:00,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3742 conditions, 746 events. 366/746 cut-off events. For 24359/24359 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4017 event pairs, 49 based on Foata normal form. 2/745 useless extension candidates. Maximal degree in co-relation 3656. Up to 541 conditions per place. [2024-06-04 17:50:00,878 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 118 selfloop transitions, 53 changer transitions 0/175 dead transitions. [2024-06-04 17:50:00,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 175 transitions, 1756 flow [2024-06-04 17:50:00,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:50:00,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:50:00,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2024-06-04 17:50:00,879 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.403030303030303 [2024-06-04 17:50:00,879 INFO L175 Difference]: Start difference. First operand has 189 places, 163 transitions, 1372 flow. Second operand 10 states and 133 transitions. [2024-06-04 17:50:00,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 175 transitions, 1756 flow [2024-06-04 17:50:00,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 175 transitions, 1707 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-06-04 17:50:00,946 INFO L231 Difference]: Finished difference. Result has 195 places, 164 transitions, 1451 flow [2024-06-04 17:50:00,946 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1325, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1451, PETRI_PLACES=195, PETRI_TRANSITIONS=164} [2024-06-04 17:50:00,946 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 163 predicate places. [2024-06-04 17:50:00,947 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 164 transitions, 1451 flow [2024-06-04 17:50:00,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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:00,947 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:50:00,947 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:50:00,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-04 17:50:00,947 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:50:00,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:50:00,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1492210003, now seen corresponding path program 11 times [2024-06-04 17:50:00,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:50:00,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081900176] [2024-06-04 17:50:00,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:50:00,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:50:00,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:50:07,128 INFO 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:07,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:50:07,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081900176] [2024-06-04 17:50:07,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081900176] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:50:07,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:50:07,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:50:07,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009472878] [2024-06-04 17:50:07,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:50:07,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:50:07,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:50:07,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:50:07,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:50:07,260 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:50:07,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 164 transitions, 1451 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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:07,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:50:07,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:50:07,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:50:07,523 INFO L124 PetriNetUnfolderBase]: 377/767 cut-off events. [2024-06-04 17:50:07,523 INFO L125 PetriNetUnfolderBase]: For 28808/28808 co-relation queries the response was YES. [2024-06-04 17:50:07,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4059 conditions, 767 events. 377/767 cut-off events. For 28808/28808 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4141 event pairs, 50 based on Foata normal form. 2/766 useless extension candidates. Maximal degree in co-relation 3972. Up to 545 conditions per place. [2024-06-04 17:50:07,528 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 121 selfloop transitions, 54 changer transitions 0/179 dead transitions. [2024-06-04 17:50:07,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 179 transitions, 1981 flow [2024-06-04 17:50:07,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:50:07,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:50:07,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 140 transitions. [2024-06-04 17:50:07,530 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2024-06-04 17:50:07,530 INFO L175 Difference]: Start difference. First operand has 195 places, 164 transitions, 1451 flow. Second operand 10 states and 140 transitions. [2024-06-04 17:50:07,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 179 transitions, 1981 flow [2024-06-04 17:50:07,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 179 transitions, 1863 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-04 17:50:07,586 INFO L231 Difference]: Finished difference. Result has 197 places, 166 transitions, 1479 flow [2024-06-04 17:50:07,586 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1333, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1479, PETRI_PLACES=197, PETRI_TRANSITIONS=166} [2024-06-04 17:50:07,587 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 165 predicate places. [2024-06-04 17:50:07,587 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 166 transitions, 1479 flow [2024-06-04 17:50:07,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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:07,587 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:50:07,587 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:50:07,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-04 17:50:07,587 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:50:07,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:50:07,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1492417393, now seen corresponding path program 12 times [2024-06-04 17:50:07,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:50:07,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585851839] [2024-06-04 17:50:07,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:50:07,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:50:07,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:50:13,558 INFO 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:13,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:50:13,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585851839] [2024-06-04 17:50:13,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585851839] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:50:13,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:50:13,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:50:13,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416494251] [2024-06-04 17:50:13,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:50:13,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:50:13,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:50:13,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:50:13,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:50:13,788 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:50:13,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 166 transitions, 1479 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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:13,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:50:13,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:50:13,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:50:14,265 INFO L124 PetriNetUnfolderBase]: 374/762 cut-off events. [2024-06-04 17:50:14,265 INFO L125 PetriNetUnfolderBase]: For 26213/26213 co-relation queries the response was YES. [2024-06-04 17:50:14,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3924 conditions, 762 events. 374/762 cut-off events. For 26213/26213 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4135 event pairs, 51 based on Foata normal form. 2/761 useless extension candidates. Maximal degree in co-relation 3836. Up to 557 conditions per place. [2024-06-04 17:50:14,271 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 120 selfloop transitions, 53 changer transitions 0/177 dead transitions. [2024-06-04 17:50:14,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 177 transitions, 1851 flow [2024-06-04 17:50:14,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:50:14,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:50:14,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 137 transitions. [2024-06-04 17:50:14,272 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41515151515151516 [2024-06-04 17:50:14,272 INFO L175 Difference]: Start difference. First operand has 197 places, 166 transitions, 1479 flow. Second operand 10 states and 137 transitions. [2024-06-04 17:50:14,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 177 transitions, 1851 flow [2024-06-04 17:50:14,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 177 transitions, 1744 flow, removed 14 selfloop flow, removed 6 redundant places. [2024-06-04 17:50:14,335 INFO L231 Difference]: Finished difference. Result has 201 places, 166 transitions, 1482 flow [2024-06-04 17:50:14,336 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1372, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1482, PETRI_PLACES=201, PETRI_TRANSITIONS=166} [2024-06-04 17:50:14,336 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 169 predicate places. [2024-06-04 17:50:14,336 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 166 transitions, 1482 flow [2024-06-04 17:50:14,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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:14,336 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:50:14,336 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:50:14,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-04 17:50:14,337 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:50:14,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:50:14,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1486703473, now seen corresponding path program 13 times [2024-06-04 17:50:14,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:50:14,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401712965] [2024-06-04 17:50:14,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:50:14,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:50:14,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:50:20,614 INFO 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:20,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:50:20,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401712965] [2024-06-04 17:50:20,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401712965] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:50:20,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:50:20,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:50:20,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540369174] [2024-06-04 17:50:20,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:50:20,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:50:20,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:50:20,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:50:20,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:50:20,757 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:50:20,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 166 transitions, 1482 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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:20,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:50:20,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:50:20,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:50:21,087 INFO L124 PetriNetUnfolderBase]: 378/770 cut-off events. [2024-06-04 17:50:21,087 INFO L125 PetriNetUnfolderBase]: For 26873/26873 co-relation queries the response was YES. [2024-06-04 17:50:21,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4006 conditions, 770 events. 378/770 cut-off events. For 26873/26873 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 4194 event pairs, 49 based on Foata normal form. 2/769 useless extension candidates. Maximal degree in co-relation 3916. Up to 503 conditions per place. [2024-06-04 17:50:21,093 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 118 selfloop transitions, 58 changer transitions 0/180 dead transitions. [2024-06-04 17:50:21,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 180 transitions, 1882 flow [2024-06-04 17:50:21,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:50:21,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:50:21,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 139 transitions. [2024-06-04 17:50:21,094 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4212121212121212 [2024-06-04 17:50:21,094 INFO L175 Difference]: Start difference. First operand has 201 places, 166 transitions, 1482 flow. Second operand 10 states and 139 transitions. [2024-06-04 17:50:21,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 180 transitions, 1882 flow [2024-06-04 17:50:21,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 180 transitions, 1760 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-06-04 17:50:21,154 INFO L231 Difference]: Finished difference. Result has 201 places, 167 transitions, 1500 flow [2024-06-04 17:50:21,154 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1360, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1500, PETRI_PLACES=201, PETRI_TRANSITIONS=167} [2024-06-04 17:50:21,155 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 169 predicate places. [2024-06-04 17:50:21,155 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 167 transitions, 1500 flow [2024-06-04 17:50:21,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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:21,155 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:50:21,155 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:50:21,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-04 17:50:21,155 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:50:21,155 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:50:21,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1058249163, now seen corresponding path program 14 times [2024-06-04 17:50:21,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:50:21,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696508528] [2024-06-04 17:50:21,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:50:21,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:50:21,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:50:26,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:50:26,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:50:26,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696508528] [2024-06-04 17:50:26,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696508528] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:50:26,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:50:26,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:50:26,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204423315] [2024-06-04 17:50:26,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:50:26,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:50:26,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:50:26,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:50:26,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:50:27,156 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:50:27,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 167 transitions, 1500 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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:27,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:50:27,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:50:27,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:50:27,381 INFO L124 PetriNetUnfolderBase]: 375/765 cut-off events. [2024-06-04 17:50:27,381 INFO L125 PetriNetUnfolderBase]: For 24015/24015 co-relation queries the response was YES. [2024-06-04 17:50:27,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3897 conditions, 765 events. 375/765 cut-off events. For 24015/24015 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 4176 event pairs, 50 based on Foata normal form. 2/764 useless extension candidates. Maximal degree in co-relation 3806. Up to 546 conditions per place. [2024-06-04 17:50:27,386 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 121 selfloop transitions, 54 changer transitions 0/179 dead transitions. [2024-06-04 17:50:27,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 179 transitions, 1878 flow [2024-06-04 17:50:27,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:50:27,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:50:27,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 135 transitions. [2024-06-04 17:50:27,387 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2024-06-04 17:50:27,387 INFO L175 Difference]: Start difference. First operand has 201 places, 167 transitions, 1500 flow. Second operand 10 states and 135 transitions. [2024-06-04 17:50:27,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 179 transitions, 1878 flow [2024-06-04 17:50:27,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 179 transitions, 1732 flow, removed 14 selfloop flow, removed 9 redundant places. [2024-06-04 17:50:27,432 INFO L231 Difference]: Finished difference. Result has 202 places, 167 transitions, 1466 flow [2024-06-04 17:50:27,433 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1354, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1466, PETRI_PLACES=202, PETRI_TRANSITIONS=167} [2024-06-04 17:50:27,433 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 170 predicate places. [2024-06-04 17:50:27,433 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 167 transitions, 1466 flow [2024-06-04 17:50:27,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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:27,433 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:50:27,433 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:50:27,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-04 17:50:27,433 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:50:27,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:50:27,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1205858763, now seen corresponding path program 15 times [2024-06-04 17:50:27,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:50:27,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277534278] [2024-06-04 17:50:27,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:50:27,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:50:27,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:50:33,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:50:33,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:50:33,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277534278] [2024-06-04 17:50:33,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277534278] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:50:33,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:50:33,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:50:33,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839471659] [2024-06-04 17:50:33,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:50:33,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:50:33,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:50:33,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:50:33,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:50:33,782 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:50:33,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 167 transitions, 1466 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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:33,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:50:33,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:50:33,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:50:34,007 INFO L124 PetriNetUnfolderBase]: 379/773 cut-off events. [2024-06-04 17:50:34,007 INFO L125 PetriNetUnfolderBase]: For 24665/24665 co-relation queries the response was YES. [2024-06-04 17:50:34,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3889 conditions, 773 events. 379/773 cut-off events. For 24665/24665 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 4224 event pairs, 48 based on Foata normal form. 2/772 useless extension candidates. Maximal degree in co-relation 3798. Up to 359 conditions per place. [2024-06-04 17:50:34,013 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 118 selfloop transitions, 62 changer transitions 0/184 dead transitions. [2024-06-04 17:50:34,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 184 transitions, 2026 flow [2024-06-04 17:50:34,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:50:34,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:50:34,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 137 transitions. [2024-06-04 17:50:34,014 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41515151515151516 [2024-06-04 17:50:34,014 INFO L175 Difference]: Start difference. First operand has 202 places, 167 transitions, 1466 flow. Second operand 10 states and 137 transitions. [2024-06-04 17:50:34,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 184 transitions, 2026 flow [2024-06-04 17:50:34,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 184 transitions, 1912 flow, removed 1 selfloop flow, removed 9 redundant places. [2024-06-04 17:50:34,065 INFO L231 Difference]: Finished difference. Result has 203 places, 169 transitions, 1522 flow [2024-06-04 17:50:34,065 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1352, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1522, PETRI_PLACES=203, PETRI_TRANSITIONS=169} [2024-06-04 17:50:34,065 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 171 predicate places. [2024-06-04 17:50:34,065 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 169 transitions, 1522 flow [2024-06-04 17:50:34,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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:34,066 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:50:34,066 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:50:34,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-04 17:50:34,068 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:50:34,068 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:50:34,068 INFO L85 PathProgramCache]: Analyzing trace with hash 233450097, now seen corresponding path program 1 times [2024-06-04 17:50:34,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:50:34,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125903063] [2024-06-04 17:50:34,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:50:34,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:50:34,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:50:40,926 INFO 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:40,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:50:40,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125903063] [2024-06-04 17:50:40,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125903063] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:50:40,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:50:40,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:50:40,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061205299] [2024-06-04 17:50:40,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:50:40,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:50:40,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:50:40,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:50:40,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:50:41,110 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:50:41,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 169 transitions, 1522 flow. Second operand has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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:41,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:50:41,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:50:41,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:50:41,507 INFO L124 PetriNetUnfolderBase]: 413/846 cut-off events. [2024-06-04 17:50:41,507 INFO L125 PetriNetUnfolderBase]: For 50023/50023 co-relation queries the response was YES. [2024-06-04 17:50:41,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4817 conditions, 846 events. 413/846 cut-off events. For 50023/50023 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 4705 event pairs, 68 based on Foata normal form. 6/848 useless extension candidates. Maximal degree in co-relation 4725. Up to 493 conditions per place. [2024-06-04 17:50:41,515 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 112 selfloop transitions, 68 changer transitions 5/189 dead transitions. [2024-06-04 17:50:41,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 189 transitions, 2146 flow [2024-06-04 17:50:41,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:50:41,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:50:41,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 156 transitions. [2024-06-04 17:50:41,516 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4297520661157025 [2024-06-04 17:50:41,516 INFO L175 Difference]: Start difference. First operand has 203 places, 169 transitions, 1522 flow. Second operand 11 states and 156 transitions. [2024-06-04 17:50:41,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 189 transitions, 2146 flow [2024-06-04 17:50:41,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 189 transitions, 2056 flow, removed 12 selfloop flow, removed 6 redundant places. [2024-06-04 17:50:41,611 INFO L231 Difference]: Finished difference. Result has 208 places, 168 transitions, 1565 flow [2024-06-04 17:50:41,611 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1432, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1565, PETRI_PLACES=208, PETRI_TRANSITIONS=168} [2024-06-04 17:50:41,611 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 176 predicate places. [2024-06-04 17:50:41,611 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 168 transitions, 1565 flow [2024-06-04 17:50:41,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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:41,612 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:50:41,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, 1] [2024-06-04 17:50:41,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-04 17:50:41,612 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:50:41,612 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:50:41,612 INFO L85 PathProgramCache]: Analyzing trace with hash 233123667, now seen corresponding path program 2 times [2024-06-04 17:50:41,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:50:41,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895858885] [2024-06-04 17:50:41,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:50:41,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:50:41,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:50:47,749 INFO 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:47,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:50:47,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895858885] [2024-06-04 17:50:47,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895858885] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:50:47,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:50:47,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:50:47,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127033809] [2024-06-04 17:50:47,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:50:47,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:50:47,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:50:47,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:50:47,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:50:47,902 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:50:47,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 168 transitions, 1565 flow. Second operand has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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:47,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:50:47,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:50:47,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:50:48,331 INFO L124 PetriNetUnfolderBase]: 413/846 cut-off events. [2024-06-04 17:50:48,331 INFO L125 PetriNetUnfolderBase]: For 55397/55397 co-relation queries the response was YES. [2024-06-04 17:50:48,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4932 conditions, 846 events. 413/846 cut-off events. For 55397/55397 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 4691 event pairs, 74 based on Foata normal form. 8/850 useless extension candidates. Maximal degree in co-relation 4838. Up to 575 conditions per place. [2024-06-04 17:50:48,338 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 105 selfloop transitions, 65 changer transitions 9/183 dead transitions. [2024-06-04 17:50:48,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 183 transitions, 2007 flow [2024-06-04 17:50:48,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:50:48,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:50:48,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 153 transitions. [2024-06-04 17:50:48,339 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4214876033057851 [2024-06-04 17:50:48,339 INFO L175 Difference]: Start difference. First operand has 208 places, 168 transitions, 1565 flow. Second operand 11 states and 153 transitions. [2024-06-04 17:50:48,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 183 transitions, 2007 flow [2024-06-04 17:50:48,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 183 transitions, 1869 flow, removed 1 selfloop flow, removed 10 redundant places. [2024-06-04 17:50:48,438 INFO L231 Difference]: Finished difference. Result has 208 places, 165 transitions, 1537 flow [2024-06-04 17:50:48,438 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1427, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1537, PETRI_PLACES=208, PETRI_TRANSITIONS=165} [2024-06-04 17:50:48,439 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 176 predicate places. [2024-06-04 17:50:48,439 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 165 transitions, 1537 flow [2024-06-04 17:50:48,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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:48,439 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:50:48,439 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:50:48,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-04 17:50:48,439 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:50:48,439 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:50:48,439 INFO L85 PathProgramCache]: Analyzing trace with hash -101669327, now seen corresponding path program 3 times [2024-06-04 17:50:48,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:50:48,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19473496] [2024-06-04 17:50:48,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:50:48,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:50:48,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:50:55,151 INFO 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:55,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:50:55,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19473496] [2024-06-04 17:50:55,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19473496] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:50:55,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:50:55,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:50:55,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054836427] [2024-06-04 17:50:55,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:50:55,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:50:55,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:50:55,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:50:55,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:50:55,369 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:50:55,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 165 transitions, 1537 flow. Second operand has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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:55,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:50:55,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:50:55,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:50:55,712 INFO L124 PetriNetUnfolderBase]: 385/789 cut-off events. [2024-06-04 17:50:55,712 INFO L125 PetriNetUnfolderBase]: For 38922/38922 co-relation queries the response was YES. [2024-06-04 17:50:55,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4135 conditions, 789 events. 385/789 cut-off events. For 38922/38922 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 4334 event pairs, 56 based on Foata normal form. 8/794 useless extension candidates. Maximal degree in co-relation 4041. Up to 561 conditions per place. [2024-06-04 17:50:55,717 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 115 selfloop transitions, 54 changer transitions 9/182 dead transitions. [2024-06-04 17:50:55,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 182 transitions, 1995 flow [2024-06-04 17:50:55,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:50:55,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:50:55,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 150 transitions. [2024-06-04 17:50:55,718 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4132231404958678 [2024-06-04 17:50:55,718 INFO L175 Difference]: Start difference. First operand has 208 places, 165 transitions, 1537 flow. Second operand 11 states and 150 transitions. [2024-06-04 17:50:55,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 182 transitions, 1995 flow [2024-06-04 17:50:55,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 182 transitions, 1849 flow, removed 6 selfloop flow, removed 10 redundant places. [2024-06-04 17:50:55,774 INFO L231 Difference]: Finished difference. Result has 207 places, 164 transitions, 1500 flow [2024-06-04 17:50:55,774 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1399, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1500, PETRI_PLACES=207, PETRI_TRANSITIONS=164} [2024-06-04 17:50:55,774 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 175 predicate places. [2024-06-04 17:50:55,774 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 164 transitions, 1500 flow [2024-06-04 17:50:55,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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:55,775 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:50:55,775 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:50:55,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-04 17:50:55,775 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:55,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:50:55,775 INFO L85 PathProgramCache]: Analyzing trace with hash -358169837, now seen corresponding path program 4 times [2024-06-04 17:50:55,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:50:55,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137166188] [2024-06-04 17:50:55,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:50:55,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:50:55,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:51:02,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:51:02,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:51:02,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137166188] [2024-06-04 17:51:02,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137166188] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:51:02,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:51:02,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:51:02,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074683974] [2024-06-04 17:51:02,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:51:02,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:51:02,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:51:02,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:51:02,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:51:02,936 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:51:02,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 164 transitions, 1500 flow. Second operand has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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:02,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:51:02,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:51:02,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:51:03,388 INFO L124 PetriNetUnfolderBase]: 383/787 cut-off events. [2024-06-04 17:51:03,388 INFO L125 PetriNetUnfolderBase]: For 37548/37548 co-relation queries the response was YES. [2024-06-04 17:51:03,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4068 conditions, 787 events. 383/787 cut-off events. For 37548/37548 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 4338 event pairs, 56 based on Foata normal form. 8/792 useless extension candidates. Maximal degree in co-relation 3974. Up to 549 conditions per place. [2024-06-04 17:51:03,394 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 115 selfloop transitions, 49 changer transitions 13/181 dead transitions. [2024-06-04 17:51:03,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 181 transitions, 1952 flow [2024-06-04 17:51:03,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:51:03,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:51:03,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 150 transitions. [2024-06-04 17:51:03,394 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4132231404958678 [2024-06-04 17:51:03,395 INFO L175 Difference]: Start difference. First operand has 207 places, 164 transitions, 1500 flow. Second operand 11 states and 150 transitions. [2024-06-04 17:51:03,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 181 transitions, 1952 flow [2024-06-04 17:51:03,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 181 transitions, 1834 flow, removed 5 selfloop flow, removed 10 redundant places. [2024-06-04 17:51:03,457 INFO L231 Difference]: Finished difference. Result has 207 places, 160 transitions, 1452 flow [2024-06-04 17:51:03,458 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1386, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1452, PETRI_PLACES=207, PETRI_TRANSITIONS=160} [2024-06-04 17:51:03,458 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 175 predicate places. [2024-06-04 17:51:03,458 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 160 transitions, 1452 flow [2024-06-04 17:51:03,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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:03,458 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:51:03,458 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:51:03,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-04 17:51:03,458 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:51:03,458 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:51:03,459 INFO L85 PathProgramCache]: Analyzing trace with hash 788218171, now seen corresponding path program 5 times [2024-06-04 17:51:03,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:51:03,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748811776] [2024-06-04 17:51:03,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:51:03,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:51:03,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:51:10,273 INFO 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,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:51:10,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748811776] [2024-06-04 17:51:10,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748811776] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:51:10,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:51:10,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:51:10,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181684540] [2024-06-04 17:51:10,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:51:10,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:51:10,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:51:10,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:51:10,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:51:10,413 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:51:10,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 160 transitions, 1452 flow. Second operand has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:51:10,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:51:10,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:51:10,885 INFO L124 PetriNetUnfolderBase]: 374/769 cut-off events. [2024-06-04 17:51:10,886 INFO L125 PetriNetUnfolderBase]: For 37796/37796 co-relation queries the response was YES. [2024-06-04 17:51:10,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3979 conditions, 769 events. 374/769 cut-off events. For 37796/37796 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4220 event pairs, 60 based on Foata normal form. 8/773 useless extension candidates. Maximal degree in co-relation 3885. Up to 523 conditions per place. [2024-06-04 17:51:10,891 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 113 selfloop transitions, 51 changer transitions 9/177 dead transitions. [2024-06-04 17:51:10,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 177 transitions, 1896 flow [2024-06-04 17:51:10,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:51:10,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:51:10,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 149 transitions. [2024-06-04 17:51:10,892 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41046831955922863 [2024-06-04 17:51:10,892 INFO L175 Difference]: Start difference. First operand has 207 places, 160 transitions, 1452 flow. Second operand 11 states and 149 transitions. [2024-06-04 17:51:10,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 177 transitions, 1896 flow [2024-06-04 17:51:10,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 177 transitions, 1782 flow, removed 8 selfloop flow, removed 10 redundant places. [2024-06-04 17:51:10,950 INFO L231 Difference]: Finished difference. Result has 204 places, 159 transitions, 1437 flow [2024-06-04 17:51:10,951 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1342, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1437, PETRI_PLACES=204, PETRI_TRANSITIONS=159} [2024-06-04 17:51:10,951 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 172 predicate places. [2024-06-04 17:51:10,951 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 159 transitions, 1437 flow [2024-06-04 17:51:10,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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,951 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:51:10,951 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:51:10,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-04 17:51:10,951 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:51:10,952 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:51:10,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1762240995, now seen corresponding path program 6 times [2024-06-04 17:51:10,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:51:10,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137619278] [2024-06-04 17:51:10,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:51:10,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:51:11,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:51:16,800 INFO 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,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:51:16,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137619278] [2024-06-04 17:51:16,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137619278] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:51:16,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:51:16,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:51:16,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684008245] [2024-06-04 17:51:16,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:51:16,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:51:16,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:51:16,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:51:16,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:51:16,919 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:51:16,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 159 transitions, 1437 flow. Second operand has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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:16,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:51:16,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:51:16,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:51:17,366 INFO L124 PetriNetUnfolderBase]: 369/769 cut-off events. [2024-06-04 17:51:17,366 INFO L125 PetriNetUnfolderBase]: For 36589/36589 co-relation queries the response was YES. [2024-06-04 17:51:17,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3920 conditions, 769 events. 369/769 cut-off events. For 36589/36589 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4234 event pairs, 58 based on Foata normal form. 8/774 useless extension candidates. Maximal degree in co-relation 3827. Up to 540 conditions per place. [2024-06-04 17:51:17,371 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 114 selfloop transitions, 47 changer transitions 9/174 dead transitions. [2024-06-04 17:51:17,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 174 transitions, 1857 flow [2024-06-04 17:51:17,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:51:17,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:51:17,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 146 transitions. [2024-06-04 17:51:17,372 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4022038567493113 [2024-06-04 17:51:17,372 INFO L175 Difference]: Start difference. First operand has 204 places, 159 transitions, 1437 flow. Second operand 11 states and 146 transitions. [2024-06-04 17:51:17,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 174 transitions, 1857 flow [2024-06-04 17:51:17,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 174 transitions, 1749 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-04 17:51:17,433 INFO L231 Difference]: Finished difference. Result has 203 places, 156 transitions, 1399 flow [2024-06-04 17:51:17,433 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1329, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1399, PETRI_PLACES=203, PETRI_TRANSITIONS=156} [2024-06-04 17:51:17,434 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 171 predicate places. [2024-06-04 17:51:17,434 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 156 transitions, 1399 flow [2024-06-04 17:51:17,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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,434 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:51:17,434 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:51:17,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-04 17:51:17,434 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:51:17,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:51:17,434 INFO L85 PathProgramCache]: Analyzing trace with hash -141465073, now seen corresponding path program 16 times [2024-06-04 17:51:17,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:51:17,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756366750] [2024-06-04 17:51:17,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:51:17,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:51:17,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:51:23,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:51:23,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:51:23,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756366750] [2024-06-04 17:51:23,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756366750] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:51:23,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:51:23,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:51:23,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732888920] [2024-06-04 17:51:23,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:51:23,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:51:23,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:51:23,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:51:23,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:51:23,484 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:51:23,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 156 transitions, 1399 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:51:23,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:51:23,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:51:23,742 INFO L124 PetriNetUnfolderBase]: 356/742 cut-off events. [2024-06-04 17:51:23,742 INFO L125 PetriNetUnfolderBase]: For 24546/24546 co-relation queries the response was YES. [2024-06-04 17:51:23,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3770 conditions, 742 events. 356/742 cut-off events. For 24546/24546 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 4051 event pairs, 50 based on Foata normal form. 2/741 useless extension candidates. Maximal degree in co-relation 3678. Up to 475 conditions per place. [2024-06-04 17:51:23,747 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 118 selfloop transitions, 49 changer transitions 0/171 dead transitions. [2024-06-04 17:51:23,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 171 transitions, 1909 flow [2024-06-04 17:51:23,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:51:23,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:51:23,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 141 transitions. [2024-06-04 17:51:23,748 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42727272727272725 [2024-06-04 17:51:23,748 INFO L175 Difference]: Start difference. First operand has 203 places, 156 transitions, 1399 flow. Second operand 10 states and 141 transitions. [2024-06-04 17:51:23,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 171 transitions, 1909 flow [2024-06-04 17:51:23,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 171 transitions, 1797 flow, removed 6 selfloop flow, removed 11 redundant places. [2024-06-04 17:51:23,814 INFO L231 Difference]: Finished difference. Result has 200 places, 157 transitions, 1411 flow [2024-06-04 17:51:23,815 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1291, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1411, PETRI_PLACES=200, PETRI_TRANSITIONS=157} [2024-06-04 17:51:23,815 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 168 predicate places. [2024-06-04 17:51:23,815 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 157 transitions, 1411 flow [2024-06-04 17:51:23,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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,815 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:51:23,815 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:51:23,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-04 17:51:23,815 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:51:23,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:51:23,815 INFO L85 PathProgramCache]: Analyzing trace with hash -135751153, now seen corresponding path program 17 times [2024-06-04 17:51:23,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:51:23,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107285108] [2024-06-04 17:51:23,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:51:23,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:51:23,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:51:30,078 INFO 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:30,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:51:30,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107285108] [2024-06-04 17:51:30,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107285108] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:51:30,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:51:30,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:51:30,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546785991] [2024-06-04 17:51:30,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:51:30,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:51:30,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:51:30,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:51:30,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:51:30,246 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:51:30,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 157 transitions, 1411 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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:30,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:51:30,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:51:30,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:51:30,505 INFO L124 PetriNetUnfolderBase]: 361/749 cut-off events. [2024-06-04 17:51:30,505 INFO L125 PetriNetUnfolderBase]: For 24071/24071 co-relation queries the response was YES. [2024-06-04 17:51:30,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3825 conditions, 749 events. 361/749 cut-off events. For 24071/24071 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4102 event pairs, 52 based on Foata normal form. 2/748 useless extension candidates. Maximal degree in co-relation 3734. Up to 552 conditions per place. [2024-06-04 17:51:30,511 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 118 selfloop transitions, 48 changer transitions 0/170 dead transitions. [2024-06-04 17:51:30,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 170 transitions, 1802 flow [2024-06-04 17:51:30,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:51:30,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:51:30,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 136 transitions. [2024-06-04 17:51:30,512 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4121212121212121 [2024-06-04 17:51:30,512 INFO L175 Difference]: Start difference. First operand has 200 places, 157 transitions, 1411 flow. Second operand 10 states and 136 transitions. [2024-06-04 17:51:30,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 170 transitions, 1802 flow [2024-06-04 17:51:30,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 170 transitions, 1583 flow, removed 13 selfloop flow, removed 11 redundant places. [2024-06-04 17:51:30,574 INFO L231 Difference]: Finished difference. Result has 199 places, 159 transitions, 1327 flow [2024-06-04 17:51:30,574 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1202, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1327, PETRI_PLACES=199, PETRI_TRANSITIONS=159} [2024-06-04 17:51:30,574 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 167 predicate places. [2024-06-04 17:51:30,574 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 159 transitions, 1327 flow [2024-06-04 17:51:30,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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:30,574 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:51:30,575 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:51:30,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-04 17:51:30,575 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:51:30,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:51:30,575 INFO L85 PathProgramCache]: Analyzing trace with hash 855633393, now seen corresponding path program 18 times [2024-06-04 17:51:30,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:51:30,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230740660] [2024-06-04 17:51:30,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:51:30,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:51:30,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:51:36,984 INFO 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:36,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:51:36,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230740660] [2024-06-04 17:51:36,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230740660] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:51:36,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:51:36,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:51:36,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423689661] [2024-06-04 17:51:36,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:51:36,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:51:36,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:51:36,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:51:36,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:51:37,139 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:51:37,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 159 transitions, 1327 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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:37,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:51:37,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:51:37,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:51:37,464 INFO L124 PetriNetUnfolderBase]: 365/761 cut-off events. [2024-06-04 17:51:37,464 INFO L125 PetriNetUnfolderBase]: For 24597/24597 co-relation queries the response was YES. [2024-06-04 17:51:37,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3651 conditions, 761 events. 365/761 cut-off events. For 24597/24597 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4199 event pairs, 54 based on Foata normal form. 2/760 useless extension candidates. Maximal degree in co-relation 3562. Up to 560 conditions per place. [2024-06-04 17:51:37,470 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 118 selfloop transitions, 50 changer transitions 0/172 dead transitions. [2024-06-04 17:51:37,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 172 transitions, 1707 flow [2024-06-04 17:51:37,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:51:37,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:51:37,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 150 transitions. [2024-06-04 17:51:37,471 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4132231404958678 [2024-06-04 17:51:37,472 INFO L175 Difference]: Start difference. First operand has 199 places, 159 transitions, 1327 flow. Second operand 11 states and 150 transitions. [2024-06-04 17:51:37,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 172 transitions, 1707 flow [2024-06-04 17:51:37,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 172 transitions, 1604 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-04 17:51:37,535 INFO L231 Difference]: Finished difference. Result has 203 places, 160 transitions, 1346 flow [2024-06-04 17:51:37,536 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1224, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1346, PETRI_PLACES=203, PETRI_TRANSITIONS=160} [2024-06-04 17:51:37,536 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 171 predicate places. [2024-06-04 17:51:37,536 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 160 transitions, 1346 flow [2024-06-04 17:51:37,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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:37,536 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:51:37,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, 1] [2024-06-04 17:51:37,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-04 17:51:37,536 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:51:37,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:51:37,537 INFO L85 PathProgramCache]: Analyzing trace with hash 599132883, now seen corresponding path program 19 times [2024-06-04 17:51:37,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:51:37,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735646075] [2024-06-04 17:51:37,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:51:37,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:51:37,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:51:44,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:51:44,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:51:44,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735646075] [2024-06-04 17:51:44,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735646075] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:51:44,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:51:44,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:51:44,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980407074] [2024-06-04 17:51:44,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:51:44,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:51:44,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:51:44,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:51:44,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:51:44,370 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:51:44,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 160 transitions, 1346 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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:44,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:51:44,370 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:51:44,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:51:44,713 INFO L124 PetriNetUnfolderBase]: 369/771 cut-off events. [2024-06-04 17:51:44,714 INFO L125 PetriNetUnfolderBase]: For 25435/25435 co-relation queries the response was YES. [2024-06-04 17:51:44,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3710 conditions, 771 events. 369/771 cut-off events. For 25435/25435 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 4293 event pairs, 54 based on Foata normal form. 2/770 useless extension candidates. Maximal degree in co-relation 3620. Up to 568 conditions per place. [2024-06-04 17:51:44,719 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 118 selfloop transitions, 51 changer transitions 0/173 dead transitions. [2024-06-04 17:51:44,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 173 transitions, 1730 flow [2024-06-04 17:51:44,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:51:44,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:51:44,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 149 transitions. [2024-06-04 17:51:44,725 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41046831955922863 [2024-06-04 17:51:44,725 INFO L175 Difference]: Start difference. First operand has 203 places, 160 transitions, 1346 flow. Second operand 11 states and 149 transitions. [2024-06-04 17:51:44,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 173 transitions, 1730 flow [2024-06-04 17:51:44,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 173 transitions, 1620 flow, removed 6 selfloop flow, removed 9 redundant places. [2024-06-04 17:51:44,792 INFO L231 Difference]: Finished difference. Result has 205 places, 161 transitions, 1362 flow [2024-06-04 17:51:44,792 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1236, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1362, PETRI_PLACES=205, PETRI_TRANSITIONS=161} [2024-06-04 17:51:44,793 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 173 predicate places. [2024-06-04 17:51:44,793 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 161 transitions, 1362 flow [2024-06-04 17:51:44,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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:44,793 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:51:44,793 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:51:44,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-04 17:51:44,793 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:51:44,793 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:51:44,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1672882703, now seen corresponding path program 20 times [2024-06-04 17:51:44,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:51:44,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148863428] [2024-06-04 17:51:44,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:51:44,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:51:44,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:51:50,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:51:50,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:51:50,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148863428] [2024-06-04 17:51:50,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148863428] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:51:50,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:51:50,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:51:50,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242179106] [2024-06-04 17:51:50,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:51:50,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:51:50,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:51:50,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:51:50,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:51:50,677 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:51:50,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 161 transitions, 1362 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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:50,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:51:50,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:51:50,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:51:51,004 INFO L124 PetriNetUnfolderBase]: 373/779 cut-off events. [2024-06-04 17:51:51,005 INFO L125 PetriNetUnfolderBase]: For 26228/26228 co-relation queries the response was YES. [2024-06-04 17:51:51,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3763 conditions, 779 events. 373/779 cut-off events. For 26228/26228 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4346 event pairs, 56 based on Foata normal form. 2/778 useless extension candidates. Maximal degree in co-relation 3672. Up to 576 conditions per place. [2024-06-04 17:51:51,011 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 119 selfloop transitions, 51 changer transitions 0/174 dead transitions. [2024-06-04 17:51:51,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 174 transitions, 1750 flow [2024-06-04 17:51:51,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:51:51,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:51:51,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 148 transitions. [2024-06-04 17:51:51,012 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40771349862258954 [2024-06-04 17:51:51,012 INFO L175 Difference]: Start difference. First operand has 205 places, 161 transitions, 1362 flow. Second operand 11 states and 148 transitions. [2024-06-04 17:51:51,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 174 transitions, 1750 flow [2024-06-04 17:51:51,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 174 transitions, 1636 flow, removed 7 selfloop flow, removed 9 redundant places. [2024-06-04 17:51:51,079 INFO L231 Difference]: Finished difference. Result has 207 places, 162 transitions, 1376 flow [2024-06-04 17:51:51,080 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1248, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1376, PETRI_PLACES=207, PETRI_TRANSITIONS=162} [2024-06-04 17:51:51,080 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 175 predicate places. [2024-06-04 17:51:51,080 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 162 transitions, 1376 flow [2024-06-04 17:51:51,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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:51,080 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:51:51,080 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:51:51,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-06-04 17:51:51,080 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:51:51,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:51:51,081 INFO L85 PathProgramCache]: Analyzing trace with hash 598925493, now seen corresponding path program 21 times [2024-06-04 17:51:51,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:51:51,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171495865] [2024-06-04 17:51:51,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:51:51,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:51:51,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:51:57,448 INFO 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:57,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:51:57,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171495865] [2024-06-04 17:51:57,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171495865] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:51:57,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:51:57,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:51:57,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886614298] [2024-06-04 17:51:57,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:51:57,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:51:57,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:51:57,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:51:57,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:51:57,611 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:51:57,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 162 transitions, 1376 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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:57,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:51:57,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:51:57,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:51:57,963 INFO L124 PetriNetUnfolderBase]: 377/787 cut-off events. [2024-06-04 17:51:57,963 INFO L125 PetriNetUnfolderBase]: For 27027/27027 co-relation queries the response was YES. [2024-06-04 17:51:57,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3816 conditions, 787 events. 377/787 cut-off events. For 27027/27027 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4402 event pairs, 56 based on Foata normal form. 2/786 useless extension candidates. Maximal degree in co-relation 3724. Up to 558 conditions per place. [2024-06-04 17:51:57,968 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 118 selfloop transitions, 54 changer transitions 0/176 dead transitions. [2024-06-04 17:51:57,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 176 transitions, 1772 flow [2024-06-04 17:51:57,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:51:57,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:51:57,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 150 transitions. [2024-06-04 17:51:57,969 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4132231404958678 [2024-06-04 17:51:57,969 INFO L175 Difference]: Start difference. First operand has 207 places, 162 transitions, 1376 flow. Second operand 11 states and 150 transitions. [2024-06-04 17:51:57,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 176 transitions, 1772 flow [2024-06-04 17:51:58,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 176 transitions, 1656 flow, removed 8 selfloop flow, removed 9 redundant places. [2024-06-04 17:51:58,036 INFO L231 Difference]: Finished difference. Result has 209 places, 163 transitions, 1396 flow [2024-06-04 17:51:58,036 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1260, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1396, PETRI_PLACES=209, PETRI_TRANSITIONS=163} [2024-06-04 17:51:58,036 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 177 predicate places. [2024-06-04 17:51:58,036 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 163 transitions, 1396 flow [2024-06-04 17:51:58,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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:58,036 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:51:58,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, 1] [2024-06-04 17:51:58,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-06-04 17:51:58,036 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:58,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:51:58,037 INFO L85 PathProgramCache]: Analyzing trace with hash -141320923, now seen corresponding path program 22 times [2024-06-04 17:51:58,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:51:58,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46791808] [2024-06-04 17:51:58,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:51:58,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:51:58,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:52:04,337 INFO 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:04,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:52:04,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46791808] [2024-06-04 17:52:04,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46791808] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:52:04,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:52:04,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:52:04,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798486739] [2024-06-04 17:52:04,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:52:04,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:52:04,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:52:04,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:52:04,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:52:04,474 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:52:04,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 163 transitions, 1396 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:52:04,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:52:04,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:52:04,757 INFO L124 PetriNetUnfolderBase]: 381/795 cut-off events. [2024-06-04 17:52:04,757 INFO L125 PetriNetUnfolderBase]: For 28030/28030 co-relation queries the response was YES. [2024-06-04 17:52:04,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3879 conditions, 795 events. 381/795 cut-off events. For 28030/28030 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4436 event pairs, 56 based on Foata normal form. 2/794 useless extension candidates. Maximal degree in co-relation 3786. Up to 578 conditions per place. [2024-06-04 17:52:04,763 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 123 selfloop transitions, 49 changer transitions 0/176 dead transitions. [2024-06-04 17:52:04,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 176 transitions, 1792 flow [2024-06-04 17:52:04,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:52:04,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:52:04,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 138 transitions. [2024-06-04 17:52:04,764 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41818181818181815 [2024-06-04 17:52:04,764 INFO L175 Difference]: Start difference. First operand has 209 places, 163 transitions, 1396 flow. Second operand 10 states and 138 transitions. [2024-06-04 17:52:04,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 176 transitions, 1792 flow [2024-06-04 17:52:04,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 176 transitions, 1668 flow, removed 9 selfloop flow, removed 9 redundant places. [2024-06-04 17:52:04,840 INFO L231 Difference]: Finished difference. Result has 210 places, 164 transitions, 1400 flow [2024-06-04 17:52:04,840 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1272, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1400, PETRI_PLACES=210, PETRI_TRANSITIONS=164} [2024-06-04 17:52:04,841 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 178 predicate places. [2024-06-04 17:52:04,841 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 164 transitions, 1400 flow [2024-06-04 17:52:04,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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,841 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:52:04,841 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:52:04,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-06-04 17:52:04,841 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:52:04,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:52:04,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1404249585, now seen corresponding path program 23 times [2024-06-04 17:52:04,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:52:04,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33484035] [2024-06-04 17:52:04,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:52:04,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:52:04,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:52:10,669 INFO 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,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:52:10,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33484035] [2024-06-04 17:52:10,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33484035] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:52:10,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:52:10,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:52:10,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707194068] [2024-06-04 17:52:10,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:52:10,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:52:10,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:52:10,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:52:10,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:52:10,813 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:52:10,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 164 transitions, 1400 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:52:10,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:52:10,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:52:11,150 INFO L124 PetriNetUnfolderBase]: 386/806 cut-off events. [2024-06-04 17:52:11,150 INFO L125 PetriNetUnfolderBase]: For 29049/29049 co-relation queries the response was YES. [2024-06-04 17:52:11,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3936 conditions, 806 events. 386/806 cut-off events. For 29049/29049 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 4532 event pairs, 58 based on Foata normal form. 2/805 useless extension candidates. Maximal degree in co-relation 3842. Up to 602 conditions per place. [2024-06-04 17:52:11,157 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 126 selfloop transitions, 47 changer transitions 0/177 dead transitions. [2024-06-04 17:52:11,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 177 transitions, 1809 flow [2024-06-04 17:52:11,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:52:11,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:52:11,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 136 transitions. [2024-06-04 17:52:11,158 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4121212121212121 [2024-06-04 17:52:11,158 INFO L175 Difference]: Start difference. First operand has 210 places, 164 transitions, 1400 flow. Second operand 10 states and 136 transitions. [2024-06-04 17:52:11,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 177 transitions, 1809 flow [2024-06-04 17:52:11,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 177 transitions, 1691 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-06-04 17:52:11,247 INFO L231 Difference]: Finished difference. Result has 212 places, 166 transitions, 1419 flow [2024-06-04 17:52:11,247 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1284, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1419, PETRI_PLACES=212, PETRI_TRANSITIONS=166} [2024-06-04 17:52:11,248 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 180 predicate places. [2024-06-04 17:52:11,248 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 166 transitions, 1419 flow [2024-06-04 17:52:11,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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,248 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:52:11,248 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:52:11,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-06-04 17:52:11,248 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:52:11,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:52:11,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1660750095, now seen corresponding path program 24 times [2024-06-04 17:52:11,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:52:11,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049321639] [2024-06-04 17:52:11,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:52:11,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:52:11,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:52:17,853 INFO 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,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:52:17,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049321639] [2024-06-04 17:52:17,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049321639] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:52:17,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:52:17,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:52:17,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621382195] [2024-06-04 17:52:17,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:52:17,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:52:17,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:52:17,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:52:17,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:52:17,999 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:52:17,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 166 transitions, 1419 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:52:17,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:52:17,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:52:18,275 INFO L124 PetriNetUnfolderBase]: 390/814 cut-off events. [2024-06-04 17:52:18,275 INFO L125 PetriNetUnfolderBase]: For 29944/29944 co-relation queries the response was YES. [2024-06-04 17:52:18,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3977 conditions, 814 events. 390/814 cut-off events. For 29944/29944 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 4586 event pairs, 60 based on Foata normal form. 2/813 useless extension candidates. Maximal degree in co-relation 3882. Up to 610 conditions per place. [2024-06-04 17:52:18,281 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 128 selfloop transitions, 46 changer transitions 0/178 dead transitions. [2024-06-04 17:52:18,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 178 transitions, 1821 flow [2024-06-04 17:52:18,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:52:18,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:52:18,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 136 transitions. [2024-06-04 17:52:18,282 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4121212121212121 [2024-06-04 17:52:18,282 INFO L175 Difference]: Start difference. First operand has 212 places, 166 transitions, 1419 flow. Second operand 10 states and 136 transitions. [2024-06-04 17:52:18,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 178 transitions, 1821 flow [2024-06-04 17:52:18,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 178 transitions, 1709 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-04 17:52:18,353 INFO L231 Difference]: Finished difference. Result has 215 places, 167 transitions, 1433 flow [2024-06-04 17:52:18,353 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1307, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1433, PETRI_PLACES=215, PETRI_TRANSITIONS=167} [2024-06-04 17:52:18,354 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 183 predicate places. [2024-06-04 17:52:18,354 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 167 transitions, 1433 flow [2024-06-04 17:52:18,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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,354 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:52:18,354 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:52:18,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-06-04 17:52:18,354 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:52:18,354 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:52:18,354 INFO L85 PathProgramCache]: Analyzing trace with hash 57980867, now seen corresponding path program 25 times [2024-06-04 17:52:18,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:52:18,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480494582] [2024-06-04 17:52:18,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:52:18,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:52:18,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:52:24,094 INFO 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:24,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:52:24,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480494582] [2024-06-04 17:52:24,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480494582] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:52:24,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:52:24,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:52:24,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739792217] [2024-06-04 17:52:24,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:52:24,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:52:24,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:52:24,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:52:24,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:52:24,271 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:52:24,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 167 transitions, 1433 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:52:24,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:52:24,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:52:24,624 INFO L124 PetriNetUnfolderBase]: 387/806 cut-off events. [2024-06-04 17:52:24,624 INFO L125 PetriNetUnfolderBase]: For 25649/25649 co-relation queries the response was YES. [2024-06-04 17:52:24,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3775 conditions, 806 events. 387/806 cut-off events. For 25649/25649 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 4555 event pairs, 61 based on Foata normal form. 2/804 useless extension candidates. Maximal degree in co-relation 3679. Up to 561 conditions per place. [2024-06-04 17:52:24,630 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 125 selfloop transitions, 50 changer transitions 0/179 dead transitions. [2024-06-04 17:52:24,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 179 transitions, 1811 flow [2024-06-04 17:52:24,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:52:24,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:52:24,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 139 transitions. [2024-06-04 17:52:24,631 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4212121212121212 [2024-06-04 17:52:24,631 INFO L175 Difference]: Start difference. First operand has 215 places, 167 transitions, 1433 flow. Second operand 10 states and 139 transitions. [2024-06-04 17:52:24,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 179 transitions, 1811 flow [2024-06-04 17:52:24,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 179 transitions, 1663 flow, removed 17 selfloop flow, removed 9 redundant places. [2024-06-04 17:52:24,694 INFO L231 Difference]: Finished difference. Result has 216 places, 167 transitions, 1389 flow [2024-06-04 17:52:24,694 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1285, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1389, PETRI_PLACES=216, PETRI_TRANSITIONS=167} [2024-06-04 17:52:24,694 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 184 predicate places. [2024-06-04 17:52:24,694 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 167 transitions, 1389 flow [2024-06-04 17:52:24,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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,694 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:52:24,695 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:52:24,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-06-04 17:52:24,695 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:52:24,695 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:52:24,695 INFO L85 PathProgramCache]: Analyzing trace with hash -830757029, now seen corresponding path program 7 times [2024-06-04 17:52:24,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:52:24,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310865676] [2024-06-04 17:52:24,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:52:24,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:52:24,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:52:30,870 INFO 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,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:52:30,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310865676] [2024-06-04 17:52:30,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310865676] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:52:30,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:52:30,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:52:30,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3585659] [2024-06-04 17:52:30,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:52:30,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:52:30,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:52:30,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:52:30,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:52:31,081 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:52:31,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 167 transitions, 1389 flow. Second operand has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:52:31,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:52:31,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:52:31,514 INFO L124 PetriNetUnfolderBase]: 417/876 cut-off events. [2024-06-04 17:52:31,514 INFO L125 PetriNetUnfolderBase]: For 54472/54472 co-relation queries the response was YES. [2024-06-04 17:52:31,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4599 conditions, 876 events. 417/876 cut-off events. For 54472/54472 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 5016 event pairs, 75 based on Foata normal form. 6/878 useless extension candidates. Maximal degree in co-relation 4502. Up to 567 conditions per place. [2024-06-04 17:52:31,521 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 127 selfloop transitions, 49 changer transitions 6/186 dead transitions. [2024-06-04 17:52:31,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 186 transitions, 2005 flow [2024-06-04 17:52:31,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:52:31,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:52:31,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 155 transitions. [2024-06-04 17:52:31,522 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42699724517906334 [2024-06-04 17:52:31,522 INFO L175 Difference]: Start difference. First operand has 216 places, 167 transitions, 1389 flow. Second operand 11 states and 155 transitions. [2024-06-04 17:52:31,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 186 transitions, 2005 flow [2024-06-04 17:52:31,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 186 transitions, 1870 flow, removed 8 selfloop flow, removed 9 redundant places. [2024-06-04 17:52:31,633 INFO L231 Difference]: Finished difference. Result has 218 places, 165 transitions, 1344 flow [2024-06-04 17:52:31,633 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1254, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1344, PETRI_PLACES=218, PETRI_TRANSITIONS=165} [2024-06-04 17:52:31,633 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 186 predicate places. [2024-06-04 17:52:31,633 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 165 transitions, 1344 flow [2024-06-04 17:52:31,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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,633 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:52:31,633 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:52:31,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-06-04 17:52:31,634 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:52:31,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:52:31,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1372059847, now seen corresponding path program 8 times [2024-06-04 17:52:31,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:52:31,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68572044] [2024-06-04 17:52:31,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:52:31,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:52:31,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:52:37,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:52:37,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:52:37,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68572044] [2024-06-04 17:52:37,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68572044] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:52:37,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:52:37,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:52:37,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126736750] [2024-06-04 17:52:37,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:52:37,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:52:37,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:52:37,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:52:37,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:52:37,690 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2024-06-04 17:52:37,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 165 transitions, 1344 flow. Second operand has 12 states, 12 states have (on average 10.416666666666666) internal successors, (125), 12 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call 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,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:52:37,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2024-06-04 17:52:37,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:52:38,122 INFO L124 PetriNetUnfolderBase]: 421/883 cut-off events. [2024-06-04 17:52:38,122 INFO L125 PetriNetUnfolderBase]: For 57478/57478 co-relation queries the response was YES. [2024-06-04 17:52:38,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4973 conditions, 883 events. 421/883 cut-off events. For 57478/57478 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 5059 event pairs, 73 based on Foata normal form. 2/882 useless extension candidates. Maximal degree in co-relation 4875. Up to 628 conditions per place. [2024-06-04 17:52:38,130 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 117 selfloop transitions, 64 changer transitions 0/185 dead transitions. [2024-06-04 17:52:38,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 185 transitions, 1962 flow [2024-06-04 17:52:38,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-04 17:52:38,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-04 17:52:38,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 191 transitions. [2024-06-04 17:52:38,130 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44522144522144524 [2024-06-04 17:52:38,130 INFO L175 Difference]: Start difference. First operand has 218 places, 165 transitions, 1344 flow. Second operand 13 states and 191 transitions. [2024-06-04 17:52:38,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 185 transitions, 1962 flow [2024-06-04 17:52:38,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 185 transitions, 1858 flow, removed 4 selfloop flow, removed 10 redundant places. [2024-06-04 17:52:38,249 INFO L231 Difference]: Finished difference. Result has 220 places, 168 transitions, 1460 flow [2024-06-04 17:52:38,249 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1244, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1460, PETRI_PLACES=220, PETRI_TRANSITIONS=168} [2024-06-04 17:52:38,249 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 188 predicate places. [2024-06-04 17:52:38,250 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 168 transitions, 1460 flow [2024-06-04 17:52:38,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.416666666666666) internal successors, (125), 12 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call 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,250 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:52:38,250 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:52:38,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-06-04 17:52:38,250 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:52:38,250 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:52:38,250 INFO L85 PathProgramCache]: Analyzing trace with hash -760403535, now seen corresponding path program 9 times [2024-06-04 17:52:38,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:52:38,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588847307] [2024-06-04 17:52:38,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:52:38,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:52:38,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:52:44,555 INFO 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,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:52:44,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588847307] [2024-06-04 17:52:44,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588847307] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:52:44,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:52:44,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:52:44,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123848159] [2024-06-04 17:52:44,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:52:44,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:52:44,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:52:44,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:52:44,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:52:44,734 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2024-06-04 17:52:44,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 168 transitions, 1460 flow. Second operand has 11 states, 11 states have (on average 10.545454545454545) internal successors, (116), 11 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call 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,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:52:44,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2024-06-04 17:52:44,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:52:45,085 INFO L124 PetriNetUnfolderBase]: 411/862 cut-off events. [2024-06-04 17:52:45,085 INFO L125 PetriNetUnfolderBase]: For 51239/51239 co-relation queries the response was YES. [2024-06-04 17:52:45,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4397 conditions, 862 events. 411/862 cut-off events. For 51239/51239 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 4945 event pairs, 71 based on Foata normal form. 8/866 useless extension candidates. Maximal degree in co-relation 4299. Up to 601 conditions per place. [2024-06-04 17:52:45,092 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 122 selfloop transitions, 46 changer transitions 11/183 dead transitions. [2024-06-04 17:52:45,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 183 transitions, 1898 flow [2024-06-04 17:52:45,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:52:45,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:52:45,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 161 transitions. [2024-06-04 17:52:45,092 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44352617079889806 [2024-06-04 17:52:45,093 INFO L175 Difference]: Start difference. First operand has 220 places, 168 transitions, 1460 flow. Second operand 11 states and 161 transitions. [2024-06-04 17:52:45,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 183 transitions, 1898 flow [2024-06-04 17:52:45,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 183 transitions, 1778 flow, removed 18 selfloop flow, removed 9 redundant places. [2024-06-04 17:52:45,195 INFO L231 Difference]: Finished difference. Result has 222 places, 164 transitions, 1406 flow [2024-06-04 17:52:45,196 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1340, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1406, PETRI_PLACES=222, PETRI_TRANSITIONS=164} [2024-06-04 17:52:45,196 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 190 predicate places. [2024-06-04 17:52:45,196 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 164 transitions, 1406 flow [2024-06-04 17:52:45,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.545454545454545) internal successors, (116), 11 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call 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,196 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:52:45,196 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:52:45,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-06-04 17:52:45,196 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:52:45,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:52:45,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1977912113, now seen corresponding path program 10 times [2024-06-04 17:52:45,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:52:45,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258785521] [2024-06-04 17:52:45,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:52:45,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:52:45,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:52:51,520 INFO 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:51,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:52:51,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258785521] [2024-06-04 17:52:51,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258785521] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:52:51,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:52:51,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 17:52:51,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210234669] [2024-06-04 17:52:51,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:52:51,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 17:52:51,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:52:51,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 17:52:51,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-06-04 17:52:51,714 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:52:51,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 164 transitions, 1406 flow. Second operand has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call 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,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:52:51,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:52:51,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:52:52,268 INFO L124 PetriNetUnfolderBase]: 411/860 cut-off events. [2024-06-04 17:52:52,268 INFO L125 PetriNetUnfolderBase]: For 48438/48438 co-relation queries the response was YES. [2024-06-04 17:52:52,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4728 conditions, 860 events. 411/860 cut-off events. For 48438/48438 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 4963 event pairs, 69 based on Foata normal form. 2/858 useless extension candidates. Maximal degree in co-relation 4628. Up to 590 conditions per place. [2024-06-04 17:52:52,275 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 116 selfloop transitions, 63 changer transitions 0/183 dead transitions. [2024-06-04 17:52:52,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 183 transitions, 2024 flow [2024-06-04 17:52:52,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 17:52:52,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 17:52:52,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 166 transitions. [2024-06-04 17:52:52,276 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41919191919191917 [2024-06-04 17:52:52,276 INFO L175 Difference]: Start difference. First operand has 222 places, 164 transitions, 1406 flow. Second operand 12 states and 166 transitions. [2024-06-04 17:52:52,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 183 transitions, 2024 flow [2024-06-04 17:52:52,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 183 transitions, 1892 flow, removed 20 selfloop flow, removed 10 redundant places. [2024-06-04 17:52:52,380 INFO L231 Difference]: Finished difference. Result has 219 places, 167 transitions, 1502 flow [2024-06-04 17:52:52,380 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1292, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1502, PETRI_PLACES=219, PETRI_TRANSITIONS=167} [2024-06-04 17:52:52,380 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 187 predicate places. [2024-06-04 17:52:52,380 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 167 transitions, 1502 flow [2024-06-04 17:52:52,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call 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:52,380 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:52:52,381 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:52:52,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2024-06-04 17:52:52,381 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:52:52,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:52:52,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1978238543, now seen corresponding path program 11 times [2024-06-04 17:52:52,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:52:52,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994292505] [2024-06-04 17:52:52,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:52:52,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:52:52,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:52:59,042 INFO 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:59,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:52:59,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994292505] [2024-06-04 17:52:59,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994292505] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:52:59,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:52:59,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 17:52:59,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423673746] [2024-06-04 17:52:59,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:52:59,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 17:52:59,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:52:59,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 17:52:59,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-06-04 17:52:59,222 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:52:59,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 167 transitions, 1502 flow. Second operand has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call 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:59,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:52:59,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:52:59,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:52:59,635 INFO L124 PetriNetUnfolderBase]: 423/888 cut-off events. [2024-06-04 17:52:59,635 INFO L125 PetriNetUnfolderBase]: For 60033/60033 co-relation queries the response was YES. [2024-06-04 17:52:59,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4845 conditions, 888 events. 423/888 cut-off events. For 60033/60033 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 5135 event pairs, 75 based on Foata normal form. 8/892 useless extension candidates. Maximal degree in co-relation 4746. Up to 622 conditions per place. [2024-06-04 17:52:59,642 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 113 selfloop transitions, 57 changer transitions 9/183 dead transitions. [2024-06-04 17:52:59,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 183 transitions, 1940 flow [2024-06-04 17:52:59,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 17:52:59,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 17:52:59,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 164 transitions. [2024-06-04 17:52:59,642 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41414141414141414 [2024-06-04 17:52:59,643 INFO L175 Difference]: Start difference. First operand has 219 places, 167 transitions, 1502 flow. Second operand 12 states and 164 transitions. [2024-06-04 17:52:59,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 183 transitions, 1940 flow [2024-06-04 17:52:59,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 183 transitions, 1803 flow, removed 26 selfloop flow, removed 8 redundant places. [2024-06-04 17:52:59,777 INFO L231 Difference]: Finished difference. Result has 223 places, 164 transitions, 1471 flow [2024-06-04 17:52:59,778 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1379, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1471, PETRI_PLACES=223, PETRI_TRANSITIONS=164} [2024-06-04 17:52:59,778 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 191 predicate places. [2024-06-04 17:52:59,778 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 164 transitions, 1471 flow [2024-06-04 17:52:59,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call 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:59,778 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:52:59,778 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:52:59,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2024-06-04 17:52:59,778 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:59,779 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:52:59,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1987435313, now seen corresponding path program 12 times [2024-06-04 17:52:59,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:52:59,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662037303] [2024-06-04 17:52:59,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:52:59,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:52:59,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:53:06,877 INFO 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:06,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:53:06,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662037303] [2024-06-04 17:53:06,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662037303] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:53:06,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:53:06,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 17:53:06,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845426333] [2024-06-04 17:53:06,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:53:06,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 17:53:06,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:53:06,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 17:53:06,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-06-04 17:53:07,098 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:53:07,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 164 transitions, 1471 flow. Second operand has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call 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:07,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:53:07,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:53:07,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:53:07,538 INFO L124 PetriNetUnfolderBase]: 404/856 cut-off events. [2024-06-04 17:53:07,538 INFO L125 PetriNetUnfolderBase]: For 51107/51107 co-relation queries the response was YES. [2024-06-04 17:53:07,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4343 conditions, 856 events. 404/856 cut-off events. For 51107/51107 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 4944 event pairs, 71 based on Foata normal form. 8/861 useless extension candidates. Maximal degree in co-relation 4242. Up to 619 conditions per place. [2024-06-04 17:53:07,545 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 116 selfloop transitions, 49 changer transitions 9/178 dead transitions. [2024-06-04 17:53:07,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 178 transitions, 1851 flow [2024-06-04 17:53:07,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 17:53:07,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 17:53:07,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 161 transitions. [2024-06-04 17:53:07,546 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4065656565656566 [2024-06-04 17:53:07,546 INFO L175 Difference]: Start difference. First operand has 223 places, 164 transitions, 1471 flow. Second operand 12 states and 161 transitions. [2024-06-04 17:53:07,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 178 transitions, 1851 flow [2024-06-04 17:53:07,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 178 transitions, 1709 flow, removed 14 selfloop flow, removed 11 redundant places. [2024-06-04 17:53:07,635 INFO L231 Difference]: Finished difference. Result has 221 places, 159 transitions, 1391 flow [2024-06-04 17:53:07,635 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1329, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1391, PETRI_PLACES=221, PETRI_TRANSITIONS=159} [2024-06-04 17:53:07,635 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 189 predicate places. [2024-06-04 17:53:07,636 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 159 transitions, 1391 flow [2024-06-04 17:53:07,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call 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:07,636 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:53:07,636 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:53:07,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2024-06-04 17:53:07,636 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:53:07,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:53:07,636 INFO L85 PathProgramCache]: Analyzing trace with hash 43083155, now seen corresponding path program 13 times [2024-06-04 17:53:07,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:53:07,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701876883] [2024-06-04 17:53:07,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:53:07,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:53:07,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:53:13,952 INFO 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:13,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:53:13,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701876883] [2024-06-04 17:53:13,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701876883] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:53:13,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:53:13,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 17:53:13,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6434387] [2024-06-04 17:53:13,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:53:13,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 17:53:13,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:53:13,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 17:53:13,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-06-04 17:53:14,101 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:53:14,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 159 transitions, 1391 flow. Second operand has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call 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:14,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:53:14,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:53:14,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:53:14,568 INFO L124 PetriNetUnfolderBase]: 385/823 cut-off events. [2024-06-04 17:53:14,569 INFO L125 PetriNetUnfolderBase]: For 39175/39175 co-relation queries the response was YES. [2024-06-04 17:53:14,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3843 conditions, 823 events. 385/823 cut-off events. For 39175/39175 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 4724 event pairs, 67 based on Foata normal form. 8/828 useless extension candidates. Maximal degree in co-relation 3743. Up to 574 conditions per place. [2024-06-04 17:53:14,575 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 109 selfloop transitions, 52 changer transitions 9/174 dead transitions. [2024-06-04 17:53:14,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 174 transitions, 1765 flow [2024-06-04 17:53:14,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-04 17:53:14,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-04 17:53:14,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 173 transitions. [2024-06-04 17:53:14,576 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40326340326340326 [2024-06-04 17:53:14,576 INFO L175 Difference]: Start difference. First operand has 221 places, 159 transitions, 1391 flow. Second operand 13 states and 173 transitions. [2024-06-04 17:53:14,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 174 transitions, 1765 flow [2024-06-04 17:53:14,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 174 transitions, 1633 flow, removed 15 selfloop flow, removed 13 redundant places. [2024-06-04 17:53:14,658 INFO L231 Difference]: Finished difference. Result has 218 places, 154 transitions, 1333 flow [2024-06-04 17:53:14,658 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1259, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1333, PETRI_PLACES=218, PETRI_TRANSITIONS=154} [2024-06-04 17:53:14,659 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 186 predicate places. [2024-06-04 17:53:14,659 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 154 transitions, 1333 flow [2024-06-04 17:53:14,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call 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:14,659 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:53:14,659 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:53:14,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2024-06-04 17:53:14,659 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:53:14,659 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:53:14,659 INFO L85 PathProgramCache]: Analyzing trace with hash 54134345, now seen corresponding path program 14 times [2024-06-04 17:53:14,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:53:14,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53054996] [2024-06-04 17:53:14,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:53:14,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:53:14,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:53:21,005 INFO 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:21,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:53:21,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53054996] [2024-06-04 17:53:21,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53054996] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:53:21,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:53:21,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 17:53:21,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922122559] [2024-06-04 17:53:21,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:53:21,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 17:53:21,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:53:21,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 17:53:21,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-06-04 17:53:21,250 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:53:21,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 154 transitions, 1333 flow. Second operand has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call 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:21,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:53:21,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:53:21,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:53:21,610 INFO L124 PetriNetUnfolderBase]: 388/833 cut-off events. [2024-06-04 17:53:21,610 INFO L125 PetriNetUnfolderBase]: For 42940/42940 co-relation queries the response was YES. [2024-06-04 17:53:21,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4100 conditions, 833 events. 388/833 cut-off events. For 42940/42940 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 4791 event pairs, 75 based on Foata normal form. 6/835 useless extension candidates. Maximal degree in co-relation 4002. Up to 475 conditions per place. [2024-06-04 17:53:21,617 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 105 selfloop transitions, 57 changer transitions 9/175 dead transitions. [2024-06-04 17:53:21,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 175 transitions, 1887 flow [2024-06-04 17:53:21,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-04 17:53:21,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-04 17:53:21,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 178 transitions. [2024-06-04 17:53:21,619 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4149184149184149 [2024-06-04 17:53:21,619 INFO L175 Difference]: Start difference. First operand has 218 places, 154 transitions, 1333 flow. Second operand 13 states and 178 transitions. [2024-06-04 17:53:21,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 175 transitions, 1887 flow [2024-06-04 17:53:21,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 175 transitions, 1769 flow, removed 5 selfloop flow, removed 14 redundant places. [2024-06-04 17:53:21,728 INFO L231 Difference]: Finished difference. Result has 214 places, 151 transitions, 1312 flow [2024-06-04 17:53:21,728 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1219, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1312, PETRI_PLACES=214, PETRI_TRANSITIONS=151} [2024-06-04 17:53:21,728 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 182 predicate places. [2024-06-04 17:53:21,728 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 151 transitions, 1312 flow [2024-06-04 17:53:21,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call 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:21,728 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:53:21,728 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:53:21,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2024-06-04 17:53:21,728 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:53:21,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:53:21,729 INFO L85 PathProgramCache]: Analyzing trace with hash 350413037, now seen corresponding path program 15 times [2024-06-04 17:53:21,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:53:21,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372855643] [2024-06-04 17:53:21,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:53:21,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:53:21,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:53:28,215 INFO 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:28,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:53:28,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372855643] [2024-06-04 17:53:28,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372855643] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:53:28,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:53:28,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 17:53:28,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917243907] [2024-06-04 17:53:28,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:53:28,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 17:53:28,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:53:28,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 17:53:28,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-06-04 17:53:28,443 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:53:28,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 151 transitions, 1312 flow. Second operand has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call 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:28,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:53:28,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:53:28,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:53:28,913 INFO L124 PetriNetUnfolderBase]: 379/804 cut-off events. [2024-06-04 17:53:28,913 INFO L125 PetriNetUnfolderBase]: For 37881/37881 co-relation queries the response was YES. [2024-06-04 17:53:28,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4161 conditions, 804 events. 379/804 cut-off events. For 37881/37881 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4532 event pairs, 74 based on Foata normal form. 2/802 useless extension candidates. Maximal degree in co-relation 4065. Up to 535 conditions per place. [2024-06-04 17:53:28,919 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 103 selfloop transitions, 62 changer transitions 0/169 dead transitions. [2024-06-04 17:53:28,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 169 transitions, 1856 flow [2024-06-04 17:53:28,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 17:53:28,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 17:53:28,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 166 transitions. [2024-06-04 17:53:28,920 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41919191919191917 [2024-06-04 17:53:28,920 INFO L175 Difference]: Start difference. First operand has 214 places, 151 transitions, 1312 flow. Second operand 12 states and 166 transitions. [2024-06-04 17:53:28,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 169 transitions, 1856 flow [2024-06-04 17:53:29,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 169 transitions, 1738 flow, removed 4 selfloop flow, removed 11 redundant places. [2024-06-04 17:53:29,005 INFO L231 Difference]: Finished difference. Result has 212 places, 153 transitions, 1380 flow [2024-06-04 17:53:29,006 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1198, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1380, PETRI_PLACES=212, PETRI_TRANSITIONS=153} [2024-06-04 17:53:29,006 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 180 predicate places. [2024-06-04 17:53:29,006 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 153 transitions, 1380 flow [2024-06-04 17:53:29,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call 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:29,006 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:53:29,006 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:53:29,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2024-06-04 17:53:29,006 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:53:29,006 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:53:29,006 INFO L85 PathProgramCache]: Analyzing trace with hash 864838099, now seen corresponding path program 16 times [2024-06-04 17:53:29,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:53:29,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193089072] [2024-06-04 17:53:29,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:53:29,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:53:29,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:53:36,286 INFO 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:36,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:53:36,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193089072] [2024-06-04 17:53:36,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193089072] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:53:36,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:53:36,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 17:53:36,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683976527] [2024-06-04 17:53:36,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:53:36,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 17:53:36,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:53:36,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 17:53:36,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-06-04 17:53:36,492 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:53:36,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 153 transitions, 1380 flow. Second operand has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call 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:36,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:53:36,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:53:36,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:53:36,925 INFO L124 PetriNetUnfolderBase]: 391/830 cut-off events. [2024-06-04 17:53:36,925 INFO L125 PetriNetUnfolderBase]: For 50195/50195 co-relation queries the response was YES. [2024-06-04 17:53:36,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4347 conditions, 830 events. 391/830 cut-off events. For 50195/50195 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4690 event pairs, 80 based on Foata normal form. 8/834 useless extension candidates. Maximal degree in co-relation 4251. Up to 571 conditions per place. [2024-06-04 17:53:36,932 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 100 selfloop transitions, 56 changer transitions 9/169 dead transitions. [2024-06-04 17:53:36,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 169 transitions, 1790 flow [2024-06-04 17:53:36,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 17:53:36,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 17:53:36,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 164 transitions. [2024-06-04 17:53:36,932 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41414141414141414 [2024-06-04 17:53:36,933 INFO L175 Difference]: Start difference. First operand has 212 places, 153 transitions, 1380 flow. Second operand 12 states and 164 transitions. [2024-06-04 17:53:36,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 169 transitions, 1790 flow [2024-06-04 17:53:37,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 169 transitions, 1565 flow, removed 27 selfloop flow, removed 11 redundant places. [2024-06-04 17:53:37,034 INFO L231 Difference]: Finished difference. Result has 213 places, 150 transitions, 1265 flow [2024-06-04 17:53:37,034 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1171, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1265, PETRI_PLACES=213, PETRI_TRANSITIONS=150} [2024-06-04 17:53:37,034 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 181 predicate places. [2024-06-04 17:53:37,034 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 150 transitions, 1265 flow [2024-06-04 17:53:37,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call 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:37,035 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:53:37,035 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:53:37,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2024-06-04 17:53:37,035 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:53:37,035 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:53:37,036 INFO L85 PathProgramCache]: Analyzing trace with hash 606290659, now seen corresponding path program 17 times [2024-06-04 17:53:37,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:53:37,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596222527] [2024-06-04 17:53:37,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:53:37,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:53:37,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:53:43,588 INFO 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:43,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:53:43,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596222527] [2024-06-04 17:53:43,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596222527] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:53:43,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:53:43,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 17:53:43,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228768054] [2024-06-04 17:53:43,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:53:43,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 17:53:43,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:53:43,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 17:53:43,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-06-04 17:53:43,770 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:53:43,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 150 transitions, 1265 flow. Second operand has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call 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:43,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:53:43,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:53:43,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:53:44,228 INFO L124 PetriNetUnfolderBase]: 386/826 cut-off events. [2024-06-04 17:53:44,228 INFO L125 PetriNetUnfolderBase]: For 51213/51213 co-relation queries the response was YES. [2024-06-04 17:53:44,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4070 conditions, 826 events. 386/826 cut-off events. For 51213/51213 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4670 event pairs, 76 based on Foata normal form. 8/831 useless extension candidates. Maximal degree in co-relation 3975. Up to 597 conditions per place. [2024-06-04 17:53:44,233 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 106 selfloop transitions, 47 changer transitions 9/166 dead transitions. [2024-06-04 17:53:44,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 166 transitions, 1653 flow [2024-06-04 17:53:44,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 17:53:44,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 17:53:44,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 162 transitions. [2024-06-04 17:53:44,234 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2024-06-04 17:53:44,234 INFO L175 Difference]: Start difference. First operand has 213 places, 150 transitions, 1265 flow. Second operand 12 states and 162 transitions. [2024-06-04 17:53:44,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 166 transitions, 1653 flow [2024-06-04 17:53:44,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 166 transitions, 1537 flow, removed 2 selfloop flow, removed 11 redundant places. [2024-06-04 17:53:44,316 INFO L231 Difference]: Finished difference. Result has 211 places, 147 transitions, 1222 flow [2024-06-04 17:53:44,316 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1149, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1222, PETRI_PLACES=211, PETRI_TRANSITIONS=147} [2024-06-04 17:53:44,316 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 179 predicate places. [2024-06-04 17:53:44,316 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 147 transitions, 1222 flow [2024-06-04 17:53:44,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call 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:44,317 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:53:44,317 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:53:44,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2024-06-04 17:53:44,317 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:53:44,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:53:44,317 INFO L85 PathProgramCache]: Analyzing trace with hash 599140819, now seen corresponding path program 18 times [2024-06-04 17:53:44,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:53:44,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39515215] [2024-06-04 17:53:44,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:53:44,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:53:44,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:53:51,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:53:51,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:53:51,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39515215] [2024-06-04 17:53:51,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39515215] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:53:51,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:53:51,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 17:53:51,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587775052] [2024-06-04 17:53:51,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:53:51,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 17:53:51,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:53:51,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 17:53:51,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-06-04 17:53:51,268 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:53:51,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 147 transitions, 1222 flow. Second operand has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call 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,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:53:51,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:53:51,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:53:51,793 INFO L124 PetriNetUnfolderBase]: 367/788 cut-off events. [2024-06-04 17:53:51,793 INFO L125 PetriNetUnfolderBase]: For 40807/40807 co-relation queries the response was YES. [2024-06-04 17:53:51,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3593 conditions, 788 events. 367/788 cut-off events. For 40807/40807 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 4409 event pairs, 78 based on Foata normal form. 8/792 useless extension candidates. Maximal degree in co-relation 3499. Up to 540 conditions per place. [2024-06-04 17:53:51,799 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 97 selfloop transitions, 51 changer transitions 9/161 dead transitions. [2024-06-04 17:53:51,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 161 transitions, 1568 flow [2024-06-04 17:53:51,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 17:53:51,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 17:53:51,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 161 transitions. [2024-06-04 17:53:51,801 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4065656565656566 [2024-06-04 17:53:51,801 INFO L175 Difference]: Start difference. First operand has 211 places, 147 transitions, 1222 flow. Second operand 12 states and 161 transitions. [2024-06-04 17:53:51,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 161 transitions, 1568 flow [2024-06-04 17:53:51,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 161 transitions, 1444 flow, removed 15 selfloop flow, removed 11 redundant places. [2024-06-04 17:53:51,875 INFO L231 Difference]: Finished difference. Result has 209 places, 142 transitions, 1171 flow [2024-06-04 17:53:51,875 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1098, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1171, PETRI_PLACES=209, PETRI_TRANSITIONS=142} [2024-06-04 17:53:51,876 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 177 predicate places. [2024-06-04 17:53:51,876 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 142 transitions, 1171 flow [2024-06-04 17:53:51,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call 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,876 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:53:51,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, 1, 1] [2024-06-04 17:53:51,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2024-06-04 17:53:51,876 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:53:51,876 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:53:51,876 INFO L85 PathProgramCache]: Analyzing trace with hash -978414135, now seen corresponding path program 1 times [2024-06-04 17:53:51,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:53:51,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796994975] [2024-06-04 17:53:51,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:53:51,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:53:51,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:53:59,559 INFO 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:59,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:53:59,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796994975] [2024-06-04 17:53:59,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796994975] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:53:59,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:53:59,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:53:59,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514966234] [2024-06-04 17:53:59,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:53:59,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:53:59,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:53:59,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:53:59,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:53:59,830 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:53:59,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 142 transitions, 1171 flow. Second operand has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:53:59,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:53:59,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:54:00,159 INFO L124 PetriNetUnfolderBase]: 358/773 cut-off events. [2024-06-04 17:54:00,159 INFO L125 PetriNetUnfolderBase]: For 35289/35289 co-relation queries the response was YES. [2024-06-04 17:54:00,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3499 conditions, 773 events. 358/773 cut-off events. For 35289/35289 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 4348 event pairs, 64 based on Foata normal form. 6/775 useless extension candidates. Maximal degree in co-relation 3406. Up to 617 conditions per place. [2024-06-04 17:54:00,165 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 127 selfloop transitions, 6 changer transitions 21/158 dead transitions. [2024-06-04 17:54:00,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 158 transitions, 1527 flow [2024-06-04 17:54:00,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:54:00,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:54:00,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2024-06-04 17:54:00,168 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3939393939393939 [2024-06-04 17:54:00,168 INFO L175 Difference]: Start difference. First operand has 209 places, 142 transitions, 1171 flow. Second operand 9 states and 117 transitions. [2024-06-04 17:54:00,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 158 transitions, 1527 flow [2024-06-04 17:54:00,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 158 transitions, 1413 flow, removed 4 selfloop flow, removed 13 redundant places. [2024-06-04 17:54:00,246 INFO L231 Difference]: Finished difference. Result has 202 places, 136 transitions, 1039 flow [2024-06-04 17:54:00,247 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1059, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1039, PETRI_PLACES=202, PETRI_TRANSITIONS=136} [2024-06-04 17:54:00,247 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 170 predicate places. [2024-06-04 17:54:00,247 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 136 transitions, 1039 flow [2024-06-04 17:54:00,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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:00,247 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:54:00,247 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:54:00,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2024-06-04 17:54:00,247 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:54:00,247 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:54:00,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1648445875, now seen corresponding path program 2 times [2024-06-04 17:54:00,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:54:00,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923728096] [2024-06-04 17:54:00,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:54:00,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:54:00,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:54:07,462 INFO 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:07,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:54:07,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923728096] [2024-06-04 17:54:07,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923728096] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:54:07,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:54:07,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:54:07,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852150362] [2024-06-04 17:54:07,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:54:07,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:54:07,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:54:07,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:54:07,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:54:07,628 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:54:07,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 136 transitions, 1039 flow. Second operand has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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:07,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:54:07,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:54:07,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:54:07,886 INFO L124 PetriNetUnfolderBase]: 330/722 cut-off events. [2024-06-04 17:54:07,886 INFO L125 PetriNetUnfolderBase]: For 33993/33993 co-relation queries the response was YES. [2024-06-04 17:54:07,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3209 conditions, 722 events. 330/722 cut-off events. For 33993/33993 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 4016 event pairs, 60 based on Foata normal form. 6/725 useless extension candidates. Maximal degree in co-relation 3118. Up to 500 conditions per place. [2024-06-04 17:54:07,893 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 92 selfloop transitions, 45 changer transitions 10/151 dead transitions. [2024-06-04 17:54:07,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 151 transitions, 1377 flow [2024-06-04 17:54:07,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:54:07,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:54:07,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 148 transitions. [2024-06-04 17:54:07,893 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40771349862258954 [2024-06-04 17:54:07,893 INFO L175 Difference]: Start difference. First operand has 202 places, 136 transitions, 1039 flow. Second operand 11 states and 148 transitions. [2024-06-04 17:54:07,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 151 transitions, 1377 flow [2024-06-04 17:54:07,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 151 transitions, 1351 flow, removed 7 selfloop flow, removed 9 redundant places. [2024-06-04 17:54:07,967 INFO L231 Difference]: Finished difference. Result has 194 places, 133 transitions, 1085 flow [2024-06-04 17:54:07,967 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1013, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1085, PETRI_PLACES=194, PETRI_TRANSITIONS=133} [2024-06-04 17:54:07,967 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 162 predicate places. [2024-06-04 17:54:07,967 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 133 transitions, 1085 flow [2024-06-04 17:54:07,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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:07,967 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:54:07,967 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:54:07,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2024-06-04 17:54:07,967 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:54:07,968 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:54:07,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1774962761, now seen corresponding path program 3 times [2024-06-04 17:54:07,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:54:07,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051650932] [2024-06-04 17:54:07,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:54:07,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:54:08,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:54:14,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:54:14,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:54:14,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051650932] [2024-06-04 17:54:14,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051650932] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:54:14,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:54:14,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:54:14,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975025269] [2024-06-04 17:54:14,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:54:14,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:54:14,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:54:14,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:54:14,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:54:15,221 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:54:15,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 133 transitions, 1085 flow. Second operand has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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:15,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:54:15,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:54:15,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:54:15,536 INFO L124 PetriNetUnfolderBase]: 323/709 cut-off events. [2024-06-04 17:54:15,536 INFO L125 PetriNetUnfolderBase]: For 29122/29122 co-relation queries the response was YES. [2024-06-04 17:54:15,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3192 conditions, 709 events. 323/709 cut-off events. For 29122/29122 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3902 event pairs, 58 based on Foata normal form. 6/712 useless extension candidates. Maximal degree in co-relation 3106. Up to 482 conditions per place. [2024-06-04 17:54:15,542 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 91 selfloop transitions, 41 changer transitions 13/149 dead transitions. [2024-06-04 17:54:15,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 149 transitions, 1421 flow [2024-06-04 17:54:15,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:54:15,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:54:15,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 147 transitions. [2024-06-04 17:54:15,543 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4049586776859504 [2024-06-04 17:54:15,543 INFO L175 Difference]: Start difference. First operand has 194 places, 133 transitions, 1085 flow. Second operand 11 states and 147 transitions. [2024-06-04 17:54:15,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 149 transitions, 1421 flow [2024-06-04 17:54:15,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 149 transitions, 1325 flow, removed 3 selfloop flow, removed 9 redundant places. [2024-06-04 17:54:15,616 INFO L231 Difference]: Finished difference. Result has 191 places, 129 transitions, 1047 flow [2024-06-04 17:54:15,616 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=989, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1047, PETRI_PLACES=191, PETRI_TRANSITIONS=129} [2024-06-04 17:54:15,616 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 159 predicate places. [2024-06-04 17:54:15,616 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 129 transitions, 1047 flow [2024-06-04 17:54:15,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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:15,617 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:54:15,617 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:54:15,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2024-06-04 17:54:15,617 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:54:15,617 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:54:15,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1383312811, now seen corresponding path program 4 times [2024-06-04 17:54:15,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:54:15,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432365066] [2024-06-04 17:54:15,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:54:15,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:54:15,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:54:22,514 INFO 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:22,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:54:22,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432365066] [2024-06-04 17:54:22,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432365066] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:54:22,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:54:22,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:54:22,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624891170] [2024-06-04 17:54:22,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:54:22,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:54:22,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:54:22,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:54:22,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:54:22,739 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:54:22,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 129 transitions, 1047 flow. Second operand has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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:22,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:54:22,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:54:22,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:54:23,094 INFO L124 PetriNetUnfolderBase]: 312/684 cut-off events. [2024-06-04 17:54:23,094 INFO L125 PetriNetUnfolderBase]: For 28231/28231 co-relation queries the response was YES. [2024-06-04 17:54:23,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3089 conditions, 684 events. 312/684 cut-off events. For 28231/28231 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3703 event pairs, 52 based on Foata normal form. 6/687 useless extension candidates. Maximal degree in co-relation 3004. Up to 436 conditions per place. [2024-06-04 17:54:23,099 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 90 selfloop transitions, 40 changer transitions 12/146 dead transitions. [2024-06-04 17:54:23,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 146 transitions, 1379 flow [2024-06-04 17:54:23,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:54:23,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:54:23,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 147 transitions. [2024-06-04 17:54:23,099 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4049586776859504 [2024-06-04 17:54:23,099 INFO L175 Difference]: Start difference. First operand has 191 places, 129 transitions, 1047 flow. Second operand 11 states and 147 transitions. [2024-06-04 17:54:23,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 146 transitions, 1379 flow [2024-06-04 17:54:23,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 146 transitions, 1289 flow, removed 4 selfloop flow, removed 9 redundant places. [2024-06-04 17:54:23,156 INFO L231 Difference]: Finished difference. Result has 186 places, 125 transitions, 1013 flow [2024-06-04 17:54:23,157 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=957, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1013, PETRI_PLACES=186, PETRI_TRANSITIONS=125} [2024-06-04 17:54:23,157 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 154 predicate places. [2024-06-04 17:54:23,157 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 125 transitions, 1013 flow [2024-06-04 17:54:23,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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:23,157 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:54:23,157 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:54:23,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2024-06-04 17:54:23,157 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:54:23,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:54:23,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1560444331, now seen corresponding path program 5 times [2024-06-04 17:54:23,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:54:23,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945929174] [2024-06-04 17:54:23,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:54:23,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:54:23,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:54:30,275 INFO 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:30,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:54:30,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945929174] [2024-06-04 17:54:30,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945929174] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:54:30,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:54:30,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:54:30,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579419952] [2024-06-04 17:54:30,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:54:30,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:54:30,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:54:30,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:54:30,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:54:30,435 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:54:30,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 125 transitions, 1013 flow. Second operand has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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:30,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:54:30,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:54:30,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:54:30,894 INFO L124 PetriNetUnfolderBase]: 298/660 cut-off events. [2024-06-04 17:54:30,894 INFO L125 PetriNetUnfolderBase]: For 26306/26306 co-relation queries the response was YES. [2024-06-04 17:54:30,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2983 conditions, 660 events. 298/660 cut-off events. For 26306/26306 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3567 event pairs, 54 based on Foata normal form. 6/663 useless extension candidates. Maximal degree in co-relation 2900. Up to 446 conditions per place. [2024-06-04 17:54:30,899 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 88 selfloop transitions, 38 changer transitions 10/140 dead transitions. [2024-06-04 17:54:30,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 140 transitions, 1329 flow [2024-06-04 17:54:30,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:54:30,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:54:30,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 142 transitions. [2024-06-04 17:54:30,900 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39118457300275483 [2024-06-04 17:54:30,900 INFO L175 Difference]: Start difference. First operand has 186 places, 125 transitions, 1013 flow. Second operand 11 states and 142 transitions. [2024-06-04 17:54:30,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 140 transitions, 1329 flow [2024-06-04 17:54:30,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 140 transitions, 1243 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-04 17:54:30,963 INFO L231 Difference]: Finished difference. Result has 181 places, 122 transitions, 985 flow [2024-06-04 17:54:30,963 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=927, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=985, PETRI_PLACES=181, PETRI_TRANSITIONS=122} [2024-06-04 17:54:30,964 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 149 predicate places. [2024-06-04 17:54:30,964 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 122 transitions, 985 flow [2024-06-04 17:54:30,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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:30,964 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:54:30,964 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:54:30,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2024-06-04 17:54:30,964 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:54:30,965 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:54:30,965 INFO L85 PathProgramCache]: Analyzing trace with hash -979700147, now seen corresponding path program 6 times [2024-06-04 17:54:30,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:54:30,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957924501] [2024-06-04 17:54:30,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:54:30,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:54:31,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:54:37,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:54:37,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:54:37,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957924501] [2024-06-04 17:54:37,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957924501] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:54:37,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:54:37,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:54:37,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115897348] [2024-06-04 17:54:37,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:54:37,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:54:37,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:54:37,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:54:37,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:54:37,883 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:54:37,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 122 transitions, 985 flow. Second operand has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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:37,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:54:37,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:54:37,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:54:38,103 INFO L124 PetriNetUnfolderBase]: 291/647 cut-off events. [2024-06-04 17:54:38,103 INFO L125 PetriNetUnfolderBase]: For 24510/24510 co-relation queries the response was YES. [2024-06-04 17:54:38,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2903 conditions, 647 events. 291/647 cut-off events. For 24510/24510 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3478 event pairs, 54 based on Foata normal form. 6/650 useless extension candidates. Maximal degree in co-relation 2822. Up to 436 conditions per place. [2024-06-04 17:54:38,107 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 86 selfloop transitions, 37 changer transitions 10/137 dead transitions. [2024-06-04 17:54:38,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 137 transitions, 1295 flow [2024-06-04 17:54:38,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:54:38,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:54:38,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 146 transitions. [2024-06-04 17:54:38,108 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4022038567493113 [2024-06-04 17:54:38,108 INFO L175 Difference]: Start difference. First operand has 181 places, 122 transitions, 985 flow. Second operand 11 states and 146 transitions. [2024-06-04 17:54:38,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 137 transitions, 1295 flow [2024-06-04 17:54:38,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 137 transitions, 1215 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-04 17:54:38,162 INFO L231 Difference]: Finished difference. Result has 178 places, 119 transitions, 961 flow [2024-06-04 17:54:38,162 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=905, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=961, PETRI_PLACES=178, PETRI_TRANSITIONS=119} [2024-06-04 17:54:38,163 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 146 predicate places. [2024-06-04 17:54:38,163 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 119 transitions, 961 flow [2024-06-04 17:54:38,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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:38,163 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:54:38,163 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:54:38,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2024-06-04 17:54:38,163 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:54:38,163 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:54:38,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1805289707, now seen corresponding path program 7 times [2024-06-04 17:54:38,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:54:38,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137888385] [2024-06-04 17:54:38,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:54:38,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:54:38,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:54:46,218 INFO 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:46,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:54:46,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137888385] [2024-06-04 17:54:46,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137888385] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:54:46,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:54:46,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:54:46,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186854356] [2024-06-04 17:54:46,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:54:46,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:54:46,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:54:46,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:54:46,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:54:46,344 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-04 17:54:46,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 119 transitions, 961 flow. Second operand has 12 states, 12 states have (on average 8.416666666666666) internal successors, (101), 12 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call 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:46,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:54:46,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-04 17:54:46,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:54:46,596 INFO L124 PetriNetUnfolderBase]: 284/632 cut-off events. [2024-06-04 17:54:46,597 INFO L125 PetriNetUnfolderBase]: For 23634/23634 co-relation queries the response was YES. [2024-06-04 17:54:46,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2834 conditions, 632 events. 284/632 cut-off events. For 23634/23634 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3375 event pairs, 52 based on Foata normal form. 6/635 useless extension candidates. Maximal degree in co-relation 2754. Up to 418 conditions per place. [2024-06-04 17:54:46,601 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 83 selfloop transitions, 35 changer transitions 13/135 dead transitions. [2024-06-04 17:54:46,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 135 transitions, 1269 flow [2024-06-04 17:54:46,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:54:46,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:54:46,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 135 transitions. [2024-06-04 17:54:46,602 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.371900826446281 [2024-06-04 17:54:46,602 INFO L175 Difference]: Start difference. First operand has 178 places, 119 transitions, 961 flow. Second operand 11 states and 135 transitions. [2024-06-04 17:54:46,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 135 transitions, 1269 flow [2024-06-04 17:54:46,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 135 transitions, 1191 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-04 17:54:46,655 INFO L231 Difference]: Finished difference. Result has 175 places, 115 transitions, 929 flow [2024-06-04 17:54:46,656 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=883, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=929, PETRI_PLACES=175, PETRI_TRANSITIONS=115} [2024-06-04 17:54:46,656 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 143 predicate places. [2024-06-04 17:54:46,656 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 115 transitions, 929 flow [2024-06-04 17:54:46,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.416666666666666) internal successors, (101), 12 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call 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:46,656 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:54:46,656 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:54:46,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2024-06-04 17:54:46,656 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:54:46,656 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:54:46,656 INFO L85 PathProgramCache]: Analyzing trace with hash 50466889, now seen corresponding path program 8 times [2024-06-04 17:54:46,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:54:46,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985099829] [2024-06-04 17:54:46,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:54:46,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:54:46,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:54:54,075 INFO 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:54,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:54:54,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985099829] [2024-06-04 17:54:54,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985099829] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:54:54,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:54:54,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:54:54,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855567949] [2024-06-04 17:54:54,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:54:54,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:54:54,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:54:54,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:54:54,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:54:54,298 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:54:54,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 115 transitions, 929 flow. Second operand has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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:54,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:54:54,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:54:54,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:54:54,668 INFO L124 PetriNetUnfolderBase]: 273/611 cut-off events. [2024-06-04 17:54:54,668 INFO L125 PetriNetUnfolderBase]: For 22778/22778 co-relation queries the response was YES. [2024-06-04 17:54:54,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2745 conditions, 611 events. 273/611 cut-off events. For 22778/22778 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3231 event pairs, 50 based on Foata normal form. 6/614 useless extension candidates. Maximal degree in co-relation 2666. Up to 400 conditions per place. [2024-06-04 17:54:54,672 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 79 selfloop transitions, 31 changer transitions 17/131 dead transitions. [2024-06-04 17:54:54,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 131 transitions, 1229 flow [2024-06-04 17:54:54,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:54:54,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:54:54,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 142 transitions. [2024-06-04 17:54:54,673 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39118457300275483 [2024-06-04 17:54:54,673 INFO L175 Difference]: Start difference. First operand has 175 places, 115 transitions, 929 flow. Second operand 11 states and 142 transitions. [2024-06-04 17:54:54,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 131 transitions, 1229 flow [2024-06-04 17:54:54,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 131 transitions, 1153 flow, removed 3 selfloop flow, removed 9 redundant places. [2024-06-04 17:54:54,723 INFO L231 Difference]: Finished difference. Result has 170 places, 108 transitions, 869 flow [2024-06-04 17:54:54,723 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=853, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=869, PETRI_PLACES=170, PETRI_TRANSITIONS=108} [2024-06-04 17:54:54,724 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 138 predicate places. [2024-06-04 17:54:54,724 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 108 transitions, 869 flow [2024-06-04 17:54:54,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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:54,724 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:54:54,724 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:54:54,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2024-06-04 17:54:54,724 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:54:54,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:54:54,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1512417085, now seen corresponding path program 9 times [2024-06-04 17:54:54,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:54:54,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538782527] [2024-06-04 17:54:54,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:54:54,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:54:54,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:55:02,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:55:02,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:55:02,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538782527] [2024-06-04 17:55:02,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538782527] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:55:02,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:55:02,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:55:02,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342299929] [2024-06-04 17:55:02,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:55:02,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:55:02,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:55:02,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:55:02,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:55:02,769 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:55:02,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 108 transitions, 869 flow. Second operand has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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:02,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:55:02,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:55:02,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:55:03,043 INFO L124 PetriNetUnfolderBase]: 257/585 cut-off events. [2024-06-04 17:55:03,043 INFO L125 PetriNetUnfolderBase]: For 21106/21106 co-relation queries the response was YES. [2024-06-04 17:55:03,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2617 conditions, 585 events. 257/585 cut-off events. For 21106/21106 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3090 event pairs, 46 based on Foata normal form. 6/588 useless extension candidates. Maximal degree in co-relation 2540. Up to 374 conditions per place. [2024-06-04 17:55:03,046 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 76 selfloop transitions, 26 changer transitions 19/125 dead transitions. [2024-06-04 17:55:03,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 125 transitions, 1159 flow [2024-06-04 17:55:03,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:55:03,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:55:03,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 145 transitions. [2024-06-04 17:55:03,047 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39944903581267216 [2024-06-04 17:55:03,047 INFO L175 Difference]: Start difference. First operand has 170 places, 108 transitions, 869 flow. Second operand 11 states and 145 transitions. [2024-06-04 17:55:03,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 125 transitions, 1159 flow [2024-06-04 17:55:03,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 125 transitions, 1091 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-06-04 17:55:03,088 INFO L231 Difference]: Finished difference. Result has 164 places, 100 transitions, 798 flow [2024-06-04 17:55:03,089 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=801, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=798, PETRI_PLACES=164, PETRI_TRANSITIONS=100} [2024-06-04 17:55:03,089 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 132 predicate places. [2024-06-04 17:55:03,089 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 100 transitions, 798 flow [2024-06-04 17:55:03,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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:03,089 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:55:03,089 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:55:03,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2024-06-04 17:55:03,089 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:55:03,089 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:55:03,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1273084937, now seen corresponding path program 10 times [2024-06-04 17:55:03,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:55:03,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600554210] [2024-06-04 17:55:03,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:55:03,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:55:03,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:55:11,186 INFO 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,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:55:11,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600554210] [2024-06-04 17:55:11,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600554210] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:55:11,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:55:11,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:55:11,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752273513] [2024-06-04 17:55:11,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:55:11,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:55:11,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:55:11,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:55:11,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:55:11,402 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:55:11,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 100 transitions, 798 flow. Second operand has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:55:11,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:55:11,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:55:11,625 INFO L124 PetriNetUnfolderBase]: 234/538 cut-off events. [2024-06-04 17:55:11,625 INFO L125 PetriNetUnfolderBase]: For 19468/19468 co-relation queries the response was YES. [2024-06-04 17:55:11,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2401 conditions, 538 events. 234/538 cut-off events. For 19468/19468 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2799 event pairs, 37 based on Foata normal form. 6/541 useless extension candidates. Maximal degree in co-relation 2326. Up to 225 conditions per place. [2024-06-04 17:55:11,628 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 59 selfloop transitions, 34 changer transitions 21/118 dead transitions. [2024-06-04 17:55:11,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 118 transitions, 1076 flow [2024-06-04 17:55:11,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:55:11,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:55:11,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 146 transitions. [2024-06-04 17:55:11,628 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4022038567493113 [2024-06-04 17:55:11,628 INFO L175 Difference]: Start difference. First operand has 164 places, 100 transitions, 798 flow. Second operand 11 states and 146 transitions. [2024-06-04 17:55:11,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 118 transitions, 1076 flow [2024-06-04 17:55:11,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 118 transitions, 1014 flow, removed 5 selfloop flow, removed 9 redundant places. [2024-06-04 17:55:11,669 INFO L231 Difference]: Finished difference. Result has 157 places, 89 transitions, 727 flow [2024-06-04 17:55:11,669 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=736, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=727, PETRI_PLACES=157, PETRI_TRANSITIONS=89} [2024-06-04 17:55:11,669 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 125 predicate places. [2024-06-04 17:55:11,669 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 89 transitions, 727 flow [2024-06-04 17:55:11,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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,669 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:55:11,669 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:55:11,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2024-06-04 17:55:11,669 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:55:11,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:55:11,670 INFO L85 PathProgramCache]: Analyzing trace with hash -90449041, now seen corresponding path program 11 times [2024-06-04 17:55:11,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:55:11,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546184966] [2024-06-04 17:55:11,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:55:11,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:55:11,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:55:18,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:55:18,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:55:18,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546184966] [2024-06-04 17:55:18,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546184966] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:55:18,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:55:18,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:55:18,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450554180] [2024-06-04 17:55:18,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:55:18,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:55:18,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:55:18,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:55:18,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:55:19,197 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:55:19,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 89 transitions, 727 flow. Second operand has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:55:19,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:55:19,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:55:19,502 INFO L124 PetriNetUnfolderBase]: 202/466 cut-off events. [2024-06-04 17:55:19,502 INFO L125 PetriNetUnfolderBase]: For 17128/17128 co-relation queries the response was YES. [2024-06-04 17:55:19,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2152 conditions, 466 events. 202/466 cut-off events. For 17128/17128 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2321 event pairs, 33 based on Foata normal form. 6/469 useless extension candidates. Maximal degree in co-relation 2093. Up to 221 conditions per place. [2024-06-04 17:55:19,505 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 55 selfloop transitions, 35 changer transitions 12/106 dead transitions. [2024-06-04 17:55:19,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 106 transitions, 979 flow [2024-06-04 17:55:19,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:55:19,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:55:19,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 146 transitions. [2024-06-04 17:55:19,510 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4022038567493113 [2024-06-04 17:55:19,510 INFO L175 Difference]: Start difference. First operand has 157 places, 89 transitions, 727 flow. Second operand 11 states and 146 transitions. [2024-06-04 17:55:19,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 106 transitions, 979 flow [2024-06-04 17:55:19,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 106 transitions, 888 flow, removed 6 selfloop flow, removed 14 redundant places. [2024-06-04 17:55:19,539 INFO L231 Difference]: Finished difference. Result has 143 places, 85 transitions, 683 flow [2024-06-04 17:55:19,539 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=683, PETRI_PLACES=143, PETRI_TRANSITIONS=85} [2024-06-04 17:55:19,540 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 111 predicate places. [2024-06-04 17:55:19,540 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 85 transitions, 683 flow [2024-06-04 17:55:19,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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,540 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:55:19,540 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:55:19,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2024-06-04 17:55:19,540 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:55:19,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:55:19,540 INFO L85 PathProgramCache]: Analyzing trace with hash 50099423, now seen corresponding path program 12 times [2024-06-04 17:55:19,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:55:19,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586002902] [2024-06-04 17:55:19,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:55:19,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:55:19,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:55:27,504 INFO 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:27,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:55:27,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586002902] [2024-06-04 17:55:27,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586002902] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:55:27,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:55:27,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:55:27,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382217871] [2024-06-04 17:55:27,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:55:27,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:55:27,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:55:27,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:55:27,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:55:27,695 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:55:27,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 85 transitions, 683 flow. Second operand has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:55:27,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:55:27,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:55:28,053 INFO L124 PetriNetUnfolderBase]: 188/440 cut-off events. [2024-06-04 17:55:28,053 INFO L125 PetriNetUnfolderBase]: For 13660/13660 co-relation queries the response was YES. [2024-06-04 17:55:28,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2003 conditions, 440 events. 188/440 cut-off events. For 13660/13660 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2162 event pairs, 36 based on Foata normal form. 6/443 useless extension candidates. Maximal degree in co-relation 1949. Up to 289 conditions per place. [2024-06-04 17:55:28,055 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 63 selfloop transitions, 23 changer transitions 10/100 dead transitions. [2024-06-04 17:55:28,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 100 transitions, 919 flow [2024-06-04 17:55:28,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:55:28,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:55:28,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 144 transitions. [2024-06-04 17:55:28,056 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39669421487603307 [2024-06-04 17:55:28,056 INFO L175 Difference]: Start difference. First operand has 143 places, 85 transitions, 683 flow. Second operand 11 states and 144 transitions. [2024-06-04 17:55:28,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 100 transitions, 919 flow [2024-06-04 17:55:28,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 100 transitions, 841 flow, removed 4 selfloop flow, removed 11 redundant places. [2024-06-04 17:55:28,075 INFO L231 Difference]: Finished difference. Result has 137 places, 82 transitions, 633 flow [2024-06-04 17:55:28,076 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=605, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=633, PETRI_PLACES=137, PETRI_TRANSITIONS=82} [2024-06-04 17:55:28,076 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 105 predicate places. [2024-06-04 17:55:28,076 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 82 transitions, 633 flow [2024-06-04 17:55:28,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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:28,076 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:55:28,076 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:55:28,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2024-06-04 17:55:28,076 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:55:28,076 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:55:28,076 INFO L85 PathProgramCache]: Analyzing trace with hash 352861279, now seen corresponding path program 13 times [2024-06-04 17:55:28,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:55:28,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678500690] [2024-06-04 17:55:28,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:55:28,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:55:28,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:55:35,747 INFO 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:35,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:55:35,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678500690] [2024-06-04 17:55:35,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678500690] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:55:35,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:55:35,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:55:35,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864732323] [2024-06-04 17:55:35,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:55:35,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:55:35,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:55:35,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:55:35,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:55:35,978 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:55:35,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 82 transitions, 633 flow. Second operand has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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:35,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:55:35,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:55:35,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:55:36,315 INFO L124 PetriNetUnfolderBase]: 181/425 cut-off events. [2024-06-04 17:55:36,315 INFO L125 PetriNetUnfolderBase]: For 11734/11734 co-relation queries the response was YES. [2024-06-04 17:55:36,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1876 conditions, 425 events. 181/425 cut-off events. For 11734/11734 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2061 event pairs, 31 based on Foata normal form. 6/428 useless extension candidates. Maximal degree in co-relation 1825. Up to 265 conditions per place. [2024-06-04 17:55:36,317 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 62 selfloop transitions, 22 changer transitions 10/98 dead transitions. [2024-06-04 17:55:36,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 98 transitions, 867 flow [2024-06-04 17:55:36,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:55:36,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:55:36,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 145 transitions. [2024-06-04 17:55:36,318 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39944903581267216 [2024-06-04 17:55:36,318 INFO L175 Difference]: Start difference. First operand has 137 places, 82 transitions, 633 flow. Second operand 11 states and 145 transitions. [2024-06-04 17:55:36,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 98 transitions, 867 flow [2024-06-04 17:55:36,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 98 transitions, 817 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-04 17:55:36,335 INFO L231 Difference]: Finished difference. Result has 134 places, 78 transitions, 604 flow [2024-06-04 17:55:36,335 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=583, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=604, PETRI_PLACES=134, PETRI_TRANSITIONS=78} [2024-06-04 17:55:36,335 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 102 predicate places. [2024-06-04 17:55:36,335 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 78 transitions, 604 flow [2024-06-04 17:55:36,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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:36,335 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:55:36,335 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:55:36,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2024-06-04 17:55:36,335 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:55:36,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:55:36,336 INFO L85 PathProgramCache]: Analyzing trace with hash 936975549, now seen corresponding path program 14 times [2024-06-04 17:55:36,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:55:36,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771108727] [2024-06-04 17:55:36,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:55:36,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:55:36,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:55:42,835 INFO 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:42,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:55:42,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771108727] [2024-06-04 17:55:42,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771108727] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:55:42,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:55:42,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:55:42,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2631651] [2024-06-04 17:55:42,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:55:42,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:55:42,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:55:42,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:55:42,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:55:43,060 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:55:43,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 78 transitions, 604 flow. Second operand has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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:43,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:55:43,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:55:43,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:55:43,310 INFO L124 PetriNetUnfolderBase]: 166/390 cut-off events. [2024-06-04 17:55:43,310 INFO L125 PetriNetUnfolderBase]: For 8532/8532 co-relation queries the response was YES. [2024-06-04 17:55:43,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1765 conditions, 390 events. 166/390 cut-off events. For 8532/8532 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1849 event pairs, 34 based on Foata normal form. 2/389 useless extension candidates. Maximal degree in co-relation 1715. Up to 265 conditions per place. [2024-06-04 17:55:43,312 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 63 selfloop transitions, 25 changer transitions 0/92 dead transitions. [2024-06-04 17:55:43,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 92 transitions, 822 flow [2024-06-04 17:55:43,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:55:43,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:55:43,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 142 transitions. [2024-06-04 17:55:43,313 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39118457300275483 [2024-06-04 17:55:43,313 INFO L175 Difference]: Start difference. First operand has 134 places, 78 transitions, 604 flow. Second operand 11 states and 142 transitions. [2024-06-04 17:55:43,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 92 transitions, 822 flow [2024-06-04 17:55:43,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 92 transitions, 772 flow, removed 3 selfloop flow, removed 11 redundant places. [2024-06-04 17:55:43,328 INFO L231 Difference]: Finished difference. Result has 129 places, 79 transitions, 622 flow [2024-06-04 17:55:43,328 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=622, PETRI_PLACES=129, PETRI_TRANSITIONS=79} [2024-06-04 17:55:43,328 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 97 predicate places. [2024-06-04 17:55:43,328 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 79 transitions, 622 flow [2024-06-04 17:55:43,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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:43,329 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:55:43,329 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:55:43,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2024-06-04 17:55:43,329 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:55:43,329 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:55:43,329 INFO L85 PathProgramCache]: Analyzing trace with hash -950636561, now seen corresponding path program 15 times [2024-06-04 17:55:43,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:55:43,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346204220] [2024-06-04 17:55:43,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:55:43,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:55:43,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:55:50,211 INFO 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:50,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:55:50,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346204220] [2024-06-04 17:55:50,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346204220] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:55:50,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:55:50,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 17:55:50,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082858058] [2024-06-04 17:55:50,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:55:50,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 17:55:50,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:55:50,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 17:55:50,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-06-04 17:55:50,431 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:55:50,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 79 transitions, 622 flow. Second operand has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call 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:50,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:55:50,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:55:50,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:55:50,778 INFO L124 PetriNetUnfolderBase]: 174/410 cut-off events. [2024-06-04 17:55:50,778 INFO L125 PetriNetUnfolderBase]: For 10008/10008 co-relation queries the response was YES. [2024-06-04 17:55:50,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1825 conditions, 410 events. 174/410 cut-off events. For 10008/10008 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1959 event pairs, 36 based on Foata normal form. 6/413 useless extension candidates. Maximal degree in co-relation 1777. Up to 269 conditions per place. [2024-06-04 17:55:50,781 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 60 selfloop transitions, 21 changer transitions 10/95 dead transitions. [2024-06-04 17:55:50,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 95 transitions, 852 flow [2024-06-04 17:55:50,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 17:55:50,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 17:55:50,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 155 transitions. [2024-06-04 17:55:50,782 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39141414141414144 [2024-06-04 17:55:50,782 INFO L175 Difference]: Start difference. First operand has 129 places, 79 transitions, 622 flow. Second operand 12 states and 155 transitions. [2024-06-04 17:55:50,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 95 transitions, 852 flow [2024-06-04 17:55:50,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 95 transitions, 794 flow, removed 5 selfloop flow, removed 9 redundant places. [2024-06-04 17:55:50,797 INFO L231 Difference]: Finished difference. Result has 132 places, 76 transitions, 589 flow [2024-06-04 17:55:50,797 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=564, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=589, PETRI_PLACES=132, PETRI_TRANSITIONS=76} [2024-06-04 17:55:50,797 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 100 predicate places. [2024-06-04 17:55:50,797 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 76 transitions, 589 flow [2024-06-04 17:55:50,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call 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:50,797 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:55:50,797 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:55:50,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2024-06-04 17:55:50,797 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:55:50,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:55:50,798 INFO L85 PathProgramCache]: Analyzing trace with hash 80253389, now seen corresponding path program 16 times [2024-06-04 17:55:50,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:55:50,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337771622] [2024-06-04 17:55:50,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:55:50,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:55:50,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:55:58,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:55:58,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:55:58,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337771622] [2024-06-04 17:55:58,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337771622] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:55:58,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:55:58,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:55:58,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511264374] [2024-06-04 17:55:58,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:55:58,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:55:58,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:55:58,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:55:58,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:55:58,307 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:55:58,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 76 transitions, 589 flow. Second operand has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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:58,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:55:58,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:55:58,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:55:58,640 INFO L124 PetriNetUnfolderBase]: 167/397 cut-off events. [2024-06-04 17:55:58,640 INFO L125 PetriNetUnfolderBase]: For 10500/10500 co-relation queries the response was YES. [2024-06-04 17:55:58,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1760 conditions, 397 events. 167/397 cut-off events. For 10500/10500 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1866 event pairs, 34 based on Foata normal form. 6/400 useless extension candidates. Maximal degree in co-relation 1711. Up to 245 conditions per place. [2024-06-04 17:55:58,642 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 57 selfloop transitions, 22 changer transitions 9/92 dead transitions. [2024-06-04 17:55:58,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 92 transitions, 813 flow [2024-06-04 17:55:58,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:55:58,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:55:58,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 145 transitions. [2024-06-04 17:55:58,643 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39944903581267216 [2024-06-04 17:55:58,643 INFO L175 Difference]: Start difference. First operand has 132 places, 76 transitions, 589 flow. Second operand 11 states and 145 transitions. [2024-06-04 17:55:58,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 92 transitions, 813 flow [2024-06-04 17:55:58,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 92 transitions, 767 flow, removed 2 selfloop flow, removed 10 redundant places. [2024-06-04 17:55:58,659 INFO L231 Difference]: Finished difference. Result has 128 places, 73 transitions, 569 flow [2024-06-04 17:55:58,660 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=543, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=569, PETRI_PLACES=128, PETRI_TRANSITIONS=73} [2024-06-04 17:55:58,660 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 96 predicate places. [2024-06-04 17:55:58,660 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 73 transitions, 569 flow [2024-06-04 17:55:58,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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:58,660 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:55:58,660 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:55:58,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2024-06-04 17:55:58,660 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:55:58,660 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:55:58,660 INFO L85 PathProgramCache]: Analyzing trace with hash 319757167, now seen corresponding path program 17 times [2024-06-04 17:55:58,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:55:58,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318146262] [2024-06-04 17:55:58,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:55:58,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:55:58,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:56:06,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:56:06,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:56:06,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318146262] [2024-06-04 17:56:06,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318146262] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:56:06,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:56:06,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 17:56:06,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436257337] [2024-06-04 17:56:06,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:56:06,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 17:56:06,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:56:06,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 17:56:06,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-06-04 17:56:06,365 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:56:06,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 73 transitions, 569 flow. Second operand has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call 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:06,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:56:06,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:56:06,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:56:06,709 INFO L124 PetriNetUnfolderBase]: 157/377 cut-off events. [2024-06-04 17:56:06,709 INFO L125 PetriNetUnfolderBase]: For 9962/9962 co-relation queries the response was YES. [2024-06-04 17:56:06,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1687 conditions, 377 events. 157/377 cut-off events. For 9962/9962 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1757 event pairs, 34 based on Foata normal form. 6/380 useless extension candidates. Maximal degree in co-relation 1639. Up to 241 conditions per place. [2024-06-04 17:56:06,711 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 57 selfloop transitions, 18 changer transitions 10/89 dead transitions. [2024-06-04 17:56:06,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 89 transitions, 787 flow [2024-06-04 17:56:06,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 17:56:06,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 17:56:06,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 152 transitions. [2024-06-04 17:56:06,712 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3838383838383838 [2024-06-04 17:56:06,712 INFO L175 Difference]: Start difference. First operand has 128 places, 73 transitions, 569 flow. Second operand 12 states and 152 transitions. [2024-06-04 17:56:06,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 89 transitions, 787 flow [2024-06-04 17:56:06,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 89 transitions, 737 flow, removed 3 selfloop flow, removed 11 redundant places. [2024-06-04 17:56:06,725 INFO L231 Difference]: Finished difference. Result has 125 places, 70 transitions, 538 flow [2024-06-04 17:56:06,725 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=519, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=538, PETRI_PLACES=125, PETRI_TRANSITIONS=70} [2024-06-04 17:56:06,725 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 93 predicate places. [2024-06-04 17:56:06,725 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 70 transitions, 538 flow [2024-06-04 17:56:06,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call 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:06,725 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:56:06,725 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:56:06,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2024-06-04 17:56:06,726 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:56:06,726 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:56:06,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1393251115, now seen corresponding path program 18 times [2024-06-04 17:56:06,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:56:06,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767911059] [2024-06-04 17:56:06,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:56:06,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:56:06,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:56:13,847 INFO 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:13,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:56:13,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767911059] [2024-06-04 17:56:13,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767911059] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:56:13,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:56:13,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 17:56:13,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047762579] [2024-06-04 17:56:13,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:56:13,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 17:56:13,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:56:13,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 17:56:13,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-06-04 17:56:14,131 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:56:14,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 70 transitions, 538 flow. Second operand has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call 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:14,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:56:14,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:56:14,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:56:14,539 INFO L124 PetriNetUnfolderBase]: 150/362 cut-off events. [2024-06-04 17:56:14,539 INFO L125 PetriNetUnfolderBase]: For 8840/8840 co-relation queries the response was YES. [2024-06-04 17:56:14,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1605 conditions, 362 events. 150/362 cut-off events. For 8840/8840 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1672 event pairs, 34 based on Foata normal form. 6/365 useless extension candidates. Maximal degree in co-relation 1559. Up to 231 conditions per place. [2024-06-04 17:56:14,541 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 55 selfloop transitions, 17 changer transitions 10/86 dead transitions. [2024-06-04 17:56:14,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 86 transitions, 750 flow [2024-06-04 17:56:14,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 17:56:14,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 17:56:14,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 153 transitions. [2024-06-04 17:56:14,542 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38636363636363635 [2024-06-04 17:56:14,542 INFO L175 Difference]: Start difference. First operand has 125 places, 70 transitions, 538 flow. Second operand 12 states and 153 transitions. [2024-06-04 17:56:14,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 86 transitions, 750 flow [2024-06-04 17:56:14,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 86 transitions, 710 flow, removed 2 selfloop flow, removed 10 redundant places. [2024-06-04 17:56:14,553 INFO L231 Difference]: Finished difference. Result has 122 places, 67 transitions, 514 flow [2024-06-04 17:56:14,553 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=498, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=514, PETRI_PLACES=122, PETRI_TRANSITIONS=67} [2024-06-04 17:56:14,554 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 90 predicate places. [2024-06-04 17:56:14,554 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 67 transitions, 514 flow [2024-06-04 17:56:14,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call 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:14,554 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:56:14,554 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:56:14,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2024-06-04 17:56:14,555 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:56:14,555 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:56:14,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1386822025, now seen corresponding path program 19 times [2024-06-04 17:56:14,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:56:14,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368752803] [2024-06-04 17:56:14,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:56:14,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:56:14,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:56:22,467 INFO 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:22,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:56:22,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368752803] [2024-06-04 17:56:22,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368752803] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:56:22,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:56:22,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 17:56:22,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537273198] [2024-06-04 17:56:22,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:56:22,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 17:56:22,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:56:22,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 17:56:22,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-06-04 17:56:22,779 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 17:56:22,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 67 transitions, 514 flow. Second operand has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call 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:22,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:56:22,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 17:56:22,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:56:23,106 INFO L124 PetriNetUnfolderBase]: 143/351 cut-off events. [2024-06-04 17:56:23,106 INFO L125 PetriNetUnfolderBase]: For 8332/8332 co-relation queries the response was YES. [2024-06-04 17:56:23,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1544 conditions, 351 events. 143/351 cut-off events. For 8332/8332 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1593 event pairs, 32 based on Foata normal form. 6/354 useless extension candidates. Maximal degree in co-relation 1499. Up to 213 conditions per place. [2024-06-04 17:56:23,108 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 52 selfloop transitions, 15 changer transitions 13/84 dead transitions. [2024-06-04 17:56:23,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 84 transitions, 724 flow [2024-06-04 17:56:23,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 17:56:23,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 17:56:23,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 153 transitions. [2024-06-04 17:56:23,109 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38636363636363635 [2024-06-04 17:56:23,109 INFO L175 Difference]: Start difference. First operand has 122 places, 67 transitions, 514 flow. Second operand 12 states and 153 transitions. [2024-06-04 17:56:23,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 84 transitions, 724 flow [2024-06-04 17:56:23,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 84 transitions, 686 flow, removed 2 selfloop flow, removed 10 redundant places. [2024-06-04 17:56:23,121 INFO L231 Difference]: Finished difference. Result has 119 places, 63 transitions, 483 flow [2024-06-04 17:56:23,121 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=483, PETRI_PLACES=119, PETRI_TRANSITIONS=63} [2024-06-04 17:56:23,122 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 87 predicate places. [2024-06-04 17:56:23,122 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 63 transitions, 483 flow [2024-06-04 17:56:23,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call 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:23,122 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:56:23,122 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:56:23,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2024-06-04 17:56:23,122 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:56:23,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:56:23,123 INFO L85 PathProgramCache]: Analyzing trace with hash 86682479, now seen corresponding path program 20 times [2024-06-04 17:56:23,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:56:23,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805240188] [2024-06-04 17:56:23,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:56:23,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:56:23,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15