./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/rfi000_power.opt_pso.opt_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/rfi000_power.opt_pso.opt_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/rfi000_power.opt_pso.opt_rmo.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/rfi000_power.opt_pso.opt_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:41:32,703 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-04 17:41:32,800 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-04 17:41:32,809 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-04 17:41:32,810 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-04 17:41:32,847 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-04 17:41:32,848 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-04 17:41:32,848 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-04 17:41:32,849 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-04 17:41:32,852 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-04 17:41:32,852 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-04 17:41:32,852 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-04 17:41:32,864 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-04 17:41:32,865 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-04 17:41:32,865 INFO L153 SettingsManager]: * Use SBE=true [2024-06-04 17:41:32,866 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-04 17:41:32,866 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-04 17:41:32,866 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-04 17:41:32,866 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-04 17:41:32,866 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-04 17:41:32,867 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-04 17:41:32,867 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-04 17:41:32,867 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-04 17:41:32,867 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-04 17:41:32,868 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-04 17:41:32,868 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-04 17:41:32,868 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-04 17:41:32,868 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-04 17:41:32,869 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-04 17:41:32,869 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-04 17:41:32,870 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-04 17:41:32,870 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-04 17:41:32,870 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 17:41:32,870 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-04 17:41:32,870 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-04 17:41:32,871 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-04 17:41:32,871 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-04 17:41:32,871 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-04 17:41:32,871 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-04 17:41:32,871 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-04 17:41:32,871 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-04 17:41:32,872 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-04 17:41:32,872 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-04 17:41:32,872 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:41:33,091 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-04 17:41:33,117 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-04 17:41:33,120 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-04 17:41:33,120 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-04 17:41:33,121 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-04 17:41:33,122 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/rfi000_power.opt_pso.opt_rmo.opt.yml/witness.yml [2024-06-04 17:41:33,279 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-04 17:41:33,279 INFO L274 PluginConnector]: CDTParser initialized [2024-06-04 17:41:33,280 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi000_power.opt_pso.opt_rmo.opt.i [2024-06-04 17:41:34,283 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-04 17:41:34,479 INFO L384 CDTParser]: Found 1 translation units. [2024-06-04 17:41:34,480 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_power.opt_pso.opt_rmo.opt.i [2024-06-04 17:41:34,501 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90e3fea0e/beae583542fb422fbcbb2999da0b75fc/FLAGd450fa64b [2024-06-04 17:41:34,515 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90e3fea0e/beae583542fb422fbcbb2999da0b75fc [2024-06-04 17:41:34,516 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-04 17:41:34,517 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-04 17:41:34,528 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-04 17:41:34,528 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-04 17:41:34,533 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-04 17:41:34,533 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 05:41:33" (1/2) ... [2024-06-04 17:41:34,534 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4886e6a6 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:41:34, skipping insertion in model container [2024-06-04 17:41:34,535 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 05:41:33" (1/2) ... [2024-06-04 17:41:34,544 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@62dd77d6 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:41:34, skipping insertion in model container [2024-06-04 17:41:34,544 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 05:41:34" (2/2) ... [2024-06-04 17:41:34,544 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4886e6a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:41:34, skipping insertion in model container [2024-06-04 17:41:34,544 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 05:41:34" (2/2) ... [2024-06-04 17:41:34,545 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-04 17:41:34,622 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-04 17:41:34,623 INFO L97 edCorrectnessWitness]: Location invariant before [L803-L803] (((((((((((((((! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2))) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! 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) && (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_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) && (2LL + (long long )__unbuffered_cnt) - (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) && (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) && (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_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 || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 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_p1_EAX <= 127) && __unbuffered_p1_EBX <= 127) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && 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) && x$w_buff0 % 2 == 0) && x$w_buff1 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)) && ((__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1) || __unbuffered_p1_EBX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 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 || (((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 || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! 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 || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-04 17:41:34,623 INFO L97 edCorrectnessWitness]: Location invariant before [L804-L804] (((((((((((((((! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2))) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! 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) && (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_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) && (2LL + (long long )__unbuffered_cnt) - (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) && (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) && (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_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 || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 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_p1_EAX <= 127) && __unbuffered_p1_EBX <= 127) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && 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) && x$w_buff0 % 2 == 0) && x$w_buff1 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)) && ((__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1) || __unbuffered_p1_EBX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 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 || (((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 || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! 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 || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-04 17:41:34,624 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-04 17:41:34,624 INFO L106 edCorrectnessWitness]: ghost_update [L801-L801] multithreaded = 1; [2024-06-04 17:41:34,661 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-04 17:41:34,980 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 17:41:34,989 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-04 17:41:35,244 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 17:41:35,280 INFO L206 MainTranslator]: Completed translation [2024-06-04 17:41:35,281 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:41:35 WrapperNode [2024-06-04 17:41:35,281 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-04 17:41:35,282 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-04 17:41:35,282 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-04 17:41:35,282 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-04 17:41:35,287 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:41:35" (1/1) ... [2024-06-04 17:41:35,318 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:41:35" (1/1) ... [2024-06-04 17:41:35,377 INFO L138 Inliner]: procedures = 174, calls = 38, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 138 [2024-06-04 17:41:35,377 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-04 17:41:35,378 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-04 17:41:35,378 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-04 17:41:35,378 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-04 17:41:35,387 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:41:35" (1/1) ... [2024-06-04 17:41:35,387 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:41:35" (1/1) ... [2024-06-04 17:41:35,406 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:41:35" (1/1) ... [2024-06-04 17:41:35,435 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:41:35,436 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:41:35" (1/1) ... [2024-06-04 17:41:35,437 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:41:35" (1/1) ... [2024-06-04 17:41:35,468 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:41:35" (1/1) ... [2024-06-04 17:41:35,470 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:41:35" (1/1) ... [2024-06-04 17:41:35,479 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:41:35" (1/1) ... [2024-06-04 17:41:35,482 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:41:35" (1/1) ... [2024-06-04 17:41:35,558 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-04 17:41:35,559 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-04 17:41:35,559 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-04 17:41:35,559 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-04 17:41:35,560 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:41:35" (1/1) ... [2024-06-04 17:41:35,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 17:41:35,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-04 17:41:35,635 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:41:35,638 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:41:35,692 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-04 17:41:35,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-04 17:41:35,692 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-04 17:41:35,692 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-04 17:41:35,692 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-04 17:41:35,692 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-04 17:41:35,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-04 17:41:35,693 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-04 17:41:35,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-04 17:41:35,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-04 17:41:35,694 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:41:35,825 INFO L244 CfgBuilder]: Building ICFG [2024-06-04 17:41:35,826 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-04 17:41:36,498 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-04 17:41:36,498 INFO L293 CfgBuilder]: Performing block encoding [2024-06-04 17:41:36,615 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-04 17:41:36,616 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-04 17:41:36,616 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 05:41:36 BoogieIcfgContainer [2024-06-04 17:41:36,616 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-04 17:41:36,618 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-04 17:41:36,618 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-04 17:41:36,620 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-04 17:41:36,620 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 05:41:33" (1/4) ... [2024-06-04 17:41:36,621 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@85b3164 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 05:41:36, skipping insertion in model container [2024-06-04 17:41:36,621 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.06 05:41:34" (2/4) ... [2024-06-04 17:41:36,621 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@85b3164 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 05:41:36, skipping insertion in model container [2024-06-04 17:41:36,621 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:41:35" (3/4) ... [2024-06-04 17:41:36,622 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@85b3164 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 05:41:36, skipping insertion in model container [2024-06-04 17:41:36,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 05:41:36" (4/4) ... [2024-06-04 17:41:36,623 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi000_power.opt_pso.opt_rmo.opt.i [2024-06-04 17:41:36,635 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-04 17:41:36,636 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-04 17:41:36,636 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-04 17:41:36,706 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-04 17:41:36,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 32 transitions, 72 flow [2024-06-04 17:41:36,773 INFO L124 PetriNetUnfolderBase]: 0/30 cut-off events. [2024-06-04 17:41:36,773 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 17:41:36,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 30 events. 0/30 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 38 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-04 17:41:36,776 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 32 transitions, 72 flow [2024-06-04 17:41:36,778 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 24 transitions, 54 flow [2024-06-04 17:41:36,789 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-04 17:41:36,795 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;@697b2663, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-04 17:41:36,795 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-04 17:41:36,800 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-04 17:41:36,801 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-04 17:41:36,801 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 17:41:36,801 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:41:36,802 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-04 17:41:36,802 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:41:36,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:41:36,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1600259855, now seen corresponding path program 1 times [2024-06-04 17:41:36,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:41:36,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968241549] [2024-06-04 17:41:36,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:41:36,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:41:37,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:41:40,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:41:40,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:41:40,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968241549] [2024-06-04 17:41:40,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968241549] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:41:40,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:41:40,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-04 17:41:40,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171726169] [2024-06-04 17:41:40,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:41:40,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-04 17:41:40,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:41:40,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-04 17:41:40,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-04 17:41:40,096 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 17:41:40,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 24 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:41:40,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:41:40,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 17:41:40,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:41:40,309 INFO L124 PetriNetUnfolderBase]: 162/317 cut-off events. [2024-06-04 17:41:40,309 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-06-04 17:41:40,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 630 conditions, 317 events. 162/317 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1162 event pairs, 97 based on Foata normal form. 1/303 useless extension candidates. Maximal degree in co-relation 616. Up to 288 conditions per place. [2024-06-04 17:41:40,315 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 23 selfloop transitions, 3 changer transitions 0/30 dead transitions. [2024-06-04 17:41:40,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 30 transitions, 121 flow [2024-06-04 17:41:40,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-04 17:41:40,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-04 17:41:40,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2024-06-04 17:41:40,326 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2024-06-04 17:41:40,327 INFO L175 Difference]: Start difference. First operand has 31 places, 24 transitions, 54 flow. Second operand 3 states and 52 transitions. [2024-06-04 17:41:40,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 30 transitions, 121 flow [2024-06-04 17:41:40,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 30 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-04 17:41:40,331 INFO L231 Difference]: Finished difference. Result has 32 places, 26 transitions, 73 flow [2024-06-04 17:41:40,332 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=73, PETRI_PLACES=32, PETRI_TRANSITIONS=26} [2024-06-04 17:41:40,335 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 1 predicate places. [2024-06-04 17:41:40,335 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 73 flow [2024-06-04 17:41:40,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:41:40,336 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:41:40,336 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:41:40,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-04 17:41:40,337 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:41:40,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:41:40,337 INFO L85 PathProgramCache]: Analyzing trace with hash 251680094, now seen corresponding path program 1 times [2024-06-04 17:41:40,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:41:40,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22369554] [2024-06-04 17:41:40,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:41:40,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:41:40,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:41:42,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:41:42,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:41:42,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22369554] [2024-06-04 17:41:42,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22369554] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:41:42,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:41:42,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-04 17:41:42,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838076890] [2024-06-04 17:41:42,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:41:42,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-04 17:41:42,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:41:42,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-04 17:41:42,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-04 17:41:42,524 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 17:41:42,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 73 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:41:42,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:41:42,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 17:41:42,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:41:42,737 INFO L124 PetriNetUnfolderBase]: 213/382 cut-off events. [2024-06-04 17:41:42,737 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2024-06-04 17:41:42,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 880 conditions, 382 events. 213/382 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1350 event pairs, 109 based on Foata normal form. 2/382 useless extension candidates. Maximal degree in co-relation 865. Up to 364 conditions per place. [2024-06-04 17:41:42,743 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 29 selfloop transitions, 5 changer transitions 0/36 dead transitions. [2024-06-04 17:41:42,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 36 transitions, 167 flow [2024-06-04 17:41:42,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-04 17:41:42,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-04 17:41:42,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2024-06-04 17:41:42,746 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46875 [2024-06-04 17:41:42,747 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 73 flow. Second operand 4 states and 60 transitions. [2024-06-04 17:41:42,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 36 transitions, 167 flow [2024-06-04 17:41:42,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 36 transitions, 164 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-04 17:41:42,750 INFO L231 Difference]: Finished difference. Result has 35 places, 28 transitions, 97 flow [2024-06-04 17:41:42,750 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=97, PETRI_PLACES=35, PETRI_TRANSITIONS=28} [2024-06-04 17:41:42,752 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 4 predicate places. [2024-06-04 17:41:42,752 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 97 flow [2024-06-04 17:41:42,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:41:42,752 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:41:42,752 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:41:42,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-04 17:41:42,753 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:41:42,754 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:41:42,755 INFO L85 PathProgramCache]: Analyzing trace with hash -795000808, now seen corresponding path program 1 times [2024-06-04 17:41:42,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:41:42,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78542778] [2024-06-04 17:41:42,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:41:42,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:41:42,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:41:44,745 INFO 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:41:44,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:41:44,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78542778] [2024-06-04 17:41:44,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78542778] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:41:44,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:41:44,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 17:41:44,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179220915] [2024-06-04 17:41:44,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:41:44,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 17:41:44,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:41:44,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 17:41:44,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-04 17:41:44,800 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 17:41:44,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 97 flow. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:41:44,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:41:44,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 17:41:44,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:41:44,949 INFO L124 PetriNetUnfolderBase]: 207/372 cut-off events. [2024-06-04 17:41:44,949 INFO L125 PetriNetUnfolderBase]: For 219/219 co-relation queries the response was YES. [2024-06-04 17:41:44,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 947 conditions, 372 events. 207/372 cut-off events. For 219/219 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1297 event pairs, 61 based on Foata normal form. 4/374 useless extension candidates. Maximal degree in co-relation 930. Up to 336 conditions per place. [2024-06-04 17:41:44,951 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 34 selfloop transitions, 7 changer transitions 0/43 dead transitions. [2024-06-04 17:41:44,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 43 transitions, 219 flow [2024-06-04 17:41:44,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 17:41:44,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 17:41:44,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2024-06-04 17:41:44,953 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45625 [2024-06-04 17:41:44,953 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 97 flow. Second operand 5 states and 73 transitions. [2024-06-04 17:41:44,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 43 transitions, 219 flow [2024-06-04 17:41:44,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 43 transitions, 210 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-04 17:41:44,955 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 121 flow [2024-06-04 17:41:44,955 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=121, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2024-06-04 17:41:44,956 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 7 predicate places. [2024-06-04 17:41:44,956 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 121 flow [2024-06-04 17:41:44,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:41:44,956 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:41:44,957 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:41:44,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-04 17:41:44,957 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:41:44,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:41:44,957 INFO L85 PathProgramCache]: Analyzing trace with hash 508425943, now seen corresponding path program 1 times [2024-06-04 17:41:44,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:41:44,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29051442] [2024-06-04 17:41:44,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:41:44,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:41:44,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:41:47,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:41:47,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:41:47,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29051442] [2024-06-04 17:41:47,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29051442] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:41:47,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:41:47,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 17:41:47,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509068300] [2024-06-04 17:41:47,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:41:47,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 17:41:47,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:41:47,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 17:41:47,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-04 17:41:47,674 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 17:41:47,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 121 flow. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:41:47,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:41:47,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 17:41:47,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:41:47,866 INFO L124 PetriNetUnfolderBase]: 203/364 cut-off events. [2024-06-04 17:41:47,867 INFO L125 PetriNetUnfolderBase]: For 359/359 co-relation queries the response was YES. [2024-06-04 17:41:47,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1008 conditions, 364 events. 203/364 cut-off events. For 359/359 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1244 event pairs, 36 based on Foata normal form. 4/366 useless extension candidates. Maximal degree in co-relation 990. Up to 310 conditions per place. [2024-06-04 17:41:47,870 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 34 selfloop transitions, 8 changer transitions 0/44 dead transitions. [2024-06-04 17:41:47,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 44 transitions, 233 flow [2024-06-04 17:41:47,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:41:47,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:41:47,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2024-06-04 17:41:47,873 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2024-06-04 17:41:47,874 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 121 flow. Second operand 6 states and 80 transitions. [2024-06-04 17:41:47,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 44 transitions, 233 flow [2024-06-04 17:41:47,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 44 transitions, 218 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-04 17:41:47,876 INFO L231 Difference]: Finished difference. Result has 40 places, 29 transitions, 118 flow [2024-06-04 17:41:47,876 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=118, PETRI_PLACES=40, PETRI_TRANSITIONS=29} [2024-06-04 17:41:47,877 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 9 predicate places. [2024-06-04 17:41:47,878 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 118 flow [2024-06-04 17:41:47,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:41:47,878 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:41:47,878 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:41:47,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-04 17:41:47,878 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:41:47,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:41:47,879 INFO L85 PathProgramCache]: Analyzing trace with hash 234560243, now seen corresponding path program 1 times [2024-06-04 17:41:47,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:41:47,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278799321] [2024-06-04 17:41:47,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:41:47,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:41:47,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:41:51,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:41:51,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:41:51,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278799321] [2024-06-04 17:41:51,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278799321] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:41:51,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:41:51,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 17:41:51,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831120053] [2024-06-04 17:41:51,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:41:51,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 17:41:51,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:41:51,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 17:41:51,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-04 17:41:51,871 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:41:51,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 118 flow. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:41:51,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:41:51,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:41:51,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:41:52,036 INFO L124 PetriNetUnfolderBase]: 147/295 cut-off events. [2024-06-04 17:41:52,036 INFO L125 PetriNetUnfolderBase]: For 377/377 co-relation queries the response was YES. [2024-06-04 17:41:52,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 823 conditions, 295 events. 147/295 cut-off events. For 377/377 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1064 event pairs, 53 based on Foata normal form. 1/288 useless extension candidates. Maximal degree in co-relation 804. Up to 259 conditions per place. [2024-06-04 17:41:52,038 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 26 selfloop transitions, 6 changer transitions 0/36 dead transitions. [2024-06-04 17:41:52,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 36 transitions, 200 flow [2024-06-04 17:41:52,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 17:41:52,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 17:41:52,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2024-06-04 17:41:52,040 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-04 17:41:52,040 INFO L175 Difference]: Start difference. First operand has 40 places, 29 transitions, 118 flow. Second operand 5 states and 64 transitions. [2024-06-04 17:41:52,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 36 transitions, 200 flow [2024-06-04 17:41:52,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 36 transitions, 180 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-04 17:41:52,045 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 125 flow [2024-06-04 17:41:52,046 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=125, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2024-06-04 17:41:52,050 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 10 predicate places. [2024-06-04 17:41:52,050 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 125 flow [2024-06-04 17:41:52,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:41:52,050 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:41:52,051 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:41:52,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-04 17:41:52,052 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:41:52,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:41:52,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1318565773, now seen corresponding path program 1 times [2024-06-04 17:41:52,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:41:52,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221347868] [2024-06-04 17:41:52,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:41:52,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:41:52,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:41:55,981 INFO 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:41:55,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:41:55,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221347868] [2024-06-04 17:41:55,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221347868] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:41:55,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:41:55,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 17:41:55,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308380818] [2024-06-04 17:41:55,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:41:55,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 17:41:55,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:41:55,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 17:41:55,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-04 17:41:56,064 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:41:56,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 125 flow. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:41:56,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:41:56,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:41:56,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:41:56,308 INFO L124 PetriNetUnfolderBase]: 203/365 cut-off events. [2024-06-04 17:41:56,309 INFO L125 PetriNetUnfolderBase]: For 693/693 co-relation queries the response was YES. [2024-06-04 17:41:56,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1106 conditions, 365 events. 203/365 cut-off events. For 693/693 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1252 event pairs, 70 based on Foata normal form. 2/365 useless extension candidates. Maximal degree in co-relation 1085. Up to 327 conditions per place. [2024-06-04 17:41:56,312 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 33 selfloop transitions, 13 changer transitions 0/48 dead transitions. [2024-06-04 17:41:56,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 48 transitions, 275 flow [2024-06-04 17:41:56,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:41:56,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:41:56,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2024-06-04 17:41:56,314 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35267857142857145 [2024-06-04 17:41:56,314 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 125 flow. Second operand 7 states and 79 transitions. [2024-06-04 17:41:56,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 48 transitions, 275 flow [2024-06-04 17:41:56,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 48 transitions, 264 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-04 17:41:56,317 INFO L231 Difference]: Finished difference. Result has 46 places, 37 transitions, 184 flow [2024-06-04 17:41:56,317 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=184, PETRI_PLACES=46, PETRI_TRANSITIONS=37} [2024-06-04 17:41:56,319 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 15 predicate places. [2024-06-04 17:41:56,319 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 37 transitions, 184 flow [2024-06-04 17:41:56,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:41:56,319 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:41:56,319 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:41:56,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-04 17:41:56,320 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:41:56,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:41:56,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1625823128, now seen corresponding path program 1 times [2024-06-04 17:41:56,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:41:56,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181123205] [2024-06-04 17:41:56,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:41:56,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:41:56,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:41:59,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:41:59,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:41:59,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181123205] [2024-06-04 17:41:59,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181123205] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:41:59,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:41:59,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 17:41:59,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851391647] [2024-06-04 17:41:59,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:41:59,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 17:41:59,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:41:59,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 17:41:59,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-04 17:42:00,034 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:42:00,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 184 flow. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:42:00,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:42:00,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:42:00,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:42:00,297 INFO L124 PetriNetUnfolderBase]: 206/370 cut-off events. [2024-06-04 17:42:00,298 INFO L125 PetriNetUnfolderBase]: For 996/996 co-relation queries the response was YES. [2024-06-04 17:42:00,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1275 conditions, 370 events. 206/370 cut-off events. For 996/996 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1264 event pairs, 74 based on Foata normal form. 1/369 useless extension candidates. Maximal degree in co-relation 1252. Up to 349 conditions per place. [2024-06-04 17:42:00,300 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 38 selfloop transitions, 8 changer transitions 0/48 dead transitions. [2024-06-04 17:42:00,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 48 transitions, 313 flow [2024-06-04 17:42:00,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:42:00,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:42:00,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 67 transitions. [2024-06-04 17:42:00,301 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3489583333333333 [2024-06-04 17:42:00,301 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 184 flow. Second operand 6 states and 67 transitions. [2024-06-04 17:42:00,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 48 transitions, 313 flow [2024-06-04 17:42:00,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 48 transitions, 299 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-06-04 17:42:00,304 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 210 flow [2024-06-04 17:42:00,304 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=210, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2024-06-04 17:42:00,305 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 18 predicate places. [2024-06-04 17:42:00,305 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 210 flow [2024-06-04 17:42:00,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:42:00,306 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:42:00,306 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:42:00,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-04 17:42:00,306 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:42:00,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:42:00,307 INFO L85 PathProgramCache]: Analyzing trace with hash 2074127378, now seen corresponding path program 2 times [2024-06-04 17:42:00,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:42:00,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711685897] [2024-06-04 17:42:00,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:42:00,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:42:00,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:42:04,180 INFO 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:04,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:42:04,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711685897] [2024-06-04 17:42:04,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711685897] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:42:04,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:42:04,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 17:42:04,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342000235] [2024-06-04 17:42:04,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:42:04,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 17:42:04,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:42:04,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 17:42:04,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-04 17:42:04,237 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:42:04,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 210 flow. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:42:04,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:42:04,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:42:04,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:42:04,482 INFO L124 PetriNetUnfolderBase]: 201/362 cut-off events. [2024-06-04 17:42:04,483 INFO L125 PetriNetUnfolderBase]: For 1265/1265 co-relation queries the response was YES. [2024-06-04 17:42:04,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1288 conditions, 362 events. 201/362 cut-off events. For 1265/1265 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1239 event pairs, 74 based on Foata normal form. 2/362 useless extension candidates. Maximal degree in co-relation 1263. Up to 324 conditions per place. [2024-06-04 17:42:04,485 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 33 selfloop transitions, 14 changer transitions 0/49 dead transitions. [2024-06-04 17:42:04,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 49 transitions, 328 flow [2024-06-04 17:42:04,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:42:04,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:42:04,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 78 transitions. [2024-06-04 17:42:04,486 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3482142857142857 [2024-06-04 17:42:04,487 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 210 flow. Second operand 7 states and 78 transitions. [2024-06-04 17:42:04,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 49 transitions, 328 flow [2024-06-04 17:42:04,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 49 transitions, 309 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-04 17:42:04,489 INFO L231 Difference]: Finished difference. Result has 52 places, 39 transitions, 226 flow [2024-06-04 17:42:04,489 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=226, PETRI_PLACES=52, PETRI_TRANSITIONS=39} [2024-06-04 17:42:04,491 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 21 predicate places. [2024-06-04 17:42:04,491 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 39 transitions, 226 flow [2024-06-04 17:42:04,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:42:04,491 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:42:04,491 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:42:04,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-04 17:42:04,492 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:42:04,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:42:04,493 INFO L85 PathProgramCache]: Analyzing trace with hash 2074135314, now seen corresponding path program 1 times [2024-06-04 17:42:04,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:42:04,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667715953] [2024-06-04 17:42:04,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:42:04,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:42:04,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:42:08,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:42:08,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:42:08,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667715953] [2024-06-04 17:42:08,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667715953] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:42:08,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:42:08,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:42:08,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259264881] [2024-06-04 17:42:08,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:42:08,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:42:08,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:42:08,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:42:08,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:42:08,585 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:42:08,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 226 flow. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:42:08,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:42:08,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:42:08,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:42:08,813 INFO L124 PetriNetUnfolderBase]: 202/364 cut-off events. [2024-06-04 17:42:08,814 INFO L125 PetriNetUnfolderBase]: For 1528/1528 co-relation queries the response was YES. [2024-06-04 17:42:08,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1342 conditions, 364 events. 202/364 cut-off events. For 1528/1528 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1231 event pairs, 72 based on Foata normal form. 2/364 useless extension candidates. Maximal degree in co-relation 1316. Up to 314 conditions per place. [2024-06-04 17:42:08,816 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 35 selfloop transitions, 19 changer transitions 0/56 dead transitions. [2024-06-04 17:42:08,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 56 transitions, 402 flow [2024-06-04 17:42:08,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:42:08,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:42:08,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2024-06-04 17:42:08,817 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34765625 [2024-06-04 17:42:08,817 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 226 flow. Second operand 8 states and 89 transitions. [2024-06-04 17:42:08,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 56 transitions, 402 flow [2024-06-04 17:42:08,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 56 transitions, 364 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-04 17:42:08,820 INFO L231 Difference]: Finished difference. Result has 54 places, 44 transitions, 262 flow [2024-06-04 17:42:08,820 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=262, PETRI_PLACES=54, PETRI_TRANSITIONS=44} [2024-06-04 17:42:08,820 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 23 predicate places. [2024-06-04 17:42:08,821 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 44 transitions, 262 flow [2024-06-04 17:42:08,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:42:08,821 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:42:08,821 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:42:08,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-04 17:42:08,821 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:42:08,822 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:42:08,822 INFO L85 PathProgramCache]: Analyzing trace with hash -132993362, now seen corresponding path program 1 times [2024-06-04 17:42:08,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:42:08,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800744107] [2024-06-04 17:42:08,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:42:08,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:42:08,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:42:12,677 INFO 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:12,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:42:12,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800744107] [2024-06-04 17:42:12,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800744107] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:42:12,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:42:12,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:42:12,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754081093] [2024-06-04 17:42:12,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:42:12,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:42:12,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:42:12,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:42:12,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:42:12,743 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:42:12,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 44 transitions, 262 flow. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:42:12,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:42:12,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:42:12,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:42:12,986 INFO L124 PetriNetUnfolderBase]: 208/374 cut-off events. [2024-06-04 17:42:12,986 INFO L125 PetriNetUnfolderBase]: For 1936/1936 co-relation queries the response was YES. [2024-06-04 17:42:12,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1458 conditions, 374 events. 208/374 cut-off events. For 1936/1936 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1300 event pairs, 50 based on Foata normal form. 2/374 useless extension candidates. Maximal degree in co-relation 1431. Up to 332 conditions per place. [2024-06-04 17:42:12,988 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 48 selfloop transitions, 12 changer transitions 0/62 dead transitions. [2024-06-04 17:42:12,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 62 transitions, 432 flow [2024-06-04 17:42:12,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:42:12,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:42:12,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2024-06-04 17:42:12,989 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35714285714285715 [2024-06-04 17:42:12,990 INFO L175 Difference]: Start difference. First operand has 54 places, 44 transitions, 262 flow. Second operand 7 states and 80 transitions. [2024-06-04 17:42:12,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 62 transitions, 432 flow [2024-06-04 17:42:12,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 62 transitions, 408 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-06-04 17:42:12,992 INFO L231 Difference]: Finished difference. Result has 58 places, 48 transitions, 292 flow [2024-06-04 17:42:12,992 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=292, PETRI_PLACES=58, PETRI_TRANSITIONS=48} [2024-06-04 17:42:12,993 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 27 predicate places. [2024-06-04 17:42:12,993 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 48 transitions, 292 flow [2024-06-04 17:42:12,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:42:12,993 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:42:12,993 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:42:12,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-04 17:42:12,993 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:42:12,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:42:12,994 INFO L85 PathProgramCache]: Analyzing trace with hash -303691142, now seen corresponding path program 2 times [2024-06-04 17:42:12,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:42:12,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537624799] [2024-06-04 17:42:12,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:42:12,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:42:13,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:42:16,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:42:16,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:42:16,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537624799] [2024-06-04 17:42:16,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537624799] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:42:16,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:42:16,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:42:16,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099257298] [2024-06-04 17:42:16,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:42:16,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:42:16,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:42:16,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:42:16,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:42:16,640 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:42:16,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 48 transitions, 292 flow. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:42:16,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:42:16,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:42:16,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:42:16,863 INFO L124 PetriNetUnfolderBase]: 219/392 cut-off events. [2024-06-04 17:42:16,864 INFO L125 PetriNetUnfolderBase]: For 2440/2440 co-relation queries the response was YES. [2024-06-04 17:42:16,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1659 conditions, 392 events. 219/392 cut-off events. For 2440/2440 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1378 event pairs, 50 based on Foata normal form. 2/392 useless extension candidates. Maximal degree in co-relation 1629. Up to 337 conditions per place. [2024-06-04 17:42:16,866 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 47 selfloop transitions, 16 changer transitions 0/65 dead transitions. [2024-06-04 17:42:16,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 65 transitions, 500 flow [2024-06-04 17:42:16,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:42:16,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:42:16,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 81 transitions. [2024-06-04 17:42:16,867 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36160714285714285 [2024-06-04 17:42:16,867 INFO L175 Difference]: Start difference. First operand has 58 places, 48 transitions, 292 flow. Second operand 7 states and 81 transitions. [2024-06-04 17:42:16,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 65 transitions, 500 flow [2024-06-04 17:42:16,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 65 transitions, 482 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-06-04 17:42:16,870 INFO L231 Difference]: Finished difference. Result has 62 places, 52 transitions, 343 flow [2024-06-04 17:42:16,870 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=343, PETRI_PLACES=62, PETRI_TRANSITIONS=52} [2024-06-04 17:42:16,871 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 31 predicate places. [2024-06-04 17:42:16,871 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 52 transitions, 343 flow [2024-06-04 17:42:16,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:42:16,871 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:42:16,871 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:42:16,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-04 17:42:16,872 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:42:16,872 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:42:16,872 INFO L85 PathProgramCache]: Analyzing trace with hash -299049512, now seen corresponding path program 3 times [2024-06-04 17:42:16,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:42:16,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245716990] [2024-06-04 17:42:16,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:42:16,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:42:16,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:42:20,732 INFO 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:20,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:42:20,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245716990] [2024-06-04 17:42:20,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245716990] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:42:20,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:42:20,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:42:20,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254105625] [2024-06-04 17:42:20,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:42:20,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:42:20,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:42:20,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:42:20,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:42:20,824 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:42:20,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 52 transitions, 343 flow. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:42:20,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:42:20,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:42:20,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:42:21,096 INFO L124 PetriNetUnfolderBase]: 221/396 cut-off events. [2024-06-04 17:42:21,097 INFO L125 PetriNetUnfolderBase]: For 2980/2980 co-relation queries the response was YES. [2024-06-04 17:42:21,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1736 conditions, 396 events. 221/396 cut-off events. For 2980/2980 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1391 event pairs, 48 based on Foata normal form. 4/398 useless extension candidates. Maximal degree in co-relation 1705. Up to 288 conditions per place. [2024-06-04 17:42:21,100 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 47 selfloop transitions, 22 changer transitions 0/71 dead transitions. [2024-06-04 17:42:21,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 71 transitions, 573 flow [2024-06-04 17:42:21,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:42:21,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:42:21,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 93 transitions. [2024-06-04 17:42:21,102 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36328125 [2024-06-04 17:42:21,102 INFO L175 Difference]: Start difference. First operand has 62 places, 52 transitions, 343 flow. Second operand 8 states and 93 transitions. [2024-06-04 17:42:21,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 71 transitions, 573 flow [2024-06-04 17:42:21,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 71 transitions, 553 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-04 17:42:21,110 INFO L231 Difference]: Finished difference. Result has 67 places, 57 transitions, 413 flow [2024-06-04 17:42:21,111 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=413, PETRI_PLACES=67, PETRI_TRANSITIONS=57} [2024-06-04 17:42:21,111 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 36 predicate places. [2024-06-04 17:42:21,111 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 57 transitions, 413 flow [2024-06-04 17:42:21,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:42:21,112 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:42:21,112 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:42:21,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-04 17:42:21,112 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:42:21,112 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:42:21,112 INFO L85 PathProgramCache]: Analyzing trace with hash -126313358, now seen corresponding path program 1 times [2024-06-04 17:42:21,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:42:21,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84048884] [2024-06-04 17:42:21,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:42:21,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:42:21,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:42:25,144 INFO 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:25,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:42:25,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84048884] [2024-06-04 17:42:25,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84048884] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:42:25,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:42:25,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:42:25,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230484134] [2024-06-04 17:42:25,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:42:25,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:42:25,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:42:25,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:42:25,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:42:25,210 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:42:25,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 57 transitions, 413 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:42:25,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:42:25,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:42:25,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:42:25,472 INFO L124 PetriNetUnfolderBase]: 222/398 cut-off events. [2024-06-04 17:42:25,472 INFO L125 PetriNetUnfolderBase]: For 3308/3308 co-relation queries the response was YES. [2024-06-04 17:42:25,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1848 conditions, 398 events. 222/398 cut-off events. For 3308/3308 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1414 event pairs, 49 based on Foata normal form. 2/398 useless extension candidates. Maximal degree in co-relation 1815. Up to 335 conditions per place. [2024-06-04 17:42:25,475 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 50 selfloop transitions, 23 changer transitions 0/75 dead transitions. [2024-06-04 17:42:25,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 75 transitions, 643 flow [2024-06-04 17:42:25,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:42:25,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:42:25,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions. [2024-06-04 17:42:25,476 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34375 [2024-06-04 17:42:25,476 INFO L175 Difference]: Start difference. First operand has 67 places, 57 transitions, 413 flow. Second operand 9 states and 99 transitions. [2024-06-04 17:42:25,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 75 transitions, 643 flow [2024-06-04 17:42:25,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 75 transitions, 612 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-06-04 17:42:25,481 INFO L231 Difference]: Finished difference. Result has 72 places, 62 transitions, 470 flow [2024-06-04 17:42:25,481 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=382, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=470, PETRI_PLACES=72, PETRI_TRANSITIONS=62} [2024-06-04 17:42:25,482 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 41 predicate places. [2024-06-04 17:42:25,483 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 62 transitions, 470 flow [2024-06-04 17:42:25,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:42:25,483 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:42:25,483 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:42:25,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-04 17:42:25,483 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:42:25,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:42:25,484 INFO L85 PathProgramCache]: Analyzing trace with hash -158297167, now seen corresponding path program 1 times [2024-06-04 17:42:25,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:42:25,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130648785] [2024-06-04 17:42:25,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:42:25,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:42:25,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:42:29,707 INFO 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:29,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:42:29,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130648785] [2024-06-04 17:42:29,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130648785] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:42:29,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:42:29,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:42:29,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857023058] [2024-06-04 17:42:29,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:42:29,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:42:29,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:42:29,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:42:29,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:42:29,824 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:42:29,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 62 transitions, 470 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:42:29,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:42:29,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:42:29,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:42:30,071 INFO L124 PetriNetUnfolderBase]: 220/395 cut-off events. [2024-06-04 17:42:30,071 INFO L125 PetriNetUnfolderBase]: For 3509/3509 co-relation queries the response was YES. [2024-06-04 17:42:30,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1914 conditions, 395 events. 220/395 cut-off events. For 3509/3509 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1383 event pairs, 47 based on Foata normal form. 1/394 useless extension candidates. Maximal degree in co-relation 1879. Up to 350 conditions per place. [2024-06-04 17:42:30,074 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 61 selfloop transitions, 13 changer transitions 0/76 dead transitions. [2024-06-04 17:42:30,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 76 transitions, 654 flow [2024-06-04 17:42:30,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:42:30,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:42:30,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2024-06-04 17:42:30,075 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35714285714285715 [2024-06-04 17:42:30,075 INFO L175 Difference]: Start difference. First operand has 72 places, 62 transitions, 470 flow. Second operand 7 states and 80 transitions. [2024-06-04 17:42:30,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 76 transitions, 654 flow [2024-06-04 17:42:30,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 76 transitions, 618 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-06-04 17:42:30,080 INFO L231 Difference]: Finished difference. Result has 74 places, 62 transitions, 468 flow [2024-06-04 17:42:30,080 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=468, PETRI_PLACES=74, PETRI_TRANSITIONS=62} [2024-06-04 17:42:30,081 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 43 predicate places. [2024-06-04 17:42:30,081 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 62 transitions, 468 flow [2024-06-04 17:42:30,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:42:30,081 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:42:30,081 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:42:30,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-04 17:42:30,081 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:42:30,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:42:30,082 INFO L85 PathProgramCache]: Analyzing trace with hash -828208594, now seen corresponding path program 1 times [2024-06-04 17:42:30,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:42:30,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065431332] [2024-06-04 17:42:30,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:42:30,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:42:30,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:42:33,945 INFO 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:33,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:42:33,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065431332] [2024-06-04 17:42:33,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065431332] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:42:33,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:42:33,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:42:33,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879499399] [2024-06-04 17:42:33,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:42:33,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:42:33,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:42:33,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:42:33,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:42:34,012 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:42:34,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 62 transitions, 468 flow. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 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:34,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:42:34,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:42:34,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:42:34,269 INFO L124 PetriNetUnfolderBase]: 226/405 cut-off events. [2024-06-04 17:42:34,270 INFO L125 PetriNetUnfolderBase]: For 4113/4113 co-relation queries the response was YES. [2024-06-04 17:42:34,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1998 conditions, 405 events. 226/405 cut-off events. For 4113/4113 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1430 event pairs, 46 based on Foata normal form. 2/405 useless extension candidates. Maximal degree in co-relation 1961. Up to 355 conditions per place. [2024-06-04 17:42:34,273 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 64 selfloop transitions, 14 changer transitions 0/80 dead transitions. [2024-06-04 17:42:34,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 80 transitions, 682 flow [2024-06-04 17:42:34,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:42:34,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:42:34,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2024-06-04 17:42:34,275 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34765625 [2024-06-04 17:42:34,276 INFO L175 Difference]: Start difference. First operand has 74 places, 62 transitions, 468 flow. Second operand 8 states and 89 transitions. [2024-06-04 17:42:34,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 80 transitions, 682 flow [2024-06-04 17:42:34,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 80 transitions, 651 flow, removed 1 selfloop flow, removed 6 redundant places. [2024-06-04 17:42:34,281 INFO L231 Difference]: Finished difference. Result has 76 places, 64 transitions, 490 flow [2024-06-04 17:42:34,281 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=490, PETRI_PLACES=76, PETRI_TRANSITIONS=64} [2024-06-04 17:42:34,282 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 45 predicate places. [2024-06-04 17:42:34,282 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 64 transitions, 490 flow [2024-06-04 17:42:34,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 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:34,282 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:42:34,282 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:42:34,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-04 17:42:34,283 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:42:34,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:42:34,283 INFO L85 PathProgramCache]: Analyzing trace with hash -824483944, now seen corresponding path program 2 times [2024-06-04 17:42:34,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:42:34,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987784104] [2024-06-04 17:42:34,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:42:34,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:42:34,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:42:38,111 INFO 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:38,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:42:38,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987784104] [2024-06-04 17:42:38,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987784104] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:42:38,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:42:38,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:42:38,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068406192] [2024-06-04 17:42:38,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:42:38,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:42:38,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:42:38,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:42:38,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:42:38,174 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:42:38,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 64 transitions, 490 flow. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 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:38,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:42:38,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:42:38,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:42:38,426 INFO L124 PetriNetUnfolderBase]: 232/415 cut-off events. [2024-06-04 17:42:38,426 INFO L125 PetriNetUnfolderBase]: For 4699/4699 co-relation queries the response was YES. [2024-06-04 17:42:38,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2095 conditions, 415 events. 232/415 cut-off events. For 4699/4699 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1473 event pairs, 41 based on Foata normal form. 2/415 useless extension candidates. Maximal degree in co-relation 2057. Up to 301 conditions per place. [2024-06-04 17:42:38,429 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 49 selfloop transitions, 30 changer transitions 0/81 dead transitions. [2024-06-04 17:42:38,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 81 transitions, 738 flow [2024-06-04 17:42:38,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:42:38,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:42:38,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2024-06-04 17:42:38,430 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3671875 [2024-06-04 17:42:38,430 INFO L175 Difference]: Start difference. First operand has 76 places, 64 transitions, 490 flow. Second operand 8 states and 94 transitions. [2024-06-04 17:42:38,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 81 transitions, 738 flow [2024-06-04 17:42:38,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 81 transitions, 705 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-04 17:42:38,435 INFO L231 Difference]: Finished difference. Result has 78 places, 66 transitions, 542 flow [2024-06-04 17:42:38,435 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=457, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=542, PETRI_PLACES=78, PETRI_TRANSITIONS=66} [2024-06-04 17:42:38,436 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 47 predicate places. [2024-06-04 17:42:38,436 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 66 transitions, 542 flow [2024-06-04 17:42:38,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 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:38,436 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:42:38,436 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:42:38,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-04 17:42:38,437 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:42:38,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:42:38,437 INFO L85 PathProgramCache]: Analyzing trace with hash -154487732, now seen corresponding path program 3 times [2024-06-04 17:42:38,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:42:38,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495634659] [2024-06-04 17:42:38,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:42:38,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:42:38,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:42:42,336 INFO 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:42,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:42:42,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495634659] [2024-06-04 17:42:42,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495634659] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:42:42,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:42:42,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:42:42,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524607959] [2024-06-04 17:42:42,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:42:42,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:42:42,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:42:42,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:42:42,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:42:42,400 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:42:42,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 66 transitions, 542 flow. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 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:42,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:42:42,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:42:42,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:42:42,660 INFO L124 PetriNetUnfolderBase]: 233/417 cut-off events. [2024-06-04 17:42:42,660 INFO L125 PetriNetUnfolderBase]: For 5209/5209 co-relation queries the response was YES. [2024-06-04 17:42:42,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2176 conditions, 417 events. 233/417 cut-off events. For 5209/5209 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1497 event pairs, 47 based on Foata normal form. 2/417 useless extension candidates. Maximal degree in co-relation 2137. Up to 304 conditions per place. [2024-06-04 17:42:42,663 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 53 selfloop transitions, 28 changer transitions 0/83 dead transitions. [2024-06-04 17:42:42,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 83 transitions, 800 flow [2024-06-04 17:42:42,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:42:42,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:42:42,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 93 transitions. [2024-06-04 17:42:42,666 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36328125 [2024-06-04 17:42:42,666 INFO L175 Difference]: Start difference. First operand has 78 places, 66 transitions, 542 flow. Second operand 8 states and 93 transitions. [2024-06-04 17:42:42,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 83 transitions, 800 flow [2024-06-04 17:42:42,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 83 transitions, 719 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-04 17:42:42,671 INFO L231 Difference]: Finished difference. Result has 80 places, 68 transitions, 547 flow [2024-06-04 17:42:42,672 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=467, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=547, PETRI_PLACES=80, PETRI_TRANSITIONS=68} [2024-06-04 17:42:42,672 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 49 predicate places. [2024-06-04 17:42:42,673 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 68 transitions, 547 flow [2024-06-04 17:42:42,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 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:42,673 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:42:42,674 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:42:42,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-04 17:42:42,674 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:42:42,674 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:42:42,675 INFO L85 PathProgramCache]: Analyzing trace with hash 371835347, now seen corresponding path program 1 times [2024-06-04 17:42:42,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:42:42,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642089876] [2024-06-04 17:42:42,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:42:42,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:42:42,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:42:46,549 INFO 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:46,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:42:46,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642089876] [2024-06-04 17:42:46,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642089876] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:42:46,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:42:46,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:42:46,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620683363] [2024-06-04 17:42:46,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:42:46,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:42:46,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:42:46,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:42:46,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:42:46,696 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:42:46,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 68 transitions, 547 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:42:46,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:42:46,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:42:46,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:42:46,978 INFO L124 PetriNetUnfolderBase]: 236/422 cut-off events. [2024-06-04 17:42:46,978 INFO L125 PetriNetUnfolderBase]: For 5605/5605 co-relation queries the response was YES. [2024-06-04 17:42:46,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2215 conditions, 422 events. 236/422 cut-off events. For 5605/5605 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1511 event pairs, 50 based on Foata normal form. 1/421 useless extension candidates. Maximal degree in co-relation 2175. Up to 371 conditions per place. [2024-06-04 17:42:46,981 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 60 selfloop transitions, 21 changer transitions 0/83 dead transitions. [2024-06-04 17:42:46,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 83 transitions, 787 flow [2024-06-04 17:42:46,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:42:46,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:42:46,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2024-06-04 17:42:46,982 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3368055555555556 [2024-06-04 17:42:46,983 INFO L175 Difference]: Start difference. First operand has 80 places, 68 transitions, 547 flow. Second operand 9 states and 97 transitions. [2024-06-04 17:42:46,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 83 transitions, 787 flow [2024-06-04 17:42:46,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 83 transitions, 740 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-06-04 17:42:46,994 INFO L231 Difference]: Finished difference. Result has 84 places, 70 transitions, 561 flow [2024-06-04 17:42:46,994 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=561, PETRI_PLACES=84, PETRI_TRANSITIONS=70} [2024-06-04 17:42:46,994 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 53 predicate places. [2024-06-04 17:42:46,995 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 70 transitions, 561 flow [2024-06-04 17:42:46,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:42:46,996 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:42:46,996 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:42:46,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-04 17:42:46,997 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:42:46,997 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:42:46,997 INFO L85 PathProgramCache]: Analyzing trace with hash 378977747, now seen corresponding path program 2 times [2024-06-04 17:42:46,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:42:46,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790015509] [2024-06-04 17:42:46,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:42:46,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:42:47,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:42:51,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:42:51,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:42:51,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790015509] [2024-06-04 17:42:51,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790015509] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:42:51,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:42:51,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:42:51,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146484370] [2024-06-04 17:42:51,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:42:51,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:42:51,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:42:51,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:42:51,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:42:51,106 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:42:51,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 70 transitions, 561 flow. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 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:51,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:42:51,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:42:51,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:42:51,339 INFO L124 PetriNetUnfolderBase]: 234/419 cut-off events. [2024-06-04 17:42:51,340 INFO L125 PetriNetUnfolderBase]: For 6026/6026 co-relation queries the response was YES. [2024-06-04 17:42:51,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2198 conditions, 419 events. 234/419 cut-off events. For 6026/6026 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1498 event pairs, 50 based on Foata normal form. 1/418 useless extension candidates. Maximal degree in co-relation 2157. Up to 369 conditions per place. [2024-06-04 17:42:51,343 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 59 selfloop transitions, 20 changer transitions 0/81 dead transitions. [2024-06-04 17:42:51,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 81 transitions, 745 flow [2024-06-04 17:42:51,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:42:51,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:42:51,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2024-06-04 17:42:51,345 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34375 [2024-06-04 17:42:51,345 INFO L175 Difference]: Start difference. First operand has 84 places, 70 transitions, 561 flow. Second operand 8 states and 88 transitions. [2024-06-04 17:42:51,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 81 transitions, 745 flow [2024-06-04 17:42:51,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 81 transitions, 697 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-04 17:42:51,352 INFO L231 Difference]: Finished difference. Result has 85 places, 70 transitions, 558 flow [2024-06-04 17:42:51,352 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=513, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=558, PETRI_PLACES=85, PETRI_TRANSITIONS=70} [2024-06-04 17:42:51,353 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 54 predicate places. [2024-06-04 17:42:51,353 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 70 transitions, 558 flow [2024-06-04 17:42:51,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 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:51,353 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:42:51,353 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:42:51,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-04 17:42:51,353 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:42:51,354 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:42:51,354 INFO L85 PathProgramCache]: Analyzing trace with hash 379254577, now seen corresponding path program 1 times [2024-06-04 17:42:51,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:42:51,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018620821] [2024-06-04 17:42:51,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:42:51,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:42:51,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:42:55,591 INFO 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:55,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:42:55,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018620821] [2024-06-04 17:42:55,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018620821] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:42:55,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:42:55,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:42:55,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084157496] [2024-06-04 17:42:55,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:42:55,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:42:55,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:42:55,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:42:55,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:42:55,687 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:42:55,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 70 transitions, 558 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:42:55,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:42:55,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:42:55,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:42:56,049 INFO L124 PetriNetUnfolderBase]: 263/467 cut-off events. [2024-06-04 17:42:56,049 INFO L125 PetriNetUnfolderBase]: For 7748/7748 co-relation queries the response was YES. [2024-06-04 17:42:56,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2438 conditions, 467 events. 263/467 cut-off events. For 7748/7748 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1737 event pairs, 46 based on Foata normal form. 4/469 useless extension candidates. Maximal degree in co-relation 2396. Up to 241 conditions per place. [2024-06-04 17:42:56,053 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 57 selfloop transitions, 44 changer transitions 0/103 dead transitions. [2024-06-04 17:42:56,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 103 transitions, 1050 flow [2024-06-04 17:42:56,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:42:56,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:42:56,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 123 transitions. [2024-06-04 17:42:56,054 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.384375 [2024-06-04 17:42:56,054 INFO L175 Difference]: Start difference. First operand has 85 places, 70 transitions, 558 flow. Second operand 10 states and 123 transitions. [2024-06-04 17:42:56,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 103 transitions, 1050 flow [2024-06-04 17:42:56,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 103 transitions, 1001 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-04 17:42:56,061 INFO L231 Difference]: Finished difference. Result has 89 places, 80 transitions, 702 flow [2024-06-04 17:42:56,062 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=509, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=702, PETRI_PLACES=89, PETRI_TRANSITIONS=80} [2024-06-04 17:42:56,062 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 58 predicate places. [2024-06-04 17:42:56,062 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 80 transitions, 702 flow [2024-06-04 17:42:56,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:42:56,062 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:42:56,063 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:42:56,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-04 17:42:56,063 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:42:56,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:42:56,063 INFO L85 PathProgramCache]: Analyzing trace with hash 92476759, now seen corresponding path program 1 times [2024-06-04 17:42:56,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:42:56,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457247802] [2024-06-04 17:42:56,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:42:56,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:42:56,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:43:00,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:43:00,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:43:00,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457247802] [2024-06-04 17:43:00,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457247802] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:43:00,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:43:00,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:43:00,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916653783] [2024-06-04 17:43:00,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:43:00,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:43:00,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:43:00,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:43:00,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:43:00,223 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:43:00,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 80 transitions, 702 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:43:00,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:43:00,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:43:00,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:43:00,518 INFO L124 PetriNetUnfolderBase]: 267/475 cut-off events. [2024-06-04 17:43:00,518 INFO L125 PetriNetUnfolderBase]: For 8248/8248 co-relation queries the response was YES. [2024-06-04 17:43:00,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2688 conditions, 475 events. 267/475 cut-off events. For 8248/8248 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1780 event pairs, 34 based on Foata normal form. 2/475 useless extension candidates. Maximal degree in co-relation 2644. Up to 413 conditions per place. [2024-06-04 17:43:00,521 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 84 selfloop transitions, 11 changer transitions 0/97 dead transitions. [2024-06-04 17:43:00,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 97 transitions, 942 flow [2024-06-04 17:43:00,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:43:00,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:43:00,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 86 transitions. [2024-06-04 17:43:00,525 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3359375 [2024-06-04 17:43:00,525 INFO L175 Difference]: Start difference. First operand has 89 places, 80 transitions, 702 flow. Second operand 8 states and 86 transitions. [2024-06-04 17:43:00,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 97 transitions, 942 flow [2024-06-04 17:43:00,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 97 transitions, 881 flow, removed 17 selfloop flow, removed 4 redundant places. [2024-06-04 17:43:00,533 INFO L231 Difference]: Finished difference. Result has 93 places, 81 transitions, 681 flow [2024-06-04 17:43:00,533 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=641, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=681, PETRI_PLACES=93, PETRI_TRANSITIONS=81} [2024-06-04 17:43:00,533 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 62 predicate places. [2024-06-04 17:43:00,533 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 81 transitions, 681 flow [2024-06-04 17:43:00,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:43:00,534 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:43:00,534 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:00,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-04 17:43:00,534 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:43:00,534 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:43:00,534 INFO L85 PathProgramCache]: Analyzing trace with hash 92537333, now seen corresponding path program 1 times [2024-06-04 17:43:00,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:43:00,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329811148] [2024-06-04 17:43:00,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:43:00,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:43:00,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:43:04,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:43:04,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:43:04,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329811148] [2024-06-04 17:43:04,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329811148] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:43:04,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:43:04,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:43:04,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086463420] [2024-06-04 17:43:04,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:43:04,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:43:04,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:43:04,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:43:04,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:43:04,420 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:43:04,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 81 transitions, 681 flow. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:43:04,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:43:04,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:43:04,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:43:04,659 INFO L124 PetriNetUnfolderBase]: 265/472 cut-off events. [2024-06-04 17:43:04,660 INFO L125 PetriNetUnfolderBase]: For 8413/8413 co-relation queries the response was YES. [2024-06-04 17:43:04,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2663 conditions, 472 events. 265/472 cut-off events. For 8413/8413 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1771 event pairs, 46 based on Foata normal form. 1/471 useless extension candidates. Maximal degree in co-relation 2617. Up to 416 conditions per place. [2024-06-04 17:43:04,663 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 78 selfloop transitions, 17 changer transitions 0/97 dead transitions. [2024-06-04 17:43:04,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 97 transitions, 913 flow [2024-06-04 17:43:04,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:43:04,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:43:04,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2024-06-04 17:43:04,670 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34765625 [2024-06-04 17:43:04,670 INFO L175 Difference]: Start difference. First operand has 93 places, 81 transitions, 681 flow. Second operand 8 states and 89 transitions. [2024-06-04 17:43:04,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 97 transitions, 913 flow [2024-06-04 17:43:04,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 97 transitions, 879 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-04 17:43:04,680 INFO L231 Difference]: Finished difference. Result has 95 places, 81 transitions, 689 flow [2024-06-04 17:43:04,681 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=647, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=689, PETRI_PLACES=95, PETRI_TRANSITIONS=81} [2024-06-04 17:43:04,682 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 64 predicate places. [2024-06-04 17:43:04,682 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 81 transitions, 689 flow [2024-06-04 17:43:04,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:43:04,682 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:43:04,682 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:04,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-04 17:43:04,683 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:43:04,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:43:04,683 INFO L85 PathProgramCache]: Analyzing trace with hash 92537209, now seen corresponding path program 2 times [2024-06-04 17:43:04,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:43:04,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131490602] [2024-06-04 17:43:04,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:43:04,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:43:04,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:43:08,597 INFO 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:08,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:43:08,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131490602] [2024-06-04 17:43:08,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131490602] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:43:08,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:43:08,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:43:08,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381182769] [2024-06-04 17:43:08,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:43:08,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:43:08,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:43:08,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:43:08,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:43:08,712 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:43:08,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 81 transitions, 689 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:43:08,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:43:08,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:43:08,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:43:08,997 INFO L124 PetriNetUnfolderBase]: 269/480 cut-off events. [2024-06-04 17:43:08,997 INFO L125 PetriNetUnfolderBase]: For 9565/9565 co-relation queries the response was YES. [2024-06-04 17:43:08,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2740 conditions, 480 events. 269/480 cut-off events. For 9565/9565 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1811 event pairs, 46 based on Foata normal form. 2/480 useless extension candidates. Maximal degree in co-relation 2693. Up to 427 conditions per place. [2024-06-04 17:43:09,000 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 82 selfloop transitions, 14 changer transitions 0/98 dead transitions. [2024-06-04 17:43:09,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 98 transitions, 935 flow [2024-06-04 17:43:09,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:43:09,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:43:09,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2024-06-04 17:43:09,002 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34375 [2024-06-04 17:43:09,002 INFO L175 Difference]: Start difference. First operand has 95 places, 81 transitions, 689 flow. Second operand 8 states and 88 transitions. [2024-06-04 17:43:09,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 98 transitions, 935 flow [2024-06-04 17:43:09,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 98 transitions, 872 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-04 17:43:09,012 INFO L231 Difference]: Finished difference. Result has 95 places, 82 transitions, 675 flow [2024-06-04 17:43:09,012 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=626, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=675, PETRI_PLACES=95, PETRI_TRANSITIONS=82} [2024-06-04 17:43:09,012 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 64 predicate places. [2024-06-04 17:43:09,013 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 82 transitions, 675 flow [2024-06-04 17:43:09,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:43:09,013 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:43:09,013 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:09,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-04 17:43:09,013 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:43:09,014 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:43:09,014 INFO L85 PathProgramCache]: Analyzing trace with hash 95338679, now seen corresponding path program 1 times [2024-06-04 17:43:09,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:43:09,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993733112] [2024-06-04 17:43:09,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:43:09,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:43:09,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:43:12,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:43:12,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:43:12,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993733112] [2024-06-04 17:43:12,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993733112] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:43:12,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:43:12,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:43:12,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215991630] [2024-06-04 17:43:12,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:43:12,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:43:12,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:43:12,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:43:12,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:43:12,825 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:43:12,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 82 transitions, 675 flow. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:43:12,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:43:12,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:43:12,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:43:13,133 INFO L124 PetriNetUnfolderBase]: 275/490 cut-off events. [2024-06-04 17:43:13,134 INFO L125 PetriNetUnfolderBase]: For 9625/9625 co-relation queries the response was YES. [2024-06-04 17:43:13,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2763 conditions, 490 events. 275/490 cut-off events. For 9625/9625 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1854 event pairs, 50 based on Foata normal form. 2/490 useless extension candidates. Maximal degree in co-relation 2715. Up to 432 conditions per place. [2024-06-04 17:43:13,137 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 84 selfloop transitions, 16 changer transitions 0/102 dead transitions. [2024-06-04 17:43:13,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 102 transitions, 939 flow [2024-06-04 17:43:13,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:43:13,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:43:13,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2024-06-04 17:43:13,138 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3402777777777778 [2024-06-04 17:43:13,139 INFO L175 Difference]: Start difference. First operand has 95 places, 82 transitions, 675 flow. Second operand 9 states and 98 transitions. [2024-06-04 17:43:13,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 102 transitions, 939 flow [2024-06-04 17:43:13,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 102 transitions, 902 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-04 17:43:13,149 INFO L231 Difference]: Finished difference. Result has 98 places, 84 transitions, 695 flow [2024-06-04 17:43:13,150 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=638, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=695, PETRI_PLACES=98, PETRI_TRANSITIONS=84} [2024-06-04 17:43:13,150 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 67 predicate places. [2024-06-04 17:43:13,150 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 84 transitions, 695 flow [2024-06-04 17:43:13,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:43:13,150 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:43:13,151 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:13,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-04 17:43:13,151 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:43:13,151 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:43:13,151 INFO L85 PathProgramCache]: Analyzing trace with hash 210809339, now seen corresponding path program 2 times [2024-06-04 17:43:13,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:43:13,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728314389] [2024-06-04 17:43:13,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:43:13,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:43:13,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:43:17,079 INFO 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:17,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:43:17,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728314389] [2024-06-04 17:43:17,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728314389] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:43:17,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:43:17,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:43:17,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816135440] [2024-06-04 17:43:17,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:43:17,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:43:17,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:43:17,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:43:17,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:43:17,173 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:43:17,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 84 transitions, 695 flow. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:43:17,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:43:17,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:43:17,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:43:17,418 INFO L124 PetriNetUnfolderBase]: 281/500 cut-off events. [2024-06-04 17:43:17,419 INFO L125 PetriNetUnfolderBase]: For 10363/10363 co-relation queries the response was YES. [2024-06-04 17:43:17,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2850 conditions, 500 events. 281/500 cut-off events. For 10363/10363 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1913 event pairs, 42 based on Foata normal form. 2/500 useless extension candidates. Maximal degree in co-relation 2801. Up to 330 conditions per place. [2024-06-04 17:43:17,422 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 62 selfloop transitions, 42 changer transitions 0/106 dead transitions. [2024-06-04 17:43:17,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 106 transitions, 1081 flow [2024-06-04 17:43:17,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:43:17,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:43:17,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 107 transitions. [2024-06-04 17:43:17,424 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3715277777777778 [2024-06-04 17:43:17,424 INFO L175 Difference]: Start difference. First operand has 98 places, 84 transitions, 695 flow. Second operand 9 states and 107 transitions. [2024-06-04 17:43:17,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 106 transitions, 1081 flow [2024-06-04 17:43:17,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 106 transitions, 1046 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-04 17:43:17,435 INFO L231 Difference]: Finished difference. Result has 101 places, 88 transitions, 812 flow [2024-06-04 17:43:17,435 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=660, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=812, PETRI_PLACES=101, PETRI_TRANSITIONS=88} [2024-06-04 17:43:17,436 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 70 predicate places. [2024-06-04 17:43:17,436 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 88 transitions, 812 flow [2024-06-04 17:43:17,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:43:17,436 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:43:17,436 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:17,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-04 17:43:17,437 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:43:17,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:43:17,437 INFO L85 PathProgramCache]: Analyzing trace with hash 210624889, now seen corresponding path program 3 times [2024-06-04 17:43:17,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:43:17,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909957904] [2024-06-04 17:43:17,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:43:17,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:43:17,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:43:21,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:43:21,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:43:21,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909957904] [2024-06-04 17:43:21,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909957904] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:43:21,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:43:21,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:43:21,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962987639] [2024-06-04 17:43:21,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:43:21,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:43:21,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:43:21,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:43:21,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:43:22,025 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:43:22,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 88 transitions, 812 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:43:22,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:43:22,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:43:22,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:43:22,276 INFO L124 PetriNetUnfolderBase]: 285/508 cut-off events. [2024-06-04 17:43:22,276 INFO L125 PetriNetUnfolderBase]: For 11491/11491 co-relation queries the response was YES. [2024-06-04 17:43:22,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3056 conditions, 508 events. 285/508 cut-off events. For 11491/11491 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1944 event pairs, 48 based on Foata normal form. 2/508 useless extension candidates. Maximal degree in co-relation 3005. Up to 448 conditions per place. [2024-06-04 17:43:22,285 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 84 selfloop transitions, 17 changer transitions 0/103 dead transitions. [2024-06-04 17:43:22,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 103 transitions, 1066 flow [2024-06-04 17:43:22,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:43:22,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:43:22,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2024-06-04 17:43:22,287 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34375 [2024-06-04 17:43:22,287 INFO L175 Difference]: Start difference. First operand has 101 places, 88 transitions, 812 flow. Second operand 8 states and 88 transitions. [2024-06-04 17:43:22,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 103 transitions, 1066 flow [2024-06-04 17:43:22,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 103 transitions, 993 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-04 17:43:22,300 INFO L231 Difference]: Finished difference. Result has 103 places, 89 transitions, 795 flow [2024-06-04 17:43:22,300 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=739, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=795, PETRI_PLACES=103, PETRI_TRANSITIONS=89} [2024-06-04 17:43:22,301 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 72 predicate places. [2024-06-04 17:43:22,301 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 89 transitions, 795 flow [2024-06-04 17:43:22,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:43:22,301 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:43:22,301 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:22,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-04 17:43:22,301 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:43:22,302 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:43:22,302 INFO L85 PathProgramCache]: Analyzing trace with hash 210629849, now seen corresponding path program 3 times [2024-06-04 17:43:22,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:43:22,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822877134] [2024-06-04 17:43:22,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:43:22,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:43:22,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:43:26,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:43:26,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:43:26,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822877134] [2024-06-04 17:43:26,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822877134] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:43:26,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:43:26,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:43:26,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812213682] [2024-06-04 17:43:26,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:43:26,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:43:26,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:43:26,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:43:26,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:43:26,325 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:43:26,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 89 transitions, 795 flow. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:43:26,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:43:26,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:43:26,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:43:26,572 INFO L124 PetriNetUnfolderBase]: 296/526 cut-off events. [2024-06-04 17:43:26,572 INFO L125 PetriNetUnfolderBase]: For 12748/12748 co-relation queries the response was YES. [2024-06-04 17:43:26,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3135 conditions, 526 events. 296/526 cut-off events. For 12748/12748 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2043 event pairs, 47 based on Foata normal form. 2/526 useless extension candidates. Maximal degree in co-relation 3083. Up to 350 conditions per place. [2024-06-04 17:43:26,576 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 69 selfloop transitions, 40 changer transitions 0/111 dead transitions. [2024-06-04 17:43:26,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 111 transitions, 1201 flow [2024-06-04 17:43:26,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:43:26,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:43:26,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2024-06-04 17:43:26,577 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3645833333333333 [2024-06-04 17:43:26,577 INFO L175 Difference]: Start difference. First operand has 103 places, 89 transitions, 795 flow. Second operand 9 states and 105 transitions. [2024-06-04 17:43:26,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 111 transitions, 1201 flow [2024-06-04 17:43:26,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 111 transitions, 1155 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-04 17:43:26,605 INFO L231 Difference]: Finished difference. Result has 106 places, 93 transitions, 874 flow [2024-06-04 17:43:26,605 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=749, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=874, PETRI_PLACES=106, PETRI_TRANSITIONS=93} [2024-06-04 17:43:26,606 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 75 predicate places. [2024-06-04 17:43:26,606 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 93 transitions, 874 flow [2024-06-04 17:43:26,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:43:26,608 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:43:26,608 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:26,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-04 17:43:26,608 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:43:26,608 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:43:26,609 INFO L85 PathProgramCache]: Analyzing trace with hash 210802829, now seen corresponding path program 4 times [2024-06-04 17:43:26,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:43:26,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85500263] [2024-06-04 17:43:26,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:43:26,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:43:26,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:43:30,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:43:30,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:43:30,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85500263] [2024-06-04 17:43:30,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85500263] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:43:30,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:43:30,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:43:30,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802743014] [2024-06-04 17:43:30,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:43:30,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:43:30,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:43:30,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:43:30,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:43:30,548 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:43:30,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 93 transitions, 874 flow. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:43:30,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:43:30,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:43:30,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:43:30,813 INFO L124 PetriNetUnfolderBase]: 292/520 cut-off events. [2024-06-04 17:43:30,813 INFO L125 PetriNetUnfolderBase]: For 13016/13016 co-relation queries the response was YES. [2024-06-04 17:43:30,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3140 conditions, 520 events. 292/520 cut-off events. For 13016/13016 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2019 event pairs, 40 based on Foata normal form. 2/520 useless extension candidates. Maximal degree in co-relation 3087. Up to 347 conditions per place. [2024-06-04 17:43:30,819 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 66 selfloop transitions, 43 changer transitions 0/111 dead transitions. [2024-06-04 17:43:30,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 111 transitions, 1244 flow [2024-06-04 17:43:30,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:43:30,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:43:30,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 107 transitions. [2024-06-04 17:43:30,821 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3715277777777778 [2024-06-04 17:43:30,821 INFO L175 Difference]: Start difference. First operand has 106 places, 93 transitions, 874 flow. Second operand 9 states and 107 transitions. [2024-06-04 17:43:30,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 111 transitions, 1244 flow [2024-06-04 17:43:30,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 111 transitions, 1191 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-06-04 17:43:30,837 INFO L231 Difference]: Finished difference. Result has 110 places, 93 transitions, 912 flow [2024-06-04 17:43:30,838 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=821, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=912, PETRI_PLACES=110, PETRI_TRANSITIONS=93} [2024-06-04 17:43:30,842 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 79 predicate places. [2024-06-04 17:43:30,842 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 93 transitions, 912 flow [2024-06-04 17:43:30,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:43:30,843 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:43:30,843 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:30,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-04 17:43:30,843 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:43:30,843 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:43:30,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1364676231, now seen corresponding path program 4 times [2024-06-04 17:43:30,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:43:30,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504406126] [2024-06-04 17:43:30,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:43:30,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:43:30,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:43:35,074 INFO 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,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:43:35,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504406126] [2024-06-04 17:43:35,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504406126] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:43:35,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:43:35,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:43:35,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756737126] [2024-06-04 17:43:35,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:43:35,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:43:35,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:43:35,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:43:35,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:43:35,208 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:43:35,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 93 transitions, 912 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:43:35,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:43:35,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:43:35,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:43:35,482 INFO L124 PetriNetUnfolderBase]: 293/523 cut-off events. [2024-06-04 17:43:35,482 INFO L125 PetriNetUnfolderBase]: For 14164/14164 co-relation queries the response was YES. [2024-06-04 17:43:35,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3132 conditions, 523 events. 293/523 cut-off events. For 14164/14164 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2037 event pairs, 49 based on Foata normal form. 4/525 useless extension candidates. Maximal degree in co-relation 3078. Up to 399 conditions per place. [2024-06-04 17:43:35,486 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 77 selfloop transitions, 30 changer transitions 0/109 dead transitions. [2024-06-04 17:43:35,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 109 transitions, 1170 flow [2024-06-04 17:43:35,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:43:35,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:43:35,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2024-06-04 17:43:35,501 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3506944444444444 [2024-06-04 17:43:35,501 INFO L175 Difference]: Start difference. First operand has 110 places, 93 transitions, 912 flow. Second operand 9 states and 101 transitions. [2024-06-04 17:43:35,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 109 transitions, 1170 flow [2024-06-04 17:43:35,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 109 transitions, 1100 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-04 17:43:35,518 INFO L231 Difference]: Finished difference. Result has 113 places, 94 transitions, 915 flow [2024-06-04 17:43:35,518 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=842, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=915, PETRI_PLACES=113, PETRI_TRANSITIONS=94} [2024-06-04 17:43:35,519 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 82 predicate places. [2024-06-04 17:43:35,519 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 94 transitions, 915 flow [2024-06-04 17:43:35,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:43:35,519 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:43:35,519 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:35,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-04 17:43:35,520 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:43:35,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:43:35,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1128316421, now seen corresponding path program 5 times [2024-06-04 17:43:35,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:43:35,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2662833] [2024-06-04 17:43:35,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:43:35,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:43:35,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:43:39,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:43:39,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:43:39,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2662833] [2024-06-04 17:43:39,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2662833] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:43:39,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:43:39,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:43:39,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776913081] [2024-06-04 17:43:39,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:43:39,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:43:39,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:43:39,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:43:39,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:43:39,717 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:43:39,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 94 transitions, 915 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:43:39,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:43:39,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:43:39,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:43:40,038 INFO L124 PetriNetUnfolderBase]: 299/533 cut-off events. [2024-06-04 17:43:40,039 INFO L125 PetriNetUnfolderBase]: For 14290/14290 co-relation queries the response was YES. [2024-06-04 17:43:40,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3197 conditions, 533 events. 299/533 cut-off events. For 14290/14290 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2096 event pairs, 41 based on Foata normal form. 2/533 useless extension candidates. Maximal degree in co-relation 3142. Up to 356 conditions per place. [2024-06-04 17:43:40,043 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 65 selfloop transitions, 48 changer transitions 0/115 dead transitions. [2024-06-04 17:43:40,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 115 transitions, 1323 flow [2024-06-04 17:43:40,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:43:40,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:43:40,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 115 transitions. [2024-06-04 17:43:40,053 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.359375 [2024-06-04 17:43:40,053 INFO L175 Difference]: Start difference. First operand has 113 places, 94 transitions, 915 flow. Second operand 10 states and 115 transitions. [2024-06-04 17:43:40,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 115 transitions, 1323 flow [2024-06-04 17:43:40,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 115 transitions, 1237 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-06-04 17:43:40,071 INFO L231 Difference]: Finished difference. Result has 115 places, 96 transitions, 950 flow [2024-06-04 17:43:40,072 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=829, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=950, PETRI_PLACES=115, PETRI_TRANSITIONS=96} [2024-06-04 17:43:40,076 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 84 predicate places. [2024-06-04 17:43:40,076 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 96 transitions, 950 flow [2024-06-04 17:43:40,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:43:40,077 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:43:40,077 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:40,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-04 17:43:40,077 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:43:40,077 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:43:40,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1128316173, now seen corresponding path program 1 times [2024-06-04 17:43:40,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:43:40,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401000559] [2024-06-04 17:43:40,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:43:40,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:43:40,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:43:44,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:43:44,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:43:44,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401000559] [2024-06-04 17:43:44,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401000559] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:43:44,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:43:44,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:43:44,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776157042] [2024-06-04 17:43:44,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:43:44,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:43:44,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:43:44,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:43:44,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:43:44,340 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:43:44,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 96 transitions, 950 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:43:44,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:43:44,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:43:44,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:43:44,602 INFO L124 PetriNetUnfolderBase]: 307/546 cut-off events. [2024-06-04 17:43:44,602 INFO L125 PetriNetUnfolderBase]: For 15130/15130 co-relation queries the response was YES. [2024-06-04 17:43:44,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3320 conditions, 546 events. 307/546 cut-off events. For 15130/15130 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2153 event pairs, 54 based on Foata normal form. 1/545 useless extension candidates. Maximal degree in co-relation 3265. Up to 479 conditions per place. [2024-06-04 17:43:44,606 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 85 selfloop transitions, 28 changer transitions 0/115 dead transitions. [2024-06-04 17:43:44,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 115 transitions, 1358 flow [2024-06-04 17:43:44,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:43:44,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:43:44,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 109 transitions. [2024-06-04 17:43:44,608 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.340625 [2024-06-04 17:43:44,608 INFO L175 Difference]: Start difference. First operand has 115 places, 96 transitions, 950 flow. Second operand 10 states and 109 transitions. [2024-06-04 17:43:44,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 115 transitions, 1358 flow [2024-06-04 17:43:44,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 115 transitions, 1237 flow, removed 7 selfloop flow, removed 9 redundant places. [2024-06-04 17:43:44,631 INFO L231 Difference]: Finished difference. Result has 116 places, 100 transitions, 922 flow [2024-06-04 17:43:44,632 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=829, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=922, PETRI_PLACES=116, PETRI_TRANSITIONS=100} [2024-06-04 17:43:44,632 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 85 predicate places. [2024-06-04 17:43:44,632 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 100 transitions, 922 flow [2024-06-04 17:43:44,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:43:44,632 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:43:44,632 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:44,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-04 17:43:44,633 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:43:44,633 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:43:44,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1128019503, now seen corresponding path program 2 times [2024-06-04 17:43:44,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:43:44,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748675024] [2024-06-04 17:43:44,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:43:44,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:43:44,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:43:48,852 INFO 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,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:43:48,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748675024] [2024-06-04 17:43:48,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748675024] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:43:48,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:43:48,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:43:48,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084682516] [2024-06-04 17:43:48,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:43:48,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:43:48,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:43:48,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:43:48,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:43:48,955 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:43:48,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 100 transitions, 922 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:43:48,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:43:48,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:43:48,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:43:49,247 INFO L124 PetriNetUnfolderBase]: 305/543 cut-off events. [2024-06-04 17:43:49,248 INFO L125 PetriNetUnfolderBase]: For 15389/15389 co-relation queries the response was YES. [2024-06-04 17:43:49,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3199 conditions, 543 events. 305/543 cut-off events. For 15389/15389 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2146 event pairs, 56 based on Foata normal form. 1/542 useless extension candidates. Maximal degree in co-relation 3144. Up to 477 conditions per place. [2024-06-04 17:43:49,251 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 84 selfloop transitions, 28 changer transitions 0/114 dead transitions. [2024-06-04 17:43:49,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 114 transitions, 1238 flow [2024-06-04 17:43:49,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:43:49,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:43:49,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 107 transitions. [2024-06-04 17:43:49,253 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.334375 [2024-06-04 17:43:49,253 INFO L175 Difference]: Start difference. First operand has 116 places, 100 transitions, 922 flow. Second operand 10 states and 107 transitions. [2024-06-04 17:43:49,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 114 transitions, 1238 flow [2024-06-04 17:43:49,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 114 transitions, 1174 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-04 17:43:49,272 INFO L231 Difference]: Finished difference. Result has 119 places, 100 transitions, 919 flow [2024-06-04 17:43:49,273 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=858, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=919, PETRI_PLACES=119, PETRI_TRANSITIONS=100} [2024-06-04 17:43:49,273 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 88 predicate places. [2024-06-04 17:43:49,273 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 100 transitions, 919 flow [2024-06-04 17:43:49,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:43:49,273 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:43:49,273 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:49,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-04 17:43:49,274 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:43:49,274 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:43:49,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1136597141, now seen corresponding path program 6 times [2024-06-04 17:43:49,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:43:49,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673836891] [2024-06-04 17:43:49,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:43:49,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:43:49,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:43:53,404 INFO 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,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:43:53,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673836891] [2024-06-04 17:43:53,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673836891] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:43:53,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:43:53,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:43:53,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638697313] [2024-06-04 17:43:53,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:43:53,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:43:53,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:43:53,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:43:53,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:43:53,487 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:43:53,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 100 transitions, 919 flow. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:43:53,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:43:53,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:43:53,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:43:53,714 INFO L124 PetriNetUnfolderBase]: 311/553 cut-off events. [2024-06-04 17:43:53,715 INFO L125 PetriNetUnfolderBase]: For 16875/16875 co-relation queries the response was YES. [2024-06-04 17:43:53,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3265 conditions, 553 events. 311/553 cut-off events. For 16875/16875 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2199 event pairs, 49 based on Foata normal form. 2/553 useless extension candidates. Maximal degree in co-relation 3209. Up to 372 conditions per place. [2024-06-04 17:43:53,718 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 73 selfloop transitions, 44 changer transitions 0/119 dead transitions. [2024-06-04 17:43:53,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 119 transitions, 1339 flow [2024-06-04 17:43:53,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:43:53,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:43:53,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2024-06-04 17:43:53,719 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3680555555555556 [2024-06-04 17:43:53,719 INFO L175 Difference]: Start difference. First operand has 119 places, 100 transitions, 919 flow. Second operand 9 states and 106 transitions. [2024-06-04 17:43:53,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 119 transitions, 1339 flow [2024-06-04 17:43:53,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 119 transitions, 1278 flow, removed 1 selfloop flow, removed 9 redundant places. [2024-06-04 17:43:53,745 INFO L231 Difference]: Finished difference. Result has 119 places, 102 transitions, 969 flow [2024-06-04 17:43:53,745 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=858, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=969, PETRI_PLACES=119, PETRI_TRANSITIONS=102} [2024-06-04 17:43:53,745 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 88 predicate places. [2024-06-04 17:43:53,745 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 102 transitions, 969 flow [2024-06-04 17:43:53,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:43:53,746 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:43:53,746 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:53,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-04 17:43:53,746 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:43:53,746 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:43:53,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1136590383, now seen corresponding path program 3 times [2024-06-04 17:43:53,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:43:53,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119622453] [2024-06-04 17:43:53,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:43:53,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:43:53,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:43:57,972 INFO 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:57,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:43:57,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119622453] [2024-06-04 17:43:57,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119622453] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:43:57,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:43:57,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:43:57,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417890502] [2024-06-04 17:43:57,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:43:57,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:43:57,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:43:57,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:43:57,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:43:58,057 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:43:58,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 102 transitions, 969 flow. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:43:58,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:43:58,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:43:58,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:43:58,276 INFO L124 PetriNetUnfolderBase]: 309/550 cut-off events. [2024-06-04 17:43:58,276 INFO L125 PetriNetUnfolderBase]: For 17057/17057 co-relation queries the response was YES. [2024-06-04 17:43:58,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3306 conditions, 550 events. 309/550 cut-off events. For 17057/17057 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2181 event pairs, 54 based on Foata normal form. 1/549 useless extension candidates. Maximal degree in co-relation 3249. Up to 485 conditions per place. [2024-06-04 17:43:58,280 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 85 selfloop transitions, 27 changer transitions 0/114 dead transitions. [2024-06-04 17:43:58,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 114 transitions, 1221 flow [2024-06-04 17:43:58,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:43:58,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:43:58,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2024-06-04 17:43:58,281 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3402777777777778 [2024-06-04 17:43:58,281 INFO L175 Difference]: Start difference. First operand has 119 places, 102 transitions, 969 flow. Second operand 9 states and 98 transitions. [2024-06-04 17:43:58,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 114 transitions, 1221 flow [2024-06-04 17:43:58,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 114 transitions, 1117 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-04 17:43:58,304 INFO L231 Difference]: Finished difference. Result has 121 places, 102 transitions, 924 flow [2024-06-04 17:43:58,304 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=865, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=924, PETRI_PLACES=121, PETRI_TRANSITIONS=102} [2024-06-04 17:43:58,305 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 90 predicate places. [2024-06-04 17:43:58,305 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 102 transitions, 924 flow [2024-06-04 17:43:58,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:43:58,305 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:43:58,305 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:58,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-04 17:43:58,305 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:43:58,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:43:58,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1617259939, now seen corresponding path program 7 times [2024-06-04 17:43:58,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:43:58,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187697413] [2024-06-04 17:43:58,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:43:58,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:43:58,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:44:02,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:44:02,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:44:02,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187697413] [2024-06-04 17:44:02,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187697413] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:44:02,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:44:02,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:44:02,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840329911] [2024-06-04 17:44:02,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:44:02,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:44:02,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:44:02,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:44:02,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:44:02,592 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:44:02,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 102 transitions, 924 flow. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:44:02,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:44:02,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:44:02,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:44:02,910 INFO L124 PetriNetUnfolderBase]: 305/544 cut-off events. [2024-06-04 17:44:02,910 INFO L125 PetriNetUnfolderBase]: For 17224/17224 co-relation queries the response was YES. [2024-06-04 17:44:02,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3186 conditions, 544 events. 305/544 cut-off events. For 17224/17224 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2166 event pairs, 47 based on Foata normal form. 2/544 useless extension candidates. Maximal degree in co-relation 3128. Up to 366 conditions per place. [2024-06-04 17:44:02,914 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 74 selfloop transitions, 43 changer transitions 0/119 dead transitions. [2024-06-04 17:44:02,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 119 transitions, 1270 flow [2024-06-04 17:44:02,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:44:02,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:44:02,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2024-06-04 17:44:02,919 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3680555555555556 [2024-06-04 17:44:02,919 INFO L175 Difference]: Start difference. First operand has 121 places, 102 transitions, 924 flow. Second operand 9 states and 106 transitions. [2024-06-04 17:44:02,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 119 transitions, 1270 flow [2024-06-04 17:44:02,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 119 transitions, 1200 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-04 17:44:02,944 INFO L231 Difference]: Finished difference. Result has 122 places, 102 transitions, 945 flow [2024-06-04 17:44:02,944 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=854, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=945, PETRI_PLACES=122, PETRI_TRANSITIONS=102} [2024-06-04 17:44:02,944 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 91 predicate places. [2024-06-04 17:44:02,944 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 102 transitions, 945 flow [2024-06-04 17:44:02,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:44:02,945 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:44:02,945 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:02,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-04 17:44:02,945 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:44:02,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:44:02,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1128008591, now seen corresponding path program 1 times [2024-06-04 17:44:02,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:44:02,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377477794] [2024-06-04 17:44:02,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:44:02,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:44:02,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:44:07,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:44:07,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:44:07,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377477794] [2024-06-04 17:44:07,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377477794] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:44:07,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:44:07,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:44:07,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668766808] [2024-06-04 17:44:07,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:44:07,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:44:07,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:44:07,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:44:07,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:44:07,727 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:44:07,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 102 transitions, 945 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:44:07,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:44:07,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:44:07,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:44:07,951 INFO L124 PetriNetUnfolderBase]: 306/547 cut-off events. [2024-06-04 17:44:07,951 INFO L125 PetriNetUnfolderBase]: For 18439/18439 co-relation queries the response was YES. [2024-06-04 17:44:07,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3207 conditions, 547 events. 306/547 cut-off events. For 18439/18439 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2178 event pairs, 53 based on Foata normal form. 4/549 useless extension candidates. Maximal degree in co-relation 3148. Up to 464 conditions per place. [2024-06-04 17:44:07,955 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 84 selfloop transitions, 33 changer transitions 0/119 dead transitions. [2024-06-04 17:44:07,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 119 transitions, 1230 flow [2024-06-04 17:44:07,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:44:07,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:44:07,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 115 transitions. [2024-06-04 17:44:07,960 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32670454545454547 [2024-06-04 17:44:07,960 INFO L175 Difference]: Start difference. First operand has 122 places, 102 transitions, 945 flow. Second operand 11 states and 115 transitions. [2024-06-04 17:44:07,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 119 transitions, 1230 flow [2024-06-04 17:44:07,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 119 transitions, 1114 flow, removed 1 selfloop flow, removed 9 redundant places. [2024-06-04 17:44:07,985 INFO L231 Difference]: Finished difference. Result has 125 places, 104 transitions, 925 flow [2024-06-04 17:44:07,985 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=829, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=925, PETRI_PLACES=125, PETRI_TRANSITIONS=104} [2024-06-04 17:44:07,985 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 94 predicate places. [2024-06-04 17:44:07,985 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 104 transitions, 925 flow [2024-06-04 17:44:07,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:44:07,986 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:44:07,986 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:07,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-04 17:44:07,986 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:44:07,986 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:44:07,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1428186481, now seen corresponding path program 1 times [2024-06-04 17:44:07,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:44:07,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736636463] [2024-06-04 17:44:07,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:44:07,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:44:08,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:44:11,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:44:11,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:44:11,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736636463] [2024-06-04 17:44:11,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736636463] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:44:11,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:44:11,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:44:11,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741349426] [2024-06-04 17:44:11,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:44:11,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:44:11,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:44:11,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:44:11,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:44:12,122 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:44:12,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 104 transitions, 925 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call 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,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:44:12,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:44:12,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:44:12,405 INFO L124 PetriNetUnfolderBase]: 310/555 cut-off events. [2024-06-04 17:44:12,406 INFO L125 PetriNetUnfolderBase]: For 17999/17999 co-relation queries the response was YES. [2024-06-04 17:44:12,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3246 conditions, 555 events. 310/555 cut-off events. For 17999/17999 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2237 event pairs, 32 based on Foata normal form. 2/555 useless extension candidates. Maximal degree in co-relation 3185. Up to 485 conditions per place. [2024-06-04 17:44:12,409 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 109 selfloop transitions, 12 changer transitions 0/123 dead transitions. [2024-06-04 17:44:12,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 123 transitions, 1217 flow [2024-06-04 17:44:12,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:44:12,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:44:12,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2024-06-04 17:44:12,437 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3263888888888889 [2024-06-04 17:44:12,437 INFO L175 Difference]: Start difference. First operand has 125 places, 104 transitions, 925 flow. Second operand 9 states and 94 transitions. [2024-06-04 17:44:12,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 123 transitions, 1217 flow [2024-06-04 17:44:12,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 123 transitions, 1136 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-06-04 17:44:12,464 INFO L231 Difference]: Finished difference. Result has 126 places, 105 transitions, 882 flow [2024-06-04 17:44:12,464 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=844, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=882, PETRI_PLACES=126, PETRI_TRANSITIONS=105} [2024-06-04 17:44:12,465 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 95 predicate places. [2024-06-04 17:44:12,465 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 105 transitions, 882 flow [2024-06-04 17:44:12,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call 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,465 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:44:12,465 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:44:12,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-04 17:44:12,466 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:44:12,466 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:44:12,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1717141770, now seen corresponding path program 1 times [2024-06-04 17:44:12,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:44:12,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685022216] [2024-06-04 17:44:12,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:44:12,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:44:12,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:44:16,466 INFO 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:16,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:44:16,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685022216] [2024-06-04 17:44:16,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685022216] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:44:16,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:44:16,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:44:16,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246789355] [2024-06-04 17:44:16,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:44:16,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:44:16,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:44:16,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:44:16,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:44:16,596 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:44:16,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 105 transitions, 882 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call 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:16,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:44:16,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:44:16,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:44:16,882 INFO L124 PetriNetUnfolderBase]: 308/552 cut-off events. [2024-06-04 17:44:16,883 INFO L125 PetriNetUnfolderBase]: For 17486/17486 co-relation queries the response was YES. [2024-06-04 17:44:16,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3149 conditions, 552 events. 308/552 cut-off events. For 17486/17486 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2234 event pairs, 46 based on Foata normal form. 1/551 useless extension candidates. Maximal degree in co-relation 3087. Up to 485 conditions per place. [2024-06-04 17:44:16,886 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 100 selfloop transitions, 21 changer transitions 0/123 dead transitions. [2024-06-04 17:44:16,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 123 transitions, 1172 flow [2024-06-04 17:44:16,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:44:16,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:44:16,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2024-06-04 17:44:16,887 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3402777777777778 [2024-06-04 17:44:16,887 INFO L175 Difference]: Start difference. First operand has 126 places, 105 transitions, 882 flow. Second operand 9 states and 98 transitions. [2024-06-04 17:44:16,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 123 transitions, 1172 flow [2024-06-04 17:44:16,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 123 transitions, 1140 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-04 17:44:16,913 INFO L231 Difference]: Finished difference. Result has 128 places, 105 transitions, 900 flow [2024-06-04 17:44:16,913 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=850, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=900, PETRI_PLACES=128, PETRI_TRANSITIONS=105} [2024-06-04 17:44:16,913 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 97 predicate places. [2024-06-04 17:44:16,913 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 105 transitions, 900 flow [2024-06-04 17:44:16,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call 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:16,914 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:44:16,914 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:16,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-04 17:44:16,914 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:44:16,914 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:44:16,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1717141615, now seen corresponding path program 2 times [2024-06-04 17:44:16,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:44:16,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568308341] [2024-06-04 17:44:16,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:44:16,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:44:16,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:44:21,233 INFO 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:21,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:44:21,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568308341] [2024-06-04 17:44:21,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568308341] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:44:21,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:44:21,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:44:21,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933347980] [2024-06-04 17:44:21,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:44:21,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:44:21,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:44:21,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:44:21,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:44:21,365 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:44:21,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 105 transitions, 900 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call 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:21,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:44:21,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:44:21,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:44:21,638 INFO L124 PetriNetUnfolderBase]: 312/560 cut-off events. [2024-06-04 17:44:21,639 INFO L125 PetriNetUnfolderBase]: For 19119/19119 co-relation queries the response was YES. [2024-06-04 17:44:21,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3223 conditions, 560 events. 312/560 cut-off events. For 19119/19119 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2273 event pairs, 48 based on Foata normal form. 2/560 useless extension candidates. Maximal degree in co-relation 3160. Up to 496 conditions per place. [2024-06-04 17:44:21,643 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 104 selfloop transitions, 18 changer transitions 0/124 dead transitions. [2024-06-04 17:44:21,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 124 transitions, 1200 flow [2024-06-04 17:44:21,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:44:21,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:44:21,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2024-06-04 17:44:21,645 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3368055555555556 [2024-06-04 17:44:21,645 INFO L175 Difference]: Start difference. First operand has 128 places, 105 transitions, 900 flow. Second operand 9 states and 97 transitions. [2024-06-04 17:44:21,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 124 transitions, 1200 flow [2024-06-04 17:44:21,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 124 transitions, 1102 flow, removed 2 selfloop flow, removed 10 redundant places. [2024-06-04 17:44:21,673 INFO L231 Difference]: Finished difference. Result has 127 places, 106 transitions, 855 flow [2024-06-04 17:44:21,673 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=802, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=855, PETRI_PLACES=127, PETRI_TRANSITIONS=106} [2024-06-04 17:44:21,673 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 96 predicate places. [2024-06-04 17:44:21,673 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 106 transitions, 855 flow [2024-06-04 17:44:21,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call 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:21,674 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:44:21,674 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:21,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-04 17:44:21,674 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:44:21,674 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:44:21,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1717137895, now seen corresponding path program 3 times [2024-06-04 17:44:21,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:44:21,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442853914] [2024-06-04 17:44:21,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:44:21,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:44:21,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:44:25,893 INFO 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,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:44:25,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442853914] [2024-06-04 17:44:25,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442853914] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:44:25,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:44:25,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:44:25,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490799825] [2024-06-04 17:44:25,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:44:25,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:44:25,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:44:25,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:44:25,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:44:25,993 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:44:25,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 106 transitions, 855 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call 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,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:44:25,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:44:25,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:44:26,295 INFO L124 PetriNetUnfolderBase]: 316/568 cut-off events. [2024-06-04 17:44:26,295 INFO L125 PetriNetUnfolderBase]: For 19260/19260 co-relation queries the response was YES. [2024-06-04 17:44:26,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3222 conditions, 568 events. 316/568 cut-off events. For 19260/19260 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2347 event pairs, 46 based on Foata normal form. 2/568 useless extension candidates. Maximal degree in co-relation 3158. Up to 488 conditions per place. [2024-06-04 17:44:26,299 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 105 selfloop transitions, 18 changer transitions 0/125 dead transitions. [2024-06-04 17:44:26,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 125 transitions, 1157 flow [2024-06-04 17:44:26,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:44:26,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:44:26,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2024-06-04 17:44:26,301 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3402777777777778 [2024-06-04 17:44:26,301 INFO L175 Difference]: Start difference. First operand has 127 places, 106 transitions, 855 flow. Second operand 9 states and 98 transitions. [2024-06-04 17:44:26,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 125 transitions, 1157 flow [2024-06-04 17:44:26,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 125 transitions, 1116 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-04 17:44:26,333 INFO L231 Difference]: Finished difference. Result has 129 places, 107 transitions, 868 flow [2024-06-04 17:44:26,333 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=814, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=868, PETRI_PLACES=129, PETRI_TRANSITIONS=107} [2024-06-04 17:44:26,343 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 98 predicate places. [2024-06-04 17:44:26,344 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 107 transitions, 868 flow [2024-06-04 17:44:26,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:44:26,344 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:44:26,344 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:26,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-04 17:44:26,344 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:44:26,345 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:44:26,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1339466899, now seen corresponding path program 1 times [2024-06-04 17:44:26,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:44:26,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304934303] [2024-06-04 17:44:26,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:44:26,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:44:26,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:44:30,741 INFO 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,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:44:30,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304934303] [2024-06-04 17:44:30,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304934303] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:44:30,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:44:30,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:44:30,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390787612] [2024-06-04 17:44:30,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:44:30,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:44:30,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:44:30,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:44:30,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:44:30,842 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:44:30,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 107 transitions, 868 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call 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,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:44:30,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:44:30,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:44:31,155 INFO L124 PetriNetUnfolderBase]: 322/578 cut-off events. [2024-06-04 17:44:31,155 INFO L125 PetriNetUnfolderBase]: For 20257/20257 co-relation queries the response was YES. [2024-06-04 17:44:31,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3284 conditions, 578 events. 322/578 cut-off events. For 20257/20257 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2395 event pairs, 45 based on Foata normal form. 2/578 useless extension candidates. Maximal degree in co-relation 3219. Up to 512 conditions per place. [2024-06-04 17:44:31,159 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 109 selfloop transitions, 18 changer transitions 0/129 dead transitions. [2024-06-04 17:44:31,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 129 transitions, 1191 flow [2024-06-04 17:44:31,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:44:31,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:44:31,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 107 transitions. [2024-06-04 17:44:31,160 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.334375 [2024-06-04 17:44:31,160 INFO L175 Difference]: Start difference. First operand has 129 places, 107 transitions, 868 flow. Second operand 10 states and 107 transitions. [2024-06-04 17:44:31,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 129 transitions, 1191 flow [2024-06-04 17:44:31,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 129 transitions, 1147 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-04 17:44:31,195 INFO L231 Difference]: Finished difference. Result has 132 places, 109 transitions, 884 flow [2024-06-04 17:44:31,195 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=824, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=884, PETRI_PLACES=132, PETRI_TRANSITIONS=109} [2024-06-04 17:44:31,195 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 101 predicate places. [2024-06-04 17:44:31,195 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 109 transitions, 884 flow [2024-06-04 17:44:31,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call 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,196 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:44:31,196 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,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-04 17:44:31,196 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:44:31,196 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:44:31,197 INFO L85 PathProgramCache]: Analyzing trace with hash -2054836295, now seen corresponding path program 2 times [2024-06-04 17:44:31,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:44:31,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238006302] [2024-06-04 17:44:31,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:44:31,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:44:31,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:44:35,272 INFO 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:35,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:44:35,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238006302] [2024-06-04 17:44:35,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238006302] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:44:35,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:44:35,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:44:35,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963267261] [2024-06-04 17:44:35,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:44:35,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:44:35,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:44:35,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:44:35,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:44:35,416 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:44:35,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 109 transitions, 884 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call 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:35,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:44:35,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:44:35,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:44:35,688 INFO L124 PetriNetUnfolderBase]: 334/598 cut-off events. [2024-06-04 17:44:35,689 INFO L125 PetriNetUnfolderBase]: For 22776/22776 co-relation queries the response was YES. [2024-06-04 17:44:35,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3388 conditions, 598 events. 334/598 cut-off events. For 22776/22776 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2496 event pairs, 37 based on Foata normal form. 4/600 useless extension candidates. Maximal degree in co-relation 3322. Up to 289 conditions per place. [2024-06-04 17:44:35,692 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 74 selfloop transitions, 60 changer transitions 0/136 dead transitions. [2024-06-04 17:44:35,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 136 transitions, 1423 flow [2024-06-04 17:44:35,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:44:35,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:44:35,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 122 transitions. [2024-06-04 17:44:35,694 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38125 [2024-06-04 17:44:35,694 INFO L175 Difference]: Start difference. First operand has 132 places, 109 transitions, 884 flow. Second operand 10 states and 122 transitions. [2024-06-04 17:44:35,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 136 transitions, 1423 flow [2024-06-04 17:44:35,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 136 transitions, 1384 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-06-04 17:44:35,727 INFO L231 Difference]: Finished difference. Result has 134 places, 115 transitions, 1026 flow [2024-06-04 17:44:35,727 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=845, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1026, PETRI_PLACES=134, PETRI_TRANSITIONS=115} [2024-06-04 17:44:35,728 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 103 predicate places. [2024-06-04 17:44:35,728 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 115 transitions, 1026 flow [2024-06-04 17:44:35,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call 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:35,728 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:44:35,728 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:35,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-04 17:44:35,729 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:44:35,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:44:35,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1864958977, now seen corresponding path program 3 times [2024-06-04 17:44:35,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:44:35,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022951161] [2024-06-04 17:44:35,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:44:35,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:44:35,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:44:40,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:40,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:44:40,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022951161] [2024-06-04 17:44:40,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022951161] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:44:40,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:44:40,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:44:40,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621626690] [2024-06-04 17:44:40,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:44:40,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:44:40,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:44:40,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:44:40,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:44:40,200 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:44:40,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 115 transitions, 1026 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call 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:40,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:44:40,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:44:40,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:44:40,481 INFO L124 PetriNetUnfolderBase]: 340/608 cut-off events. [2024-06-04 17:44:40,481 INFO L125 PetriNetUnfolderBase]: For 22609/22609 co-relation queries the response was YES. [2024-06-04 17:44:40,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3605 conditions, 608 events. 340/608 cut-off events. For 22609/22609 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2557 event pairs, 43 based on Foata normal form. 2/608 useless extension candidates. Maximal degree in co-relation 3538. Up to 291 conditions per place. [2024-06-04 17:44:40,503 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 78 selfloop transitions, 58 changer transitions 0/138 dead transitions. [2024-06-04 17:44:40,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 138 transitions, 1549 flow [2024-06-04 17:44:40,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:44:40,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:44:40,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 122 transitions. [2024-06-04 17:44:40,505 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38125 [2024-06-04 17:44:40,505 INFO L175 Difference]: Start difference. First operand has 134 places, 115 transitions, 1026 flow. Second operand 10 states and 122 transitions. [2024-06-04 17:44:40,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 138 transitions, 1549 flow [2024-06-04 17:44:40,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 138 transitions, 1487 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-06-04 17:44:40,543 INFO L231 Difference]: Finished difference. Result has 139 places, 117 transitions, 1110 flow [2024-06-04 17:44:40,543 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=964, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1110, PETRI_PLACES=139, PETRI_TRANSITIONS=117} [2024-06-04 17:44:40,543 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 108 predicate places. [2024-06-04 17:44:40,544 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 117 transitions, 1110 flow [2024-06-04 17:44:40,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call 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:40,544 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:44:40,544 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:40,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-04 17:44:40,544 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:44:40,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:44:40,546 INFO L85 PathProgramCache]: Analyzing trace with hash -2055051497, now seen corresponding path program 4 times [2024-06-04 17:44:40,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:44:40,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928360528] [2024-06-04 17:44:40,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:44:40,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:44:40,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:44:44,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:44:44,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:44:44,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928360528] [2024-06-04 17:44:44,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928360528] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:44:44,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:44:44,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:44:44,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501006032] [2024-06-04 17:44:44,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:44:44,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:44:44,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:44:44,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:44:44,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:44:45,110 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:44:45,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 117 transitions, 1110 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call 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:45,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:44:45,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:44:45,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:44:45,367 INFO L124 PetriNetUnfolderBase]: 344/616 cut-off events. [2024-06-04 17:44:45,368 INFO L125 PetriNetUnfolderBase]: For 24008/24008 co-relation queries the response was YES. [2024-06-04 17:44:45,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3776 conditions, 616 events. 344/616 cut-off events. For 24008/24008 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2603 event pairs, 39 based on Foata normal form. 2/616 useless extension candidates. Maximal degree in co-relation 3707. Up to 498 conditions per place. [2024-06-04 17:44:45,372 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 99 selfloop transitions, 33 changer transitions 0/134 dead transitions. [2024-06-04 17:44:45,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 134 transitions, 1430 flow [2024-06-04 17:44:45,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:44:45,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:44:45,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2024-06-04 17:44:45,373 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3506944444444444 [2024-06-04 17:44:45,373 INFO L175 Difference]: Start difference. First operand has 139 places, 117 transitions, 1110 flow. Second operand 9 states and 101 transitions. [2024-06-04 17:44:45,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 134 transitions, 1430 flow [2024-06-04 17:44:45,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 134 transitions, 1327 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-04 17:44:45,417 INFO L231 Difference]: Finished difference. Result has 141 places, 118 transitions, 1093 flow [2024-06-04 17:44:45,417 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1007, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1093, PETRI_PLACES=141, PETRI_TRANSITIONS=118} [2024-06-04 17:44:45,417 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 110 predicate places. [2024-06-04 17:44:45,417 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 118 transitions, 1093 flow [2024-06-04 17:44:45,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call 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:45,418 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:44:45,418 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:44:45,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-04 17:44:45,418 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:44:45,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:44:45,418 INFO L85 PathProgramCache]: Analyzing trace with hash -2055045545, now seen corresponding path program 4 times [2024-06-04 17:44:45,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:44:45,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690880454] [2024-06-04 17:44:45,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:44:45,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:44:45,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:44:49,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:44:49,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:44:49,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690880454] [2024-06-04 17:44:49,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690880454] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:44:49,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:44:49,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:44:49,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612153079] [2024-06-04 17:44:49,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:44:49,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:44:49,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:44:49,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:44:49,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:44:49,592 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:44:49,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 118 transitions, 1093 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call 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,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:44:49,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:44:49,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:44:49,901 INFO L124 PetriNetUnfolderBase]: 350/626 cut-off events. [2024-06-04 17:44:49,901 INFO L125 PetriNetUnfolderBase]: For 25065/25065 co-relation queries the response was YES. [2024-06-04 17:44:49,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3805 conditions, 626 events. 350/626 cut-off events. For 25065/25065 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2650 event pairs, 45 based on Foata normal form. 2/626 useless extension candidates. Maximal degree in co-relation 3735. Up to 301 conditions per place. [2024-06-04 17:44:49,906 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 82 selfloop transitions, 57 changer transitions 0/141 dead transitions. [2024-06-04 17:44:49,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 141 transitions, 1633 flow [2024-06-04 17:44:49,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:44:49,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:44:49,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 122 transitions. [2024-06-04 17:44:49,907 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38125 [2024-06-04 17:44:49,907 INFO L175 Difference]: Start difference. First operand has 141 places, 118 transitions, 1093 flow. Second operand 10 states and 122 transitions. [2024-06-04 17:44:49,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 141 transitions, 1633 flow [2024-06-04 17:44:49,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 141 transitions, 1557 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-04 17:44:49,949 INFO L231 Difference]: Finished difference. Result has 144 places, 120 transitions, 1164 flow [2024-06-04 17:44:49,949 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1017, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1164, PETRI_PLACES=144, PETRI_TRANSITIONS=120} [2024-06-04 17:44:49,949 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 113 predicate places. [2024-06-04 17:44:49,949 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 120 transitions, 1164 flow [2024-06-04 17:44:49,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call 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,950 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:44:49,950 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,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-04 17:44:49,950 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:44:49,950 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:44:49,950 INFO L85 PathProgramCache]: Analyzing trace with hash -2060558027, now seen corresponding path program 5 times [2024-06-04 17:44:49,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:44:49,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620002255] [2024-06-04 17:44:49,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:44:49,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:44:49,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:44:54,262 INFO 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:54,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:44:54,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620002255] [2024-06-04 17:44:54,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620002255] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:44:54,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:44:54,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:44:54,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879099040] [2024-06-04 17:44:54,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:44:54,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:44:54,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:44:54,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:44:54,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:44:54,345 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:44:54,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 120 transitions, 1164 flow. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:44:54,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:44:54,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:44:54,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:44:54,602 INFO L124 PetriNetUnfolderBase]: 354/634 cut-off events. [2024-06-04 17:44:54,602 INFO L125 PetriNetUnfolderBase]: For 26451/26451 co-relation queries the response was YES. [2024-06-04 17:44:54,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3930 conditions, 634 events. 354/634 cut-off events. For 26451/26451 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2720 event pairs, 43 based on Foata normal form. 2/634 useless extension candidates. Maximal degree in co-relation 3859. Up to 516 conditions per place. [2024-06-04 17:44:54,606 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 106 selfloop transitions, 29 changer transitions 0/137 dead transitions. [2024-06-04 17:44:54,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 137 transitions, 1492 flow [2024-06-04 17:44:54,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:44:54,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:44:54,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 100 transitions. [2024-06-04 17:44:54,608 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3472222222222222 [2024-06-04 17:44:54,608 INFO L175 Difference]: Start difference. First operand has 144 places, 120 transitions, 1164 flow. Second operand 9 states and 100 transitions. [2024-06-04 17:44:54,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 137 transitions, 1492 flow [2024-06-04 17:44:54,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 137 transitions, 1396 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-04 17:44:54,655 INFO L231 Difference]: Finished difference. Result has 146 places, 121 transitions, 1148 flow [2024-06-04 17:44:54,655 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1068, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1148, PETRI_PLACES=146, PETRI_TRANSITIONS=121} [2024-06-04 17:44:54,655 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 115 predicate places. [2024-06-04 17:44:54,655 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 121 transitions, 1148 flow [2024-06-04 17:44:54,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:44:54,656 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:44:54,656 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:54,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-04 17:44:54,656 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:44:54,656 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:44:54,657 INFO L85 PathProgramCache]: Analyzing trace with hash -2060407925, now seen corresponding path program 5 times [2024-06-04 17:44:54,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:44:54,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684671082] [2024-06-04 17:44:54,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:44:54,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:44:54,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:44:58,921 INFO 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:58,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:44:58,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684671082] [2024-06-04 17:44:58,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684671082] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:44:58,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:44:58,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:44:58,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991109768] [2024-06-04 17:44:58,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:44:58,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:44:58,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:44:58,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:44:58,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:44:59,023 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:44:59,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 121 transitions, 1148 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:44:59,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:44:59,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:44:59,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:44:59,319 INFO L124 PetriNetUnfolderBase]: 364/650 cut-off events. [2024-06-04 17:44:59,319 INFO L125 PetriNetUnfolderBase]: For 28500/28500 co-relation queries the response was YES. [2024-06-04 17:44:59,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4023 conditions, 650 events. 364/650 cut-off events. For 28500/28500 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2790 event pairs, 53 based on Foata normal form. 2/650 useless extension candidates. Maximal degree in co-relation 3951. Up to 319 conditions per place. [2024-06-04 17:44:59,324 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 83 selfloop transitions, 61 changer transitions 0/146 dead transitions. [2024-06-04 17:44:59,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 146 transitions, 1727 flow [2024-06-04 17:44:59,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:44:59,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:44:59,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2024-06-04 17:44:59,328 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36875 [2024-06-04 17:44:59,328 INFO L175 Difference]: Start difference. First operand has 146 places, 121 transitions, 1148 flow. Second operand 10 states and 118 transitions. [2024-06-04 17:44:59,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 146 transitions, 1727 flow [2024-06-04 17:44:59,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 146 transitions, 1657 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-04 17:44:59,383 INFO L231 Difference]: Finished difference. Result has 150 places, 126 transitions, 1304 flow [2024-06-04 17:44:59,383 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1078, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1304, PETRI_PLACES=150, PETRI_TRANSITIONS=126} [2024-06-04 17:44:59,383 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 119 predicate places. [2024-06-04 17:44:59,383 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 126 transitions, 1304 flow [2024-06-04 17:44:59,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:44:59,384 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:44:59,385 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:44:59,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-04 17:44:59,388 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:44:59,388 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:44:59,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1861033261, now seen corresponding path program 6 times [2024-06-04 17:44:59,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:44:59,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862411079] [2024-06-04 17:44:59,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:44:59,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:44:59,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:45:03,941 INFO 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:03,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:45:03,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862411079] [2024-06-04 17:45:03,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862411079] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:45:03,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:45:03,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:45:03,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512222030] [2024-06-04 17:45:03,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:45:03,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:45:03,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:45:03,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:45:03,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:45:04,080 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:45:04,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 126 transitions, 1304 flow. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:45:04,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:45:04,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:45:04,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:45:04,344 INFO L124 PetriNetUnfolderBase]: 361/645 cut-off events. [2024-06-04 17:45:04,345 INFO L125 PetriNetUnfolderBase]: For 27980/27980 co-relation queries the response was YES. [2024-06-04 17:45:04,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4084 conditions, 645 events. 361/645 cut-off events. For 27980/27980 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2767 event pairs, 44 based on Foata normal form. 2/645 useless extension candidates. Maximal degree in co-relation 4010. Up to 491 conditions per place. [2024-06-04 17:45:04,349 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 108 selfloop transitions, 32 changer transitions 0/142 dead transitions. [2024-06-04 17:45:04,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 142 transitions, 1624 flow [2024-06-04 17:45:04,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:45:04,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:45:04,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 100 transitions. [2024-06-04 17:45:04,350 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3472222222222222 [2024-06-04 17:45:04,350 INFO L175 Difference]: Start difference. First operand has 150 places, 126 transitions, 1304 flow. Second operand 9 states and 100 transitions. [2024-06-04 17:45:04,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 142 transitions, 1624 flow [2024-06-04 17:45:04,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 142 transitions, 1555 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-06-04 17:45:04,403 INFO L231 Difference]: Finished difference. Result has 153 places, 126 transitions, 1304 flow [2024-06-04 17:45:04,404 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1235, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1304, PETRI_PLACES=153, PETRI_TRANSITIONS=126} [2024-06-04 17:45:04,404 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 122 predicate places. [2024-06-04 17:45:04,404 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 126 transitions, 1304 flow [2024-06-04 17:45:04,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:45:04,404 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:45:04,405 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:04,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-04 17:45:04,405 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:45:04,405 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:45:04,405 INFO L85 PathProgramCache]: Analyzing trace with hash -874771655, now seen corresponding path program 6 times [2024-06-04 17:45:04,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:45:04,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310030245] [2024-06-04 17:45:04,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:45:04,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:45:04,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:45:08,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:45:08,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:45:08,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310030245] [2024-06-04 17:45:08,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310030245] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:45:08,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:45:08,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:45:08,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007547036] [2024-06-04 17:45:08,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:45:08,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:45:08,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:45:08,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:45:08,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:45:08,649 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:45:08,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 126 transitions, 1304 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call 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,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:45:08,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:45:08,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:45:08,950 INFO L124 PetriNetUnfolderBase]: 367/655 cut-off events. [2024-06-04 17:45:08,950 INFO L125 PetriNetUnfolderBase]: For 29339/29339 co-relation queries the response was YES. [2024-06-04 17:45:08,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4104 conditions, 655 events. 367/655 cut-off events. For 29339/29339 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2822 event pairs, 53 based on Foata normal form. 2/655 useless extension candidates. Maximal degree in co-relation 4029. Up to 316 conditions per place. [2024-06-04 17:45:08,955 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 88 selfloop transitions, 59 changer transitions 0/149 dead transitions. [2024-06-04 17:45:08,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 149 transitions, 1952 flow [2024-06-04 17:45:08,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:45:08,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:45:08,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-04 17:45:08,956 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3875 [2024-06-04 17:45:08,956 INFO L175 Difference]: Start difference. First operand has 153 places, 126 transitions, 1304 flow. Second operand 10 states and 124 transitions. [2024-06-04 17:45:08,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 149 transitions, 1952 flow [2024-06-04 17:45:09,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 149 transitions, 1875 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-04 17:45:09,020 INFO L231 Difference]: Finished difference. Result has 156 places, 128 transitions, 1372 flow [2024-06-04 17:45:09,020 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1227, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1372, PETRI_PLACES=156, PETRI_TRANSITIONS=128} [2024-06-04 17:45:09,021 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 125 predicate places. [2024-06-04 17:45:09,021 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 128 transitions, 1372 flow [2024-06-04 17:45:09,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call 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,021 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:45:09,021 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,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-04 17:45:09,022 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:45:09,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:45:09,022 INFO L85 PathProgramCache]: Analyzing trace with hash -874562405, now seen corresponding path program 7 times [2024-06-04 17:45:09,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:45:09,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253202442] [2024-06-04 17:45:09,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:45:09,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:45:09,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:45:13,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:45:13,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:45:13,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253202442] [2024-06-04 17:45:13,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253202442] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:45:13,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:45:13,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:45:13,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345139531] [2024-06-04 17:45:13,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:45:13,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:45:13,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:45:13,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:45:13,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:45:13,342 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:45:13,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 128 transitions, 1372 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call 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:13,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:45:13,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:45:13,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:45:13,663 INFO L124 PetriNetUnfolderBase]: 406/719 cut-off events. [2024-06-04 17:45:13,663 INFO L125 PetriNetUnfolderBase]: For 38681/38681 co-relation queries the response was YES. [2024-06-04 17:45:13,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4738 conditions, 719 events. 406/719 cut-off events. For 38681/38681 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 3137 event pairs, 59 based on Foata normal form. 4/721 useless extension candidates. Maximal degree in co-relation 4662. Up to 342 conditions per place. [2024-06-04 17:45:13,669 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 94 selfloop transitions, 62 changer transitions 0/158 dead transitions. [2024-06-04 17:45:13,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 158 transitions, 2143 flow [2024-06-04 17:45:13,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:45:13,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:45:13,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-04 17:45:13,670 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3875 [2024-06-04 17:45:13,670 INFO L175 Difference]: Start difference. First operand has 156 places, 128 transitions, 1372 flow. Second operand 10 states and 124 transitions. [2024-06-04 17:45:13,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 158 transitions, 2143 flow [2024-06-04 17:45:13,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 158 transitions, 1947 flow, removed 12 selfloop flow, removed 9 redundant places. [2024-06-04 17:45:13,745 INFO L231 Difference]: Finished difference. Result has 158 places, 136 transitions, 1435 flow [2024-06-04 17:45:13,746 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1201, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1435, PETRI_PLACES=158, PETRI_TRANSITIONS=136} [2024-06-04 17:45:13,746 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 127 predicate places. [2024-06-04 17:45:13,746 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 136 transitions, 1435 flow [2024-06-04 17:45:13,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call 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:13,746 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:45:13,746 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:13,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-04 17:45:13,747 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:45:13,748 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:45:13,748 INFO L85 PathProgramCache]: Analyzing trace with hash -608864846, now seen corresponding path program 1 times [2024-06-04 17:45:13,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:45:13,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097966218] [2024-06-04 17:45:13,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:45:13,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:45:13,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:45:18,721 INFO 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:18,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:45:18,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097966218] [2024-06-04 17:45:18,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097966218] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:45:18,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:45:18,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:45:18,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054683879] [2024-06-04 17:45:18,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:45:18,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:45:18,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:45:18,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:45:18,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:45:18,813 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:45:18,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 136 transitions, 1435 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:45:18,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:45:18,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:45:18,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:45:19,203 INFO L124 PetriNetUnfolderBase]: 409/724 cut-off events. [2024-06-04 17:45:19,203 INFO L125 PetriNetUnfolderBase]: For 36326/36326 co-relation queries the response was YES. [2024-06-04 17:45:19,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4782 conditions, 724 events. 409/724 cut-off events. For 36326/36326 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3157 event pairs, 74 based on Foata normal form. 1/723 useless extension candidates. Maximal degree in co-relation 4705. Up to 656 conditions per place. [2024-06-04 17:45:19,208 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 120 selfloop transitions, 30 changer transitions 0/152 dead transitions. [2024-06-04 17:45:19,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 152 transitions, 1795 flow [2024-06-04 17:45:19,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:45:19,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:45:19,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 114 transitions. [2024-06-04 17:45:19,209 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32386363636363635 [2024-06-04 17:45:19,210 INFO L175 Difference]: Start difference. First operand has 158 places, 136 transitions, 1435 flow. Second operand 11 states and 114 transitions. [2024-06-04 17:45:19,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 152 transitions, 1795 flow [2024-06-04 17:45:19,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 152 transitions, 1682 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-04 17:45:19,290 INFO L231 Difference]: Finished difference. Result has 163 places, 138 transitions, 1419 flow [2024-06-04 17:45:19,290 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1323, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1419, PETRI_PLACES=163, PETRI_TRANSITIONS=138} [2024-06-04 17:45:19,291 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 132 predicate places. [2024-06-04 17:45:19,291 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 138 transitions, 1419 flow [2024-06-04 17:45:19,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:45:19,291 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:45:19,291 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:19,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-04 17:45:19,291 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:45:19,292 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:45:19,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1404548095, now seen corresponding path program 8 times [2024-06-04 17:45:19,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:45:19,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590229032] [2024-06-04 17:45:19,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:45:19,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:45:19,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:45:23,422 INFO 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:23,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:45:23,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590229032] [2024-06-04 17:45:23,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590229032] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:45:23,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:45:23,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:45:23,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73059150] [2024-06-04 17:45:23,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:45:23,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:45:23,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:45:23,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:45:23,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:45:23,562 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:45:23,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 138 transitions, 1419 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:45:23,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:45:23,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:45:23,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:45:23,823 INFO L124 PetriNetUnfolderBase]: 405/718 cut-off events. [2024-06-04 17:45:23,824 INFO L125 PetriNetUnfolderBase]: For 36269/36269 co-relation queries the response was YES. [2024-06-04 17:45:23,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4596 conditions, 718 events. 405/718 cut-off events. For 36269/36269 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3149 event pairs, 58 based on Foata normal form. 2/718 useless extension candidates. Maximal degree in co-relation 4518. Up to 343 conditions per place. [2024-06-04 17:45:23,829 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 95 selfloop transitions, 63 changer transitions 0/160 dead transitions. [2024-06-04 17:45:23,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 160 transitions, 2095 flow [2024-06-04 17:45:23,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:45:23,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:45:23,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2024-06-04 17:45:23,830 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.390625 [2024-06-04 17:45:23,831 INFO L175 Difference]: Start difference. First operand has 163 places, 138 transitions, 1419 flow. Second operand 10 states and 125 transitions. [2024-06-04 17:45:23,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 160 transitions, 2095 flow [2024-06-04 17:45:23,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 160 transitions, 2024 flow, removed 7 selfloop flow, removed 9 redundant places. [2024-06-04 17:45:23,903 INFO L231 Difference]: Finished difference. Result has 164 places, 139 transitions, 1491 flow [2024-06-04 17:45:23,903 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1348, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1491, PETRI_PLACES=164, PETRI_TRANSITIONS=139} [2024-06-04 17:45:23,903 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 133 predicate places. [2024-06-04 17:45:23,903 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 139 transitions, 1491 flow [2024-06-04 17:45:23,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:45:23,904 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:45:23,904 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:23,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-04 17:45:23,904 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:45:23,904 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:45:23,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1394423036, now seen corresponding path program 2 times [2024-06-04 17:45:23,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:45:23,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375202284] [2024-06-04 17:45:23,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:45:23,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:45:23,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:45:28,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:45:28,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:45:28,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375202284] [2024-06-04 17:45:28,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375202284] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:45:28,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:45:28,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:45:28,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147444156] [2024-06-04 17:45:28,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:45:28,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:45:28,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:45:28,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:45:28,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:45:28,571 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:45:28,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 139 transitions, 1491 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:45:28,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:45:28,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:45:28,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:45:28,869 INFO L124 PetriNetUnfolderBase]: 397/705 cut-off events. [2024-06-04 17:45:28,869 INFO L125 PetriNetUnfolderBase]: For 35502/35502 co-relation queries the response was YES. [2024-06-04 17:45:28,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4512 conditions, 705 events. 397/705 cut-off events. For 35502/35502 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3073 event pairs, 57 based on Foata normal form. 3/706 useless extension candidates. Maximal degree in co-relation 4433. Up to 415 conditions per place. [2024-06-04 17:45:28,880 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 95 selfloop transitions, 62 changer transitions 0/159 dead transitions. [2024-06-04 17:45:28,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 159 transitions, 2059 flow [2024-06-04 17:45:28,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:45:28,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:45:28,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 120 transitions. [2024-06-04 17:45:28,881 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-04 17:45:28,882 INFO L175 Difference]: Start difference. First operand has 164 places, 139 transitions, 1491 flow. Second operand 10 states and 120 transitions. [2024-06-04 17:45:28,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 159 transitions, 2059 flow [2024-06-04 17:45:28,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 159 transitions, 1929 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-06-04 17:45:28,949 INFO L231 Difference]: Finished difference. Result has 167 places, 139 transitions, 1494 flow [2024-06-04 17:45:28,950 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1361, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1494, PETRI_PLACES=167, PETRI_TRANSITIONS=139} [2024-06-04 17:45:28,950 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 136 predicate places. [2024-06-04 17:45:28,950 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 139 transitions, 1494 flow [2024-06-04 17:45:28,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:45:28,951 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:45:28,951 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:28,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-04 17:45:28,951 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:45:28,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:45:28,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1148047585, now seen corresponding path program 9 times [2024-06-04 17:45:28,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:45:28,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799335364] [2024-06-04 17:45:28,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:45:28,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:45:28,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:45:33,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:45:33,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:45:33,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799335364] [2024-06-04 17:45:33,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799335364] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:45:33,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:45:33,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:45:33,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460004524] [2024-06-04 17:45:33,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:45:33,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:45:33,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:45:33,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:45:33,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:45:33,353 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:45:33,359 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 139 transitions, 1494 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:45:33,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:45:33,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:45:33,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:45:33,758 INFO L124 PetriNetUnfolderBase]: 403/715 cut-off events. [2024-06-04 17:45:33,758 INFO L125 PetriNetUnfolderBase]: For 35573/35573 co-relation queries the response was YES. [2024-06-04 17:45:33,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4597 conditions, 715 events. 403/715 cut-off events. For 35573/35573 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3155 event pairs, 44 based on Foata normal form. 2/715 useless extension candidates. Maximal degree in co-relation 4517. Up to 338 conditions per place. [2024-06-04 17:45:33,764 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 89 selfloop transitions, 73 changer transitions 0/164 dead transitions. [2024-06-04 17:45:33,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 164 transitions, 2217 flow [2024-06-04 17:45:33,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:45:33,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:45:33,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 135 transitions. [2024-06-04 17:45:33,765 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3835227272727273 [2024-06-04 17:45:33,765 INFO L175 Difference]: Start difference. First operand has 167 places, 139 transitions, 1494 flow. Second operand 11 states and 135 transitions. [2024-06-04 17:45:33,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 164 transitions, 2217 flow [2024-06-04 17:45:33,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 164 transitions, 2063 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-04 17:45:33,834 INFO L231 Difference]: Finished difference. Result has 169 places, 141 transitions, 1522 flow [2024-06-04 17:45:33,835 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1344, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1522, PETRI_PLACES=169, PETRI_TRANSITIONS=141} [2024-06-04 17:45:33,835 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 138 predicate places. [2024-06-04 17:45:33,835 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 141 transitions, 1522 flow [2024-06-04 17:45:33,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:45:33,836 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:45:33,836 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:33,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-04 17:45:33,837 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:45:33,838 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:45:33,838 INFO L85 PathProgramCache]: Analyzing trace with hash -618061616, now seen corresponding path program 3 times [2024-06-04 17:45:33,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:45:33,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713493405] [2024-06-04 17:45:33,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:45:33,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:45:33,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:45:38,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:45:38,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:45:38,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713493405] [2024-06-04 17:45:38,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713493405] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:45:38,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:45:38,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:45:38,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681878208] [2024-06-04 17:45:38,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:45:38,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:45:38,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:45:38,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:45:38,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:45:38,837 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:45:38,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 141 transitions, 1522 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:45:38,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:45:38,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:45:38,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:45:39,148 INFO L124 PetriNetUnfolderBase]: 406/720 cut-off events. [2024-06-04 17:45:39,148 INFO L125 PetriNetUnfolderBase]: For 35494/35494 co-relation queries the response was YES. [2024-06-04 17:45:39,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4685 conditions, 720 events. 406/720 cut-off events. For 35494/35494 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3157 event pairs, 68 based on Foata normal form. 1/719 useless extension candidates. Maximal degree in co-relation 4604. Up to 652 conditions per place. [2024-06-04 17:45:39,154 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 125 selfloop transitions, 30 changer transitions 0/157 dead transitions. [2024-06-04 17:45:39,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 157 transitions, 1899 flow [2024-06-04 17:45:39,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:45:39,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:45:39,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 115 transitions. [2024-06-04 17:45:39,157 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32670454545454547 [2024-06-04 17:45:39,157 INFO L175 Difference]: Start difference. First operand has 169 places, 141 transitions, 1522 flow. Second operand 11 states and 115 transitions. [2024-06-04 17:45:39,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 157 transitions, 1899 flow [2024-06-04 17:45:39,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 157 transitions, 1661 flow, removed 9 selfloop flow, removed 12 redundant places. [2024-06-04 17:45:39,234 INFO L231 Difference]: Finished difference. Result has 168 places, 143 transitions, 1388 flow [2024-06-04 17:45:39,234 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1291, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1388, PETRI_PLACES=168, PETRI_TRANSITIONS=143} [2024-06-04 17:45:39,235 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 137 predicate places. [2024-06-04 17:45:39,235 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 143 transitions, 1388 flow [2024-06-04 17:45:39,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:45:39,235 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:45:39,236 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:39,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-04 17:45:39,236 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:45:39,236 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:45:39,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1366577095, now seen corresponding path program 10 times [2024-06-04 17:45:39,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:45:39,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403244489] [2024-06-04 17:45:39,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:45:39,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:45:39,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:45:43,754 INFO 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:43,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:45:43,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403244489] [2024-06-04 17:45:43,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403244489] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:45:43,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:45:43,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:45:43,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762909488] [2024-06-04 17:45:43,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:45:43,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:45:43,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:45:43,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:45:43,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:45:43,849 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:45:43,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 143 transitions, 1388 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:45:43,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:45:43,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:45:43,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:45:44,215 INFO L124 PetriNetUnfolderBase]: 428/756 cut-off events. [2024-06-04 17:45:44,215 INFO L125 PetriNetUnfolderBase]: For 43233/43233 co-relation queries the response was YES. [2024-06-04 17:45:44,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4743 conditions, 756 events. 428/756 cut-off events. For 43233/43233 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3356 event pairs, 51 based on Foata normal form. 4/758 useless extension candidates. Maximal degree in co-relation 4663. Up to 357 conditions per place. [2024-06-04 17:45:44,221 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 94 selfloop transitions, 76 changer transitions 0/172 dead transitions. [2024-06-04 17:45:44,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 172 transitions, 2172 flow [2024-06-04 17:45:44,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:45:44,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:45:44,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 136 transitions. [2024-06-04 17:45:44,223 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38636363636363635 [2024-06-04 17:45:44,223 INFO L175 Difference]: Start difference. First operand has 168 places, 143 transitions, 1388 flow. Second operand 11 states and 136 transitions. [2024-06-04 17:45:44,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 172 transitions, 2172 flow [2024-06-04 17:45:44,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 172 transitions, 2099 flow, removed 8 selfloop flow, removed 9 redundant places. [2024-06-04 17:45:44,317 INFO L231 Difference]: Finished difference. Result has 170 places, 149 transitions, 1541 flow [2024-06-04 17:45:44,317 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1315, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1541, PETRI_PLACES=170, PETRI_TRANSITIONS=149} [2024-06-04 17:45:44,317 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 139 predicate places. [2024-06-04 17:45:44,317 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 149 transitions, 1541 flow [2024-06-04 17:45:44,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:45:44,318 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:45:44,318 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:44,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-04 17:45:44,318 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:45:44,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:45:44,318 INFO L85 PathProgramCache]: Analyzing trace with hash -608865125, now seen corresponding path program 11 times [2024-06-04 17:45:44,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:45:44,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819432729] [2024-06-04 17:45:44,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:45:44,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:45:44,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:45:48,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:45:48,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:45:48,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819432729] [2024-06-04 17:45:48,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819432729] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:45:48,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:45:48,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:45:48,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754104066] [2024-06-04 17:45:48,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:45:48,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:45:48,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:45:48,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:45:48,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:45:48,743 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:45:48,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 149 transitions, 1541 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:45:48,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:45:48,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:45:48,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:45:49,119 INFO L124 PetriNetUnfolderBase]: 422/748 cut-off events. [2024-06-04 17:45:49,119 INFO L125 PetriNetUnfolderBase]: For 39443/39443 co-relation queries the response was YES. [2024-06-04 17:45:49,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4665 conditions, 748 events. 422/748 cut-off events. For 39443/39443 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3328 event pairs, 47 based on Foata normal form. 4/750 useless extension candidates. Maximal degree in co-relation 4584. Up to 356 conditions per place. [2024-06-04 17:45:49,124 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 89 selfloop transitions, 81 changer transitions 0/172 dead transitions. [2024-06-04 17:45:49,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 172 transitions, 2267 flow [2024-06-04 17:45:49,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:45:49,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:45:49,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 134 transitions. [2024-06-04 17:45:49,126 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3806818181818182 [2024-06-04 17:45:49,127 INFO L175 Difference]: Start difference. First operand has 170 places, 149 transitions, 1541 flow. Second operand 11 states and 134 transitions. [2024-06-04 17:45:49,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 172 transitions, 2267 flow [2024-06-04 17:45:49,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 172 transitions, 2112 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-06-04 17:45:49,211 INFO L231 Difference]: Finished difference. Result has 174 places, 149 transitions, 1557 flow [2024-06-04 17:45:49,211 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1386, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1557, PETRI_PLACES=174, PETRI_TRANSITIONS=149} [2024-06-04 17:45:49,212 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 143 predicate places. [2024-06-04 17:45:49,212 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 149 transitions, 1557 flow [2024-06-04 17:45:49,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:45:49,212 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:45:49,212 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:49,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-04 17:45:49,212 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:45:49,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:45:49,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1138516666, now seen corresponding path program 4 times [2024-06-04 17:45:49,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:45:49,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033559559] [2024-06-04 17:45:49,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:45:49,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:45:49,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:45:54,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:45:54,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:45:54,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033559559] [2024-06-04 17:45:54,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033559559] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:45:54,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:45:54,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:45:54,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650236787] [2024-06-04 17:45:54,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:45:54,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:45:54,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:45:54,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:45:54,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:45:54,460 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:45:54,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 149 transitions, 1557 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:45:54,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:45:54,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:45:54,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:45:54,762 INFO L124 PetriNetUnfolderBase]: 418/741 cut-off events. [2024-06-04 17:45:54,762 INFO L125 PetriNetUnfolderBase]: For 34903/34903 co-relation queries the response was YES. [2024-06-04 17:45:54,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4600 conditions, 741 events. 418/741 cut-off events. For 34903/34903 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3263 event pairs, 69 based on Foata normal form. 1/740 useless extension candidates. Maximal degree in co-relation 4518. Up to 664 conditions per place. [2024-06-04 17:45:54,768 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 128 selfloop transitions, 35 changer transitions 0/165 dead transitions. [2024-06-04 17:45:54,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 165 transitions, 1932 flow [2024-06-04 17:45:54,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 17:45:54,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 17:45:54,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 123 transitions. [2024-06-04 17:45:54,770 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3203125 [2024-06-04 17:45:54,770 INFO L175 Difference]: Start difference. First operand has 174 places, 149 transitions, 1557 flow. Second operand 12 states and 123 transitions. [2024-06-04 17:45:54,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 165 transitions, 1932 flow [2024-06-04 17:45:54,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 165 transitions, 1750 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-04 17:45:54,850 INFO L231 Difference]: Finished difference. Result has 176 places, 150 transitions, 1467 flow [2024-06-04 17:45:54,850 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1377, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1467, PETRI_PLACES=176, PETRI_TRANSITIONS=150} [2024-06-04 17:45:54,850 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 145 predicate places. [2024-06-04 17:45:54,850 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 150 transitions, 1467 flow [2024-06-04 17:45:54,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:45:54,851 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:45:54,851 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:54,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-04 17:45:54,851 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:45:54,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:45:54,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1324106634, now seen corresponding path program 1 times [2024-06-04 17:45:54,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:45:54,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961858781] [2024-06-04 17:45:54,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:45:54,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:45:54,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:45:59,257 INFO 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:59,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:45:59,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961858781] [2024-06-04 17:45:59,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961858781] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:45:59,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:45:59,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:45:59,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854506987] [2024-06-04 17:45:59,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:45:59,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:45:59,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:45:59,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:45:59,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:45:59,367 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:45:59,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 150 transitions, 1467 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:45:59,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:45:59,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:45:59,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:45:59,677 INFO L124 PetriNetUnfolderBase]: 422/749 cut-off events. [2024-06-04 17:45:59,677 INFO L125 PetriNetUnfolderBase]: For 37406/37406 co-relation queries the response was YES. [2024-06-04 17:45:59,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4507 conditions, 749 events. 422/749 cut-off events. For 37406/37406 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3344 event pairs, 49 based on Foata normal form. 2/749 useless extension candidates. Maximal degree in co-relation 4424. Up to 671 conditions per place. [2024-06-04 17:45:59,683 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 156 selfloop transitions, 13 changer transitions 0/171 dead transitions. [2024-06-04 17:45:59,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 171 transitions, 1859 flow [2024-06-04 17:45:59,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:45:59,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:45:59,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 102 transitions. [2024-06-04 17:45:59,685 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31875 [2024-06-04 17:45:59,685 INFO L175 Difference]: Start difference. First operand has 176 places, 150 transitions, 1467 flow. Second operand 10 states and 102 transitions. [2024-06-04 17:45:59,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 171 transitions, 1859 flow [2024-06-04 17:45:59,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 171 transitions, 1774 flow, removed 9 selfloop flow, removed 10 redundant places. [2024-06-04 17:45:59,756 INFO L231 Difference]: Finished difference. Result has 176 places, 151 transitions, 1422 flow [2024-06-04 17:45:59,757 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1382, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1422, PETRI_PLACES=176, PETRI_TRANSITIONS=151} [2024-06-04 17:45:59,757 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 145 predicate places. [2024-06-04 17:45:59,757 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 151 transitions, 1422 flow [2024-06-04 17:45:59,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:45:59,757 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:45:59,757 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:59,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-04 17:45:59,758 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:45:59,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:45:59,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1310729562, now seen corresponding path program 1 times [2024-06-04 17:45:59,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:45:59,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253864040] [2024-06-04 17:45:59,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:45:59,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:45:59,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:46:04,208 INFO 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:04,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:46:04,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253864040] [2024-06-04 17:46:04,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253864040] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:46:04,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:46:04,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:46:04,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608089898] [2024-06-04 17:46:04,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:46:04,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:46:04,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:46:04,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:46:04,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:46:04,328 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:46:04,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 151 transitions, 1422 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:46:04,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:46:04,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:46:04,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:46:04,614 INFO L124 PetriNetUnfolderBase]: 419/744 cut-off events. [2024-06-04 17:46:04,615 INFO L125 PetriNetUnfolderBase]: For 35290/35290 co-relation queries the response was YES. [2024-06-04 17:46:04,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4391 conditions, 744 events. 419/744 cut-off events. For 35290/35290 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3316 event pairs, 60 based on Foata normal form. 1/743 useless extension candidates. Maximal degree in co-relation 4307. Up to 666 conditions per place. [2024-06-04 17:46:04,621 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 144 selfloop transitions, 25 changer transitions 0/171 dead transitions. [2024-06-04 17:46:04,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 171 transitions, 1814 flow [2024-06-04 17:46:04,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:46:04,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:46:04,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 107 transitions. [2024-06-04 17:46:04,622 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.334375 [2024-06-04 17:46:04,622 INFO L175 Difference]: Start difference. First operand has 176 places, 151 transitions, 1422 flow. Second operand 10 states and 107 transitions. [2024-06-04 17:46:04,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 171 transitions, 1814 flow [2024-06-04 17:46:04,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 171 transitions, 1780 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-04 17:46:04,703 INFO L231 Difference]: Finished difference. Result has 178 places, 151 transitions, 1446 flow [2024-06-04 17:46:04,703 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1388, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1446, PETRI_PLACES=178, PETRI_TRANSITIONS=151} [2024-06-04 17:46:04,704 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 147 predicate places. [2024-06-04 17:46:04,705 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 151 transitions, 1446 flow [2024-06-04 17:46:04,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:46:04,705 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:46:04,705 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:04,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-04 17:46:04,713 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:46:04,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:46:04,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1265894214, now seen corresponding path program 2 times [2024-06-04 17:46:04,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:46:04,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315401992] [2024-06-04 17:46:04,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:46:04,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:46:04,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:46:09,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:46:09,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:46:09,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315401992] [2024-06-04 17:46:09,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315401992] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:46:09,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:46:09,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:46:09,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102551816] [2024-06-04 17:46:09,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:46:09,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:46:09,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:46:09,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:46:09,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:46:09,174 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:46:09,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 151 transitions, 1446 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:46:09,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:46:09,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:46:09,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:46:09,474 INFO L124 PetriNetUnfolderBase]: 423/752 cut-off events. [2024-06-04 17:46:09,474 INFO L125 PetriNetUnfolderBase]: For 38156/38156 co-relation queries the response was YES. [2024-06-04 17:46:09,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4466 conditions, 752 events. 423/752 cut-off events. For 38156/38156 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 3374 event pairs, 62 based on Foata normal form. 2/752 useless extension candidates. Maximal degree in co-relation 4381. Up to 677 conditions per place. [2024-06-04 17:46:09,480 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 148 selfloop transitions, 22 changer transitions 0/172 dead transitions. [2024-06-04 17:46:09,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 172 transitions, 1848 flow [2024-06-04 17:46:09,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:46:09,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:46:09,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 106 transitions. [2024-06-04 17:46:09,481 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33125 [2024-06-04 17:46:09,481 INFO L175 Difference]: Start difference. First operand has 178 places, 151 transitions, 1446 flow. Second operand 10 states and 106 transitions. [2024-06-04 17:46:09,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 172 transitions, 1848 flow [2024-06-04 17:46:09,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 172 transitions, 1670 flow, removed 6 selfloop flow, removed 12 redundant places. [2024-06-04 17:46:09,548 INFO L231 Difference]: Finished difference. Result has 176 places, 152 transitions, 1329 flow [2024-06-04 17:46:09,549 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1268, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1329, PETRI_PLACES=176, PETRI_TRANSITIONS=152} [2024-06-04 17:46:09,549 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 145 predicate places. [2024-06-04 17:46:09,549 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 152 transitions, 1329 flow [2024-06-04 17:46:09,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:46:09,549 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:46:09,550 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:09,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-04 17:46:09,550 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:46:09,550 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:46:09,550 INFO L85 PathProgramCache]: Analyzing trace with hash 44462096, now seen corresponding path program 3 times [2024-06-04 17:46:09,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:46:09,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349740316] [2024-06-04 17:46:09,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:46:09,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:46:09,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:46:14,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:46:14,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:46:14,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349740316] [2024-06-04 17:46:14,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349740316] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:46:14,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:46:14,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:46:14,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698019589] [2024-06-04 17:46:14,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:46:14,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:46:14,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:46:14,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:46:14,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:46:14,211 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:46:14,212 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 152 transitions, 1329 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:46:14,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:46:14,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:46:14,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:46:14,537 INFO L124 PetriNetUnfolderBase]: 427/760 cut-off events. [2024-06-04 17:46:14,537 INFO L125 PetriNetUnfolderBase]: For 37784/37784 co-relation queries the response was YES. [2024-06-04 17:46:14,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4371 conditions, 760 events. 427/760 cut-off events. For 37784/37784 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3429 event pairs, 62 based on Foata normal form. 2/760 useless extension candidates. Maximal degree in co-relation 4285. Up to 669 conditions per place. [2024-06-04 17:46:14,547 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 149 selfloop transitions, 22 changer transitions 0/173 dead transitions. [2024-06-04 17:46:14,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 173 transitions, 1733 flow [2024-06-04 17:46:14,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:46:14,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:46:14,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 107 transitions. [2024-06-04 17:46:14,548 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.334375 [2024-06-04 17:46:14,548 INFO L175 Difference]: Start difference. First operand has 176 places, 152 transitions, 1329 flow. Second operand 10 states and 107 transitions. [2024-06-04 17:46:14,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 173 transitions, 1733 flow [2024-06-04 17:46:14,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 173 transitions, 1684 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-04 17:46:14,625 INFO L231 Difference]: Finished difference. Result has 178 places, 153 transitions, 1342 flow [2024-06-04 17:46:14,625 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1280, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1342, PETRI_PLACES=178, PETRI_TRANSITIONS=153} [2024-06-04 17:46:14,625 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 147 predicate places. [2024-06-04 17:46:14,625 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 153 transitions, 1342 flow [2024-06-04 17:46:14,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:46:14,626 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:46:14,626 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:14,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-04 17:46:14,626 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:46:14,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:46:14,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1266014184, now seen corresponding path program 4 times [2024-06-04 17:46:14,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:46:14,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115294161] [2024-06-04 17:46:14,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:46:14,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:46:14,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:46:18,915 INFO 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,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:46:18,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115294161] [2024-06-04 17:46:18,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115294161] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:46:18,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:46:18,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:46:18,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39331071] [2024-06-04 17:46:18,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:46:18,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:46:18,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:46:18,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:46:18,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:46:19,055 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:46:19,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 153 transitions, 1342 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:46:19,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:46:19,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:46:19,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:46:19,362 INFO L124 PetriNetUnfolderBase]: 431/768 cut-off events. [2024-06-04 17:46:19,363 INFO L125 PetriNetUnfolderBase]: For 39250/39250 co-relation queries the response was YES. [2024-06-04 17:46:19,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4432 conditions, 768 events. 431/768 cut-off events. For 39250/39250 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3491 event pairs, 64 based on Foata normal form. 2/768 useless extension candidates. Maximal degree in co-relation 4345. Up to 653 conditions per place. [2024-06-04 17:46:19,369 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 150 selfloop transitions, 22 changer transitions 0/174 dead transitions. [2024-06-04 17:46:19,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 174 transitions, 1748 flow [2024-06-04 17:46:19,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:46:19,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:46:19,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 108 transitions. [2024-06-04 17:46:19,378 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3375 [2024-06-04 17:46:19,378 INFO L175 Difference]: Start difference. First operand has 178 places, 153 transitions, 1342 flow. Second operand 10 states and 108 transitions. [2024-06-04 17:46:19,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 174 transitions, 1748 flow [2024-06-04 17:46:19,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 174 transitions, 1696 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-04 17:46:19,446 INFO L231 Difference]: Finished difference. Result has 180 places, 154 transitions, 1354 flow [2024-06-04 17:46:19,447 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1290, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1354, PETRI_PLACES=180, PETRI_TRANSITIONS=154} [2024-06-04 17:46:19,448 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 149 predicate places. [2024-06-04 17:46:19,448 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 154 transitions, 1354 flow [2024-06-04 17:46:19,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:46:19,448 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:46:19,448 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,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-04 17:46:19,448 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:46:19,449 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:46:19,449 INFO L85 PathProgramCache]: Analyzing trace with hash 724348090, now seen corresponding path program 5 times [2024-06-04 17:46:19,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:46:19,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283797748] [2024-06-04 17:46:19,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:46:19,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:46:19,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:46: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:46:24,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:46:24,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283797748] [2024-06-04 17:46:24,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283797748] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:46:24,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:46:24,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:46:24,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6773898] [2024-06-04 17:46:24,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:46:24,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:46:24,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:46:24,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:46:24,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:46:24,190 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:46:24,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 154 transitions, 1354 flow. Second operand has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:46:24,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:46:24,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:46:24,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:46:24,462 INFO L124 PetriNetUnfolderBase]: 435/776 cut-off events. [2024-06-04 17:46:24,463 INFO L125 PetriNetUnfolderBase]: For 40656/40656 co-relation queries the response was YES. [2024-06-04 17:46:24,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4493 conditions, 776 events. 435/776 cut-off events. For 40656/40656 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3548 event pairs, 41 based on Foata normal form. 2/776 useless extension candidates. Maximal degree in co-relation 4405. Up to 593 conditions per place. [2024-06-04 17:46:24,468 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 120 selfloop transitions, 51 changer transitions 0/173 dead transitions. [2024-06-04 17:46:24,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 173 transitions, 1760 flow [2024-06-04 17:46:24,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:46:24,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:46:24,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 113 transitions. [2024-06-04 17:46:24,470 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.353125 [2024-06-04 17:46:24,470 INFO L175 Difference]: Start difference. First operand has 180 places, 154 transitions, 1354 flow. Second operand 10 states and 113 transitions. [2024-06-04 17:46:24,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 173 transitions, 1760 flow [2024-06-04 17:46:24,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 173 transitions, 1706 flow, removed 6 selfloop flow, removed 8 redundant places. [2024-06-04 17:46:24,551 INFO L231 Difference]: Finished difference. Result has 182 places, 155 transitions, 1424 flow [2024-06-04 17:46:24,551 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1300, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1424, PETRI_PLACES=182, PETRI_TRANSITIONS=155} [2024-06-04 17:46:24,552 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 151 predicate places. [2024-06-04 17:46:24,552 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 155 transitions, 1424 flow [2024-06-04 17:46:24,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:46:24,552 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:46:24,552 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:24,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-04 17:46:24,553 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:46:24,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:46:24,553 INFO L85 PathProgramCache]: Analyzing trace with hash 547216570, now seen corresponding path program 6 times [2024-06-04 17:46:24,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:46:24,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108116182] [2024-06-04 17:46:24,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:46:24,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:46:24,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:46:28,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:46:28,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:46:28,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108116182] [2024-06-04 17:46:28,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108116182] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:46:28,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:46:28,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:46:28,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303613773] [2024-06-04 17:46:28,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:46:28,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:46:28,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:46:28,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:46:28,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:46:29,029 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:46:29,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 155 transitions, 1424 flow. Second operand has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:46:29,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:46:29,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:46:29,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:46:29,315 INFO L124 PetriNetUnfolderBase]: 439/784 cut-off events. [2024-06-04 17:46:29,315 INFO L125 PetriNetUnfolderBase]: For 42179/42179 co-relation queries the response was YES. [2024-06-04 17:46:29,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4629 conditions, 784 events. 439/784 cut-off events. For 42179/42179 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3607 event pairs, 47 based on Foata normal form. 2/784 useless extension candidates. Maximal degree in co-relation 4540. Up to 601 conditions per place. [2024-06-04 17:46:29,321 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 127 selfloop transitions, 45 changer transitions 0/174 dead transitions. [2024-06-04 17:46:29,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 174 transitions, 1834 flow [2024-06-04 17:46:29,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:46:29,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:46:29,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 111 transitions. [2024-06-04 17:46:29,323 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.346875 [2024-06-04 17:46:29,323 INFO L175 Difference]: Start difference. First operand has 182 places, 155 transitions, 1424 flow. Second operand 10 states and 111 transitions. [2024-06-04 17:46:29,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 174 transitions, 1834 flow [2024-06-04 17:46:29,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 174 transitions, 1720 flow, removed 7 selfloop flow, removed 8 redundant places. [2024-06-04 17:46:29,403 INFO L231 Difference]: Finished difference. Result has 184 places, 156 transitions, 1424 flow [2024-06-04 17:46:29,404 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1310, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1424, PETRI_PLACES=184, PETRI_TRANSITIONS=156} [2024-06-04 17:46:29,404 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 153 predicate places. [2024-06-04 17:46:29,404 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 156 transitions, 1424 flow [2024-06-04 17:46:29,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:46:29,405 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:46:29,405 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:29,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-04 17:46:29,405 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:46:29,405 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:46:29,405 INFO L85 PathProgramCache]: Analyzing trace with hash 717919000, now seen corresponding path program 7 times [2024-06-04 17:46:29,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:46:29,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244617589] [2024-06-04 17:46:29,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:46:29,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:46:29,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:46:34,148 INFO 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:34,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:46:34,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244617589] [2024-06-04 17:46:34,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244617589] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:46:34,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:46:34,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:46:34,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639391994] [2024-06-04 17:46:34,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:46:34,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:46:34,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:46:34,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:46:34,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:46:34,291 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:46:34,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 156 transitions, 1424 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:46:34,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:46:34,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:46:34,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:46:34,636 INFO L124 PetriNetUnfolderBase]: 443/792 cut-off events. [2024-06-04 17:46:34,636 INFO L125 PetriNetUnfolderBase]: For 43572/43572 co-relation queries the response was YES. [2024-06-04 17:46:34,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4668 conditions, 792 events. 443/792 cut-off events. For 43572/43572 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 3646 event pairs, 43 based on Foata normal form. 2/792 useless extension candidates. Maximal degree in co-relation 4578. Up to 609 conditions per place. [2024-06-04 17:46:34,643 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 125 selfloop transitions, 48 changer transitions 0/175 dead transitions. [2024-06-04 17:46:34,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 175 transitions, 1838 flow [2024-06-04 17:46:34,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:46:34,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:46:34,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 113 transitions. [2024-06-04 17:46:34,649 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.353125 [2024-06-04 17:46:34,649 INFO L175 Difference]: Start difference. First operand has 184 places, 156 transitions, 1424 flow. Second operand 10 states and 113 transitions. [2024-06-04 17:46:34,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 175 transitions, 1838 flow [2024-06-04 17:46:34,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 175 transitions, 1734 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-04 17:46:34,744 INFO L231 Difference]: Finished difference. Result has 186 places, 157 transitions, 1442 flow [2024-06-04 17:46:34,744 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1320, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1442, PETRI_PLACES=186, PETRI_TRANSITIONS=157} [2024-06-04 17:46:34,744 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 155 predicate places. [2024-06-04 17:46:34,744 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 157 transitions, 1442 flow [2024-06-04 17:46:34,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:46:34,745 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:46:34,745 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:46:34,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-04 17:46:34,745 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:46:34,745 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:46:34,745 INFO L85 PathProgramCache]: Analyzing trace with hash 547211920, now seen corresponding path program 8 times [2024-06-04 17:46:34,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:46:34,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463566871] [2024-06-04 17:46:34,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:46:34,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:46:34,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:46:39,209 INFO 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,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:46:39,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463566871] [2024-06-04 17:46:39,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463566871] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:46:39,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:46:39,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:46:39,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591879910] [2024-06-04 17:46:39,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:46:39,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:46:39,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:46:39,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:46:39,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:46:39,334 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:46:39,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 157 transitions, 1442 flow. Second operand has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:46:39,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:46:39,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:46:39,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:46:39,607 INFO L124 PetriNetUnfolderBase]: 447/800 cut-off events. [2024-06-04 17:46:39,607 INFO L125 PetriNetUnfolderBase]: For 45001/45001 co-relation queries the response was YES. [2024-06-04 17:46:39,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4731 conditions, 800 events. 447/800 cut-off events. For 45001/45001 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3714 event pairs, 49 based on Foata normal form. 2/800 useless extension candidates. Maximal degree in co-relation 4640. Up to 603 conditions per place. [2024-06-04 17:46:39,617 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 128 selfloop transitions, 46 changer transitions 0/176 dead transitions. [2024-06-04 17:46:39,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 176 transitions, 1858 flow [2024-06-04 17:46:39,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:46:39,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:46:39,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2024-06-04 17:46:39,619 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35 [2024-06-04 17:46:39,619 INFO L175 Difference]: Start difference. First operand has 186 places, 157 transitions, 1442 flow. Second operand 10 states and 112 transitions. [2024-06-04 17:46:39,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 176 transitions, 1858 flow [2024-06-04 17:46:39,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 176 transitions, 1746 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-06-04 17:46:39,703 INFO L231 Difference]: Finished difference. Result has 188 places, 158 transitions, 1450 flow [2024-06-04 17:46:39,704 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1330, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1450, PETRI_PLACES=188, PETRI_TRANSITIONS=158} [2024-06-04 17:46:39,704 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 157 predicate places. [2024-06-04 17:46:39,704 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 158 transitions, 1450 flow [2024-06-04 17:46:39,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:46:39,704 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:46:39,704 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:39,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-04 17:46:39,705 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:46:39,705 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:46:39,705 INFO L85 PathProgramCache]: Analyzing trace with hash 547096600, now seen corresponding path program 9 times [2024-06-04 17:46:39,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:46:39,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23058275] [2024-06-04 17:46:39,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:46:39,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:46:39,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:46:44,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:46:44,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:46:44,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23058275] [2024-06-04 17:46:44,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23058275] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:46:44,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:46:44,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:46:44,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211866663] [2024-06-04 17:46:44,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:46:44,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:46:44,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:46:44,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:46:44,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:46:44,641 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:46:44,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 158 transitions, 1450 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:46:44,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:46:44,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:46:44,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:46:44,903 INFO L124 PetriNetUnfolderBase]: 451/808 cut-off events. [2024-06-04 17:46:44,903 INFO L125 PetriNetUnfolderBase]: For 46474/46474 co-relation queries the response was YES. [2024-06-04 17:46:44,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4786 conditions, 808 events. 451/808 cut-off events. For 46474/46474 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 3761 event pairs, 53 based on Foata normal form. 2/808 useless extension candidates. Maximal degree in co-relation 4694. Up to 534 conditions per place. [2024-06-04 17:46:44,909 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 126 selfloop transitions, 50 changer transitions 0/178 dead transitions. [2024-06-04 17:46:44,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 178 transitions, 2000 flow [2024-06-04 17:46:44,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:46:44,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:46:44,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2024-06-04 17:46:44,911 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35 [2024-06-04 17:46:44,911 INFO L175 Difference]: Start difference. First operand has 188 places, 158 transitions, 1450 flow. Second operand 10 states and 112 transitions. [2024-06-04 17:46:44,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 178 transitions, 2000 flow [2024-06-04 17:46:45,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 178 transitions, 1890 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-06-04 17:46:45,005 INFO L231 Difference]: Finished difference. Result has 190 places, 159 transitions, 1468 flow [2024-06-04 17:46:45,005 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1340, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1468, PETRI_PLACES=190, PETRI_TRANSITIONS=159} [2024-06-04 17:46:45,005 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 159 predicate places. [2024-06-04 17:46:45,005 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 159 transitions, 1468 flow [2024-06-04 17:46:45,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:46:45,006 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:46:45,006 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:45,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-04 17:46:45,006 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:46:45,006 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:46:45,006 INFO L85 PathProgramCache]: Analyzing trace with hash 717914350, now seen corresponding path program 10 times [2024-06-04 17:46:45,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:46:45,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745701078] [2024-06-04 17:46:45,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:46:45,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:46:45,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:46:49,549 INFO 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:49,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:46:49,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745701078] [2024-06-04 17:46:49,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745701078] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:46:49,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:46:49,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:46:49,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069704317] [2024-06-04 17:46:49,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:46:49,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:46:49,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:46:49,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:46:49,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:46:49,692 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:46:49,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 159 transitions, 1468 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:46:49,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:46:49,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:46:49,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:46:49,999 INFO L124 PetriNetUnfolderBase]: 455/816 cut-off events. [2024-06-04 17:46:49,999 INFO L125 PetriNetUnfolderBase]: For 48106/48106 co-relation queries the response was YES. [2024-06-04 17:46:50,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4857 conditions, 816 events. 455/816 cut-off events. For 48106/48106 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 3823 event pairs, 47 based on Foata normal form. 2/816 useless extension candidates. Maximal degree in co-relation 4764. Up to 613 conditions per place. [2024-06-04 17:46:50,006 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 126 selfloop transitions, 50 changer transitions 0/178 dead transitions. [2024-06-04 17:46:50,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 178 transitions, 1892 flow [2024-06-04 17:46:50,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:46:50,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:46:50,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 113 transitions. [2024-06-04 17:46:50,007 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.353125 [2024-06-04 17:46:50,007 INFO L175 Difference]: Start difference. First operand has 190 places, 159 transitions, 1468 flow. Second operand 10 states and 113 transitions. [2024-06-04 17:46:50,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 178 transitions, 1892 flow [2024-06-04 17:46:50,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 178 transitions, 1734 flow, removed 17 selfloop flow, removed 9 redundant places. [2024-06-04 17:46:50,105 INFO L231 Difference]: Finished difference. Result has 191 places, 160 transitions, 1442 flow [2024-06-04 17:46:50,106 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1317, PETRI_DIFFERENCE_MINUEND_PLACES=181, 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=10, PETRI_FLOW=1442, PETRI_PLACES=191, PETRI_TRANSITIONS=160} [2024-06-04 17:46:50,106 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 160 predicate places. [2024-06-04 17:46:50,106 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 160 transitions, 1442 flow [2024-06-04 17:46:50,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:46:50,106 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:46:50,106 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:50,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-04 17:46:50,107 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:46:50,107 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:46:50,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1684820302, now seen corresponding path program 1 times [2024-06-04 17:46:50,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:46:50,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047963542] [2024-06-04 17:46:50,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:46:50,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:46:50,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:46:54,980 INFO 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:54,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:46:54,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047963542] [2024-06-04 17:46:54,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047963542] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:46:54,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:46:54,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:46:54,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757453300] [2024-06-04 17:46:54,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:46:54,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:46:54,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:46:54,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:46:54,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:46:55,175 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:46:55,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 160 transitions, 1442 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:46:55,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:46:55,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:46:55,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:46:55,510 INFO L124 PetriNetUnfolderBase]: 459/824 cut-off events. [2024-06-04 17:46:55,511 INFO L125 PetriNetUnfolderBase]: For 49122/49122 co-relation queries the response was YES. [2024-06-04 17:46:55,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4780 conditions, 824 events. 459/824 cut-off events. For 49122/49122 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 3865 event pairs, 52 based on Foata normal form. 2/824 useless extension candidates. Maximal degree in co-relation 4688. Up to 494 conditions per place. [2024-06-04 17:46:55,517 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 98 selfloop transitions, 85 changer transitions 0/185 dead transitions. [2024-06-04 17:46:55,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 185 transitions, 2018 flow [2024-06-04 17:46:55,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-04 17:46:55,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-04 17:46:55,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 146 transitions. [2024-06-04 17:46:55,518 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35096153846153844 [2024-06-04 17:46:55,518 INFO L175 Difference]: Start difference. First operand has 191 places, 160 transitions, 1442 flow. Second operand 13 states and 146 transitions. [2024-06-04 17:46:55,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 185 transitions, 2018 flow [2024-06-04 17:46:55,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 185 transitions, 1889 flow, removed 10 selfloop flow, removed 9 redundant places. [2024-06-04 17:46:55,617 INFO L231 Difference]: Finished difference. Result has 195 places, 161 transitions, 1503 flow [2024-06-04 17:46:55,617 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1315, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1503, PETRI_PLACES=195, PETRI_TRANSITIONS=161} [2024-06-04 17:46:55,617 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 164 predicate places. [2024-06-04 17:46:55,617 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 161 transitions, 1503 flow [2024-06-04 17:46:55,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:46:55,618 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:46:55,618 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:55,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-04 17:46:55,618 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:46:55,618 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:46:55,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1348300724, now seen corresponding path program 11 times [2024-06-04 17:46:55,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:46:55,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482285294] [2024-06-04 17:46:55,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:46:55,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:46:55,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:47:00,122 INFO 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,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:47:00,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482285294] [2024-06-04 17:47:00,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482285294] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:47:00,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:47:00,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:47:00,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957418925] [2024-06-04 17:47:00,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:47:00,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:47:00,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:47:00,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:47:00,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:47:00,251 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:47:00,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 161 transitions, 1503 flow. Second operand has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:47:00,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:47:00,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:47:00,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:47:00,540 INFO L124 PetriNetUnfolderBase]: 463/832 cut-off events. [2024-06-04 17:47:00,540 INFO L125 PetriNetUnfolderBase]: For 50720/50720 co-relation queries the response was YES. [2024-06-04 17:47:00,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4896 conditions, 832 events. 463/832 cut-off events. For 50720/50720 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 3920 event pairs, 57 based on Foata normal form. 2/832 useless extension candidates. Maximal degree in co-relation 4804. Up to 622 conditions per place. [2024-06-04 17:47:00,546 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 131 selfloop transitions, 47 changer transitions 0/180 dead transitions. [2024-06-04 17:47:00,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 180 transitions, 2058 flow [2024-06-04 17:47:00,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:47:00,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:47:00,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 114 transitions. [2024-06-04 17:47:00,547 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35625 [2024-06-04 17:47:00,547 INFO L175 Difference]: Start difference. First operand has 195 places, 161 transitions, 1503 flow. Second operand 10 states and 114 transitions. [2024-06-04 17:47:00,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 180 transitions, 2058 flow [2024-06-04 17:47:00,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 180 transitions, 1934 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-04 17:47:00,633 INFO L231 Difference]: Finished difference. Result has 197 places, 162 transitions, 1498 flow [2024-06-04 17:47:00,633 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1379, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1498, PETRI_PLACES=197, PETRI_TRANSITIONS=162} [2024-06-04 17:47:00,635 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 166 predicate places. [2024-06-04 17:47:00,635 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 162 transitions, 1498 flow [2024-06-04 17:47:00,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:47:00,636 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:47:00,636 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:47:00,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-04 17:47:00,636 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:47:00,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:47:00,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1980285766, now seen corresponding path program 12 times [2024-06-04 17:47:00,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:47:00,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877021641] [2024-06-04 17:47:00,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:47:00,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:47:00,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:47:05,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:47:05,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:47:05,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877021641] [2024-06-04 17:47:05,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877021641] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:47:05,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:47:05,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:47:05,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934058422] [2024-06-04 17:47:05,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:47:05,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:47:05,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:47:05,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:47:05,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:47:05,680 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:47:05,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 162 transitions, 1498 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:47:05,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:47:05,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:47:05,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:47:06,026 INFO L124 PetriNetUnfolderBase]: 467/840 cut-off events. [2024-06-04 17:47:06,027 INFO L125 PetriNetUnfolderBase]: For 52550/52550 co-relation queries the response was YES. [2024-06-04 17:47:06,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4900 conditions, 840 events. 467/840 cut-off events. For 52550/52550 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 3997 event pairs, 49 based on Foata normal form. 2/840 useless extension candidates. Maximal degree in co-relation 4807. Up to 657 conditions per place. [2024-06-04 17:47:06,033 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 129 selfloop transitions, 51 changer transitions 0/182 dead transitions. [2024-06-04 17:47:06,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 182 transitions, 1931 flow [2024-06-04 17:47:06,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:47:06,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:47:06,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 121 transitions. [2024-06-04 17:47:06,034 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34375 [2024-06-04 17:47:06,034 INFO L175 Difference]: Start difference. First operand has 197 places, 162 transitions, 1498 flow. Second operand 11 states and 121 transitions. [2024-06-04 17:47:06,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 182 transitions, 1931 flow [2024-06-04 17:47:06,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 182 transitions, 1807 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-06-04 17:47:06,139 INFO L231 Difference]: Finished difference. Result has 200 places, 163 transitions, 1505 flow [2024-06-04 17:47:06,140 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1376, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1505, PETRI_PLACES=200, PETRI_TRANSITIONS=163} [2024-06-04 17:47:06,140 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 169 predicate places. [2024-06-04 17:47:06,140 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 163 transitions, 1505 flow [2024-06-04 17:47:06,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:47:06,140 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:47:06,141 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:47:06,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-04 17:47:06,141 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:47:06,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:47:06,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1980278822, now seen corresponding path program 1 times [2024-06-04 17:47:06,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:47:06,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530635971] [2024-06-04 17:47:06,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:47:06,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:47:06,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:47:10,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:47:10,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:47:10,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530635971] [2024-06-04 17:47:10,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530635971] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:47:10,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:47:10,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:47:10,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109181621] [2024-06-04 17:47:10,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:47:10,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:47:10,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:47:10,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:47:10,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:47:10,708 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:47:10,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 163 transitions, 1505 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:47:10,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:47:10,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:47:10,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:47:11,078 INFO L124 PetriNetUnfolderBase]: 463/834 cut-off events. [2024-06-04 17:47:11,079 INFO L125 PetriNetUnfolderBase]: For 48966/48966 co-relation queries the response was YES. [2024-06-04 17:47:11,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4727 conditions, 834 events. 463/834 cut-off events. For 48966/48966 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 3952 event pairs, 54 based on Foata normal form. 2/834 useless extension candidates. Maximal degree in co-relation 4633. Up to 544 conditions per place. [2024-06-04 17:47:11,085 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 108 selfloop transitions, 73 changer transitions 0/183 dead transitions. [2024-06-04 17:47:11,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 183 transitions, 1923 flow [2024-06-04 17:47:11,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:47:11,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:47:11,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 129 transitions. [2024-06-04 17:47:11,087 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3664772727272727 [2024-06-04 17:47:11,087 INFO L175 Difference]: Start difference. First operand has 200 places, 163 transitions, 1505 flow. Second operand 11 states and 129 transitions. [2024-06-04 17:47:11,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 183 transitions, 1923 flow [2024-06-04 17:47:11,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 183 transitions, 1797 flow, removed 13 selfloop flow, removed 9 redundant places. [2024-06-04 17:47:11,185 INFO L231 Difference]: Finished difference. Result has 202 places, 163 transitions, 1534 flow [2024-06-04 17:47:11,185 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1379, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1534, PETRI_PLACES=202, PETRI_TRANSITIONS=163} [2024-06-04 17:47:11,185 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 171 predicate places. [2024-06-04 17:47:11,186 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 163 transitions, 1534 flow [2024-06-04 17:47:11,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:47:11,186 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:47:11,186 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:47:11,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-04 17:47:11,186 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:47:11,187 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:47:11,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1684464112, now seen corresponding path program 2 times [2024-06-04 17:47:11,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:47:11,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568164127] [2024-06-04 17:47:11,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:47:11,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:47:11,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:47:16,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:47:16,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:47:16,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568164127] [2024-06-04 17:47:16,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568164127] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:47:16,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:47:16,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:47:16,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116781895] [2024-06-04 17:47:16,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:47:16,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:47:16,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:47:16,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:47:16,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:47:16,488 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:47:16,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 163 transitions, 1534 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:47:16,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:47:16,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:47:16,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:47:16,865 INFO L124 PetriNetUnfolderBase]: 503/914 cut-off events. [2024-06-04 17:47:16,865 INFO L125 PetriNetUnfolderBase]: For 79778/79778 co-relation queries the response was YES. [2024-06-04 17:47:16,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5866 conditions, 914 events. 503/914 cut-off events. For 79778/79778 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4433 event pairs, 66 based on Foata normal form. 2/914 useless extension candidates. Maximal degree in co-relation 5771. Up to 481 conditions per place. [2024-06-04 17:47:16,873 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 105 selfloop transitions, 88 changer transitions 0/195 dead transitions. [2024-06-04 17:47:16,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 195 transitions, 2318 flow [2024-06-04 17:47:16,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-04 17:47:16,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-04 17:47:16,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 151 transitions. [2024-06-04 17:47:16,874 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3629807692307692 [2024-06-04 17:47:16,874 INFO L175 Difference]: Start difference. First operand has 202 places, 163 transitions, 1534 flow. Second operand 13 states and 151 transitions. [2024-06-04 17:47:16,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 195 transitions, 2318 flow [2024-06-04 17:47:17,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 195 transitions, 2106 flow, removed 1 selfloop flow, removed 12 redundant places. [2024-06-04 17:47:17,012 INFO L231 Difference]: Finished difference. Result has 203 places, 165 transitions, 1532 flow [2024-06-04 17:47:17,012 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1322, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1532, PETRI_PLACES=203, PETRI_TRANSITIONS=165} [2024-06-04 17:47:17,012 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 172 predicate places. [2024-06-04 17:47:17,012 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 165 transitions, 1532 flow [2024-06-04 17:47:17,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:47:17,013 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:47:17,013 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:47:17,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-04 17:47:17,013 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:47:17,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:47:17,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1980039502, now seen corresponding path program 3 times [2024-06-04 17:47:17,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:47:17,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442373357] [2024-06-04 17:47:17,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:47:17,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:47:17,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:47:21,833 INFO 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:21,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:47:21,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442373357] [2024-06-04 17:47:21,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442373357] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:47:21,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:47:21,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:47:21,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272188041] [2024-06-04 17:47:21,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:47:21,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:47:21,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:47:21,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:47:21,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:47:21,973 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:47:21,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 165 transitions, 1532 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:47:21,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:47:21,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:47:21,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:47:22,393 INFO L124 PetriNetUnfolderBase]: 523/958 cut-off events. [2024-06-04 17:47:22,394 INFO L125 PetriNetUnfolderBase]: For 106887/106887 co-relation queries the response was YES. [2024-06-04 17:47:22,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6074 conditions, 958 events. 523/958 cut-off events. For 106887/106887 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 4740 event pairs, 78 based on Foata normal form. 12/968 useless extension candidates. Maximal degree in co-relation 5978. Up to 620 conditions per place. [2024-06-04 17:47:22,401 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 111 selfloop transitions, 70 changer transitions 9/192 dead transitions. [2024-06-04 17:47:22,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 192 transitions, 2010 flow [2024-06-04 17:47:22,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 17:47:22,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 17:47:22,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 141 transitions. [2024-06-04 17:47:22,402 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3671875 [2024-06-04 17:47:22,402 INFO L175 Difference]: Start difference. First operand has 203 places, 165 transitions, 1532 flow. Second operand 12 states and 141 transitions. [2024-06-04 17:47:22,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 192 transitions, 2010 flow [2024-06-04 17:47:22,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 192 transitions, 1875 flow, removed 8 selfloop flow, removed 9 redundant places. [2024-06-04 17:47:22,546 INFO L231 Difference]: Finished difference. Result has 206 places, 162 transitions, 1525 flow [2024-06-04 17:47:22,546 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1397, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1525, PETRI_PLACES=206, PETRI_TRANSITIONS=162} [2024-06-04 17:47:22,547 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 175 predicate places. [2024-06-04 17:47:22,547 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 162 transitions, 1525 flow [2024-06-04 17:47:22,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:47:22,547 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:47:22,547 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:47:22,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-04 17:47:22,547 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:47:22,548 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:47:22,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1694939632, now seen corresponding path program 4 times [2024-06-04 17:47:22,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:47:22,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291167995] [2024-06-04 17:47:22,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:47:22,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:47:22,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:47:27,533 INFO 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:27,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:47:27,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291167995] [2024-06-04 17:47:27,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291167995] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:47:27,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:47:27,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:47:27,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261909322] [2024-06-04 17:47:27,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:47:27,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:47:27,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:47:27,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:47:27,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:47:27,654 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:47:27,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 162 transitions, 1525 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:47:27,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:47:27,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:47:27,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:47:28,135 INFO L124 PetriNetUnfolderBase]: 502/929 cut-off events. [2024-06-04 17:47:28,135 INFO L125 PetriNetUnfolderBase]: For 104343/104343 co-relation queries the response was YES. [2024-06-04 17:47:28,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5718 conditions, 929 events. 502/929 cut-off events. For 104343/104343 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4610 event pairs, 77 based on Foata normal form. 14/941 useless extension candidates. Maximal degree in co-relation 5620. Up to 595 conditions per place. [2024-06-04 17:47:28,142 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 105 selfloop transitions, 73 changer transitions 8/188 dead transitions. [2024-06-04 17:47:28,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 188 transitions, 1979 flow [2024-06-04 17:47:28,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 17:47:28,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 17:47:28,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 141 transitions. [2024-06-04 17:47:28,143 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3671875 [2024-06-04 17:47:28,143 INFO L175 Difference]: Start difference. First operand has 206 places, 162 transitions, 1525 flow. Second operand 12 states and 141 transitions. [2024-06-04 17:47:28,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 188 transitions, 1979 flow [2024-06-04 17:47:28,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 188 transitions, 1809 flow, removed 13 selfloop flow, removed 12 redundant places. [2024-06-04 17:47:28,265 INFO L231 Difference]: Finished difference. Result has 207 places, 159 transitions, 1483 flow [2024-06-04 17:47:28,265 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1355, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1483, PETRI_PLACES=207, PETRI_TRANSITIONS=159} [2024-06-04 17:47:28,266 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 176 predicate places. [2024-06-04 17:47:28,266 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 159 transitions, 1483 flow [2024-06-04 17:47:28,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:47:28,266 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:47:28,266 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:47:28,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-04 17:47:28,266 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:47:28,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:47:28,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1348296074, now seen corresponding path program 13 times [2024-06-04 17:47:28,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:47:28,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463530150] [2024-06-04 17:47:28,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:47:28,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:47:28,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:47:32,544 INFO 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:32,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:47:32,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463530150] [2024-06-04 17:47:32,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463530150] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:47:32,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:47:32,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:47:32,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419273345] [2024-06-04 17:47:32,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:47:32,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:47:32,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:47:32,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:47:32,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:47:32,629 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:47:32,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 159 transitions, 1483 flow. Second operand has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:47:32,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:47:32,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:47:32,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:47:32,918 INFO L124 PetriNetUnfolderBase]: 480/887 cut-off events. [2024-06-04 17:47:32,919 INFO L125 PetriNetUnfolderBase]: For 76002/76002 co-relation queries the response was YES. [2024-06-04 17:47:32,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5603 conditions, 887 events. 480/887 cut-off events. For 76002/76002 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4373 event pairs, 75 based on Foata normal form. 2/887 useless extension candidates. Maximal degree in co-relation 5504. Up to 704 conditions per place. [2024-06-04 17:47:32,926 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 130 selfloop transitions, 45 changer transitions 0/177 dead transitions. [2024-06-04 17:47:32,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 177 transitions, 1900 flow [2024-06-04 17:47:32,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:47:32,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:47:32,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2024-06-04 17:47:32,927 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35 [2024-06-04 17:47:32,927 INFO L175 Difference]: Start difference. First operand has 207 places, 159 transitions, 1483 flow. Second operand 10 states and 112 transitions. [2024-06-04 17:47:32,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 177 transitions, 1900 flow [2024-06-04 17:47:33,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 177 transitions, 1712 flow, removed 5 selfloop flow, removed 14 redundant places. [2024-06-04 17:47:33,041 INFO L231 Difference]: Finished difference. Result has 203 places, 160 transitions, 1414 flow [2024-06-04 17:47:33,041 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1295, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1414, PETRI_PLACES=203, PETRI_TRANSITIONS=160} [2024-06-04 17:47:33,041 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 172 predicate places. [2024-06-04 17:47:33,042 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 160 transitions, 1414 flow [2024-06-04 17:47:33,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:47:33,042 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:47:33,042 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:47:33,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-04 17:47:33,042 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:47:33,042 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:47:33,043 INFO L85 PathProgramCache]: Analyzing trace with hash -591323550, now seen corresponding path program 14 times [2024-06-04 17:47:33,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:47:33,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076281470] [2024-06-04 17:47:33,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:47:33,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:47:33,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:47:37,608 INFO 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:37,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:47:37,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076281470] [2024-06-04 17:47:37,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076281470] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:47:37,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:47:37,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:47:37,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748396231] [2024-06-04 17:47:37,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:47:37,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:47:37,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:47:37,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:47:37,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:47:37,691 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:47:37,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 160 transitions, 1414 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:47:37,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:47:37,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:47:37,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:47:38,017 INFO L124 PetriNetUnfolderBase]: 477/882 cut-off events. [2024-06-04 17:47:38,017 INFO L125 PetriNetUnfolderBase]: For 70597/70597 co-relation queries the response was YES. [2024-06-04 17:47:38,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5295 conditions, 882 events. 477/882 cut-off events. For 70597/70597 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4351 event pairs, 74 based on Foata normal form. 2/882 useless extension candidates. Maximal degree in co-relation 5196. Up to 699 conditions per place. [2024-06-04 17:47:38,024 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 132 selfloop transitions, 44 changer transitions 0/178 dead transitions. [2024-06-04 17:47:38,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 178 transitions, 1814 flow [2024-06-04 17:47:38,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:47:38,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:47:38,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 113 transitions. [2024-06-04 17:47:38,026 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.353125 [2024-06-04 17:47:38,026 INFO L175 Difference]: Start difference. First operand has 203 places, 160 transitions, 1414 flow. Second operand 10 states and 113 transitions. [2024-06-04 17:47:38,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 178 transitions, 1814 flow [2024-06-04 17:47:38,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 178 transitions, 1688 flow, removed 19 selfloop flow, removed 8 redundant places. [2024-06-04 17:47:38,146 INFO L231 Difference]: Finished difference. Result has 205 places, 160 transitions, 1380 flow [2024-06-04 17:47:38,146 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1288, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1380, PETRI_PLACES=205, PETRI_TRANSITIONS=160} [2024-06-04 17:47:38,147 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 174 predicate places. [2024-06-04 17:47:38,147 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 160 transitions, 1380 flow [2024-06-04 17:47:38,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:47:38,147 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:47:38,147 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:47:38,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-04 17:47:38,147 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:47:38,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:47:38,148 INFO L85 PathProgramCache]: Analyzing trace with hash -591077286, now seen corresponding path program 5 times [2024-06-04 17:47:38,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:47:38,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400697401] [2024-06-04 17:47:38,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:47:38,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:47:38,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:47:42,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:47:42,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:47:42,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400697401] [2024-06-04 17:47:42,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400697401] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:47:42,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:47:42,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:47:42,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652003431] [2024-06-04 17:47:42,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:47:42,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:47:42,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:47:42,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:47:42,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:47:43,064 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:47:43,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 160 transitions, 1380 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:47:43,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:47:43,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:47:43,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:47:43,369 INFO L124 PetriNetUnfolderBase]: 474/877 cut-off events. [2024-06-04 17:47:43,369 INFO L125 PetriNetUnfolderBase]: For 66506/66506 co-relation queries the response was YES. [2024-06-04 17:47:43,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5072 conditions, 877 events. 474/877 cut-off events. For 66506/66506 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4335 event pairs, 91 based on Foata normal form. 2/877 useless extension candidates. Maximal degree in co-relation 4972. Up to 803 conditions per place. [2024-06-04 17:47:43,376 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 144 selfloop transitions, 30 changer transitions 0/176 dead transitions. [2024-06-04 17:47:43,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 176 transitions, 1768 flow [2024-06-04 17:47:43,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:47:43,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:47:43,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 114 transitions. [2024-06-04 17:47:43,377 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32386363636363635 [2024-06-04 17:47:43,377 INFO L175 Difference]: Start difference. First operand has 205 places, 160 transitions, 1380 flow. Second operand 11 states and 114 transitions. [2024-06-04 17:47:43,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 176 transitions, 1768 flow [2024-06-04 17:47:43,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 176 transitions, 1630 flow, removed 2 selfloop flow, removed 10 redundant places. [2024-06-04 17:47:43,492 INFO L231 Difference]: Finished difference. Result has 207 places, 161 transitions, 1317 flow [2024-06-04 17:47:43,492 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1242, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1317, PETRI_PLACES=207, PETRI_TRANSITIONS=161} [2024-06-04 17:47:43,492 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 176 predicate places. [2024-06-04 17:47:43,493 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 161 transitions, 1317 flow [2024-06-04 17:47:43,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:47:43,493 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:47:43,493 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:43,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-04 17:47:43,493 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:47:43,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:47:43,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1902368654, now seen corresponding path program 1 times [2024-06-04 17:47:43,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:47:43,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847599009] [2024-06-04 17:47:43,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:47:43,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:47:43,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:47:47,879 INFO 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,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:47:47,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847599009] [2024-06-04 17:47:47,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847599009] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:47:47,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:47:47,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:47:47,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758790512] [2024-06-04 17:47:47,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:47:47,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:47:47,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:47:47,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:47:47,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:47:48,053 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:47:48,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 161 transitions, 1317 flow. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:47:48,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:47:48,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:47:48,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:47:48,355 INFO L124 PetriNetUnfolderBase]: 478/885 cut-off events. [2024-06-04 17:47:48,356 INFO L125 PetriNetUnfolderBase]: For 68037/68037 co-relation queries the response was YES. [2024-06-04 17:47:48,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5018 conditions, 885 events. 478/885 cut-off events. For 68037/68037 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 4393 event pairs, 74 based on Foata normal form. 2/885 useless extension candidates. Maximal degree in co-relation 4916. Up to 799 conditions per place. [2024-06-04 17:47:48,363 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 168 selfloop transitions, 14 changer transitions 0/184 dead transitions. [2024-06-04 17:47:48,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 184 transitions, 1737 flow [2024-06-04 17:47:48,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:47:48,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:47:48,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 110 transitions. [2024-06-04 17:47:48,364 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3125 [2024-06-04 17:47:48,364 INFO L175 Difference]: Start difference. First operand has 207 places, 161 transitions, 1317 flow. Second operand 11 states and 110 transitions. [2024-06-04 17:47:48,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 184 transitions, 1737 flow [2024-06-04 17:47:48,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 184 transitions, 1581 flow, removed 8 selfloop flow, removed 10 redundant places. [2024-06-04 17:47:48,497 INFO L231 Difference]: Finished difference. Result has 208 places, 162 transitions, 1201 flow [2024-06-04 17:47:48,498 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1161, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1201, PETRI_PLACES=208, PETRI_TRANSITIONS=162} [2024-06-04 17:47:48,498 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 177 predicate places. [2024-06-04 17:47:48,498 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 162 transitions, 1201 flow [2024-06-04 17:47:48,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:47:48,498 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:47:48,498 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:48,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-04 17:47:48,499 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:47:48,499 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:47:48,499 INFO L85 PathProgramCache]: Analyzing trace with hash -591732692, now seen corresponding path program 2 times [2024-06-04 17:47:48,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:47:48,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938780979] [2024-06-04 17:47:48,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:47:48,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:47:48,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:47:53,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:47:53,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:47:53,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938780979] [2024-06-04 17:47:53,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938780979] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:47:53,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:47:53,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:47:53,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38797453] [2024-06-04 17:47:53,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:47:53,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:47:53,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:47:53,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:47:53,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:47:53,227 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:47:53,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 162 transitions, 1201 flow. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:47:53,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:47:53,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:47:53,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:47:53,588 INFO L124 PetriNetUnfolderBase]: 460/847 cut-off events. [2024-06-04 17:47:53,589 INFO L125 PetriNetUnfolderBase]: For 46524/46524 co-relation queries the response was YES. [2024-06-04 17:47:53,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4127 conditions, 847 events. 460/847 cut-off events. For 46524/46524 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 4211 event pairs, 69 based on Foata normal form. 2/847 useless extension candidates. Maximal degree in co-relation 4026. Up to 694 conditions per place. [2024-06-04 17:47:53,595 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 161 selfloop transitions, 24 changer transitions 0/187 dead transitions. [2024-06-04 17:47:53,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 187 transitions, 1793 flow [2024-06-04 17:47:53,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:47:53,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:47:53,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 119 transitions. [2024-06-04 17:47:53,597 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3380681818181818 [2024-06-04 17:47:53,597 INFO L175 Difference]: Start difference. First operand has 208 places, 162 transitions, 1201 flow. Second operand 11 states and 119 transitions. [2024-06-04 17:47:53,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 187 transitions, 1793 flow [2024-06-04 17:47:53,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 187 transitions, 1741 flow, removed 5 selfloop flow, removed 10 redundant places. [2024-06-04 17:47:53,703 INFO L231 Difference]: Finished difference. Result has 209 places, 164 transitions, 1219 flow [2024-06-04 17:47:53,704 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1219, PETRI_PLACES=209, PETRI_TRANSITIONS=164} [2024-06-04 17:47:53,704 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 178 predicate places. [2024-06-04 17:47:53,704 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 164 transitions, 1219 flow [2024-06-04 17:47:53,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:47:53,704 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:47:53,704 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:53,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-04 17:47:53,705 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:47:53,705 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:47:53,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1977906340, now seen corresponding path program 3 times [2024-06-04 17:47:53,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:47:53,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038391041] [2024-06-04 17:47:53,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:47:53,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:47:53,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:47:58,026 INFO 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:58,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:47:58,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038391041] [2024-06-04 17:47:58,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038391041] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:47:58,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:47:58,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:47:58,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843339494] [2024-06-04 17:47:58,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:47:58,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:47:58,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:47:58,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:47:58,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:47:58,156 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:47:58,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 164 transitions, 1219 flow. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:47:58,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:47:58,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:47:58,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:47:58,486 INFO L124 PetriNetUnfolderBase]: 471/868 cut-off events. [2024-06-04 17:47:58,486 INFO L125 PetriNetUnfolderBase]: For 53734/53734 co-relation queries the response was YES. [2024-06-04 17:47:58,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4344 conditions, 868 events. 471/868 cut-off events. For 53734/53734 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 4329 event pairs, 70 based on Foata normal form. 2/868 useless extension candidates. Maximal degree in co-relation 4243. Up to 763 conditions per place. [2024-06-04 17:47:58,495 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 161 selfloop transitions, 26 changer transitions 0/189 dead transitions. [2024-06-04 17:47:58,495 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 189 transitions, 1821 flow [2024-06-04 17:47:58,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:47:58,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:47:58,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 117 transitions. [2024-06-04 17:47:58,496 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33238636363636365 [2024-06-04 17:47:58,496 INFO L175 Difference]: Start difference. First operand has 209 places, 164 transitions, 1219 flow. Second operand 11 states and 117 transitions. [2024-06-04 17:47:58,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 189 transitions, 1821 flow [2024-06-04 17:47:58,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 189 transitions, 1783 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-04 17:47:58,612 INFO L231 Difference]: Finished difference. Result has 213 places, 166 transitions, 1255 flow [2024-06-04 17:47:58,612 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1185, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1255, PETRI_PLACES=213, PETRI_TRANSITIONS=166} [2024-06-04 17:47:58,613 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 182 predicate places. [2024-06-04 17:47:58,613 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 166 transitions, 1255 flow [2024-06-04 17:47:58,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:47:58,613 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:47:58,613 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:58,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-04 17:47:58,613 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:47:58,614 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:47:58,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1977762190, now seen corresponding path program 4 times [2024-06-04 17:47:58,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:47:58,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934260750] [2024-06-04 17:47:58,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:47:58,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:47:58,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:48:03,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:48:03,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:48:03,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934260750] [2024-06-04 17:48:03,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934260750] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:48:03,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:48:03,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:48:03,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622445452] [2024-06-04 17:48:03,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:48:03,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:48:03,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:48:03,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:48:03,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:48:03,273 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:48:03,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 166 transitions, 1255 flow. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:48:03,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:48:03,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:48:03,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:48:03,589 INFO L124 PetriNetUnfolderBase]: 468/863 cut-off events. [2024-06-04 17:48:03,590 INFO L125 PetriNetUnfolderBase]: For 49098/49098 co-relation queries the response was YES. [2024-06-04 17:48:03,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4225 conditions, 863 events. 468/863 cut-off events. For 49098/49098 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 4310 event pairs, 67 based on Foata normal form. 2/863 useless extension candidates. Maximal degree in co-relation 4122. Up to 734 conditions per place. [2024-06-04 17:48:03,597 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 161 selfloop transitions, 26 changer transitions 0/189 dead transitions. [2024-06-04 17:48:03,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 189 transitions, 1841 flow [2024-06-04 17:48:03,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:48:03,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:48:03,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 118 transitions. [2024-06-04 17:48:03,598 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3352272727272727 [2024-06-04 17:48:03,598 INFO L175 Difference]: Start difference. First operand has 213 places, 166 transitions, 1255 flow. Second operand 11 states and 118 transitions. [2024-06-04 17:48:03,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 189 transitions, 1841 flow [2024-06-04 17:48:03,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 189 transitions, 1807 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-04 17:48:03,712 INFO L231 Difference]: Finished difference. Result has 217 places, 166 transitions, 1277 flow [2024-06-04 17:48:03,712 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1221, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1277, PETRI_PLACES=217, PETRI_TRANSITIONS=166} [2024-06-04 17:48:03,712 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 186 predicate places. [2024-06-04 17:48:03,712 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 166 transitions, 1277 flow [2024-06-04 17:48:03,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:48:03,713 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:48:03,713 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:03,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-04 17:48:03,713 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:48:03,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:48:03,713 INFO L85 PathProgramCache]: Analyzing trace with hash -588008042, now seen corresponding path program 5 times [2024-06-04 17:48:03,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:48:03,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708268035] [2024-06-04 17:48:03,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:48:03,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:48:03,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:48:08,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:48:08,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:48:08,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708268035] [2024-06-04 17:48:08,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708268035] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:48:08,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:48:08,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:48:08,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172223705] [2024-06-04 17:48:08,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:48:08,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:48:08,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:48:08,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:48:08,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:48:08,244 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:48:08,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 166 transitions, 1277 flow. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:48:08,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:48:08,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:48:08,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:48:08,584 INFO L124 PetriNetUnfolderBase]: 465/858 cut-off events. [2024-06-04 17:48:08,584 INFO L125 PetriNetUnfolderBase]: For 44208/44208 co-relation queries the response was YES. [2024-06-04 17:48:08,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4112 conditions, 858 events. 465/858 cut-off events. For 44208/44208 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 4276 event pairs, 70 based on Foata normal form. 2/858 useless extension candidates. Maximal degree in co-relation 4007. Up to 772 conditions per place. [2024-06-04 17:48:08,591 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 160 selfloop transitions, 26 changer transitions 0/188 dead transitions. [2024-06-04 17:48:08,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 188 transitions, 1707 flow [2024-06-04 17:48:08,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:48:08,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:48:08,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 115 transitions. [2024-06-04 17:48:08,593 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32670454545454547 [2024-06-04 17:48:08,593 INFO L175 Difference]: Start difference. First operand has 217 places, 166 transitions, 1277 flow. Second operand 11 states and 115 transitions. [2024-06-04 17:48:08,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 188 transitions, 1707 flow [2024-06-04 17:48:08,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 188 transitions, 1627 flow, removed 3 selfloop flow, removed 11 redundant places. [2024-06-04 17:48:08,702 INFO L231 Difference]: Finished difference. Result has 217 places, 166 transitions, 1254 flow [2024-06-04 17:48:08,702 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1197, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1254, PETRI_PLACES=217, PETRI_TRANSITIONS=166} [2024-06-04 17:48:08,703 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 186 predicate places. [2024-06-04 17:48:08,703 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 166 transitions, 1254 flow [2024-06-04 17:48:08,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:48:08,703 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:48:08,703 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:08,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-04 17:48:08,704 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:48:08,705 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:48:08,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1262543020, now seen corresponding path program 1 times [2024-06-04 17:48:08,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:48:08,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4419381] [2024-06-04 17:48:08,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:48:08,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:48:08,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:48:13,478 INFO 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:13,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:48:13,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4419381] [2024-06-04 17:48:13,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4419381] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:48:13,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:48:13,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:48:13,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579183110] [2024-06-04 17:48:13,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:48:13,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:48:13,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:48:13,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:48:13,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:48:13,626 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:48:13,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 166 transitions, 1254 flow. Second operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:48:13,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:48:13,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:48:13,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:48:14,029 INFO L124 PetriNetUnfolderBase]: 481/894 cut-off events. [2024-06-04 17:48:14,030 INFO L125 PetriNetUnfolderBase]: For 70722/70722 co-relation queries the response was YES. [2024-06-04 17:48:14,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4169 conditions, 894 events. 481/894 cut-off events. For 70722/70722 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 4504 event pairs, 58 based on Foata normal form. 10/902 useless extension candidates. Maximal degree in co-relation 4064. Up to 533 conditions per place. [2024-06-04 17:48:14,036 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 106 selfloop transitions, 69 changer transitions 13/190 dead transitions. [2024-06-04 17:48:14,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 190 transitions, 1706 flow [2024-06-04 17:48:14,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:48:14,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:48:14,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 131 transitions. [2024-06-04 17:48:14,038 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3721590909090909 [2024-06-04 17:48:14,038 INFO L175 Difference]: Start difference. First operand has 217 places, 166 transitions, 1254 flow. Second operand 11 states and 131 transitions. [2024-06-04 17:48:14,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 190 transitions, 1706 flow [2024-06-04 17:48:14,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 190 transitions, 1651 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-06-04 17:48:14,168 INFO L231 Difference]: Finished difference. Result has 218 places, 158 transitions, 1280 flow [2024-06-04 17:48:14,177 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1199, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1280, PETRI_PLACES=218, PETRI_TRANSITIONS=158} [2024-06-04 17:48:14,178 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 187 predicate places. [2024-06-04 17:48:14,178 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 158 transitions, 1280 flow [2024-06-04 17:48:14,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call 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:14,178 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:48:14,179 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:14,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-04 17:48:14,179 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:48:14,179 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:48:14,179 INFO L85 PathProgramCache]: Analyzing trace with hash 987589594, now seen corresponding path program 2 times [2024-06-04 17:48:14,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:48:14,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903972128] [2024-06-04 17:48:14,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:48:14,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:48:14,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:48:18,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:48:18,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:48:18,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903972128] [2024-06-04 17:48:18,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903972128] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:48:18,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:48:18,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:48:18,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452720055] [2024-06-04 17:48:18,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:48:18,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:48:18,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:48:18,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:48:18,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:48:19,054 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:48:19,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 158 transitions, 1280 flow. Second operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:48:19,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:48:19,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:48:19,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:48:19,365 INFO L124 PetriNetUnfolderBase]: 485/926 cut-off events. [2024-06-04 17:48:19,366 INFO L125 PetriNetUnfolderBase]: For 105153/105153 co-relation queries the response was YES. [2024-06-04 17:48:19,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5307 conditions, 926 events. 485/926 cut-off events. For 105153/105153 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 4748 event pairs, 74 based on Foata normal form. 8/932 useless extension candidates. Maximal degree in co-relation 5201. Up to 449 conditions per place. [2024-06-04 17:48:19,373 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 105 selfloop transitions, 74 changer transitions 6/187 dead transitions. [2024-06-04 17:48:19,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 187 transitions, 1912 flow [2024-06-04 17:48:19,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:48:19,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:48:19,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 134 transitions. [2024-06-04 17:48:19,375 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3806818181818182 [2024-06-04 17:48:19,375 INFO L175 Difference]: Start difference. First operand has 218 places, 158 transitions, 1280 flow. Second operand 11 states and 134 transitions. [2024-06-04 17:48:19,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 187 transitions, 1912 flow [2024-06-04 17:48:19,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 187 transitions, 1759 flow, removed 2 selfloop flow, removed 13 redundant places. [2024-06-04 17:48:19,573 INFO L231 Difference]: Finished difference. Result has 216 places, 157 transitions, 1275 flow [2024-06-04 17:48:19,573 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1129, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1275, PETRI_PLACES=216, PETRI_TRANSITIONS=157} [2024-06-04 17:48:19,574 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 185 predicate places. [2024-06-04 17:48:19,574 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 157 transitions, 1275 flow [2024-06-04 17:48:19,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:48:19,574 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:48:19,574 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:19,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-06-04 17:48:19,575 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:48:19,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:48:19,575 INFO L85 PathProgramCache]: Analyzing trace with hash 987580294, now seen corresponding path program 3 times [2024-06-04 17:48:19,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:48:19,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222583310] [2024-06-04 17:48:19,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:48:19,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:48:19,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:48:24,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:48:24,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:48:24,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222583310] [2024-06-04 17:48:24,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222583310] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:48:24,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:48:24,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:48:24,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141361926] [2024-06-04 17:48:24,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:48:24,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:48:24,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:48:24,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:48:24,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:48:24,440 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:48:24,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 157 transitions, 1275 flow. Second operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call 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:24,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:48:24,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:48:24,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:48:24,826 INFO L124 PetriNetUnfolderBase]: 475/912 cut-off events. [2024-06-04 17:48:24,826 INFO L125 PetriNetUnfolderBase]: For 105327/105327 co-relation queries the response was YES. [2024-06-04 17:48:24,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4930 conditions, 912 events. 475/912 cut-off events. For 105327/105327 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 4708 event pairs, 78 based on Foata normal form. 12/922 useless extension candidates. Maximal degree in co-relation 4825. Up to 529 conditions per place. [2024-06-04 17:48:24,833 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 100 selfloop transitions, 73 changer transitions 7/182 dead transitions. [2024-06-04 17:48:24,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 182 transitions, 1719 flow [2024-06-04 17:48:24,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:48:24,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:48:24,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 131 transitions. [2024-06-04 17:48:24,834 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3721590909090909 [2024-06-04 17:48:24,834 INFO L175 Difference]: Start difference. First operand has 216 places, 157 transitions, 1275 flow. Second operand 11 states and 131 transitions. [2024-06-04 17:48:24,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 182 transitions, 1719 flow [2024-06-04 17:48:24,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 182 transitions, 1569 flow, removed 1 selfloop flow, removed 10 redundant places. [2024-06-04 17:48:24,998 INFO L231 Difference]: Finished difference. Result has 216 places, 155 transitions, 1266 flow [2024-06-04 17:48:24,998 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1125, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1266, PETRI_PLACES=216, PETRI_TRANSITIONS=155} [2024-06-04 17:48:24,998 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 185 predicate places. [2024-06-04 17:48:24,998 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 155 transitions, 1266 flow [2024-06-04 17:48:24,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call 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:24,999 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:48:24,999 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:24,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-06-04 17:48:24,999 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:48:24,999 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:48:24,999 INFO L85 PathProgramCache]: Analyzing trace with hash 979961238, now seen corresponding path program 6 times [2024-06-04 17:48:24,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:48:25,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803866815] [2024-06-04 17:48:25,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:48:25,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:48:25,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:48:29,398 INFO 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,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:48:29,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803866815] [2024-06-04 17:48:29,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803866815] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:48:29,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:48:29,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:48:29,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731147994] [2024-06-04 17:48:29,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:48:29,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:48:29,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:48:29,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:48:29,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:48:29,502 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:48:29,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 155 transitions, 1266 flow. Second operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call 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,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:48:29,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:48:29,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:48:29,774 INFO L124 PetriNetUnfolderBase]: 433/826 cut-off events. [2024-06-04 17:48:29,774 INFO L125 PetriNetUnfolderBase]: For 46396/46396 co-relation queries the response was YES. [2024-06-04 17:48:29,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4052 conditions, 826 events. 433/826 cut-off events. For 46396/46396 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4212 event pairs, 62 based on Foata normal form. 2/826 useless extension candidates. Maximal degree in co-relation 3947. Up to 491 conditions per place. [2024-06-04 17:48:29,780 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 105 selfloop transitions, 69 changer transitions 0/176 dead transitions. [2024-06-04 17:48:29,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 176 transitions, 1678 flow [2024-06-04 17:48:29,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:48:29,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:48:29,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 125 transitions. [2024-06-04 17:48:29,782 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35511363636363635 [2024-06-04 17:48:29,782 INFO L175 Difference]: Start difference. First operand has 216 places, 155 transitions, 1266 flow. Second operand 11 states and 125 transitions. [2024-06-04 17:48:29,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 176 transitions, 1678 flow [2024-06-04 17:48:29,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 176 transitions, 1514 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-04 17:48:29,921 INFO L231 Difference]: Finished difference. Result has 217 places, 156 transitions, 1256 flow [2024-06-04 17:48:29,922 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1102, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1256, PETRI_PLACES=217, PETRI_TRANSITIONS=156} [2024-06-04 17:48:29,922 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 186 predicate places. [2024-06-04 17:48:29,922 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 156 transitions, 1256 flow [2024-06-04 17:48:29,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call 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,922 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:48:29,922 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:29,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-06-04 17:48:29,923 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:48:29,923 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:48:29,923 INFO L85 PathProgramCache]: Analyzing trace with hash 979955658, now seen corresponding path program 7 times [2024-06-04 17:48:29,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:48:29,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10095446] [2024-06-04 17:48:29,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:48:29,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:48:29,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:48:34,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:48:34,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:48:34,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10095446] [2024-06-04 17:48:34,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10095446] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:48:34,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:48:34,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:48:34,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858322662] [2024-06-04 17:48:34,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:48:34,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:48:34,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:48:34,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:48:34,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:48:34,521 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:48:34,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 156 transitions, 1256 flow. Second operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call 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:34,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:48:34,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:48:34,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:48:34,871 INFO L124 PetriNetUnfolderBase]: 437/834 cut-off events. [2024-06-04 17:48:34,871 INFO L125 PetriNetUnfolderBase]: For 47692/47692 co-relation queries the response was YES. [2024-06-04 17:48:34,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4063 conditions, 834 events. 437/834 cut-off events. For 47692/47692 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4264 event pairs, 60 based on Foata normal form. 2/834 useless extension candidates. Maximal degree in co-relation 3957. Up to 479 conditions per place. [2024-06-04 17:48:34,877 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 104 selfloop transitions, 71 changer transitions 0/177 dead transitions. [2024-06-04 17:48:34,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 177 transitions, 1670 flow [2024-06-04 17:48:34,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:48:34,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:48:34,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 126 transitions. [2024-06-04 17:48:34,879 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35795454545454547 [2024-06-04 17:48:34,879 INFO L175 Difference]: Start difference. First operand has 217 places, 156 transitions, 1256 flow. Second operand 11 states and 126 transitions. [2024-06-04 17:48:34,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 177 transitions, 1670 flow [2024-06-04 17:48:35,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 177 transitions, 1526 flow, removed 4 selfloop flow, removed 9 redundant places. [2024-06-04 17:48:35,004 INFO L231 Difference]: Finished difference. Result has 219 places, 157 transitions, 1272 flow [2024-06-04 17:48:35,004 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1112, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1272, PETRI_PLACES=219, PETRI_TRANSITIONS=157} [2024-06-04 17:48:35,004 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 188 predicate places. [2024-06-04 17:48:35,005 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 157 transitions, 1272 flow [2024-06-04 17:48:35,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call 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:35,005 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:48:35,005 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:35,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-06-04 17:48:35,005 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:48:35,006 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:48:35,006 INFO L85 PathProgramCache]: Analyzing trace with hash 780659448, now seen corresponding path program 8 times [2024-06-04 17:48:35,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:48:35,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701684073] [2024-06-04 17:48:35,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:48:35,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:48:35,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:48:39,667 INFO 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:39,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:48:39,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701684073] [2024-06-04 17:48:39,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701684073] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:48:39,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:48:39,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:48:39,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708026900] [2024-06-04 17:48:39,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:48:39,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:48:39,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:48:39,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:48:39,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:48:39,825 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:48:39,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 157 transitions, 1272 flow. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:48:39,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:48:39,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:48:39,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:48:40,228 INFO L124 PetriNetUnfolderBase]: 441/842 cut-off events. [2024-06-04 17:48:40,228 INFO L125 PetriNetUnfolderBase]: For 48897/48897 co-relation queries the response was YES. [2024-06-04 17:48:40,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4120 conditions, 842 events. 441/842 cut-off events. For 48897/48897 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4321 event pairs, 62 based on Foata normal form. 2/842 useless extension candidates. Maximal degree in co-relation 4013. Up to 561 conditions per place. [2024-06-04 17:48:40,235 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 117 selfloop transitions, 59 changer transitions 0/178 dead transitions. [2024-06-04 17:48:40,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 178 transitions, 1692 flow [2024-06-04 17:48:40,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:48:40,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:48:40,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 123 transitions. [2024-06-04 17:48:40,236 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3494318181818182 [2024-06-04 17:48:40,236 INFO L175 Difference]: Start difference. First operand has 219 places, 157 transitions, 1272 flow. Second operand 11 states and 123 transitions. [2024-06-04 17:48:40,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 178 transitions, 1692 flow [2024-06-04 17:48:40,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 178 transitions, 1542 flow, removed 5 selfloop flow, removed 9 redundant places. [2024-06-04 17:48:40,385 INFO L231 Difference]: Finished difference. Result has 221 places, 158 transitions, 1260 flow [2024-06-04 17:48:40,385 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1122, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1260, PETRI_PLACES=221, PETRI_TRANSITIONS=158} [2024-06-04 17:48:40,385 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 190 predicate places. [2024-06-04 17:48:40,386 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 158 transitions, 1260 flow [2024-06-04 17:48:40,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:48:40,386 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:48:40,386 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:40,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-06-04 17:48:40,386 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:48:40,386 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:48:40,387 INFO L85 PathProgramCache]: Analyzing trace with hash 780653868, now seen corresponding path program 9 times [2024-06-04 17:48:40,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:48:40,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121944684] [2024-06-04 17:48:40,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:48:40,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:48:40,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:48:44,939 INFO 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:44,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:48:44,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121944684] [2024-06-04 17:48:44,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121944684] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:48:44,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:48:44,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:48:44,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560848137] [2024-06-04 17:48:44,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:48:44,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:48:44,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:48:44,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:48:44,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:48:45,145 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:48:45,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 158 transitions, 1260 flow. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:48:45,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:48:45,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:48:45,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:48:45,462 INFO L124 PetriNetUnfolderBase]: 445/850 cut-off events. [2024-06-04 17:48:45,462 INFO L125 PetriNetUnfolderBase]: For 50038/50038 co-relation queries the response was YES. [2024-06-04 17:48:45,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4135 conditions, 850 events. 445/850 cut-off events. For 50038/50038 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 4368 event pairs, 68 based on Foata normal form. 2/850 useless extension candidates. Maximal degree in co-relation 4027. Up to 555 conditions per place. [2024-06-04 17:48:45,469 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 117 selfloop transitions, 60 changer transitions 0/179 dead transitions. [2024-06-04 17:48:45,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 179 transitions, 1682 flow [2024-06-04 17:48:45,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:48:45,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:48:45,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 124 transitions. [2024-06-04 17:48:45,470 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3522727272727273 [2024-06-04 17:48:45,470 INFO L175 Difference]: Start difference. First operand has 221 places, 158 transitions, 1260 flow. Second operand 11 states and 124 transitions. [2024-06-04 17:48:45,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 179 transitions, 1682 flow [2024-06-04 17:48:45,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 179 transitions, 1554 flow, removed 6 selfloop flow, removed 9 redundant places. [2024-06-04 17:48:45,616 INFO L231 Difference]: Finished difference. Result has 223 places, 159 transitions, 1274 flow [2024-06-04 17:48:45,617 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1132, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1274, PETRI_PLACES=223, PETRI_TRANSITIONS=159} [2024-06-04 17:48:45,617 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 192 predicate places. [2024-06-04 17:48:45,617 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 159 transitions, 1274 flow [2024-06-04 17:48:45,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:48:45,617 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:48:45,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] [2024-06-04 17:48:45,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-06-04 17:48:45,618 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:48:45,618 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:48:45,618 INFO L85 PathProgramCache]: Analyzing trace with hash 780509718, now seen corresponding path program 10 times [2024-06-04 17:48:45,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:48:45,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487471051] [2024-06-04 17:48:45,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:48:45,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:48:45,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:48:49,972 INFO 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,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:48:49,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487471051] [2024-06-04 17:48:49,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487471051] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:48:49,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:48:49,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:48:49,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177644266] [2024-06-04 17:48:49,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:48:49,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:48:49,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:48:49,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:48:49,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:48:50,060 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:48:50,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 159 transitions, 1274 flow. Second operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call 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,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:48:50,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:48:50,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:48:50,384 INFO L124 PetriNetUnfolderBase]: 449/858 cut-off events. [2024-06-04 17:48:50,385 INFO L125 PetriNetUnfolderBase]: For 51407/51407 co-relation queries the response was YES. [2024-06-04 17:48:50,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4188 conditions, 858 events. 449/858 cut-off events. For 51407/51407 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 4436 event pairs, 66 based on Foata normal form. 2/858 useless extension candidates. Maximal degree in co-relation 4079. Up to 461 conditions per place. [2024-06-04 17:48:50,392 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 107 selfloop transitions, 71 changer transitions 0/180 dead transitions. [2024-06-04 17:48:50,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 180 transitions, 1698 flow [2024-06-04 17:48:50,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:48:50,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:48:50,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 126 transitions. [2024-06-04 17:48:50,394 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35795454545454547 [2024-06-04 17:48:50,394 INFO L175 Difference]: Start difference. First operand has 223 places, 159 transitions, 1274 flow. Second operand 11 states and 126 transitions. [2024-06-04 17:48:50,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 180 transitions, 1698 flow [2024-06-04 17:48:50,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 180 transitions, 1566 flow, removed 7 selfloop flow, removed 9 redundant places. [2024-06-04 17:48:50,549 INFO L231 Difference]: Finished difference. Result has 225 places, 160 transitions, 1308 flow [2024-06-04 17:48:50,549 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1142, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1308, PETRI_PLACES=225, PETRI_TRANSITIONS=160} [2024-06-04 17:48:50,549 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 194 predicate places. [2024-06-04 17:48:50,550 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 160 transitions, 1308 flow [2024-06-04 17:48:50,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call 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,550 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:48:50,550 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:50,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-06-04 17:48:50,550 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:48:50,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:48:50,551 INFO L85 PathProgramCache]: Analyzing trace with hash -216148586, now seen corresponding path program 11 times [2024-06-04 17:48:50,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:48:50,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597285830] [2024-06-04 17:48:50,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:48:50,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:48:50,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:48:55,477 INFO 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,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:48:55,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597285830] [2024-06-04 17:48:55,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597285830] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:48:55,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:48:55,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:48:55,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199929182] [2024-06-04 17:48:55,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:48:55,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:48:55,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:48:55,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:48:55,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:48:55,619 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:48:55,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 160 transitions, 1308 flow. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:48:55,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:48:55,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:48:55,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:48:56,042 INFO L124 PetriNetUnfolderBase]: 453/866 cut-off events. [2024-06-04 17:48:56,042 INFO L125 PetriNetUnfolderBase]: For 52732/52732 co-relation queries the response was YES. [2024-06-04 17:48:56,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4271 conditions, 866 events. 453/866 cut-off events. For 52732/52732 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 4486 event pairs, 82 based on Foata normal form. 2/866 useless extension candidates. Maximal degree in co-relation 4161. Up to 585 conditions per place. [2024-06-04 17:48:56,050 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 121 selfloop transitions, 58 changer transitions 0/181 dead transitions. [2024-06-04 17:48:56,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 181 transitions, 1740 flow [2024-06-04 17:48:56,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:48:56,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:48:56,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 121 transitions. [2024-06-04 17:48:56,051 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34375 [2024-06-04 17:48:56,051 INFO L175 Difference]: Start difference. First operand has 225 places, 160 transitions, 1308 flow. Second operand 11 states and 121 transitions. [2024-06-04 17:48:56,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 181 transitions, 1740 flow [2024-06-04 17:48:56,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 181 transitions, 1584 flow, removed 8 selfloop flow, removed 9 redundant places. [2024-06-04 17:48:56,203 INFO L231 Difference]: Finished difference. Result has 227 places, 161 transitions, 1294 flow [2024-06-04 17:48:56,203 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1152, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1294, PETRI_PLACES=227, PETRI_TRANSITIONS=161} [2024-06-04 17:48:56,203 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 196 predicate places. [2024-06-04 17:48:56,203 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 161 transitions, 1294 flow [2024-06-04 17:48:56,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:48:56,204 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:48:56,204 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:56,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-06-04 17:48:56,204 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:48:56,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:48:56,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1750329930, now seen corresponding path program 12 times [2024-06-04 17:48:56,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:48:56,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316842146] [2024-06-04 17:48:56,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:48:56,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:48:56,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:49:00,694 INFO 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:00,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:49:00,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316842146] [2024-06-04 17:49:00,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316842146] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:49:00,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:49:00,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:49:00,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783271689] [2024-06-04 17:49:00,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:49:00,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:49:00,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:49:00,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:49:00,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:49:00,820 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:49:00,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 161 transitions, 1294 flow. Second operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call 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:00,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:49:00,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:49:00,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:49:01,128 INFO L124 PetriNetUnfolderBase]: 457/874 cut-off events. [2024-06-04 17:49:01,128 INFO L125 PetriNetUnfolderBase]: For 53954/53954 co-relation queries the response was YES. [2024-06-04 17:49:01,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4284 conditions, 874 events. 457/874 cut-off events. For 53954/53954 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 4564 event pairs, 76 based on Foata normal form. 2/874 useless extension candidates. Maximal degree in co-relation 4173. Up to 525 conditions per place. [2024-06-04 17:49:01,135 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 108 selfloop transitions, 72 changer transitions 0/182 dead transitions. [2024-06-04 17:49:01,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 182 transitions, 1728 flow [2024-06-04 17:49:01,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:49:01,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:49:01,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 124 transitions. [2024-06-04 17:49:01,147 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3522727272727273 [2024-06-04 17:49:01,147 INFO L175 Difference]: Start difference. First operand has 227 places, 161 transitions, 1294 flow. Second operand 11 states and 124 transitions. [2024-06-04 17:49:01,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 182 transitions, 1728 flow [2024-06-04 17:49:01,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 182 transitions, 1628 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-06-04 17:49:01,301 INFO L231 Difference]: Finished difference. Result has 230 places, 162 transitions, 1366 flow [2024-06-04 17:49:01,301 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1194, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1366, PETRI_PLACES=230, PETRI_TRANSITIONS=162} [2024-06-04 17:49:01,301 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 199 predicate places. [2024-06-04 17:49:01,301 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 162 transitions, 1366 flow [2024-06-04 17:49:01,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:49:01,302 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:49:01,302 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:49:01,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-06-04 17:49:01,302 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:49:01,302 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:49:01,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1750185780, now seen corresponding path program 13 times [2024-06-04 17:49:01,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:49:01,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762598899] [2024-06-04 17:49:01,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:49:01,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:49:01,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:49:05,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:49:05,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:49:05,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762598899] [2024-06-04 17:49:05,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762598899] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:49:05,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:49:05,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:49:05,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551049148] [2024-06-04 17:49:05,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:49:05,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:49:05,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:49:05,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:49:05,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:49:06,075 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:49:06,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 162 transitions, 1366 flow. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:49:06,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:49:06,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:49:06,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:49:06,433 INFO L124 PetriNetUnfolderBase]: 461/882 cut-off events. [2024-06-04 17:49:06,433 INFO L125 PetriNetUnfolderBase]: For 55446/55446 co-relation queries the response was YES. [2024-06-04 17:49:06,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4393 conditions, 882 events. 461/882 cut-off events. For 55446/55446 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 4621 event pairs, 76 based on Foata normal form. 2/882 useless extension candidates. Maximal degree in co-relation 4281. Up to 565 conditions per place. [2024-06-04 17:49:06,441 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 121 selfloop transitions, 60 changer transitions 0/183 dead transitions. [2024-06-04 17:49:06,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 183 transitions, 1802 flow [2024-06-04 17:49:06,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:49:06,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:49:06,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 123 transitions. [2024-06-04 17:49:06,442 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3494318181818182 [2024-06-04 17:49:06,443 INFO L175 Difference]: Start difference. First operand has 230 places, 162 transitions, 1366 flow. Second operand 11 states and 123 transitions. [2024-06-04 17:49:06,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 183 transitions, 1802 flow [2024-06-04 17:49:06,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 183 transitions, 1640 flow, removed 10 selfloop flow, removed 9 redundant places. [2024-06-04 17:49:06,607 INFO L231 Difference]: Finished difference. Result has 232 places, 163 transitions, 1354 flow [2024-06-04 17:49:06,607 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1204, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1354, PETRI_PLACES=232, PETRI_TRANSITIONS=163} [2024-06-04 17:49:06,607 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 201 predicate places. [2024-06-04 17:49:06,607 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 163 transitions, 1354 flow [2024-06-04 17:49:06,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:49:06,608 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:49:06,608 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:49:06,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2024-06-04 17:49:06,608 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:49:06,608 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:49:06,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1746610860, now seen corresponding path program 14 times [2024-06-04 17:49:06,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:49:06,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146718914] [2024-06-04 17:49:06,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:49:06,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:49:06,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:49:11,363 INFO 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:11,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:49:11,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146718914] [2024-06-04 17:49:11,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146718914] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:49:11,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:49:11,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:49:11,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499642896] [2024-06-04 17:49:11,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:49:11,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:49:11,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:49:11,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:49:11,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:49:11,517 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:49:11,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 163 transitions, 1354 flow. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:49:11,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:49:11,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:49:11,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:49:11,820 INFO L124 PetriNetUnfolderBase]: 465/890 cut-off events. [2024-06-04 17:49:11,820 INFO L125 PetriNetUnfolderBase]: For 56901/56901 co-relation queries the response was YES. [2024-06-04 17:49:11,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4414 conditions, 890 events. 465/890 cut-off events. For 56901/56901 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 4664 event pairs, 80 based on Foata normal form. 2/890 useless extension candidates. Maximal degree in co-relation 4301. Up to 398 conditions per place. [2024-06-04 17:49:11,828 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 115 selfloop transitions, 68 changer transitions 0/185 dead transitions. [2024-06-04 17:49:11,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 185 transitions, 1974 flow [2024-06-04 17:49:11,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:49:11,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:49:11,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 123 transitions. [2024-06-04 17:49:11,830 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3494318181818182 [2024-06-04 17:49:11,830 INFO L175 Difference]: Start difference. First operand has 232 places, 163 transitions, 1354 flow. Second operand 11 states and 123 transitions. [2024-06-04 17:49:11,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 185 transitions, 1974 flow [2024-06-04 17:49:11,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 185 transitions, 1834 flow, removed 11 selfloop flow, removed 9 redundant places. [2024-06-04 17:49:11,990 INFO L231 Difference]: Finished difference. Result has 234 places, 164 transitions, 1380 flow [2024-06-04 17:49:11,990 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1214, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1380, PETRI_PLACES=234, PETRI_TRANSITIONS=164} [2024-06-04 17:49:11,990 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 203 predicate places. [2024-06-04 17:49:11,990 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 164 transitions, 1380 flow [2024-06-04 17:49:11,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:49:11,991 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:49:11,991 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:49:11,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2024-06-04 17:49:11,991 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:49:11,991 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:49:11,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1152501594, now seen corresponding path program 15 times [2024-06-04 17:49:11,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:49:11,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998001325] [2024-06-04 17:49:11,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:49:11,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:49:12,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:49:16,781 INFO 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:16,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:49:16,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998001325] [2024-06-04 17:49:16,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998001325] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:49:16,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:49:16,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:49:16,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276640089] [2024-06-04 17:49:16,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:49:16,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:49:16,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:49:16,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:49:16,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:49:16,969 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:49:16,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 164 transitions, 1380 flow. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:49:16,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:49:16,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:49:16,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:49:17,395 INFO L124 PetriNetUnfolderBase]: 469/898 cut-off events. [2024-06-04 17:49:17,396 INFO L125 PetriNetUnfolderBase]: For 58272/58272 co-relation queries the response was YES. [2024-06-04 17:49:17,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4493 conditions, 898 events. 469/898 cut-off events. For 58272/58272 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 4721 event pairs, 84 based on Foata normal form. 2/898 useless extension candidates. Maximal degree in co-relation 4379. Up to 617 conditions per place. [2024-06-04 17:49:17,403 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 124 selfloop transitions, 58 changer transitions 0/184 dead transitions. [2024-06-04 17:49:17,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 184 transitions, 1822 flow [2024-06-04 17:49:17,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:49:17,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:49:17,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 124 transitions. [2024-06-04 17:49:17,404 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3522727272727273 [2024-06-04 17:49:17,404 INFO L175 Difference]: Start difference. First operand has 234 places, 164 transitions, 1380 flow. Second operand 11 states and 124 transitions. [2024-06-04 17:49:17,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 184 transitions, 1822 flow [2024-06-04 17:49:17,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 184 transitions, 1679 flow, removed 16 selfloop flow, removed 9 redundant places. [2024-06-04 17:49:17,563 INFO L231 Difference]: Finished difference. Result has 236 places, 165 transitions, 1387 flow [2024-06-04 17:49:17,563 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1242, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1387, PETRI_PLACES=236, PETRI_TRANSITIONS=165} [2024-06-04 17:49:17,564 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 205 predicate places. [2024-06-04 17:49:17,564 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 165 transitions, 1387 flow [2024-06-04 17:49:17,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:49:17,564 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:49:17,564 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:49:17,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2024-06-04 17:49:17,564 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:49:17,565 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:49:17,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1152496014, now seen corresponding path program 16 times [2024-06-04 17:49:17,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:49:17,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133132713] [2024-06-04 17:49:17,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:49:17,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:49:17,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:49:22,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:49:22,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:49:22,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133132713] [2024-06-04 17:49:22,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133132713] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:49:22,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:49:22,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:49:22,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337282022] [2024-06-04 17:49:22,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:49:22,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:49:22,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:49:22,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:49:22,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:49:22,691 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:49:22,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 165 transitions, 1387 flow. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:49:22,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:49:22,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:49:22,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:49:23,060 INFO L124 PetriNetUnfolderBase]: 473/906 cut-off events. [2024-06-04 17:49:23,061 INFO L125 PetriNetUnfolderBase]: For 59328/59328 co-relation queries the response was YES. [2024-06-04 17:49:23,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4480 conditions, 906 events. 473/906 cut-off events. For 59328/59328 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 4798 event pairs, 84 based on Foata normal form. 2/906 useless extension candidates. Maximal degree in co-relation 4366. Up to 611 conditions per place. [2024-06-04 17:49:23,068 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 124 selfloop transitions, 59 changer transitions 0/185 dead transitions. [2024-06-04 17:49:23,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 185 transitions, 1826 flow [2024-06-04 17:49:23,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:49:23,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:49:23,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 125 transitions. [2024-06-04 17:49:23,069 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35511363636363635 [2024-06-04 17:49:23,070 INFO L175 Difference]: Start difference. First operand has 236 places, 165 transitions, 1387 flow. Second operand 11 states and 125 transitions. [2024-06-04 17:49:23,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 185 transitions, 1826 flow [2024-06-04 17:49:23,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 185 transitions, 1676 flow, removed 11 selfloop flow, removed 9 redundant places. [2024-06-04 17:49:23,232 INFO L231 Difference]: Finished difference. Result has 238 places, 166 transitions, 1386 flow [2024-06-04 17:49:23,232 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1237, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1386, PETRI_PLACES=238, PETRI_TRANSITIONS=166} [2024-06-04 17:49:23,236 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 207 predicate places. [2024-06-04 17:49:23,236 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 166 transitions, 1386 flow [2024-06-04 17:49:23,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:49:23,237 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:49:23,237 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:49:23,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2024-06-04 17:49:23,237 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:49:23,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:49:23,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1152351864, now seen corresponding path program 17 times [2024-06-04 17:49:23,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:49:23,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862397210] [2024-06-04 17:49:23,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:49:23,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:49:23,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:49:28,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:49:28,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:49:28,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862397210] [2024-06-04 17:49:28,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862397210] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:49:28,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:49:28,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:49:28,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439547358] [2024-06-04 17:49:28,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:49:28,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:49:28,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:49:28,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:49:28,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:49:28,310 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:49:28,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 166 transitions, 1386 flow. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:49:28,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:49:28,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:49:28,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:49:28,667 INFO L124 PetriNetUnfolderBase]: 477/914 cut-off events. [2024-06-04 17:49:28,668 INFO L125 PetriNetUnfolderBase]: For 60774/60774 co-relation queries the response was YES. [2024-06-04 17:49:28,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4519 conditions, 914 events. 477/914 cut-off events. For 60774/60774 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 4838 event pairs, 86 based on Foata normal form. 2/914 useless extension candidates. Maximal degree in co-relation 4404. Up to 554 conditions per place. [2024-06-04 17:49:28,675 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 123 selfloop transitions, 62 changer transitions 0/187 dead transitions. [2024-06-04 17:49:28,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 187 transitions, 2015 flow [2024-06-04 17:49:28,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:49:28,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:49:28,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 126 transitions. [2024-06-04 17:49:28,677 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35795454545454547 [2024-06-04 17:49:28,677 INFO L175 Difference]: Start difference. First operand has 238 places, 166 transitions, 1386 flow. Second operand 11 states and 126 transitions. [2024-06-04 17:49:28,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 187 transitions, 2015 flow [2024-06-04 17:49:28,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 187 transitions, 1877 flow, removed 11 selfloop flow, removed 9 redundant places. [2024-06-04 17:49:28,843 INFO L231 Difference]: Finished difference. Result has 240 places, 167 transitions, 1403 flow [2024-06-04 17:49:28,844 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1248, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1403, PETRI_PLACES=240, PETRI_TRANSITIONS=167} [2024-06-04 17:49:28,845 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 209 predicate places. [2024-06-04 17:49:28,847 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 167 transitions, 1403 flow [2024-06-04 17:49:28,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:49:28,847 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:49:28,847 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:49:28,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2024-06-04 17:49:28,847 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:49:28,854 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:49:28,854 INFO L85 PathProgramCache]: Analyzing trace with hash -212054454, now seen corresponding path program 4 times [2024-06-04 17:49:28,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:49:28,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798244710] [2024-06-04 17:49:28,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:49:28,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:49:28,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:49:33,235 INFO 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:33,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:49:33,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798244710] [2024-06-04 17:49:33,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798244710] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:49:33,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:49:33,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:49:33,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139353334] [2024-06-04 17:49:33,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:49:33,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:49:33,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:49:33,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:49:33,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:49:33,358 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:49:33,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 167 transitions, 1403 flow. Second operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:49:33,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:49:33,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:49:33,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:49:33,684 INFO L124 PetriNetUnfolderBase]: 493/950 cut-off events. [2024-06-04 17:49:33,684 INFO L125 PetriNetUnfolderBase]: For 96370/96370 co-relation queries the response was YES. [2024-06-04 17:49:33,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4606 conditions, 950 events. 493/950 cut-off events. For 96370/96370 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 5044 event pairs, 94 based on Foata normal form. 10/958 useless extension candidates. Maximal degree in co-relation 4490. Up to 608 conditions per place. [2024-06-04 17:49:33,692 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 125 selfloop transitions, 54 changer transitions 10/191 dead transitions. [2024-06-04 17:49:33,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 191 transitions, 1855 flow [2024-06-04 17:49:33,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:49:33,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:49:33,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 130 transitions. [2024-06-04 17:49:33,694 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3693181818181818 [2024-06-04 17:49:33,694 INFO L175 Difference]: Start difference. First operand has 240 places, 167 transitions, 1403 flow. Second operand 11 states and 130 transitions. [2024-06-04 17:49:33,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 191 transitions, 1855 flow [2024-06-04 17:49:33,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 191 transitions, 1689 flow, removed 12 selfloop flow, removed 9 redundant places. [2024-06-04 17:49:33,864 INFO L231 Difference]: Finished difference. Result has 242 places, 162 transitions, 1311 flow [2024-06-04 17:49:33,864 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1237, PETRI_DIFFERENCE_MINUEND_PLACES=231, 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=11, PETRI_FLOW=1311, PETRI_PLACES=242, PETRI_TRANSITIONS=162} [2024-06-04 17:49:33,865 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 211 predicate places. [2024-06-04 17:49:33,865 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 162 transitions, 1311 flow [2024-06-04 17:49:33,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:49:33,865 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:49:33,865 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:49:33,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2024-06-04 17:49:33,866 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:49:33,866 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:49:33,866 INFO L85 PathProgramCache]: Analyzing trace with hash 540051950, now seen corresponding path program 18 times [2024-06-04 17:49:33,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:49:33,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375909376] [2024-06-04 17:49:33,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:49:33,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:49:33,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:49:38,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:49:38,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:49:38,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375909376] [2024-06-04 17:49:38,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375909376] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:49:38,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:49:38,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:49:38,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373606935] [2024-06-04 17:49:38,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:49:38,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:49:38,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:49:38,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:49:38,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:49:38,519 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:49:38,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 162 transitions, 1311 flow. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:49:38,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:49:38,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:49:38,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:49:38,972 INFO L124 PetriNetUnfolderBase]: 479/936 cut-off events. [2024-06-04 17:49:38,972 INFO L125 PetriNetUnfolderBase]: For 107136/107136 co-relation queries the response was YES. [2024-06-04 17:49:38,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4493 conditions, 936 events. 479/936 cut-off events. For 107136/107136 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 5046 event pairs, 82 based on Foata normal form. 12/946 useless extension candidates. Maximal degree in co-relation 4376. Up to 575 conditions per place. [2024-06-04 17:49:38,978 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 115 selfloop transitions, 65 changer transitions 7/189 dead transitions. [2024-06-04 17:49:38,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 189 transitions, 1792 flow [2024-06-04 17:49:38,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 17:49:38,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 17:49:38,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 144 transitions. [2024-06-04 17:49:38,979 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-04 17:49:38,979 INFO L175 Difference]: Start difference. First operand has 242 places, 162 transitions, 1311 flow. Second operand 12 states and 144 transitions. [2024-06-04 17:49:38,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 189 transitions, 1792 flow [2024-06-04 17:49:39,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 189 transitions, 1674 flow, removed 1 selfloop flow, removed 13 redundant places. [2024-06-04 17:49:39,168 INFO L231 Difference]: Finished difference. Result has 241 places, 160 transitions, 1338 flow [2024-06-04 17:49:39,169 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1193, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1338, PETRI_PLACES=241, PETRI_TRANSITIONS=160} [2024-06-04 17:49:39,169 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 210 predicate places. [2024-06-04 17:49:39,169 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 160 transitions, 1338 flow [2024-06-04 17:49:39,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:49:39,169 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:49:39,169 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:49:39,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2024-06-04 17:49:39,170 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:49:39,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:49:39,170 INFO L85 PathProgramCache]: Analyzing trace with hash 540328656, now seen corresponding path program 5 times [2024-06-04 17:49:39,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:49:39,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057491405] [2024-06-04 17:49:39,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:49:39,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:49:39,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:49:43,929 INFO 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:43,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:49:43,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057491405] [2024-06-04 17:49:43,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057491405] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:49:43,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:49:43,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:49:43,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69521960] [2024-06-04 17:49:43,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:49:43,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:49:43,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:49:43,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:49:43,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:49:44,096 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:49:44,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 160 transitions, 1338 flow. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:49:44,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:49:44,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:49:44,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:49:44,491 INFO L124 PetriNetUnfolderBase]: 489/962 cut-off events. [2024-06-04 17:49:44,492 INFO L125 PetriNetUnfolderBase]: For 124126/124126 co-relation queries the response was YES. [2024-06-04 17:49:44,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5392 conditions, 962 events. 489/962 cut-off events. For 124126/124126 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 5182 event pairs, 90 based on Foata normal form. 8/968 useless extension candidates. Maximal degree in co-relation 5276. Up to 559 conditions per place. [2024-06-04 17:49:44,500 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 117 selfloop transitions, 62 changer transitions 8/189 dead transitions. [2024-06-04 17:49:44,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 189 transitions, 2011 flow [2024-06-04 17:49:44,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 17:49:44,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 17:49:44,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 145 transitions. [2024-06-04 17:49:44,501 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3776041666666667 [2024-06-04 17:49:44,501 INFO L175 Difference]: Start difference. First operand has 241 places, 160 transitions, 1338 flow. Second operand 12 states and 145 transitions. [2024-06-04 17:49:44,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 189 transitions, 2011 flow [2024-06-04 17:49:44,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 189 transitions, 1854 flow, removed 12 selfloop flow, removed 11 redundant places. [2024-06-04 17:49:44,760 INFO L231 Difference]: Finished difference. Result has 242 places, 157 transitions, 1289 flow [2024-06-04 17:49:44,760 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1181, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1289, PETRI_PLACES=242, PETRI_TRANSITIONS=157} [2024-06-04 17:49:44,761 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 211 predicate places. [2024-06-04 17:49:44,761 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 157 transitions, 1289 flow [2024-06-04 17:49:44,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:49:44,761 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:49:44,761 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:49:44,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2024-06-04 17:49:44,761 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:49:44,762 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:49:44,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1259309674, now seen corresponding path program 19 times [2024-06-04 17:49:44,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:49:44,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651403384] [2024-06-04 17:49:44,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:49:44,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:49:44,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:49:49,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:49:49,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:49:49,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651403384] [2024-06-04 17:49:49,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651403384] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:49:49,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:49:49,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 17:49:49,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980219345] [2024-06-04 17:49:49,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:49:49,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 17:49:49,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:49:49,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 17:49:49,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-06-04 17:49:49,509 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:49:49,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 157 transitions, 1289 flow. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:49:49,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:49:49,510 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:49:49,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:49:49,938 INFO L124 PetriNetUnfolderBase]: 467/916 cut-off events. [2024-06-04 17:49:49,938 INFO L125 PetriNetUnfolderBase]: For 91633/91633 co-relation queries the response was YES. [2024-06-04 17:49:49,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5013 conditions, 916 events. 467/916 cut-off events. For 91633/91633 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4877 event pairs, 91 based on Foata normal form. 2/916 useless extension candidates. Maximal degree in co-relation 4896. Up to 635 conditions per place. [2024-06-04 17:49:49,949 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 118 selfloop transitions, 59 changer transitions 0/179 dead transitions. [2024-06-04 17:49:49,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 179 transitions, 1728 flow [2024-06-04 17:49:49,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 17:49:49,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 17:49:49,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 132 transitions. [2024-06-04 17:49:49,951 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34375 [2024-06-04 17:49:49,951 INFO L175 Difference]: Start difference. First operand has 242 places, 157 transitions, 1289 flow. Second operand 12 states and 132 transitions. [2024-06-04 17:49:49,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 179 transitions, 1728 flow [2024-06-04 17:49:50,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 179 transitions, 1600 flow, removed 3 selfloop flow, removed 12 redundant places. [2024-06-04 17:49:50,214 INFO L231 Difference]: Finished difference. Result has 239 places, 158 transitions, 1314 flow [2024-06-04 17:49:50,216 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1161, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1314, PETRI_PLACES=239, PETRI_TRANSITIONS=158} [2024-06-04 17:49:50,217 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 208 predicate places. [2024-06-04 17:49:50,217 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 158 transitions, 1314 flow [2024-06-04 17:49:50,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:49:50,217 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:49:50,217 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:49:50,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2024-06-04 17:49:50,217 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:49:50,218 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:49:50,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1151153938, now seen corresponding path program 20 times [2024-06-04 17:49:50,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:49:50,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608806966] [2024-06-04 17:49:50,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:49:50,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:49:50,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:49:54,868 INFO 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:54,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:49:54,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608806966] [2024-06-04 17:49:54,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608806966] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:49:54,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:49:54,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:49:54,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133201484] [2024-06-04 17:49:54,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:49:54,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:49:54,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:49:54,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:49:54,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:49:54,992 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:49:54,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 158 transitions, 1314 flow. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:49:54,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:49:54,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:49:54,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:49:55,433 INFO L124 PetriNetUnfolderBase]: 471/924 cut-off events. [2024-06-04 17:49:55,433 INFO L125 PetriNetUnfolderBase]: For 86072/86072 co-relation queries the response was YES. [2024-06-04 17:49:55,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5053 conditions, 924 events. 471/924 cut-off events. For 86072/86072 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 4925 event pairs, 105 based on Foata normal form. 2/924 useless extension candidates. Maximal degree in co-relation 4938. Up to 643 conditions per place. [2024-06-04 17:49:55,440 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 126 selfloop transitions, 51 changer transitions 0/179 dead transitions. [2024-06-04 17:49:55,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 179 transitions, 1753 flow [2024-06-04 17:49:55,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:49:55,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:49:55,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 124 transitions. [2024-06-04 17:49:55,441 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3522727272727273 [2024-06-04 17:49:55,442 INFO L175 Difference]: Start difference. First operand has 239 places, 158 transitions, 1314 flow. Second operand 11 states and 124 transitions. [2024-06-04 17:49:55,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 179 transitions, 1753 flow [2024-06-04 17:49:55,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 179 transitions, 1618 flow, removed 13 selfloop flow, removed 9 redundant places. [2024-06-04 17:49:55,671 INFO L231 Difference]: Finished difference. Result has 241 places, 159 transitions, 1318 flow [2024-06-04 17:49:55,671 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1179, PETRI_DIFFERENCE_MINUEND_PLACES=230, 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=11, PETRI_FLOW=1318, PETRI_PLACES=241, PETRI_TRANSITIONS=159} [2024-06-04 17:49:55,671 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 210 predicate places. [2024-06-04 17:49:55,672 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 159 transitions, 1318 flow [2024-06-04 17:49:55,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:49:55,672 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:49:55,672 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:49:55,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2024-06-04 17:49:55,672 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:49:55,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:49:55,673 INFO L85 PathProgramCache]: Analyzing trace with hash -18330370, now seen corresponding path program 21 times [2024-06-04 17:49:55,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:49:55,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116362184] [2024-06-04 17:49:55,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:49:55,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:49:55,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:50:00,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:50:00,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:50:00,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116362184] [2024-06-04 17:50:00,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116362184] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:50:00,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:50:00,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:50:00,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139983738] [2024-06-04 17:50:00,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:50:00,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:50:00,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:50:00,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:50:00,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:50:00,324 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:50:00,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 159 transitions, 1318 flow. Second operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call 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,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:50:00,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:50:00,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:50:00,688 INFO L124 PetriNetUnfolderBase]: 511/1004 cut-off events. [2024-06-04 17:50:00,688 INFO L125 PetriNetUnfolderBase]: For 143568/143568 co-relation queries the response was YES. [2024-06-04 17:50:00,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6486 conditions, 1004 events. 511/1004 cut-off events. For 143568/143568 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 5440 event pairs, 121 based on Foata normal form. 2/1004 useless extension candidates. Maximal degree in co-relation 6370. Up to 606 conditions per place. [2024-06-04 17:50:00,697 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 124 selfloop transitions, 60 changer transitions 0/186 dead transitions. [2024-06-04 17:50:00,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 186 transitions, 2014 flow [2024-06-04 17:50:00,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:50:00,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:50:00,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 134 transitions. [2024-06-04 17:50:00,698 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3806818181818182 [2024-06-04 17:50:00,698 INFO L175 Difference]: Start difference. First operand has 241 places, 159 transitions, 1318 flow. Second operand 11 states and 134 transitions. [2024-06-04 17:50:00,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 186 transitions, 2014 flow [2024-06-04 17:50:01,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 186 transitions, 1875 flow, removed 14 selfloop flow, removed 9 redundant places. [2024-06-04 17:50:01,036 INFO L231 Difference]: Finished difference. Result has 243 places, 161 transitions, 1371 flow [2024-06-04 17:50:01,052 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1179, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1371, PETRI_PLACES=243, PETRI_TRANSITIONS=161} [2024-06-04 17:50:01,052 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 212 predicate places. [2024-06-04 17:50:01,052 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 161 transitions, 1371 flow [2024-06-04 17:50:01,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call 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:01,053 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:50:01,053 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:50:01,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2024-06-04 17:50:01,053 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:50:01,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:50:01,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1359155034, now seen corresponding path program 22 times [2024-06-04 17:50:01,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:50:01,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352683331] [2024-06-04 17:50:01,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:50:01,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:50:01,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:50:05,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:50:05,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:50:05,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352683331] [2024-06-04 17:50:05,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352683331] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:50:05,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:50:05,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:50:05,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774851112] [2024-06-04 17:50:05,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:50:05,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:50:05,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:50:05,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:50:05,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:50:06,044 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:50:06,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 161 transitions, 1371 flow. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:50:06,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:50:06,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:50:06,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:50:06,430 INFO L124 PetriNetUnfolderBase]: 508/999 cut-off events. [2024-06-04 17:50:06,430 INFO L125 PetriNetUnfolderBase]: For 137337/137337 co-relation queries the response was YES. [2024-06-04 17:50:06,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6259 conditions, 999 events. 508/999 cut-off events. For 137337/137337 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 5410 event pairs, 126 based on Foata normal form. 2/999 useless extension candidates. Maximal degree in co-relation 6142. Up to 718 conditions per place. [2024-06-04 17:50:06,439 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 127 selfloop transitions, 52 changer transitions 0/181 dead transitions. [2024-06-04 17:50:06,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 181 transitions, 1783 flow [2024-06-04 17:50:06,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:50:06,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:50:06,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 124 transitions. [2024-06-04 17:50:06,440 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3522727272727273 [2024-06-04 17:50:06,440 INFO L175 Difference]: Start difference. First operand has 243 places, 161 transitions, 1371 flow. Second operand 11 states and 124 transitions. [2024-06-04 17:50:06,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 181 transitions, 1783 flow [2024-06-04 17:50:06,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 181 transitions, 1679 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-06-04 17:50:06,764 INFO L231 Difference]: Finished difference. Result has 247 places, 161 transitions, 1375 flow [2024-06-04 17:50:06,765 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1267, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1375, PETRI_PLACES=247, PETRI_TRANSITIONS=161} [2024-06-04 17:50:06,765 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 216 predicate places. [2024-06-04 17:50:06,765 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 161 transitions, 1375 flow [2024-06-04 17:50:06,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:50:06,765 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:50:06,765 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:50:06,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2024-06-04 17:50:06,766 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:50:06,766 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:50:06,766 INFO L85 PathProgramCache]: Analyzing trace with hash 739837700, now seen corresponding path program 6 times [2024-06-04 17:50:06,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:50:06,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302909054] [2024-06-04 17:50:06,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:50:06,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:50:06,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:50:11,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:50:11,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:50:11,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302909054] [2024-06-04 17:50:11,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302909054] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:50:11,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:50:11,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:50:11,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379976582] [2024-06-04 17:50:11,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:50:11,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:50:11,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:50:11,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:50:11,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:50:11,816 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:50:11,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 161 transitions, 1375 flow. Second operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:50:11,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:50:11,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:50:11,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:50:12,164 INFO L124 PetriNetUnfolderBase]: 495/976 cut-off events. [2024-06-04 17:50:12,164 INFO L125 PetriNetUnfolderBase]: For 130416/130416 co-relation queries the response was YES. [2024-06-04 17:50:12,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5294 conditions, 976 events. 495/976 cut-off events. For 130416/130416 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 5281 event pairs, 111 based on Foata normal form. 10/984 useless extension candidates. Maximal degree in co-relation 5175. Up to 624 conditions per place. [2024-06-04 17:50:12,174 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 120 selfloop transitions, 56 changer transitions 7/185 dead transitions. [2024-06-04 17:50:12,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 185 transitions, 1815 flow [2024-06-04 17:50:12,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:50:12,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:50:12,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 132 transitions. [2024-06-04 17:50:12,175 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-04 17:50:12,175 INFO L175 Difference]: Start difference. First operand has 247 places, 161 transitions, 1375 flow. Second operand 11 states and 132 transitions. [2024-06-04 17:50:12,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 185 transitions, 1815 flow [2024-06-04 17:50:12,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 185 transitions, 1665 flow, removed 15 selfloop flow, removed 11 redundant places. [2024-06-04 17:50:12,445 INFO L231 Difference]: Finished difference. Result has 247 places, 158 transitions, 1323 flow [2024-06-04 17:50:12,445 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1225, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1323, PETRI_PLACES=247, PETRI_TRANSITIONS=158} [2024-06-04 17:50:12,446 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 216 predicate places. [2024-06-04 17:50:12,446 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 158 transitions, 1323 flow [2024-06-04 17:50:12,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call 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:12,446 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:50:12,446 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:50:12,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2024-06-04 17:50:12,447 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:50:12,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:50:12,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1359431740, now seen corresponding path program 7 times [2024-06-04 17:50:12,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:50:12,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697529671] [2024-06-04 17:50:12,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:50:12,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:50:12,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:50:17,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:50:17,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:50:17,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697529671] [2024-06-04 17:50:17,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697529671] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:50:17,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:50:17,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:50:17,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874409428] [2024-06-04 17:50:17,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:50:17,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:50:17,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:50:17,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:50:17,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:50:17,311 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:50:17,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 158 transitions, 1323 flow. Second operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:50:17,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:50:17,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:50:17,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:50:17,681 INFO L124 PetriNetUnfolderBase]: 498/989 cut-off events. [2024-06-04 17:50:17,681 INFO L125 PetriNetUnfolderBase]: For 151252/151252 co-relation queries the response was YES. [2024-06-04 17:50:17,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5837 conditions, 989 events. 498/989 cut-off events. For 151252/151252 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 5368 event pairs, 116 based on Foata normal form. 8/995 useless extension candidates. Maximal degree in co-relation 5717. Up to 590 conditions per place. [2024-06-04 17:50:17,689 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 121 selfloop transitions, 53 changer transitions 8/184 dead transitions. [2024-06-04 17:50:17,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 184 transitions, 1957 flow [2024-06-04 17:50:17,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:50:17,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:50:17,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 133 transitions. [2024-06-04 17:50:17,690 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3778409090909091 [2024-06-04 17:50:17,690 INFO L175 Difference]: Start difference. First operand has 247 places, 158 transitions, 1323 flow. Second operand 11 states and 133 transitions. [2024-06-04 17:50:17,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 184 transitions, 1957 flow [2024-06-04 17:50:18,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 184 transitions, 1837 flow, removed 2 selfloop flow, removed 12 redundant places. [2024-06-04 17:50:18,020 INFO L231 Difference]: Finished difference. Result has 246 places, 155 transitions, 1294 flow [2024-06-04 17:50:18,020 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1205, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1294, PETRI_PLACES=246, PETRI_TRANSITIONS=155} [2024-06-04 17:50:18,021 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 215 predicate places. [2024-06-04 17:50:18,021 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 155 transitions, 1294 flow [2024-06-04 17:50:18,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call 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:18,021 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:50:18,021 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:50:18,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2024-06-04 17:50:18,021 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:50:18,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:50:18,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1259315254, now seen corresponding path program 23 times [2024-06-04 17:50:18,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:50:18,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769323468] [2024-06-04 17:50:18,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:50:18,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:50:18,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:50:22,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:50:22,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:50:22,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769323468] [2024-06-04 17:50:22,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769323468] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:50:22,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:50:22,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:50:22,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691080979] [2024-06-04 17:50:22,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:50:22,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:50:22,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:50:22,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:50:22,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:50:22,768 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:50:22,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 155 transitions, 1294 flow. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:50:22,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:50:22,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:50:22,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:50:23,156 INFO L124 PetriNetUnfolderBase]: 512/1015 cut-off events. [2024-06-04 17:50:23,157 INFO L125 PetriNetUnfolderBase]: For 170683/170683 co-relation queries the response was YES. [2024-06-04 17:50:23,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6911 conditions, 1015 events. 512/1015 cut-off events. For 170683/170683 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 5522 event pairs, 119 based on Foata normal form. 2/1015 useless extension candidates. Maximal degree in co-relation 6791. Up to 620 conditions per place. [2024-06-04 17:50:23,166 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 113 selfloop transitions, 67 changer transitions 0/182 dead transitions. [2024-06-04 17:50:23,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 182 transitions, 1959 flow [2024-06-04 17:50:23,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 17:50:23,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 17:50:23,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 140 transitions. [2024-06-04 17:50:23,167 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3645833333333333 [2024-06-04 17:50:23,167 INFO L175 Difference]: Start difference. First operand has 246 places, 155 transitions, 1294 flow. Second operand 12 states and 140 transitions. [2024-06-04 17:50:23,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 182 transitions, 1959 flow [2024-06-04 17:50:23,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 182 transitions, 1844 flow, removed 6 selfloop flow, removed 11 redundant places. [2024-06-04 17:50:23,562 INFO L231 Difference]: Finished difference. Result has 244 places, 156 transitions, 1358 flow [2024-06-04 17:50:23,562 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1185, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1358, PETRI_PLACES=244, PETRI_TRANSITIONS=156} [2024-06-04 17:50:23,563 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 213 predicate places. [2024-06-04 17:50:23,563 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 156 transitions, 1358 flow [2024-06-04 17:50:23,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:50:23,563 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:50:23,563 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:50:23,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2024-06-04 17:50:23,563 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:50:23,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:50:23,564 INFO L85 PathProgramCache]: Analyzing trace with hash -110432648, now seen corresponding path program 24 times [2024-06-04 17:50:23,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:50:23,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563993839] [2024-06-04 17:50:23,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:50:23,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:50:23,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:50:28,428 INFO 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:28,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:50:28,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563993839] [2024-06-04 17:50:28,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563993839] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:50:28,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:50:28,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 17:50:28,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009188644] [2024-06-04 17:50:28,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:50:28,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 17:50:28,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:50:28,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 17:50:28,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-06-04 17:50:28,549 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:50:28,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 156 transitions, 1358 flow. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:50:28,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:50:28,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:50:28,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:50:28,947 INFO L124 PetriNetUnfolderBase]: 509/1010 cut-off events. [2024-06-04 17:50:28,947 INFO L125 PetriNetUnfolderBase]: For 154885/154885 co-relation queries the response was YES. [2024-06-04 17:50:28,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6663 conditions, 1010 events. 509/1010 cut-off events. For 154885/154885 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 5497 event pairs, 126 based on Foata normal form. 2/1010 useless extension candidates. Maximal degree in co-relation 6545. Up to 729 conditions per place. [2024-06-04 17:50:28,956 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 114 selfloop transitions, 61 changer transitions 0/177 dead transitions. [2024-06-04 17:50:28,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 177 transitions, 1764 flow [2024-06-04 17:50:28,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 17:50:28,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 17:50:28,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 131 transitions. [2024-06-04 17:50:28,958 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3411458333333333 [2024-06-04 17:50:28,958 INFO L175 Difference]: Start difference. First operand has 244 places, 156 transitions, 1358 flow. Second operand 12 states and 131 transitions. [2024-06-04 17:50:28,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 177 transitions, 1764 flow [2024-06-04 17:50:29,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 177 transitions, 1553 flow, removed 27 selfloop flow, removed 10 redundant places. [2024-06-04 17:50:29,355 INFO L231 Difference]: Finished difference. Result has 246 places, 156 transitions, 1273 flow [2024-06-04 17:50:29,356 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1147, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1273, PETRI_PLACES=246, PETRI_TRANSITIONS=156} [2024-06-04 17:50:29,356 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 215 predicate places. [2024-06-04 17:50:29,356 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 156 transitions, 1273 flow [2024-06-04 17:50:29,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:50:29,356 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:50:29,356 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:50:29,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2024-06-04 17:50:29,357 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:50:29,357 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:50:29,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1003529240, now seen corresponding path program 8 times [2024-06-04 17:50:29,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:50:29,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820280274] [2024-06-04 17:50:29,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:50:29,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:50:29,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:50:34,324 INFO 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:34,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:50:34,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820280274] [2024-06-04 17:50:34,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820280274] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:50:34,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:50:34,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:50:34,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659755457] [2024-06-04 17:50:34,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:50:34,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:50:34,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:50:34,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:50:34,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:50:34,472 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:50:34,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 156 transitions, 1273 flow. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:50:34,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:50:34,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:50:34,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:50:34,878 INFO L124 PetriNetUnfolderBase]: 496/987 cut-off events. [2024-06-04 17:50:34,878 INFO L125 PetriNetUnfolderBase]: For 147754/147754 co-relation queries the response was YES. [2024-06-04 17:50:34,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5496 conditions, 987 events. 496/987 cut-off events. For 147754/147754 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 5354 event pairs, 111 based on Foata normal form. 10/995 useless extension candidates. Maximal degree in co-relation 5378. Up to 644 conditions per place. [2024-06-04 17:50:34,887 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 108 selfloop transitions, 63 changer transitions 8/181 dead transitions. [2024-06-04 17:50:34,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 181 transitions, 1707 flow [2024-06-04 17:50:34,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 17:50:34,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 17:50:34,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 138 transitions. [2024-06-04 17:50:34,888 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.359375 [2024-06-04 17:50:34,888 INFO L175 Difference]: Start difference. First operand has 246 places, 156 transitions, 1273 flow. Second operand 12 states and 138 transitions. [2024-06-04 17:50:34,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 181 transitions, 1707 flow [2024-06-04 17:50:35,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 181 transitions, 1486 flow, removed 5 selfloop flow, removed 14 redundant places. [2024-06-04 17:50:35,193 INFO L231 Difference]: Finished difference. Result has 244 places, 152 transitions, 1158 flow [2024-06-04 17:50:35,193 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1052, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1158, PETRI_PLACES=244, PETRI_TRANSITIONS=152} [2024-06-04 17:50:35,194 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 213 predicate places. [2024-06-04 17:50:35,194 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 152 transitions, 1158 flow [2024-06-04 17:50:35,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:50:35,194 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:50:35,194 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:50:35,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2024-06-04 17:50:35,195 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:50:35,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:50:35,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1003519940, now seen corresponding path program 9 times [2024-06-04 17:50:35,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:50:35,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719608882] [2024-06-04 17:50:35,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:50:35,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:50:35,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:50:40,111 INFO 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,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:50:40,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719608882] [2024-06-04 17:50:40,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719608882] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:50:40,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:50:40,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:50:40,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959861557] [2024-06-04 17:50:40,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:50:40,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:50:40,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:50:40,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:50:40,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:50:40,278 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:50:40,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 152 transitions, 1158 flow. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:50:40,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:50:40,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:50:40,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:50:40,660 INFO L124 PetriNetUnfolderBase]: 497/998 cut-off events. [2024-06-04 17:50:40,661 INFO L125 PetriNetUnfolderBase]: For 169369/169369 co-relation queries the response was YES. [2024-06-04 17:50:40,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5957 conditions, 998 events. 497/998 cut-off events. For 169369/169369 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 5458 event pairs, 120 based on Foata normal form. 8/1004 useless extension candidates. Maximal degree in co-relation 5838. Up to 620 conditions per place. [2024-06-04 17:50:40,669 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 109 selfloop transitions, 58 changer transitions 11/180 dead transitions. [2024-06-04 17:50:40,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 180 transitions, 1790 flow [2024-06-04 17:50:40,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 17:50:40,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 17:50:40,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 141 transitions. [2024-06-04 17:50:40,671 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3671875 [2024-06-04 17:50:40,671 INFO L175 Difference]: Start difference. First operand has 244 places, 152 transitions, 1158 flow. Second operand 12 states and 141 transitions. [2024-06-04 17:50:40,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 180 transitions, 1790 flow [2024-06-04 17:50:41,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 180 transitions, 1623 flow, removed 2 selfloop flow, removed 14 redundant places. [2024-06-04 17:50:41,086 INFO L231 Difference]: Finished difference. Result has 242 places, 146 transitions, 1078 flow [2024-06-04 17:50:41,086 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=993, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1078, PETRI_PLACES=242, PETRI_TRANSITIONS=146} [2024-06-04 17:50:41,087 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 211 predicate places. [2024-06-04 17:50:41,087 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 146 transitions, 1078 flow [2024-06-04 17:50:41,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:50:41,087 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:50:41,087 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:50:41,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2024-06-04 17:50:41,088 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:50:41,088 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:50:41,088 INFO L85 PathProgramCache]: Analyzing trace with hash -993076218, now seen corresponding path program 10 times [2024-06-04 17:50:41,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:50:41,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496213962] [2024-06-04 17:50:41,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:50:41,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:50:41,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:50:46,032 INFO 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:46,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:50:46,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496213962] [2024-06-04 17:50:46,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496213962] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:50:46,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:50:46,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:50:46,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482534714] [2024-06-04 17:50:46,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:50:46,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:50:46,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:50:46,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:50:46,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:50:46,159 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:50:46,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 146 transitions, 1078 flow. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:50:46,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:50:46,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:50:46,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:50:46,546 INFO L124 PetriNetUnfolderBase]: 484/979 cut-off events. [2024-06-04 17:50:46,547 INFO L125 PetriNetUnfolderBase]: For 178735/178735 co-relation queries the response was YES. [2024-06-04 17:50:46,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5983 conditions, 979 events. 484/979 cut-off events. For 178735/178735 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 5316 event pairs, 123 based on Foata normal form. 8/985 useless extension candidates. Maximal degree in co-relation 5865. Up to 518 conditions per place. [2024-06-04 17:50:46,556 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 104 selfloop transitions, 57 changer transitions 11/174 dead transitions. [2024-06-04 17:50:46,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 174 transitions, 1690 flow [2024-06-04 17:50:46,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-04 17:50:46,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-04 17:50:46,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 143 transitions. [2024-06-04 17:50:46,557 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34375 [2024-06-04 17:50:46,557 INFO L175 Difference]: Start difference. First operand has 242 places, 146 transitions, 1078 flow. Second operand 13 states and 143 transitions. [2024-06-04 17:50:46,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 174 transitions, 1690 flow [2024-06-04 17:50:46,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 174 transitions, 1555 flow, removed 10 selfloop flow, removed 14 redundant places. [2024-06-04 17:50:46,884 INFO L231 Difference]: Finished difference. Result has 236 places, 141 transitions, 1039 flow [2024-06-04 17:50:46,884 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=953, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1039, PETRI_PLACES=236, PETRI_TRANSITIONS=141} [2024-06-04 17:50:46,888 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 205 predicate places. [2024-06-04 17:50:46,888 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 141 transitions, 1039 flow [2024-06-04 17:50:46,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:50:46,904 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:50:46,904 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:46,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2024-06-04 17:50:46,905 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:50:46,905 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:50:46,905 INFO L85 PathProgramCache]: Analyzing trace with hash -380780201, now seen corresponding path program 1 times [2024-06-04 17:50:46,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:50:46,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987955588] [2024-06-04 17:50:46,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:50:46,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:50:46,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:50:52,072 INFO 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:52,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:50:52,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987955588] [2024-06-04 17:50:52,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987955588] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:50:52,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:50:52,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 17:50:52,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289159878] [2024-06-04 17:50:52,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:50:52,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 17:50:52,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:50:52,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 17:50:52,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-06-04 17:50:52,234 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:50:52,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 141 transitions, 1039 flow. Second operand has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:50:52,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:50:52,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:50:52,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:50:52,620 INFO L124 PetriNetUnfolderBase]: 466/941 cut-off events. [2024-06-04 17:50:52,620 INFO L125 PetriNetUnfolderBase]: For 155650/155650 co-relation queries the response was YES. [2024-06-04 17:50:52,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5741 conditions, 941 events. 466/941 cut-off events. For 155650/155650 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 5005 event pairs, 133 based on Foata normal form. 6/945 useless extension candidates. Maximal degree in co-relation 5627. Up to 831 conditions per place. [2024-06-04 17:50:52,628 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 134 selfloop transitions, 8 changer transitions 23/167 dead transitions. [2024-06-04 17:50:52,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 167 transitions, 1431 flow [2024-06-04 17:50:52,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 17:50:52,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 17:50:52,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 119 transitions. [2024-06-04 17:50:52,629 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3098958333333333 [2024-06-04 17:50:52,629 INFO L175 Difference]: Start difference. First operand has 236 places, 141 transitions, 1039 flow. Second operand 12 states and 119 transitions. [2024-06-04 17:50:52,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 167 transitions, 1431 flow [2024-06-04 17:50:52,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 167 transitions, 1282 flow, removed 6 selfloop flow, removed 13 redundant places. [2024-06-04 17:50:52,896 INFO L231 Difference]: Finished difference. Result has 230 places, 135 transitions, 879 flow [2024-06-04 17:50:52,896 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=892, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=879, PETRI_PLACES=230, PETRI_TRANSITIONS=135} [2024-06-04 17:50:52,896 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 199 predicate places. [2024-06-04 17:50:52,896 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 135 transitions, 879 flow [2024-06-04 17:50:52,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:50:52,897 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:50:52,897 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:52,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2024-06-04 17:50:52,897 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:50:52,897 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:50:52,897 INFO L85 PathProgramCache]: Analyzing trace with hash -332378057, now seen corresponding path program 2 times [2024-06-04 17:50:52,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:50:52,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300813359] [2024-06-04 17:50:52,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:50:52,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:50:52,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:50:57,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:57,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:50:57,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300813359] [2024-06-04 17:50:57,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300813359] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:50:57,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:50:57,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:50:57,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816501326] [2024-06-04 17:50:57,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:50:57,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:50:57,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:50:57,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:50:57,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:50:57,746 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:50:57,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 135 transitions, 879 flow. Second operand has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:50:57,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:50:57,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:50:57,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:50:58,016 INFO L124 PetriNetUnfolderBase]: 438/887 cut-off events. [2024-06-04 17:50:58,016 INFO L125 PetriNetUnfolderBase]: For 145623/145623 co-relation queries the response was YES. [2024-06-04 17:50:58,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5291 conditions, 887 events. 438/887 cut-off events. For 145623/145623 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 4665 event pairs, 76 based on Foata normal form. 6/891 useless extension candidates. Maximal degree in co-relation 5180. Up to 278 conditions per place. [2024-06-04 17:50:58,023 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 75 selfloop transitions, 54 changer transitions 22/153 dead transitions. [2024-06-04 17:50:58,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 153 transitions, 1221 flow [2024-06-04 17:50:58,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:50:58,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:50:58,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 105 transitions. [2024-06-04 17:50:58,024 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29829545454545453 [2024-06-04 17:50:58,024 INFO L175 Difference]: Start difference. First operand has 230 places, 135 transitions, 879 flow. Second operand 11 states and 105 transitions. [2024-06-04 17:50:58,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 153 transitions, 1221 flow [2024-06-04 17:50:58,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 153 transitions, 1193 flow, removed 6 selfloop flow, removed 11 redundant places. [2024-06-04 17:50:58,290 INFO L231 Difference]: Finished difference. Result has 219 places, 123 transitions, 897 flow [2024-06-04 17:50:58,290 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=851, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=897, PETRI_PLACES=219, PETRI_TRANSITIONS=123} [2024-06-04 17:50:58,291 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 188 predicate places. [2024-06-04 17:50:58,291 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 123 transitions, 897 flow [2024-06-04 17:50:58,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:50:58,291 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:50:58,291 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:58,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2024-06-04 17:50:58,291 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:50:58,292 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:50:58,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1701567083, now seen corresponding path program 3 times [2024-06-04 17:50:58,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:50:58,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780266282] [2024-06-04 17:50:58,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:50:58,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:50:58,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:51:03,402 INFO 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:03,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:51:03,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780266282] [2024-06-04 17:51:03,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780266282] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:51:03,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:51:03,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 17:51:03,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339356891] [2024-06-04 17:51:03,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:51:03,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 17:51:03,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:51:03,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 17:51:03,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-06-04 17:51:03,582 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:51:03,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 123 transitions, 897 flow. Second operand has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:51:03,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:51:03,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:51:03,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:51:03,925 INFO L124 PetriNetUnfolderBase]: 396/813 cut-off events. [2024-06-04 17:51:03,925 INFO L125 PetriNetUnfolderBase]: For 130074/130074 co-relation queries the response was YES. [2024-06-04 17:51:03,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5059 conditions, 813 events. 396/813 cut-off events. For 130074/130074 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4219 event pairs, 111 based on Foata normal form. 6/817 useless extension candidates. Maximal degree in co-relation 4953. Up to 687 conditions per place. [2024-06-04 17:51:03,931 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 117 selfloop transitions, 17 changer transitions 10/146 dead transitions. [2024-06-04 17:51:03,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 146 transitions, 1243 flow [2024-06-04 17:51:03,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 17:51:03,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 17:51:03,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 118 transitions. [2024-06-04 17:51:03,932 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3072916666666667 [2024-06-04 17:51:03,932 INFO L175 Difference]: Start difference. First operand has 219 places, 123 transitions, 897 flow. Second operand 12 states and 118 transitions. [2024-06-04 17:51:03,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 146 transitions, 1243 flow [2024-06-04 17:51:04,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 146 transitions, 1117 flow, removed 9 selfloop flow, removed 15 redundant places. [2024-06-04 17:51:04,090 INFO L231 Difference]: Finished difference. Result has 204 places, 119 transitions, 784 flow [2024-06-04 17:51:04,090 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=771, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=784, PETRI_PLACES=204, PETRI_TRANSITIONS=119} [2024-06-04 17:51:04,091 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 173 predicate places. [2024-06-04 17:51:04,091 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 119 transitions, 784 flow [2024-06-04 17:51:04,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:51:04,091 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:51:04,091 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:04,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2024-06-04 17:51:04,091 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:51:04,092 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:51:04,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1048378739, now seen corresponding path program 4 times [2024-06-04 17:51:04,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:51:04,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859103412] [2024-06-04 17:51:04,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:51:04,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:51:04,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:51:09,203 INFO 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:09,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:51:09,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859103412] [2024-06-04 17:51:09,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859103412] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:51:09,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:51:09,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 17:51:09,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484476227] [2024-06-04 17:51:09,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:51:09,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 17:51:09,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:51:09,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 17:51:09,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-06-04 17:51:09,336 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:51:09,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 119 transitions, 784 flow. Second operand has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:51:09,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:51:09,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:51:09,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:51:09,676 INFO L124 PetriNetUnfolderBase]: 384/793 cut-off events. [2024-06-04 17:51:09,676 INFO L125 PetriNetUnfolderBase]: For 106581/106581 co-relation queries the response was YES. [2024-06-04 17:51:09,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4640 conditions, 793 events. 384/793 cut-off events. For 106581/106581 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4092 event pairs, 113 based on Foata normal form. 6/797 useless extension candidates. Maximal degree in co-relation 4542. Up to 683 conditions per place. [2024-06-04 17:51:09,682 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 111 selfloop transitions, 12 changer transitions 17/142 dead transitions. [2024-06-04 17:51:09,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 142 transitions, 1124 flow [2024-06-04 17:51:09,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 17:51:09,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 17:51:09,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 116 transitions. [2024-06-04 17:51:09,683 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3020833333333333 [2024-06-04 17:51:09,683 INFO L175 Difference]: Start difference. First operand has 204 places, 119 transitions, 784 flow. Second operand 12 states and 116 transitions. [2024-06-04 17:51:09,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 142 transitions, 1124 flow [2024-06-04 17:51:09,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 142 transitions, 1084 flow, removed 3 selfloop flow, removed 12 redundant places. [2024-06-04 17:51:09,844 INFO L231 Difference]: Finished difference. Result has 200 places, 112 transitions, 719 flow [2024-06-04 17:51:09,844 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=744, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=719, PETRI_PLACES=200, PETRI_TRANSITIONS=112} [2024-06-04 17:51:09,844 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 169 predicate places. [2024-06-04 17:51:09,844 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 112 transitions, 719 flow [2024-06-04 17:51:09,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:51:09,845 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:51:09,845 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:09,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2024-06-04 17:51:09,845 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:51:09,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:51:09,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1053020369, now seen corresponding path program 5 times [2024-06-04 17:51:09,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:51:09,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817207612] [2024-06-04 17:51:09,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:51:09,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:51:09,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:51:14,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:51:14,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:51:14,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817207612] [2024-06-04 17:51:14,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817207612] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:51:14,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:51:14,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:51:14,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34666788] [2024-06-04 17:51:14,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:51:14,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:51:14,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:51:14,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:51:14,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:51:14,768 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:51:14,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 112 transitions, 719 flow. Second operand has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:51:14,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:51:14,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:51:14,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:51:15,028 INFO L124 PetriNetUnfolderBase]: 366/759 cut-off events. [2024-06-04 17:51:15,028 INFO L125 PetriNetUnfolderBase]: For 101233/101233 co-relation queries the response was YES. [2024-06-04 17:51:15,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4440 conditions, 759 events. 366/759 cut-off events. For 101233/101233 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3887 event pairs, 91 based on Foata normal form. 6/763 useless extension candidates. Maximal degree in co-relation 4357. Up to 340 conditions per place. [2024-06-04 17:51:15,034 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 64 selfloop transitions, 37 changer transitions 27/130 dead transitions. [2024-06-04 17:51:15,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 130 transitions, 1017 flow [2024-06-04 17:51:15,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:51:15,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:51:15,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 111 transitions. [2024-06-04 17:51:15,035 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3153409090909091 [2024-06-04 17:51:15,035 INFO L175 Difference]: Start difference. First operand has 200 places, 112 transitions, 719 flow. Second operand 11 states and 111 transitions. [2024-06-04 17:51:15,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 130 transitions, 1017 flow [2024-06-04 17:51:15,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 130 transitions, 985 flow, removed 4 selfloop flow, removed 11 redundant places. [2024-06-04 17:51:15,196 INFO L231 Difference]: Finished difference. Result has 191 places, 93 transitions, 650 flow [2024-06-04 17:51:15,196 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=687, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=650, PETRI_PLACES=191, PETRI_TRANSITIONS=93} [2024-06-04 17:51:15,196 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 160 predicate places. [2024-06-04 17:51:15,196 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 93 transitions, 650 flow [2024-06-04 17:51:15,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:51:15,197 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:51:15,197 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:15,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2024-06-04 17:51:15,197 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:51:15,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:51:15,197 INFO L85 PathProgramCache]: Analyzing trace with hash 541929835, now seen corresponding path program 6 times [2024-06-04 17:51:15,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:51:15,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679753148] [2024-06-04 17:51:15,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:51:15,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:51:15,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:51:20,061 INFO 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:20,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:51:20,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679753148] [2024-06-04 17:51:20,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679753148] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:51:20,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:51:20,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:51:20,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262290212] [2024-06-04 17:51:20,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:51:20,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:51:20,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:51:20,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:51:20,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:51:20,190 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:51:20,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 93 transitions, 650 flow. Second operand has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call 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:20,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:51:20,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:51:20,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:51:20,430 INFO L124 PetriNetUnfolderBase]: 291/608 cut-off events. [2024-06-04 17:51:20,430 INFO L125 PetriNetUnfolderBase]: For 77696/77696 co-relation queries the response was YES. [2024-06-04 17:51:20,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3549 conditions, 608 events. 291/608 cut-off events. For 77696/77696 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2933 event pairs, 76 based on Foata normal form. 6/612 useless extension candidates. Maximal degree in co-relation 3469. Up to 333 conditions per place. [2024-06-04 17:51:20,434 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 60 selfloop transitions, 30 changer transitions 19/111 dead transitions. [2024-06-04 17:51:20,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 111 transitions, 914 flow [2024-06-04 17:51:20,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:51:20,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:51:20,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 110 transitions. [2024-06-04 17:51:20,435 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3125 [2024-06-04 17:51:20,436 INFO L175 Difference]: Start difference. First operand has 191 places, 93 transitions, 650 flow. Second operand 11 states and 110 transitions. [2024-06-04 17:51:20,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 111 transitions, 914 flow [2024-06-04 17:51:20,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 111 transitions, 804 flow, removed 17 selfloop flow, removed 22 redundant places. [2024-06-04 17:51:20,532 INFO L231 Difference]: Finished difference. Result has 162 places, 81 transitions, 550 flow [2024-06-04 17:51:20,532 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=550, PETRI_PLACES=162, PETRI_TRANSITIONS=81} [2024-06-04 17:51:20,532 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 131 predicate places. [2024-06-04 17:51:20,532 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 81 transitions, 550 flow [2024-06-04 17:51:20,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call 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:20,532 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:51:20,533 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:20,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2024-06-04 17:51:20,533 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:51:20,533 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:51:20,533 INFO L85 PathProgramCache]: Analyzing trace with hash 313855705, now seen corresponding path program 7 times [2024-06-04 17:51:20,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:51:20,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037054849] [2024-06-04 17:51:20,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:51:20,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:51:20,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:51:25,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:51:25,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:51:25,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037054849] [2024-06-04 17:51:25,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037054849] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:51:25,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:51:25,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:51:25,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631370418] [2024-06-04 17:51:25,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:51:25,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:51:25,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:51:25,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:51:25,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:51:25,882 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:51:25,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 81 transitions, 550 flow. Second operand has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call 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:25,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:51:25,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:51:25,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:51:26,168 INFO L124 PetriNetUnfolderBase]: 253/538 cut-off events. [2024-06-04 17:51:26,168 INFO L125 PetriNetUnfolderBase]: For 53934/53934 co-relation queries the response was YES. [2024-06-04 17:51:26,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2985 conditions, 538 events. 253/538 cut-off events. For 53934/53934 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2495 event pairs, 70 based on Foata normal form. 6/542 useless extension candidates. Maximal degree in co-relation 2918. Up to 279 conditions per place. [2024-06-04 17:51:26,171 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 44 selfloop transitions, 18 changer transitions 35/99 dead transitions. [2024-06-04 17:51:26,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 99 transitions, 784 flow [2024-06-04 17:51:26,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:51:26,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:51:26,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 108 transitions. [2024-06-04 17:51:26,172 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3068181818181818 [2024-06-04 17:51:26,173 INFO L175 Difference]: Start difference. First operand has 162 places, 81 transitions, 550 flow. Second operand 11 states and 108 transitions. [2024-06-04 17:51:26,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 99 transitions, 784 flow [2024-06-04 17:51:26,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 99 transitions, 706 flow, removed 9 selfloop flow, removed 17 redundant places. [2024-06-04 17:51:26,230 INFO L231 Difference]: Finished difference. Result has 146 places, 60 transitions, 401 flow [2024-06-04 17:51:26,230 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=472, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=401, PETRI_PLACES=146, PETRI_TRANSITIONS=60} [2024-06-04 17:51:26,231 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 115 predicate places. [2024-06-04 17:51:26,231 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 60 transitions, 401 flow [2024-06-04 17:51:26,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call 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:26,231 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:51:26,231 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:26,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2024-06-04 17:51:26,232 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:51:26,232 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:51:26,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1728994633, now seen corresponding path program 8 times [2024-06-04 17:51:26,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:51:26,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225562621] [2024-06-04 17:51:26,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:51:26,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:51:26,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:51:31,719 INFO 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:31,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:51:31,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225562621] [2024-06-04 17:51:31,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225562621] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:51:31,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:51:31,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-06-04 17:51:31,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908906821] [2024-06-04 17:51:31,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:51:31,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-06-04 17:51:31,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:51:31,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-06-04 17:51:31,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2024-06-04 17:51:31,923 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:51:31,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 60 transitions, 401 flow. Second operand has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:51:31,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:51:31,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:51:31,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:51:32,171 INFO L124 PetriNetUnfolderBase]: 186/400 cut-off events. [2024-06-04 17:51:32,171 INFO L125 PetriNetUnfolderBase]: For 40418/40418 co-relation queries the response was YES. [2024-06-04 17:51:32,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2356 conditions, 400 events. 186/400 cut-off events. For 40418/40418 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1751 event pairs, 68 based on Foata normal form. 6/405 useless extension candidates. Maximal degree in co-relation 2297. Up to 263 conditions per place. [2024-06-04 17:51:32,174 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 44 selfloop transitions, 18 changer transitions 12/76 dead transitions. [2024-06-04 17:51:32,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 76 transitions, 583 flow [2024-06-04 17:51:32,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 17:51:32,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 17:51:32,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 110 transitions. [2024-06-04 17:51:32,175 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2864583333333333 [2024-06-04 17:51:32,175 INFO L175 Difference]: Start difference. First operand has 146 places, 60 transitions, 401 flow. Second operand 12 states and 110 transitions. [2024-06-04 17:51:32,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 76 transitions, 583 flow [2024-06-04 17:51:32,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 76 transitions, 499 flow, removed 15 selfloop flow, removed 25 redundant places. [2024-06-04 17:51:32,202 INFO L231 Difference]: Finished difference. Result has 115 places, 56 transitions, 336 flow [2024-06-04 17:51:32,203 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=336, PETRI_PLACES=115, PETRI_TRANSITIONS=56} [2024-06-04 17:51:32,203 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 84 predicate places. [2024-06-04 17:51:32,203 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 56 transitions, 336 flow [2024-06-04 17:51:32,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:51:32,203 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:51:32,203 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:32,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2024-06-04 17:51:32,204 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:51:32,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:51:32,204 INFO L85 PathProgramCache]: Analyzing trace with hash -383892851, now seen corresponding path program 9 times [2024-06-04 17:51:32,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:51:32,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18981960] [2024-06-04 17:51:32,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:51:32,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:51:32,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:51:37,113 INFO 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:37,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:51:37,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18981960] [2024-06-04 17:51:37,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18981960] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:51:37,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:51:37,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 17:51:37,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500551571] [2024-06-04 17:51:37,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:51:37,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 17:51:37,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:51:37,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 17:51:37,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-06-04 17:51:37,357 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:51:37,357 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 56 transitions, 336 flow. Second operand has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:51:37,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:51:37,357 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:51:37,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:51:37,659 INFO L124 PetriNetUnfolderBase]: 162/348 cut-off events. [2024-06-04 17:51:37,659 INFO L125 PetriNetUnfolderBase]: For 17266/17266 co-relation queries the response was YES. [2024-06-04 17:51:37,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1643 conditions, 348 events. 162/348 cut-off events. For 17266/17266 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1440 event pairs, 55 based on Foata normal form. 6/353 useless extension candidates. Maximal degree in co-relation 1598. Up to 220 conditions per place. [2024-06-04 17:51:37,661 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 41 selfloop transitions, 16 changer transitions 11/70 dead transitions. [2024-06-04 17:51:37,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 70 transitions, 502 flow [2024-06-04 17:51:37,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:51:37,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:51:37,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 101 transitions. [2024-06-04 17:51:37,662 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2869318181818182 [2024-06-04 17:51:37,662 INFO L175 Difference]: Start difference. First operand has 115 places, 56 transitions, 336 flow. Second operand 11 states and 101 transitions. [2024-06-04 17:51:37,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 70 transitions, 502 flow [2024-06-04 17:51:37,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 70 transitions, 458 flow, removed 4 selfloop flow, removed 12 redundant places. [2024-06-04 17:51:37,674 INFO L231 Difference]: Finished difference. Result has 108 places, 53 transitions, 312 flow [2024-06-04 17:51:37,674 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=312, PETRI_PLACES=108, PETRI_TRANSITIONS=53} [2024-06-04 17:51:37,674 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 77 predicate places. [2024-06-04 17:51:37,674 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 53 transitions, 312 flow [2024-06-04 17:51:37,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:51:37,675 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:51:37,675 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,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2024-06-04 17:51:37,675 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:51:37,675 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:51:37,675 INFO L85 PathProgramCache]: Analyzing trace with hash -384065831, now seen corresponding path program 10 times [2024-06-04 17:51:37,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:51:37,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246427602] [2024-06-04 17:51:37,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:51:37,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:51:37,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:51:42,772 INFO 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:42,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:51:42,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246427602] [2024-06-04 17:51:42,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246427602] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:51:42,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:51:42,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 17:51:42,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725827465] [2024-06-04 17:51:42,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:51:42,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 17:51:42,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:51:42,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 17:51:42,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-06-04 17:51:42,983 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:51:42,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 53 transitions, 312 flow. Second operand has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:51:42,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:51:42,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:51:42,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:51:43,243 INFO L124 PetriNetUnfolderBase]: 152/330 cut-off events. [2024-06-04 17:51:43,244 INFO L125 PetriNetUnfolderBase]: For 14677/14677 co-relation queries the response was YES. [2024-06-04 17:51:43,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1530 conditions, 330 events. 152/330 cut-off events. For 14677/14677 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1336 event pairs, 51 based on Foata normal form. 6/335 useless extension candidates. Maximal degree in co-relation 1488. Up to 196 conditions per place. [2024-06-04 17:51:43,245 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 39 selfloop transitions, 15 changer transitions 11/67 dead transitions. [2024-06-04 17:51:43,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 67 transitions, 472 flow [2024-06-04 17:51:43,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:51:43,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:51:43,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 101 transitions. [2024-06-04 17:51:43,246 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2869318181818182 [2024-06-04 17:51:43,246 INFO L175 Difference]: Start difference. First operand has 108 places, 53 transitions, 312 flow. Second operand 11 states and 101 transitions. [2024-06-04 17:51:43,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 67 transitions, 472 flow [2024-06-04 17:51:43,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 67 transitions, 434 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-04 17:51:43,257 INFO L231 Difference]: Finished difference. Result has 103 places, 48 transitions, 283 flow [2024-06-04 17:51:43,258 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=283, PETRI_PLACES=103, PETRI_TRANSITIONS=48} [2024-06-04 17:51:43,258 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 72 predicate places. [2024-06-04 17:51:43,258 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 48 transitions, 283 flow [2024-06-04 17:51:43,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:51:43,258 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:51:43,258 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:43,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2024-06-04 17:51:43,259 INFO L420 AbstractCegarLoop]: === Iteration 124 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:51:43,259 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:51:43,259 INFO L85 PathProgramCache]: Analyzing trace with hash 871556587, now seen corresponding path program 11 times [2024-06-04 17:51:43,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:51:43,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896034497] [2024-06-04 17:51:43,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:51:43,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:51:43,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:51:48,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:51:48,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:51:48,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896034497] [2024-06-04 17:51:48,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896034497] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:51:48,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:51:48,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 17:51:48,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192380467] [2024-06-04 17:51:48,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:51:48,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 17:51:48,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:51:48,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 17:51:48,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-06-04 17:51:48,780 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:51:48,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 48 transitions, 283 flow. Second operand has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:51:48,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:51:48,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:51:48,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:51:49,007 INFO L124 PetriNetUnfolderBase]: 124/270 cut-off events. [2024-06-04 17:51:49,007 INFO L125 PetriNetUnfolderBase]: For 9774/9774 co-relation queries the response was YES. [2024-06-04 17:51:49,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1150 conditions, 270 events. 124/270 cut-off events. For 9774/9774 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 996 event pairs, 40 based on Foata normal form. 6/275 useless extension candidates. Maximal degree in co-relation 1110. Up to 159 conditions per place. [2024-06-04 17:51:49,008 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 32 selfloop transitions, 11 changer transitions 17/62 dead transitions. [2024-06-04 17:51:49,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 62 transitions, 433 flow [2024-06-04 17:51:49,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 17:51:49,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 17:51:49,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 104 transitions. [2024-06-04 17:51:49,009 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2708333333333333 [2024-06-04 17:51:49,009 INFO L175 Difference]: Start difference. First operand has 103 places, 48 transitions, 283 flow. Second operand 12 states and 104 transitions. [2024-06-04 17:51:49,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 62 transitions, 433 flow [2024-06-04 17:51:49,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 62 transitions, 393 flow, removed 5 selfloop flow, removed 13 redundant places. [2024-06-04 17:51:49,017 INFO L231 Difference]: Finished difference. Result has 96 places, 42 transitions, 238 flow [2024-06-04 17:51:49,017 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=238, PETRI_PLACES=96, PETRI_TRANSITIONS=42} [2024-06-04 17:51:49,017 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 65 predicate places. [2024-06-04 17:51:49,017 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 42 transitions, 238 flow [2024-06-04 17:51:49,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:51:49,017 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:51:49,018 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:49,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2024-06-04 17:51:49,018 INFO L420 AbstractCegarLoop]: === Iteration 125 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:51:49,018 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:51:49,018 INFO L85 PathProgramCache]: Analyzing trace with hash -815865527, now seen corresponding path program 12 times [2024-06-04 17:51:49,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:51:49,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096506532] [2024-06-04 17:51:49,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:51:49,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:51:49,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:51:53,803 INFO 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:53,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:51:53,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096506532] [2024-06-04 17:51:53,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096506532] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:51:53,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:51:53,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:51:53,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126888982] [2024-06-04 17:51:53,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:51:53,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:51:53,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:51:53,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:51:53,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:51:53,954 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:51:53,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 42 transitions, 238 flow. Second operand has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call 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:53,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:51:53,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:51:53,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:51:54,124 INFO L124 PetriNetUnfolderBase]: 98/212 cut-off events. [2024-06-04 17:51:54,125 INFO L125 PetriNetUnfolderBase]: For 5044/5044 co-relation queries the response was YES. [2024-06-04 17:51:54,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 770 conditions, 212 events. 98/212 cut-off events. For 5044/5044 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 704 event pairs, 21 based on Foata normal form. 6/217 useless extension candidates. Maximal degree in co-relation 734. Up to 96 conditions per place. [2024-06-04 17:51:54,125 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 26 selfloop transitions, 9 changer transitions 18/55 dead transitions. [2024-06-04 17:51:54,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 55 transitions, 372 flow [2024-06-04 17:51:54,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:51:54,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:51:54,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 92 transitions. [2024-06-04 17:51:54,126 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2875 [2024-06-04 17:51:54,126 INFO L175 Difference]: Start difference. First operand has 96 places, 42 transitions, 238 flow. Second operand 10 states and 92 transitions. [2024-06-04 17:51:54,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 55 transitions, 372 flow [2024-06-04 17:51:54,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 55 transitions, 338 flow, removed 6 selfloop flow, removed 11 redundant places. [2024-06-04 17:51:54,148 INFO L231 Difference]: Finished difference. Result has 82 places, 32 transitions, 177 flow [2024-06-04 17:51:54,149 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=177, PETRI_PLACES=82, PETRI_TRANSITIONS=32} [2024-06-04 17:51:54,164 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 51 predicate places. [2024-06-04 17:51:54,164 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 32 transitions, 177 flow [2024-06-04 17:51:54,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call 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:54,164 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:51:54,165 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:54,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124 [2024-06-04 17:51:54,165 INFO L420 AbstractCegarLoop]: === Iteration 126 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:51:54,165 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:51:54,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1043939657, now seen corresponding path program 13 times [2024-06-04 17:51:54,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:51:54,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608550333] [2024-06-04 17:51:54,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:51:54,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:51:54,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:51:59,268 INFO 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:59,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:51:59,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608550333] [2024-06-04 17:51:59,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608550333] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:51:59,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:51:59,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:51:59,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642795883] [2024-06-04 17:51:59,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:51:59,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:51:59,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:51:59,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:51:59,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:51:59,471 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:51:59,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 32 transitions, 177 flow. Second operand has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call 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:59,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:51:59,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:51:59,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:51:59,642 INFO L124 PetriNetUnfolderBase]: 69/157 cut-off events. [2024-06-04 17:51:59,643 INFO L125 PetriNetUnfolderBase]: For 3450/3450 co-relation queries the response was YES. [2024-06-04 17:51:59,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 579 conditions, 157 events. 69/157 cut-off events. For 3450/3450 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 447 event pairs, 17 based on Foata normal form. 6/162 useless extension candidates. Maximal degree in co-relation 548. Up to 60 conditions per place. [2024-06-04 17:51:59,644 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 19 selfloop transitions, 5 changer transitions 19/45 dead transitions. [2024-06-04 17:51:59,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 45 transitions, 291 flow [2024-06-04 17:51:59,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:51:59,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:51:59,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 90 transitions. [2024-06-04 17:51:59,645 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.28125 [2024-06-04 17:51:59,645 INFO L175 Difference]: Start difference. First operand has 82 places, 32 transitions, 177 flow. Second operand 10 states and 90 transitions. [2024-06-04 17:51:59,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 45 transitions, 291 flow [2024-06-04 17:51:59,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 45 transitions, 257 flow, removed 8 selfloop flow, removed 14 redundant places. [2024-06-04 17:51:59,648 INFO L231 Difference]: Finished difference. Result has 67 places, 23 transitions, 116 flow [2024-06-04 17:51:59,648 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=116, PETRI_PLACES=67, PETRI_TRANSITIONS=23} [2024-06-04 17:51:59,648 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 36 predicate places. [2024-06-04 17:51:59,648 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 23 transitions, 116 flow [2024-06-04 17:51:59,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call 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:59,648 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:51:59,649 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:59,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable125 [2024-06-04 17:51:59,649 INFO L420 AbstractCegarLoop]: === Iteration 127 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:51:59,649 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:51:59,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1363170795, now seen corresponding path program 14 times [2024-06-04 17:51:59,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:51:59,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962221818] [2024-06-04 17:51:59,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:51:59,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:51:59,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:52:04,770 INFO 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,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:52:04,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962221818] [2024-06-04 17:52:04,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962221818] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:52:04,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:52:04,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:52:04,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567791440] [2024-06-04 17:52:04,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:52:04,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:52:04,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:52:04,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:52:04,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:52:04,975 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 17:52:04,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 23 transitions, 116 flow. Second operand has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call 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,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:52:04,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 17:52:04,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:52:05,120 INFO L124 PetriNetUnfolderBase]: 27/71 cut-off events. [2024-06-04 17:52:05,120 INFO L125 PetriNetUnfolderBase]: For 870/870 co-relation queries the response was YES. [2024-06-04 17:52:05,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206 conditions, 71 events. 27/71 cut-off events. For 870/870 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 107 event pairs, 0 based on Foata normal form. 6/76 useless extension candidates. Maximal degree in co-relation 182. Up to 24 conditions per place. [2024-06-04 17:52:05,120 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 0 selfloop transitions, 0 changer transitions 31/31 dead transitions. [2024-06-04 17:52:05,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 31 transitions, 156 flow [2024-06-04 17:52:05,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:52:05,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:52:05,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 80 transitions. [2024-06-04 17:52:05,121 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.25 [2024-06-04 17:52:05,121 INFO L175 Difference]: Start difference. First operand has 67 places, 23 transitions, 116 flow. Second operand 10 states and 80 transitions. [2024-06-04 17:52:05,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 31 transitions, 156 flow [2024-06-04 17:52:05,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 31 transitions, 126 flow, removed 1 selfloop flow, removed 15 redundant places. [2024-06-04 17:52:05,122 INFO L231 Difference]: Finished difference. Result has 49 places, 0 transitions, 0 flow [2024-06-04 17:52:05,122 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=0, PETRI_PLACES=49, PETRI_TRANSITIONS=0} [2024-06-04 17:52:05,122 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 18 predicate places. [2024-06-04 17:52:05,123 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 0 transitions, 0 flow [2024-06-04 17:52:05,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call 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:05,125 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 4 remaining) [2024-06-04 17:52:05,126 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 4 remaining) [2024-06-04 17:52:05,126 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-06-04 17:52:05,126 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-06-04 17:52:05,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126 [2024-06-04 17:52:05,128 INFO L445 BasicCegarLoop]: Path program histogram: [24, 14, 14, 11, 10, 7, 6, 5, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:52:05,130 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-04 17:52:05,130 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-04 17:52:05,133 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-06-04 17:52:05,134 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-06-04 17:52:05,134 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.06 05:52:05 BasicIcfg [2024-06-04 17:52:05,134 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-04 17:52:05,135 INFO L158 Benchmark]: Toolchain (without parser) took 630618.25ms. Allocated memory was 182.5MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 150.5MB in the beginning and 884.3MB in the end (delta: -733.7MB). Peak memory consumption was 908.2MB. Max. memory is 16.1GB. [2024-06-04 17:52:05,135 INFO L158 Benchmark]: Witness Parser took 0.15ms. Allocated memory is still 138.4MB. Free memory was 100.8MB in the beginning and 100.7MB in the end (delta: 80.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-06-04 17:52:05,135 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 138.4MB. Free memory is still 102.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-04 17:52:05,135 INFO L158 Benchmark]: CACSL2BoogieTranslator took 753.55ms. Allocated memory is still 182.5MB. Free memory was 151.5MB in the beginning and 101.9MB in the end (delta: 49.6MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2024-06-04 17:52:05,135 INFO L158 Benchmark]: Boogie Procedure Inliner took 95.36ms. Allocated memory is still 182.5MB. Free memory was 101.9MB in the beginning and 86.5MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-06-04 17:52:05,136 INFO L158 Benchmark]: Boogie Preprocessor took 180.41ms. Allocated memory is still 182.5MB. Free memory was 86.5MB in the beginning and 135.5MB in the end (delta: -49.1MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. [2024-06-04 17:52:05,136 INFO L158 Benchmark]: RCFGBuilder took 1057.43ms. Allocated memory was 182.5MB in the beginning and 272.6MB in the end (delta: 90.2MB). Free memory was 135.5MB in the beginning and 141.9MB in the end (delta: -6.4MB). Peak memory consumption was 91.4MB. Max. memory is 16.1GB. [2024-06-04 17:52:05,137 INFO L158 Benchmark]: TraceAbstraction took 628516.75ms. Allocated memory was 272.6MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 141.9MB in the beginning and 884.3MB in the end (delta: -742.4MB). Peak memory consumption was 809.5MB. Max. memory is 16.1GB. [2024-06-04 17:52:05,137 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.15ms. Allocated memory is still 138.4MB. Free memory was 100.8MB in the beginning and 100.7MB in the end (delta: 80.9kB). There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.14ms. Allocated memory is still 138.4MB. Free memory is still 102.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 753.55ms. Allocated memory is still 182.5MB. Free memory was 151.5MB in the beginning and 101.9MB in the end (delta: 49.6MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 95.36ms. Allocated memory is still 182.5MB. Free memory was 101.9MB in the beginning and 86.5MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 180.41ms. Allocated memory is still 182.5MB. Free memory was 86.5MB in the beginning and 135.5MB in the end (delta: -49.1MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. * RCFGBuilder took 1057.43ms. Allocated memory was 182.5MB in the beginning and 272.6MB in the end (delta: 90.2MB). Free memory was 135.5MB in the beginning and 141.9MB in the end (delta: -6.4MB). Peak memory consumption was 91.4MB. Max. memory is 16.1GB. * TraceAbstraction took 628516.75ms. Allocated memory was 272.6MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 141.9MB in the beginning and 884.3MB in the end (delta: -742.4MB). Peak memory consumption was 809.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 803]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 804]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 51 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 628.4s, OverallIterations: 127, TraceHistogramMax: 1, PathProgramHistogramMax: 24, EmptinessCheckTime: 0.0s, AutomataDifference: 67.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7216 SdHoareTripleChecker+Valid, 34.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6194 mSDsluCounter, 4182 SdHoareTripleChecker+Invalid, 30.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3470 mSDsCounter, 1435 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 43115 IncrementalHoareTripleChecker+Invalid, 44550 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1435 mSolverCounterUnsat, 712 mSDtfsCounter, 43115 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1386 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1360 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2543 ImplicationChecksByTransitivity, 32.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1557occurred in iteration=57, InterpolantAutomatonStates: 1267, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.8s SatisfiabilityAnalysisTime, 556.0s InterpolantComputationTime, 2191 NumberOfCodeBlocks, 2191 NumberOfCodeBlocksAsserted, 127 NumberOfCheckSat, 2064 ConstructedInterpolants, 0 QuantifiedInterpolants, 98669 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 127 InterpolantComputations, 127 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-06-04 17:52:05,243 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE