./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/rfi007_tso.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/rfi007_tso.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/rfi007_tso.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/rfi007_tso.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-03 22:21:15,676 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-03 22:21:15,749 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-03 22:21:15,754 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-03 22:21:15,754 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-03 22:21:15,779 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-03 22:21:15,779 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-03 22:21:15,780 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-03 22:21:15,780 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-03 22:21:15,784 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-03 22:21:15,785 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-03 22:21:15,785 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-03 22:21:15,786 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-03 22:21:15,787 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-03 22:21:15,787 INFO L153 SettingsManager]: * Use SBE=true [2024-06-03 22:21:15,787 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-03 22:21:15,787 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-03 22:21:15,788 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-03 22:21:15,788 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-03 22:21:15,788 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-03 22:21:15,788 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-03 22:21:15,789 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-03 22:21:15,789 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-03 22:21:15,789 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-03 22:21:15,789 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-03 22:21:15,789 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-03 22:21:15,790 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-03 22:21:15,790 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-03 22:21:15,790 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-03 22:21:15,791 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-03 22:21:15,791 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-03 22:21:15,792 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-03 22:21:15,792 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 22:21:15,792 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-03 22:21:15,792 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-03 22:21:15,792 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-03 22:21:15,792 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-03 22:21:15,793 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-03 22:21:15,793 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-03 22:21:15,793 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-03 22:21:15,793 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-03 22:21:15,793 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-03 22:21:15,794 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-03 22:21:15,794 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-03 22:21:15,970 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-03 22:21:15,990 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-03 22:21:15,992 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-03 22:21:15,993 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-03 22:21:15,993 INFO L274 PluginConnector]: CDTParser initialized [2024-06-03 22:21:15,994 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi007_tso.i [2024-06-03 22:21:17,017 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-03 22:21:17,226 INFO L384 CDTParser]: Found 1 translation units. [2024-06-03 22:21:17,226 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi007_tso.i [2024-06-03 22:21:17,237 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8123ba3a/1f4bc3b741394687b107cb47204d4a15/FLAG395d683d1 [2024-06-03 22:21:17,246 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8123ba3a/1f4bc3b741394687b107cb47204d4a15 [2024-06-03 22:21:17,248 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-03 22:21:17,249 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-03 22:21:17,249 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/rfi007_tso.yml/witness.yml [2024-06-03 22:21:17,370 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-03 22:21:17,372 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-03 22:21:17,373 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-03 22:21:17,373 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-03 22:21:17,376 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-03 22:21:17,377 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 10:21:17" (1/2) ... [2024-06-03 22:21:17,377 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@296b9b6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:21:17, skipping insertion in model container [2024-06-03 22:21:17,378 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 10:21:17" (1/2) ... [2024-06-03 22:21:17,380 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@82c9b46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:21:17, skipping insertion in model container [2024-06-03 22:21:17,380 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 10:21:17" (2/2) ... [2024-06-03 22:21:17,381 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@296b9b6c and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:21:17, skipping insertion in model container [2024-06-03 22:21:17,381 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 10:21:17" (2/2) ... [2024-06-03 22:21:17,381 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-03 22:21:17,438 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-03 22:21:17,440 INFO L97 edCorrectnessWitness]: Location invariant before [L814-L814] (((((((((((((((! multithreaded || y$r_buff0_thd1 == (_Bool)0) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EBX) + (long long )x >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )x) + (long long )y >= 0LL) && (1LL - (long long )x) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )x) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )x) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )x) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )x) + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )x >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )x >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )x >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )x >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )x) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )x >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || (((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && __unbuffered_p1_EBX <= 1) && x <= 1) && y$w_buff0 <= 127) && y$w_buff1 <= 127) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && y$w_buff0 % 2 == 0) && y$w_buff1 % 2 == 0) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (0 <= y && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || (0 <= __unbuffered_p1_EAX && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)))) && (! multithreaded || (0 <= y$mem_tmp && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || (((0 <= y$w_buff0 && y$w_buff0 <= 127) && y$w_buff0 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= y$w_buff1 && y$w_buff1 <= 127) && y$w_buff1 % 2 == 0) && (y$w_buff1 == 0 || y$w_buff1 == 2)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-03 22:21:17,440 INFO L97 edCorrectnessWitness]: Location invariant before [L813-L813] (((((((((((((((! multithreaded || y$r_buff0_thd1 == (_Bool)0) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EBX) + (long long )x >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )x) + (long long )y >= 0LL) && (1LL - (long long )x) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )x) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )x) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )x) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )x) + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )x >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )x >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )x >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )x >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )x) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )x >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || (((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && __unbuffered_p1_EBX <= 1) && x <= 1) && y$w_buff0 <= 127) && y$w_buff1 <= 127) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && y$w_buff0 % 2 == 0) && y$w_buff1 % 2 == 0) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (0 <= y && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || (0 <= __unbuffered_p1_EAX && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)))) && (! multithreaded || (0 <= y$mem_tmp && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || (((0 <= y$w_buff0 && y$w_buff0 <= 127) && y$w_buff0 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= y$w_buff1 && y$w_buff1 <= 127) && y$w_buff1 % 2 == 0) && (y$w_buff1 == 0 || y$w_buff1 == 2)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-03 22:21:17,441 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-03 22:21:17,441 INFO L106 edCorrectnessWitness]: ghost_update [L811-L811] multithreaded = 1; [2024-06-03 22:21:17,484 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-03 22:21:17,813 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 22:21:17,825 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-03 22:21:18,046 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 22:21:18,078 INFO L206 MainTranslator]: Completed translation [2024-06-03 22:21:18,079 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:21:18 WrapperNode [2024-06-03 22:21:18,079 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-03 22:21:18,080 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-03 22:21:18,080 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-03 22:21:18,080 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-03 22:21:18,085 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:21:18" (1/1) ... [2024-06-03 22:21:18,117 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:21:18" (1/1) ... [2024-06-03 22:21:18,181 INFO L138 Inliner]: procedures = 174, calls = 36, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 154 [2024-06-03 22:21:18,182 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-03 22:21:18,182 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-03 22:21:18,182 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-03 22:21:18,182 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-03 22:21:18,193 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:21:18" (1/1) ... [2024-06-03 22:21:18,194 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:21:18" (1/1) ... [2024-06-03 22:21:18,212 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:21:18" (1/1) ... [2024-06-03 22:21:18,241 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-03 22:21:18,242 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:21:18" (1/1) ... [2024-06-03 22:21:18,242 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:21:18" (1/1) ... [2024-06-03 22:21:18,264 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:21:18" (1/1) ... [2024-06-03 22:21:18,265 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:21:18" (1/1) ... [2024-06-03 22:21:18,273 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:21:18" (1/1) ... [2024-06-03 22:21:18,276 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:21:18" (1/1) ... [2024-06-03 22:21:18,286 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-03 22:21:18,287 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-03 22:21:18,287 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-03 22:21:18,287 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-03 22:21:18,289 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:21:18" (1/1) ... [2024-06-03 22:21:18,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 22:21:18,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-03 22:21:18,317 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-03 22:21:18,327 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-03 22:21:18,349 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-03 22:21:18,349 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-03 22:21:18,349 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-03 22:21:18,349 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-03 22:21:18,349 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-03 22:21:18,350 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-03 22:21:18,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-03 22:21:18,350 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-03 22:21:18,350 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-03 22:21:18,350 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-03 22:21:18,352 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-03 22:21:18,470 INFO L244 CfgBuilder]: Building ICFG [2024-06-03 22:21:18,471 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-03 22:21:19,089 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-03 22:21:19,089 INFO L293 CfgBuilder]: Performing block encoding [2024-06-03 22:21:19,267 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-03 22:21:19,268 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-03 22:21:19,270 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 10:21:19 BoogieIcfgContainer [2024-06-03 22:21:19,270 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-03 22:21:19,272 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-03 22:21:19,272 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-03 22:21:19,275 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-03 22:21:19,275 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.06 10:21:17" (1/4) ... [2024-06-03 22:21:19,275 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b45b1a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 10:21:19, skipping insertion in model container [2024-06-03 22:21:19,275 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 10:21:17" (2/4) ... [2024-06-03 22:21:19,276 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b45b1a9 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 10:21:19, skipping insertion in model container [2024-06-03 22:21:19,276 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:21:18" (3/4) ... [2024-06-03 22:21:19,279 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b45b1a9 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 10:21:19, skipping insertion in model container [2024-06-03 22:21:19,280 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 10:21:19" (4/4) ... [2024-06-03 22:21:19,281 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi007_tso.i [2024-06-03 22:21:19,293 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-03 22:21:19,293 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-03 22:21:19,293 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-03 22:21:19,354 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-03 22:21:19,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 31 transitions, 70 flow [2024-06-03 22:21:19,415 INFO L124 PetriNetUnfolderBase]: 0/29 cut-off events. [2024-06-03 22:21:19,416 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 22:21:19,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 29 events. 0/29 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 40 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-03 22:21:19,417 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 31 transitions, 70 flow [2024-06-03 22:21:19,420 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 23 transitions, 52 flow [2024-06-03 22:21:19,432 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-03 22:21:19,439 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;@454c7c9b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-03 22:21:19,439 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-03 22:21:19,448 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-03 22:21:19,448 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-03 22:21:19,448 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 22:21:19,448 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:21:19,449 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-03 22:21:19,450 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-03 22:21:19,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:21:19,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1606705191, now seen corresponding path program 1 times [2024-06-03 22:21:19,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:21:19,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448333458] [2024-06-03 22:21:19,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:21:19,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:21:19,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:21:22,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-03 22:21:22,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:21:22,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448333458] [2024-06-03 22:21:22,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448333458] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:21:22,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:21:22,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-03 22:21:22,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106653412] [2024-06-03 22:21:22,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:21:22,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-03 22:21:22,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:21:22,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-03 22:21:22,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-03 22:21:22,654 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 22:21:22,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 23 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:21:22,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:21:22,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 22:21:22,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:21:22,848 INFO L124 PetriNetUnfolderBase]: 162/309 cut-off events. [2024-06-03 22:21:22,848 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-06-03 22:21:22,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 622 conditions, 309 events. 162/309 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1128 event pairs, 97 based on Foata normal form. 1/298 useless extension candidates. Maximal degree in co-relation 608. Up to 288 conditions per place. [2024-06-03 22:21:22,854 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 23 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2024-06-03 22:21:22,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 29 transitions, 119 flow [2024-06-03 22:21:22,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-03 22:21:22,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-03 22:21:22,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2024-06-03 22:21:22,865 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5268817204301075 [2024-06-03 22:21:22,866 INFO L175 Difference]: Start difference. First operand has 30 places, 23 transitions, 52 flow. Second operand 3 states and 49 transitions. [2024-06-03 22:21:22,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 29 transitions, 119 flow [2024-06-03 22:21:22,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 29 transitions, 116 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-03 22:21:22,870 INFO L231 Difference]: Finished difference. Result has 31 places, 25 transitions, 71 flow [2024-06-03 22:21:22,872 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=71, PETRI_PLACES=31, PETRI_TRANSITIONS=25} [2024-06-03 22:21:22,874 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 1 predicate places. [2024-06-03 22:21:22,875 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 25 transitions, 71 flow [2024-06-03 22:21:22,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:21:22,875 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:21:22,875 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:21:22,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-03 22:21:22,876 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-03 22:21:22,876 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:21:22,876 INFO L85 PathProgramCache]: Analyzing trace with hash 2144571448, now seen corresponding path program 1 times [2024-06-03 22:21:22,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:21:22,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511883052] [2024-06-03 22:21:22,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:21:22,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:21:22,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:21:24,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:21:24,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:21:24,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511883052] [2024-06-03 22:21:24,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511883052] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:21:24,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:21:24,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-03 22:21:24,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466662667] [2024-06-03 22:21:24,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:21:24,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-03 22:21:24,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:21:24,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-03 22:21:24,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-03 22:21:24,912 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:21:24,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 25 transitions, 71 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-03 22:21:24,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:21:24,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:21:24,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:21:25,143 INFO L124 PetriNetUnfolderBase]: 186/337 cut-off events. [2024-06-03 22:21:25,144 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2024-06-03 22:21:25,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 781 conditions, 337 events. 186/337 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1172 event pairs, 94 based on Foata normal form. 2/338 useless extension candidates. Maximal degree in co-relation 766. Up to 319 conditions per place. [2024-06-03 22:21:25,147 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 28 selfloop transitions, 5 changer transitions 0/35 dead transitions. [2024-06-03 22:21:25,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 35 transitions, 163 flow [2024-06-03 22:21:25,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-03 22:21:25,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-03 22:21:25,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2024-06-03 22:21:25,148 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47580645161290325 [2024-06-03 22:21:25,148 INFO L175 Difference]: Start difference. First operand has 31 places, 25 transitions, 71 flow. Second operand 4 states and 59 transitions. [2024-06-03 22:21:25,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 35 transitions, 163 flow [2024-06-03 22:21:25,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 35 transitions, 160 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-03 22:21:25,150 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 95 flow [2024-06-03 22:21:25,150 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=95, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2024-06-03 22:21:25,151 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 4 predicate places. [2024-06-03 22:21:25,151 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 27 transitions, 95 flow [2024-06-03 22:21:25,151 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-03 22:21:25,151 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:21:25,152 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:21:25,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-03 22:21:25,152 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-03 22:21:25,152 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:21:25,153 INFO L85 PathProgramCache]: Analyzing trace with hash 2057206554, now seen corresponding path program 1 times [2024-06-03 22:21:25,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:21:25,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252860965] [2024-06-03 22:21:25,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:21:25,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:21:25,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:21:26,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:21:26,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:21:26,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252860965] [2024-06-03 22:21:26,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252860965] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:21:26,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:21:26,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-03 22:21:26,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056798460] [2024-06-03 22:21:26,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:21:26,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-03 22:21:26,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:21:26,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-03 22:21:26,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-03 22:21:27,042 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:21:27,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 27 transitions, 95 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-03 22:21:27,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:21:27,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:21:27,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:21:27,238 INFO L124 PetriNetUnfolderBase]: 180/327 cut-off events. [2024-06-03 22:21:27,239 INFO L125 PetriNetUnfolderBase]: For 195/195 co-relation queries the response was YES. [2024-06-03 22:21:27,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 839 conditions, 327 events. 180/327 cut-off events. For 195/195 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1119 event pairs, 52 based on Foata normal form. 4/330 useless extension candidates. Maximal degree in co-relation 822. Up to 291 conditions per place. [2024-06-03 22:21:27,243 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 33 selfloop transitions, 7 changer transitions 0/42 dead transitions. [2024-06-03 22:21:27,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 42 transitions, 215 flow [2024-06-03 22:21:27,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 22:21:27,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 22:21:27,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2024-06-03 22:21:27,246 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4645161290322581 [2024-06-03 22:21:27,246 INFO L175 Difference]: Start difference. First operand has 34 places, 27 transitions, 95 flow. Second operand 5 states and 72 transitions. [2024-06-03 22:21:27,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 42 transitions, 215 flow [2024-06-03 22:21:27,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 42 transitions, 206 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-03 22:21:27,249 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 119 flow [2024-06-03 22:21:27,249 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=119, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2024-06-03 22:21:27,251 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 7 predicate places. [2024-06-03 22:21:27,251 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 119 flow [2024-06-03 22:21:27,251 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-03 22:21:27,251 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:21:27,251 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:21:27,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-03 22:21:27,252 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-03 22:21:27,252 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:21:27,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1290578649, now seen corresponding path program 1 times [2024-06-03 22:21:27,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:21:27,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595365518] [2024-06-03 22:21:27,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:21:27,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:21:27,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:21:29,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:21:29,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:21:29,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595365518] [2024-06-03 22:21:29,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595365518] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:21:29,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:21:29,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 22:21:29,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572603345] [2024-06-03 22:21:29,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:21:29,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 22:21:29,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:21:29,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 22:21:29,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-03 22:21:29,782 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:21:29,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 119 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-03 22:21:29,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:21:29,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:21:29,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:21:29,991 INFO L124 PetriNetUnfolderBase]: 176/319 cut-off events. [2024-06-03 22:21:29,992 INFO L125 PetriNetUnfolderBase]: For 314/314 co-relation queries the response was YES. [2024-06-03 22:21:29,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 891 conditions, 319 events. 176/319 cut-off events. For 314/314 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1082 event pairs, 30 based on Foata normal form. 4/322 useless extension candidates. Maximal degree in co-relation 873. Up to 265 conditions per place. [2024-06-03 22:21:29,995 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 33 selfloop transitions, 8 changer transitions 0/43 dead transitions. [2024-06-03 22:21:29,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 43 transitions, 229 flow [2024-06-03 22:21:29,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:21:29,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:21:29,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2024-06-03 22:21:30,000 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42473118279569894 [2024-06-03 22:21:30,000 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 119 flow. Second operand 6 states and 79 transitions. [2024-06-03 22:21:30,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 43 transitions, 229 flow [2024-06-03 22:21:30,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 43 transitions, 214 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-03 22:21:30,003 INFO L231 Difference]: Finished difference. Result has 39 places, 28 transitions, 116 flow [2024-06-03 22:21:30,003 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=116, PETRI_PLACES=39, PETRI_TRANSITIONS=28} [2024-06-03 22:21:30,004 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 9 predicate places. [2024-06-03 22:21:30,005 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 116 flow [2024-06-03 22:21:30,005 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-03 22:21:30,005 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:21:30,005 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:21:30,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-03 22:21:30,006 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-03 22:21:30,006 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:21:30,006 INFO L85 PathProgramCache]: Analyzing trace with hash 672537551, now seen corresponding path program 1 times [2024-06-03 22:21:30,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:21:30,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677845615] [2024-06-03 22:21:30,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:21:30,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:21:30,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:21:33,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:21:33,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:21:33,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677845615] [2024-06-03 22:21:33,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677845615] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:21:33,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:21:33,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 22:21:33,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43430620] [2024-06-03 22:21:33,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:21:33,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 22:21:33,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:21:33,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 22:21:33,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-03 22:21:33,657 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:21:33,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 116 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-03 22:21:33,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:21:33,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:21:33,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:21:33,817 INFO L124 PetriNetUnfolderBase]: 147/283 cut-off events. [2024-06-03 22:21:33,817 INFO L125 PetriNetUnfolderBase]: For 377/377 co-relation queries the response was YES. [2024-06-03 22:21:33,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 811 conditions, 283 events. 147/283 cut-off events. For 377/377 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 989 event pairs, 53 based on Foata normal form. 1/283 useless extension candidates. Maximal degree in co-relation 792. Up to 259 conditions per place. [2024-06-03 22:21:33,819 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 26 selfloop transitions, 6 changer transitions 0/35 dead transitions. [2024-06-03 22:21:33,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 35 transitions, 198 flow [2024-06-03 22:21:33,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 22:21:33,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 22:21:33,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2024-06-03 22:21:33,820 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38064516129032255 [2024-06-03 22:21:33,820 INFO L175 Difference]: Start difference. First operand has 39 places, 28 transitions, 116 flow. Second operand 5 states and 59 transitions. [2024-06-03 22:21:33,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 35 transitions, 198 flow [2024-06-03 22:21:33,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 35 transitions, 178 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-03 22:21:33,822 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 123 flow [2024-06-03 22:21:33,822 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=123, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2024-06-03 22:21:33,823 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 10 predicate places. [2024-06-03 22:21:33,823 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 123 flow [2024-06-03 22:21:33,823 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-03 22:21:33,823 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:21:33,823 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:21:33,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-03 22:21:33,824 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-03 22:21:33,824 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:21:33,824 INFO L85 PathProgramCache]: Analyzing trace with hash -616340437, now seen corresponding path program 1 times [2024-06-03 22:21:33,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:21:33,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631443677] [2024-06-03 22:21:33,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:21:33,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:21:33,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:21:37,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:21:37,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:21:37,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631443677] [2024-06-03 22:21:37,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631443677] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:21:37,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:21:37,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 22:21:37,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483910661] [2024-06-03 22:21:37,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:21:37,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 22:21:37,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:21:37,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 22:21:37,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-03 22:21:37,997 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 22:21:37,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 123 flow. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 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-03 22:21:37,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:21:37,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 22:21:37,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:21:38,152 INFO L124 PetriNetUnfolderBase]: 143/277 cut-off events. [2024-06-03 22:21:38,153 INFO L125 PetriNetUnfolderBase]: For 474/474 co-relation queries the response was YES. [2024-06-03 22:21:38,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 824 conditions, 277 events. 143/277 cut-off events. For 474/474 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 962 event pairs, 51 based on Foata normal form. 2/278 useless extension candidates. Maximal degree in co-relation 803. Up to 247 conditions per place. [2024-06-03 22:21:38,155 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 28 selfloop transitions, 8 changer transitions 0/39 dead transitions. [2024-06-03 22:21:38,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 39 transitions, 219 flow [2024-06-03 22:21:38,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:21:38,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:21:38,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2024-06-03 22:21:38,157 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4032258064516129 [2024-06-03 22:21:38,157 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 123 flow. Second operand 6 states and 75 transitions. [2024-06-03 22:21:38,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 39 transitions, 219 flow [2024-06-03 22:21:38,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 39 transitions, 208 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-03 22:21:38,161 INFO L231 Difference]: Finished difference. Result has 43 places, 32 transitions, 145 flow [2024-06-03 22:21:38,161 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=145, PETRI_PLACES=43, PETRI_TRANSITIONS=32} [2024-06-03 22:21:38,163 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 13 predicate places. [2024-06-03 22:21:38,163 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 32 transitions, 145 flow [2024-06-03 22:21:38,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 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-03 22:21:38,164 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:21:38,164 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:21:38,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-03 22:21:38,164 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-03 22:21:38,164 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:21:38,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1661963166, now seen corresponding path program 1 times [2024-06-03 22:21:38,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:21:38,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400905503] [2024-06-03 22:21:38,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:21:38,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:21:38,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:21:41,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:21:41,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:21:41,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400905503] [2024-06-03 22:21:41,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400905503] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:21:41,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:21:41,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 22:21:41,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88497534] [2024-06-03 22:21:41,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:21:41,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 22:21:41,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:21:41,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 22:21:41,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-03 22:21:41,858 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:21:41,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 32 transitions, 145 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-03 22:21:41,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:21:41,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:21:41,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:21:42,138 INFO L124 PetriNetUnfolderBase]: 171/312 cut-off events. [2024-06-03 22:21:42,138 INFO L125 PetriNetUnfolderBase]: For 716/716 co-relation queries the response was YES. [2024-06-03 22:21:42,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1015 conditions, 312 events. 171/312 cut-off events. For 716/716 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1033 event pairs, 61 based on Foata normal form. 1/312 useless extension candidates. Maximal degree in co-relation 993. Up to 291 conditions per place. [2024-06-03 22:21:42,142 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 33 selfloop transitions, 8 changer transitions 0/43 dead transitions. [2024-06-03 22:21:42,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 43 transitions, 257 flow [2024-06-03 22:21:42,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:21:42,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:21:42,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2024-06-03 22:21:42,143 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2024-06-03 22:21:42,143 INFO L175 Difference]: Start difference. First operand has 43 places, 32 transitions, 145 flow. Second operand 6 states and 66 transitions. [2024-06-03 22:21:42,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 43 transitions, 257 flow [2024-06-03 22:21:42,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 43 transitions, 240 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-03 22:21:42,148 INFO L231 Difference]: Finished difference. Result has 45 places, 34 transitions, 161 flow [2024-06-03 22:21:42,148 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=161, PETRI_PLACES=45, PETRI_TRANSITIONS=34} [2024-06-03 22:21:42,149 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 15 predicate places. [2024-06-03 22:21:42,149 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 161 flow [2024-06-03 22:21:42,150 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-03 22:21:42,150 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:21:42,150 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:21:42,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-03 22:21:42,150 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-03 22:21:42,150 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:21:42,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1926691336, now seen corresponding path program 2 times [2024-06-03 22:21:42,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:21:42,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242653668] [2024-06-03 22:21:42,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:21:42,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:21:42,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:21:45,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:21:45,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:21:45,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242653668] [2024-06-03 22:21:45,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242653668] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:21:45,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:21:45,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 22:21:45,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897640914] [2024-06-03 22:21:45,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:21:45,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 22:21:45,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:21:45,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 22:21:45,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-03 22:21:45,871 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:21:45,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 161 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-03 22:21:45,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:21:45,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:21:45,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:21:46,104 INFO L124 PetriNetUnfolderBase]: 169/309 cut-off events. [2024-06-03 22:21:46,105 INFO L125 PetriNetUnfolderBase]: For 891/891 co-relation queries the response was YES. [2024-06-03 22:21:46,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1057 conditions, 309 events. 169/309 cut-off events. For 891/891 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1018 event pairs, 61 based on Foata normal form. 1/309 useless extension candidates. Maximal degree in co-relation 1034. Up to 282 conditions per place. [2024-06-03 22:21:46,107 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 32 selfloop transitions, 12 changer transitions 0/46 dead transitions. [2024-06-03 22:21:46,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 46 transitions, 285 flow [2024-06-03 22:21:46,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:21:46,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:21:46,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2024-06-03 22:21:46,108 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3456221198156682 [2024-06-03 22:21:46,108 INFO L175 Difference]: Start difference. First operand has 45 places, 34 transitions, 161 flow. Second operand 7 states and 75 transitions. [2024-06-03 22:21:46,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 46 transitions, 285 flow [2024-06-03 22:21:46,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 46 transitions, 268 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-03 22:21:46,110 INFO L231 Difference]: Finished difference. Result has 48 places, 36 transitions, 189 flow [2024-06-03 22:21:46,110 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=189, PETRI_PLACES=48, PETRI_TRANSITIONS=36} [2024-06-03 22:21:46,111 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 18 predicate places. [2024-06-03 22:21:46,111 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 36 transitions, 189 flow [2024-06-03 22:21:46,111 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-03 22:21:46,111 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:21:46,111 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:21:46,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-03 22:21:46,112 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-03 22:21:46,112 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:21:46,112 INFO L85 PathProgramCache]: Analyzing trace with hash -632825254, now seen corresponding path program 1 times [2024-06-03 22:21:46,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:21:46,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535123445] [2024-06-03 22:21:46,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:21:46,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:21:46,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:21:49,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:21:49,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:21:49,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535123445] [2024-06-03 22:21:49,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535123445] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:21:49,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:21:49,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:21:49,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161493874] [2024-06-03 22:21:49,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:21:49,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:21:49,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:21:49,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:21:49,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:21:49,443 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:21:49,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 36 transitions, 189 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-03 22:21:49,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:21:49,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:21:49,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:21:49,710 INFO L124 PetriNetUnfolderBase]: 175/319 cut-off events. [2024-06-03 22:21:49,710 INFO L125 PetriNetUnfolderBase]: For 1215/1215 co-relation queries the response was YES. [2024-06-03 22:21:49,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1160 conditions, 319 events. 175/319 cut-off events. For 1215/1215 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1059 event pairs, 42 based on Foata normal form. 2/320 useless extension candidates. Maximal degree in co-relation 1136. Up to 277 conditions per place. [2024-06-03 22:21:49,712 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 44 selfloop transitions, 12 changer transitions 0/58 dead transitions. [2024-06-03 22:21:49,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 58 transitions, 363 flow [2024-06-03 22:21:49,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:21:49,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:21:49,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2024-06-03 22:21:49,713 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3588709677419355 [2024-06-03 22:21:49,714 INFO L175 Difference]: Start difference. First operand has 48 places, 36 transitions, 189 flow. Second operand 8 states and 89 transitions. [2024-06-03 22:21:49,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 58 transitions, 363 flow [2024-06-03 22:21:49,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 58 transitions, 334 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-03 22:21:49,717 INFO L231 Difference]: Finished difference. Result has 52 places, 40 transitions, 216 flow [2024-06-03 22:21:49,717 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=216, PETRI_PLACES=52, PETRI_TRANSITIONS=40} [2024-06-03 22:21:49,718 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 22 predicate places. [2024-06-03 22:21:49,718 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 40 transitions, 216 flow [2024-06-03 22:21:49,718 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-03 22:21:49,718 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:21:49,718 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:21:49,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-03 22:21:49,719 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-03 22:21:49,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:21:49,720 INFO L85 PathProgramCache]: Analyzing trace with hash -632705098, now seen corresponding path program 1 times [2024-06-03 22:21:49,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:21:49,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120450140] [2024-06-03 22:21:49,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:21:49,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:21:49,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:21:53,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:21:53,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:21:53,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120450140] [2024-06-03 22:21:53,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120450140] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:21:53,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:21:53,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:21:53,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375998624] [2024-06-03 22:21:53,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:21:53,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:21:53,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:21:53,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:21:53,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:21:53,769 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:21:53,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 216 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-03 22:21:53,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:21:53,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:21:53,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:21:54,011 INFO L124 PetriNetUnfolderBase]: 178/324 cut-off events. [2024-06-03 22:21:54,012 INFO L125 PetriNetUnfolderBase]: For 1500/1500 co-relation queries the response was YES. [2024-06-03 22:21:54,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1274 conditions, 324 events. 178/324 cut-off events. For 1500/1500 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1076 event pairs, 41 based on Foata normal form. 1/324 useless extension candidates. Maximal degree in co-relation 1248. Up to 300 conditions per place. [2024-06-03 22:21:54,014 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 40 selfloop transitions, 10 changer transitions 0/52 dead transitions. [2024-06-03 22:21:54,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 52 transitions, 350 flow [2024-06-03 22:21:54,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:21:54,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:21:54,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2024-06-03 22:21:54,015 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34101382488479265 [2024-06-03 22:21:54,015 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 216 flow. Second operand 7 states and 74 transitions. [2024-06-03 22:21:54,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 52 transitions, 350 flow [2024-06-03 22:21:54,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 52 transitions, 323 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-03 22:21:54,017 INFO L231 Difference]: Finished difference. Result has 54 places, 42 transitions, 228 flow [2024-06-03 22:21:54,018 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=228, PETRI_PLACES=54, PETRI_TRANSITIONS=42} [2024-06-03 22:21:54,018 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 24 predicate places. [2024-06-03 22:21:54,018 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 228 flow [2024-06-03 22:21:54,018 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-03 22:21:54,018 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:21:54,019 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:21:54,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-03 22:21:54,019 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-03 22:21:54,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:21:54,019 INFO L85 PathProgramCache]: Analyzing trace with hash -632705284, now seen corresponding path program 2 times [2024-06-03 22:21:54,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:21:54,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315198668] [2024-06-03 22:21:54,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:21:54,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:21:54,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:21:57,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:21:57,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:21:57,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315198668] [2024-06-03 22:21:57,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315198668] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:21:57,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:21:57,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:21:57,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843667883] [2024-06-03 22:21:57,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:21:57,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:21:57,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:21:57,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:21:57,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:21:57,313 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:21:57,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 228 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-03 22:21:57,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:21:57,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:21:57,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:21:57,567 INFO L124 PetriNetUnfolderBase]: 189/342 cut-off events. [2024-06-03 22:21:57,567 INFO L125 PetriNetUnfolderBase]: For 1937/1937 co-relation queries the response was YES. [2024-06-03 22:21:57,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1409 conditions, 342 events. 189/342 cut-off events. For 1937/1937 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1170 event pairs, 41 based on Foata normal form. 2/343 useless extension candidates. Maximal degree in co-relation 1382. Up to 287 conditions per place. [2024-06-03 22:21:57,569 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 41 selfloop transitions, 16 changer transitions 0/59 dead transitions. [2024-06-03 22:21:57,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 59 transitions, 428 flow [2024-06-03 22:21:57,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:21:57,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:21:57,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2024-06-03 22:21:57,571 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3686635944700461 [2024-06-03 22:21:57,571 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 228 flow. Second operand 7 states and 80 transitions. [2024-06-03 22:21:57,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 59 transitions, 428 flow [2024-06-03 22:21:57,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 59 transitions, 405 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-03 22:21:57,573 INFO L231 Difference]: Finished difference. Result has 56 places, 46 transitions, 278 flow [2024-06-03 22:21:57,573 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=278, PETRI_PLACES=56, PETRI_TRANSITIONS=46} [2024-06-03 22:21:57,573 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 26 predicate places. [2024-06-03 22:21:57,573 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 46 transitions, 278 flow [2024-06-03 22:21:57,573 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-03 22:21:57,573 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:21:57,574 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:21:57,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-03 22:21:57,574 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-03 22:21:57,574 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:21:57,574 INFO L85 PathProgramCache]: Analyzing trace with hash -455573764, now seen corresponding path program 3 times [2024-06-03 22:21:57,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:21:57,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456503060] [2024-06-03 22:21:57,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:21:57,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:21:57,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:22:01,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:22:01,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:22:01,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456503060] [2024-06-03 22:22:01,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456503060] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:22:01,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:22:01,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:22:01,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891412004] [2024-06-03 22:22:01,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:22:01,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:22:01,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:22:01,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:22:01,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:22:01,146 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:22:01,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 46 transitions, 278 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-03 22:22:01,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:22:01,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:22:01,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:22:01,393 INFO L124 PetriNetUnfolderBase]: 185/337 cut-off events. [2024-06-03 22:22:01,393 INFO L125 PetriNetUnfolderBase]: For 2294/2297 co-relation queries the response was YES. [2024-06-03 22:22:01,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1445 conditions, 337 events. 185/337 cut-off events. For 2294/2297 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1145 event pairs, 44 based on Foata normal form. 4/339 useless extension candidates. Maximal degree in co-relation 1417. Up to 269 conditions per place. [2024-06-03 22:22:01,396 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 39 selfloop transitions, 21 changer transitions 0/62 dead transitions. [2024-06-03 22:22:01,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 62 transitions, 476 flow [2024-06-03 22:22:01,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:22:01,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:22:01,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2024-06-03 22:22:01,399 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3588709677419355 [2024-06-03 22:22:01,399 INFO L175 Difference]: Start difference. First operand has 56 places, 46 transitions, 278 flow. Second operand 8 states and 89 transitions. [2024-06-03 22:22:01,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 62 transitions, 476 flow [2024-06-03 22:22:01,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 62 transitions, 454 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-06-03 22:22:01,403 INFO L231 Difference]: Finished difference. Result has 61 places, 48 transitions, 327 flow [2024-06-03 22:22:01,403 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=327, PETRI_PLACES=61, PETRI_TRANSITIONS=48} [2024-06-03 22:22:01,405 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 31 predicate places. [2024-06-03 22:22:01,405 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 48 transitions, 327 flow [2024-06-03 22:22:01,405 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-03 22:22:01,406 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:22:01,406 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:22:01,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-03 22:22:01,406 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-03 22:22:01,406 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:22:01,406 INFO L85 PathProgramCache]: Analyzing trace with hash -455573578, now seen corresponding path program 2 times [2024-06-03 22:22:01,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:22:01,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899340208] [2024-06-03 22:22:01,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:22:01,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:22:01,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:22:05,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-03 22:22:05,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:22:05,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899340208] [2024-06-03 22:22:05,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899340208] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:22:05,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:22:05,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:22:05,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187364894] [2024-06-03 22:22:05,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:22:05,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:22:05,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:22:05,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:22:05,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:22:05,761 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:22:05,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 48 transitions, 327 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-03 22:22:05,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:22:05,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:22:05,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:22:06,026 INFO L124 PetriNetUnfolderBase]: 188/341 cut-off events. [2024-06-03 22:22:06,027 INFO L125 PetriNetUnfolderBase]: For 2589/2589 co-relation queries the response was YES. [2024-06-03 22:22:06,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1550 conditions, 341 events. 188/341 cut-off events. For 2589/2589 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1163 event pairs, 41 based on Foata normal form. 1/341 useless extension candidates. Maximal degree in co-relation 1520. Up to 311 conditions per place. [2024-06-03 22:22:06,029 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 45 selfloop transitions, 14 changer transitions 0/61 dead transitions. [2024-06-03 22:22:06,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 61 transitions, 485 flow [2024-06-03 22:22:06,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:22:06,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:22:06,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 83 transitions. [2024-06-03 22:22:06,030 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3346774193548387 [2024-06-03 22:22:06,030 INFO L175 Difference]: Start difference. First operand has 61 places, 48 transitions, 327 flow. Second operand 8 states and 83 transitions. [2024-06-03 22:22:06,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 61 transitions, 485 flow [2024-06-03 22:22:06,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 61 transitions, 430 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-03 22:22:06,032 INFO L231 Difference]: Finished difference. Result has 63 places, 50 transitions, 323 flow [2024-06-03 22:22:06,033 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=323, PETRI_PLACES=63, PETRI_TRANSITIONS=50} [2024-06-03 22:22:06,033 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 33 predicate places. [2024-06-03 22:22:06,033 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 50 transitions, 323 flow [2024-06-03 22:22:06,033 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-03 22:22:06,033 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:22:06,034 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:22:06,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-03 22:22:06,034 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-03 22:22:06,034 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:22:06,034 INFO L85 PathProgramCache]: Analyzing trace with hash -455336428, now seen corresponding path program 3 times [2024-06-03 22:22:06,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:22:06,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137644553] [2024-06-03 22:22:06,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:22:06,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:22:06,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:22:10,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:22:10,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:22:10,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137644553] [2024-06-03 22:22:10,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137644553] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:22:10,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:22:10,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:22:10,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370007911] [2024-06-03 22:22:10,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:22:10,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:22:10,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:22:10,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:22:10,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:22:10,353 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:22:10,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 50 transitions, 323 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-03 22:22:10,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:22:10,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:22:10,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:22:10,547 INFO L124 PetriNetUnfolderBase]: 186/339 cut-off events. [2024-06-03 22:22:10,547 INFO L125 PetriNetUnfolderBase]: For 2851/2854 co-relation queries the response was YES. [2024-06-03 22:22:10,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1546 conditions, 339 events. 186/339 cut-off events. For 2851/2854 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1171 event pairs, 45 based on Foata normal form. 3/340 useless extension candidates. Maximal degree in co-relation 1515. Up to 299 conditions per place. [2024-06-03 22:22:10,550 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 41 selfloop transitions, 18 changer transitions 0/61 dead transitions. [2024-06-03 22:22:10,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 61 transitions, 485 flow [2024-06-03 22:22:10,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:22:10,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:22:10,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2024-06-03 22:22:10,551 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34101382488479265 [2024-06-03 22:22:10,551 INFO L175 Difference]: Start difference. First operand has 63 places, 50 transitions, 323 flow. Second operand 7 states and 74 transitions. [2024-06-03 22:22:10,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 61 transitions, 485 flow [2024-06-03 22:22:10,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 61 transitions, 450 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-03 22:22:10,554 INFO L231 Difference]: Finished difference. Result has 65 places, 54 transitions, 372 flow [2024-06-03 22:22:10,555 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=372, PETRI_PLACES=65, PETRI_TRANSITIONS=54} [2024-06-03 22:22:10,555 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 35 predicate places. [2024-06-03 22:22:10,555 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 54 transitions, 372 flow [2024-06-03 22:22:10,556 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-03 22:22:10,556 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:22:10,556 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:22:10,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-03 22:22:10,556 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-03 22:22:10,556 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:22:10,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1003758989, now seen corresponding path program 1 times [2024-06-03 22:22:10,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:22:10,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771190372] [2024-06-03 22:22:10,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:22:10,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:22:10,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:22:14,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:22:14,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:22:14,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771190372] [2024-06-03 22:22:14,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771190372] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:22:14,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:22:14,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:22:14,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964682001] [2024-06-03 22:22:14,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:22:14,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:22:14,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:22:14,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:22:14,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:22:14,543 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:22:14,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 54 transitions, 372 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-03 22:22:14,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:22:14,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:22:14,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:22:14,837 INFO L124 PetriNetUnfolderBase]: 207/375 cut-off events. [2024-06-03 22:22:14,838 INFO L125 PetriNetUnfolderBase]: For 3344/3344 co-relation queries the response was YES. [2024-06-03 22:22:14,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1770 conditions, 375 events. 207/375 cut-off events. For 3344/3344 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1338 event pairs, 41 based on Foata normal form. 1/375 useless extension candidates. Maximal degree in co-relation 1737. Up to 335 conditions per place. [2024-06-03 22:22:14,840 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 60 selfloop transitions, 16 changer transitions 0/78 dead transitions. [2024-06-03 22:22:14,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 78 transitions, 637 flow [2024-06-03 22:22:14,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:22:14,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:22:14,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 86 transitions. [2024-06-03 22:22:14,842 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3467741935483871 [2024-06-03 22:22:14,842 INFO L175 Difference]: Start difference. First operand has 65 places, 54 transitions, 372 flow. Second operand 8 states and 86 transitions. [2024-06-03 22:22:14,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 78 transitions, 637 flow [2024-06-03 22:22:14,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 78 transitions, 607 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-06-03 22:22:14,845 INFO L231 Difference]: Finished difference. Result has 72 places, 64 transitions, 478 flow [2024-06-03 22:22:14,846 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=478, PETRI_PLACES=72, PETRI_TRANSITIONS=64} [2024-06-03 22:22:14,846 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 42 predicate places. [2024-06-03 22:22:14,846 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 64 transitions, 478 flow [2024-06-03 22:22:14,846 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-03 22:22:14,846 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:22:14,847 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:22:14,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-03 22:22:14,847 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-03 22:22:14,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:22:14,847 INFO L85 PathProgramCache]: Analyzing trace with hash 577446209, now seen corresponding path program 2 times [2024-06-03 22:22:14,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:22:14,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673097307] [2024-06-03 22:22:14,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:22:14,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:22:14,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:22:18,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:22:18,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:22:18,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673097307] [2024-06-03 22:22:18,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673097307] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:22:18,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:22:18,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:22:18,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094563079] [2024-06-03 22:22:18,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:22:18,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:22:18,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:22:18,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:22:18,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:22:18,346 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:22:18,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 64 transitions, 478 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-03 22:22:18,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:22:18,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:22:18,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:22:18,621 INFO L124 PetriNetUnfolderBase]: 205/372 cut-off events. [2024-06-03 22:22:18,622 INFO L125 PetriNetUnfolderBase]: For 3676/3676 co-relation queries the response was YES. [2024-06-03 22:22:18,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1840 conditions, 372 events. 205/372 cut-off events. For 3676/3676 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1319 event pairs, 40 based on Foata normal form. 1/372 useless extension candidates. Maximal degree in co-relation 1803. Up to 305 conditions per place. [2024-06-03 22:22:18,624 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 53 selfloop transitions, 22 changer transitions 0/77 dead transitions. [2024-06-03 22:22:18,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 77 transitions, 666 flow [2024-06-03 22:22:18,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:22:18,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:22:18,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2024-06-03 22:22:18,626 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3640552995391705 [2024-06-03 22:22:18,626 INFO L175 Difference]: Start difference. First operand has 72 places, 64 transitions, 478 flow. Second operand 7 states and 79 transitions. [2024-06-03 22:22:18,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 77 transitions, 666 flow [2024-06-03 22:22:18,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 77 transitions, 632 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-06-03 22:22:18,631 INFO L231 Difference]: Finished difference. Result has 75 places, 64 transitions, 502 flow [2024-06-03 22:22:18,631 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=502, PETRI_PLACES=75, PETRI_TRANSITIONS=64} [2024-06-03 22:22:18,631 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 45 predicate places. [2024-06-03 22:22:18,631 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 64 transitions, 502 flow [2024-06-03 22:22:18,632 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-03 22:22:18,632 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:22:18,632 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:22:18,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-03 22:22:18,632 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-03 22:22:18,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:22:18,632 INFO L85 PathProgramCache]: Analyzing trace with hash 577536574, now seen corresponding path program 1 times [2024-06-03 22:22:18,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:22:18,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987805527] [2024-06-03 22:22:18,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:22:18,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:22:18,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:22:22,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:22:22,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:22:22,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987805527] [2024-06-03 22:22:22,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987805527] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:22:22,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:22:22,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:22:22,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268237368] [2024-06-03 22:22:22,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:22:22,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:22:22,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:22:22,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:22:22,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:22:23,078 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:22:23,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 64 transitions, 502 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-03 22:22:23,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:22:23,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:22:23,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:22:23,351 INFO L124 PetriNetUnfolderBase]: 211/382 cut-off events. [2024-06-03 22:22:23,351 INFO L125 PetriNetUnfolderBase]: For 4262/4262 co-relation queries the response was YES. [2024-06-03 22:22:23,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1943 conditions, 382 events. 211/382 cut-off events. For 4262/4262 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1371 event pairs, 39 based on Foata normal form. 2/383 useless extension candidates. Maximal degree in co-relation 1905. Up to 309 conditions per place. [2024-06-03 22:22:23,354 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 62 selfloop transitions, 21 changer transitions 0/85 dead transitions. [2024-06-03 22:22:23,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 85 transitions, 742 flow [2024-06-03 22:22:23,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:22:23,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:22:23,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2024-06-03 22:22:23,355 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35125448028673834 [2024-06-03 22:22:23,355 INFO L175 Difference]: Start difference. First operand has 75 places, 64 transitions, 502 flow. Second operand 9 states and 98 transitions. [2024-06-03 22:22:23,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 85 transitions, 742 flow [2024-06-03 22:22:23,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 85 transitions, 690 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-03 22:22:23,360 INFO L231 Difference]: Finished difference. Result has 78 places, 66 transitions, 520 flow [2024-06-03 22:22:23,360 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=450, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=520, PETRI_PLACES=78, PETRI_TRANSITIONS=66} [2024-06-03 22:22:23,360 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 48 predicate places. [2024-06-03 22:22:23,360 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 66 transitions, 520 flow [2024-06-03 22:22:23,361 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-03 22:22:23,361 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:22:23,361 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:22:23,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-03 22:22:23,361 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-03 22:22:23,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:22:23,361 INFO L85 PathProgramCache]: Analyzing trace with hash 6644999, now seen corresponding path program 1 times [2024-06-03 22:22:23,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:22:23,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698934550] [2024-06-03 22:22:23,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:22:23,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:22:23,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:22:27,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:22:27,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:22:27,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698934550] [2024-06-03 22:22:27,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698934550] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:22:27,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:22:27,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:22:27,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440438585] [2024-06-03 22:22:27,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:22:27,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:22:27,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:22:27,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:22:27,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:22:27,590 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:22:27,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 66 transitions, 520 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-03 22:22:27,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:22:27,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:22:27,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:22:27,812 INFO L124 PetriNetUnfolderBase]: 214/387 cut-off events. [2024-06-03 22:22:27,812 INFO L125 PetriNetUnfolderBase]: For 4257/4257 co-relation queries the response was YES. [2024-06-03 22:22:27,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1999 conditions, 387 events. 214/387 cut-off events. For 4257/4257 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1398 event pairs, 40 based on Foata normal form. 1/387 useless extension candidates. Maximal degree in co-relation 1960. Up to 355 conditions per place. [2024-06-03 22:22:27,815 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 62 selfloop transitions, 14 changer transitions 0/78 dead transitions. [2024-06-03 22:22:27,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 78 transitions, 714 flow [2024-06-03 22:22:27,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:22:27,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:22:27,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 82 transitions. [2024-06-03 22:22:27,815 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33064516129032256 [2024-06-03 22:22:27,816 INFO L175 Difference]: Start difference. First operand has 78 places, 66 transitions, 520 flow. Second operand 8 states and 82 transitions. [2024-06-03 22:22:27,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 78 transitions, 714 flow [2024-06-03 22:22:27,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 78 transitions, 662 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-03 22:22:27,820 INFO L231 Difference]: Finished difference. Result has 79 places, 68 transitions, 521 flow [2024-06-03 22:22:27,820 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=468, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=521, PETRI_PLACES=79, PETRI_TRANSITIONS=68} [2024-06-03 22:22:27,820 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 49 predicate places. [2024-06-03 22:22:27,821 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 68 transitions, 521 flow [2024-06-03 22:22:27,822 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-03 22:22:27,822 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:22:27,822 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:22:27,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-03 22:22:27,823 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-03 22:22:27,823 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:22:27,823 INFO L85 PathProgramCache]: Analyzing trace with hash -619336118, now seen corresponding path program 2 times [2024-06-03 22:22:27,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:22:27,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492532769] [2024-06-03 22:22:27,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:22:27,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:22:27,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:22:31,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-03 22:22:31,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:22:31,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492532769] [2024-06-03 22:22:31,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492532769] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:22:31,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:22:31,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:22:31,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790575704] [2024-06-03 22:22:31,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:22:31,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:22:31,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:22:31,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:22:31,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:22:31,588 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:22:31,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 68 transitions, 521 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-03 22:22:31,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:22:31,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:22:31,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:22:31,792 INFO L124 PetriNetUnfolderBase]: 220/397 cut-off events. [2024-06-03 22:22:31,793 INFO L125 PetriNetUnfolderBase]: For 4874/4874 co-relation queries the response was YES. [2024-06-03 22:22:31,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2067 conditions, 397 events. 220/397 cut-off events. For 4874/4874 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1434 event pairs, 40 based on Foata normal form. 2/398 useless extension candidates. Maximal degree in co-relation 2027. Up to 362 conditions per place. [2024-06-03 22:22:31,796 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 65 selfloop transitions, 14 changer transitions 0/81 dead transitions. [2024-06-03 22:22:31,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 81 transitions, 731 flow [2024-06-03 22:22:31,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:22:31,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:22:31,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 83 transitions. [2024-06-03 22:22:31,797 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3346774193548387 [2024-06-03 22:22:31,797 INFO L175 Difference]: Start difference. First operand has 79 places, 68 transitions, 521 flow. Second operand 8 states and 83 transitions. [2024-06-03 22:22:31,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 81 transitions, 731 flow [2024-06-03 22:22:31,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 81 transitions, 694 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-03 22:22:31,802 INFO L231 Difference]: Finished difference. Result has 81 places, 70 transitions, 543 flow [2024-06-03 22:22:31,802 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=484, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=543, PETRI_PLACES=81, PETRI_TRANSITIONS=70} [2024-06-03 22:22:31,803 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 51 predicate places. [2024-06-03 22:22:31,803 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 70 transitions, 543 flow [2024-06-03 22:22:31,803 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-03 22:22:31,803 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:22:31,803 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:22:31,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-03 22:22:31,803 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-03 22:22:31,804 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:22:31,804 INFO L85 PathProgramCache]: Analyzing trace with hash 6639202, now seen corresponding path program 3 times [2024-06-03 22:22:31,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:22:31,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031651793] [2024-06-03 22:22:31,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:22:31,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:22:31,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:22:36,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:22:36,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:22:36,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031651793] [2024-06-03 22:22:36,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031651793] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:22:36,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:22:36,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:22:36,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775356949] [2024-06-03 22:22:36,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:22:36,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:22:36,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:22:36,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:22:36,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:22:36,468 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:22:36,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 70 transitions, 543 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-03 22:22:36,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:22:36,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:22:36,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:22:36,805 INFO L124 PetriNetUnfolderBase]: 231/415 cut-off events. [2024-06-03 22:22:36,805 INFO L125 PetriNetUnfolderBase]: For 5619/5619 co-relation queries the response was YES. [2024-06-03 22:22:36,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2242 conditions, 415 events. 231/415 cut-off events. For 5619/5619 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1516 event pairs, 44 based on Foata normal form. 2/416 useless extension candidates. Maximal degree in co-relation 2201. Up to 302 conditions per place. [2024-06-03 22:22:36,808 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 58 selfloop transitions, 29 changer transitions 0/89 dead transitions. [2024-06-03 22:22:36,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 89 transitions, 849 flow [2024-06-03 22:22:36,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:22:36,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:22:36,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 91 transitions. [2024-06-03 22:22:36,810 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36693548387096775 [2024-06-03 22:22:36,810 INFO L175 Difference]: Start difference. First operand has 81 places, 70 transitions, 543 flow. Second operand 8 states and 91 transitions. [2024-06-03 22:22:36,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 89 transitions, 849 flow [2024-06-03 22:22:36,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 89 transitions, 806 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-06-03 22:22:36,817 INFO L231 Difference]: Finished difference. Result has 83 places, 74 transitions, 619 flow [2024-06-03 22:22:36,817 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=619, PETRI_PLACES=83, PETRI_TRANSITIONS=74} [2024-06-03 22:22:36,817 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 53 predicate places. [2024-06-03 22:22:36,817 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 74 transitions, 619 flow [2024-06-03 22:22:36,818 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-03 22:22:36,818 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:22:36,818 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:22:36,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-03 22:22:36,818 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-03 22:22:36,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:22:36,818 INFO L85 PathProgramCache]: Analyzing trace with hash -411820905, now seen corresponding path program 2 times [2024-06-03 22:22:36,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:22:36,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136010882] [2024-06-03 22:22:36,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:22:36,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:22:36,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:22:40,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:22:40,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:22:40,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136010882] [2024-06-03 22:22:40,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136010882] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:22:40,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:22:40,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:22:40,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693106593] [2024-06-03 22:22:40,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:22:40,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:22:40,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:22:40,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:22:40,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:22:41,016 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:22:41,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 74 transitions, 619 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-03 22:22:41,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:22:41,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:22:41,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:22:41,299 INFO L124 PetriNetUnfolderBase]: 234/420 cut-off events. [2024-06-03 22:22:41,300 INFO L125 PetriNetUnfolderBase]: For 6188/6188 co-relation queries the response was YES. [2024-06-03 22:22:41,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2345 conditions, 420 events. 234/420 cut-off events. For 6188/6188 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1543 event pairs, 50 based on Foata normal form. 1/420 useless extension candidates. Maximal degree in co-relation 2303. Up to 398 conditions per place. [2024-06-03 22:22:41,303 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 72 selfloop transitions, 12 changer transitions 0/86 dead transitions. [2024-06-03 22:22:41,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 86 transitions, 837 flow [2024-06-03 22:22:41,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:22:41,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:22:41,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2024-06-03 22:22:41,305 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3185483870967742 [2024-06-03 22:22:41,305 INFO L175 Difference]: Start difference. First operand has 83 places, 74 transitions, 619 flow. Second operand 8 states and 79 transitions. [2024-06-03 22:22:41,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 86 transitions, 837 flow [2024-06-03 22:22:41,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 86 transitions, 795 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-06-03 22:22:41,312 INFO L231 Difference]: Finished difference. Result has 88 places, 78 transitions, 645 flow [2024-06-03 22:22:41,312 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=577, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=645, PETRI_PLACES=88, PETRI_TRANSITIONS=78} [2024-06-03 22:22:41,313 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 58 predicate places. [2024-06-03 22:22:41,313 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 78 transitions, 645 flow [2024-06-03 22:22:41,313 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-03 22:22:41,313 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:22:41,313 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:22:41,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-03 22:22:41,313 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-03 22:22:41,314 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:22:41,315 INFO L85 PathProgramCache]: Analyzing trace with hash -412088032, now seen corresponding path program 4 times [2024-06-03 22:22:41,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:22:41,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938797115] [2024-06-03 22:22:41,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:22:41,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:22:41,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:22:44,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:22:44,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:22:44,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938797115] [2024-06-03 22:22:44,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938797115] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:22:44,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:22:44,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:22:44,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807928395] [2024-06-03 22:22:44,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:22:44,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:22:44,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:22:44,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:22:44,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:22:44,639 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:22:44,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 78 transitions, 645 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-03 22:22:44,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:22:44,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:22:44,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:22:44,846 INFO L124 PetriNetUnfolderBase]: 250/450 cut-off events. [2024-06-03 22:22:44,847 INFO L125 PetriNetUnfolderBase]: For 7571/7571 co-relation queries the response was YES. [2024-06-03 22:22:44,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2592 conditions, 450 events. 250/450 cut-off events. For 7571/7571 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1695 event pairs, 84 based on Foata normal form. 2/449 useless extension candidates. Maximal degree in co-relation 2547. Up to 381 conditions per place. [2024-06-03 22:22:44,850 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 66 selfloop transitions, 27 changer transitions 0/95 dead transitions. [2024-06-03 22:22:44,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 95 transitions, 979 flow [2024-06-03 22:22:44,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:22:44,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:22:44,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 93 transitions. [2024-06-03 22:22:44,853 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2024-06-03 22:22:44,853 INFO L175 Difference]: Start difference. First operand has 88 places, 78 transitions, 645 flow. Second operand 9 states and 93 transitions. [2024-06-03 22:22:44,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 95 transitions, 979 flow [2024-06-03 22:22:44,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 95 transitions, 937 flow, removed 12 selfloop flow, removed 4 redundant places. [2024-06-03 22:22:44,860 INFO L231 Difference]: Finished difference. Result has 94 places, 84 transitions, 746 flow [2024-06-03 22:22:44,861 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=604, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=746, PETRI_PLACES=94, PETRI_TRANSITIONS=84} [2024-06-03 22:22:44,861 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 64 predicate places. [2024-06-03 22:22:44,861 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 84 transitions, 746 flow [2024-06-03 22:22:44,861 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-03 22:22:44,861 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:22:44,861 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:22:44,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-03 22:22:44,862 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-03 22:22:44,862 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:22:44,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1230526417, now seen corresponding path program 3 times [2024-06-03 22:22:44,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:22:44,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619170872] [2024-06-03 22:22:44,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:22:44,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:22:44,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:22:48,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:22:48,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:22:48,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619170872] [2024-06-03 22:22:48,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619170872] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:22:48,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:22:48,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:22:48,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924213332] [2024-06-03 22:22:48,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:22:48,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:22:48,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:22:48,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:22:48,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:22:48,986 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:22:48,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 84 transitions, 746 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-03 22:22:48,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:22:48,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:22:48,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:22:49,235 INFO L124 PetriNetUnfolderBase]: 261/464 cut-off events. [2024-06-03 22:22:49,235 INFO L125 PetriNetUnfolderBase]: For 8754/8754 co-relation queries the response was YES. [2024-06-03 22:22:49,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2812 conditions, 464 events. 261/464 cut-off events. For 8754/8754 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1742 event pairs, 45 based on Foata normal form. 2/465 useless extension candidates. Maximal degree in co-relation 2764. Up to 385 conditions per place. [2024-06-03 22:22:49,239 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 72 selfloop transitions, 30 changer transitions 0/104 dead transitions. [2024-06-03 22:22:49,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 104 transitions, 1140 flow [2024-06-03 22:22:49,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:22:49,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:22:49,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions. [2024-06-03 22:22:49,240 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2024-06-03 22:22:49,240 INFO L175 Difference]: Start difference. First operand has 94 places, 84 transitions, 746 flow. Second operand 9 states and 99 transitions. [2024-06-03 22:22:49,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 104 transitions, 1140 flow [2024-06-03 22:22:49,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 104 transitions, 1099 flow, removed 14 selfloop flow, removed 3 redundant places. [2024-06-03 22:22:49,248 INFO L231 Difference]: Finished difference. Result has 100 places, 90 transitions, 840 flow [2024-06-03 22:22:49,249 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=705, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=840, PETRI_PLACES=100, PETRI_TRANSITIONS=90} [2024-06-03 22:22:49,249 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 70 predicate places. [2024-06-03 22:22:49,249 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 90 transitions, 840 flow [2024-06-03 22:22:49,249 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-03 22:22:49,249 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:22:49,250 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:22:49,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-03 22:22:49,250 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-03 22:22:49,250 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:22:49,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1582831412, now seen corresponding path program 5 times [2024-06-03 22:22:49,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:22:49,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88385760] [2024-06-03 22:22:49,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:22:49,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:22:49,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:22:53,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:22:53,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:22:53,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88385760] [2024-06-03 22:22:53,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88385760] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:22:53,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:22:53,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:22:53,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944739179] [2024-06-03 22:22:53,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:22:53,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:22:53,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:22:53,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:22:53,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:22:53,614 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:22:53,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 90 transitions, 840 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-03 22:22:53,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:22:53,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:22:53,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:22:53,875 INFO L124 PetriNetUnfolderBase]: 257/459 cut-off events. [2024-06-03 22:22:53,876 INFO L125 PetriNetUnfolderBase]: For 9027/9027 co-relation queries the response was YES. [2024-06-03 22:22:53,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2814 conditions, 459 events. 257/459 cut-off events. For 9027/9027 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1733 event pairs, 42 based on Foata normal form. 2/458 useless extension candidates. Maximal degree in co-relation 2763. Up to 360 conditions per place. [2024-06-03 22:22:53,879 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 71 selfloop transitions, 33 changer transitions 0/106 dead transitions. [2024-06-03 22:22:53,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 106 transitions, 1124 flow [2024-06-03 22:22:53,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:22:53,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:22:53,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2024-06-03 22:22:53,881 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34767025089605735 [2024-06-03 22:22:53,881 INFO L175 Difference]: Start difference. First operand has 100 places, 90 transitions, 840 flow. Second operand 9 states and 97 transitions. [2024-06-03 22:22:53,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 106 transitions, 1124 flow [2024-06-03 22:22:53,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 106 transitions, 1089 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-06-03 22:22:53,890 INFO L231 Difference]: Finished difference. Result has 105 places, 92 transitions, 914 flow [2024-06-03 22:22:53,890 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=805, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=914, PETRI_PLACES=105, PETRI_TRANSITIONS=92} [2024-06-03 22:22:53,890 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 75 predicate places. [2024-06-03 22:22:53,890 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 92 transitions, 914 flow [2024-06-03 22:22:53,891 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-03 22:22:53,891 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:22:53,891 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:22:53,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-03 22:22:53,891 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-03 22:22:53,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:22:53,891 INFO L85 PathProgramCache]: Analyzing trace with hash 725151971, now seen corresponding path program 4 times [2024-06-03 22:22:53,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:22:53,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223988129] [2024-06-03 22:22:53,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:22:53,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:22:53,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:22:57,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:22:57,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:22:57,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223988129] [2024-06-03 22:22:57,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223988129] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:22:57,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:22:57,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:22:57,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972854216] [2024-06-03 22:22:57,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:22:57,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:22:57,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:22:57,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:22:57,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:22:57,937 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:22:57,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 92 transitions, 914 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-03 22:22:57,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:22:57,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:22:57,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:22:58,180 INFO L124 PetriNetUnfolderBase]: 255/455 cut-off events. [2024-06-03 22:22:58,180 INFO L125 PetriNetUnfolderBase]: For 9202/9202 co-relation queries the response was YES. [2024-06-03 22:22:58,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2866 conditions, 455 events. 255/455 cut-off events. For 9202/9202 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1697 event pairs, 45 based on Foata normal form. 1/455 useless extension candidates. Maximal degree in co-relation 2813. Up to 417 conditions per place. [2024-06-03 22:22:58,184 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 83 selfloop transitions, 19 changer transitions 0/104 dead transitions. [2024-06-03 22:22:58,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 104 transitions, 1168 flow [2024-06-03 22:22:58,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:22:58,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:22:58,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 91 transitions. [2024-06-03 22:22:58,185 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32616487455197135 [2024-06-03 22:22:58,185 INFO L175 Difference]: Start difference. First operand has 105 places, 92 transitions, 914 flow. Second operand 9 states and 91 transitions. [2024-06-03 22:22:58,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 104 transitions, 1168 flow [2024-06-03 22:22:58,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 104 transitions, 1075 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-06-03 22:22:58,195 INFO L231 Difference]: Finished difference. Result has 107 places, 94 transitions, 894 flow [2024-06-03 22:22:58,195 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=821, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=894, PETRI_PLACES=107, PETRI_TRANSITIONS=94} [2024-06-03 22:22:58,195 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 77 predicate places. [2024-06-03 22:22:58,195 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 94 transitions, 894 flow [2024-06-03 22:22:58,196 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-03 22:22:58,196 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:22:58,196 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:22:58,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-03 22:22:58,196 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-03 22:22:58,196 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:22:58,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1237878284, now seen corresponding path program 6 times [2024-06-03 22:22:58,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:22:58,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858091849] [2024-06-03 22:22:58,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:22:58,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:22:58,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:23:02,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:23:02,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:23:02,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858091849] [2024-06-03 22:23:02,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858091849] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:23:02,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:23:02,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:23:02,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621785399] [2024-06-03 22:23:02,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:23:02,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:23:02,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:23:02,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:23:02,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:23:02,159 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:23:02,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 94 transitions, 894 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-03 22:23:02,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:23:02,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:23:02,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:23:02,391 INFO L124 PetriNetUnfolderBase]: 251/450 cut-off events. [2024-06-03 22:23:02,391 INFO L125 PetriNetUnfolderBase]: For 9353/9353 co-relation queries the response was YES. [2024-06-03 22:23:02,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2757 conditions, 450 events. 251/450 cut-off events. For 9353/9353 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1696 event pairs, 47 based on Foata normal form. 2/449 useless extension candidates. Maximal degree in co-relation 2703. Up to 408 conditions per place. [2024-06-03 22:23:02,395 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 82 selfloop transitions, 18 changer transitions 0/102 dead transitions. [2024-06-03 22:23:02,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 102 transitions, 1114 flow [2024-06-03 22:23:02,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:23:02,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:23:02,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 82 transitions. [2024-06-03 22:23:02,397 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33064516129032256 [2024-06-03 22:23:02,397 INFO L175 Difference]: Start difference. First operand has 107 places, 94 transitions, 894 flow. Second operand 8 states and 82 transitions. [2024-06-03 22:23:02,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 102 transitions, 1114 flow [2024-06-03 22:23:02,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 102 transitions, 1049 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-06-03 22:23:02,406 INFO L231 Difference]: Finished difference. Result has 108 places, 94 transitions, 870 flow [2024-06-03 22:23:02,407 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=829, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=870, PETRI_PLACES=108, PETRI_TRANSITIONS=94} [2024-06-03 22:23:02,407 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 78 predicate places. [2024-06-03 22:23:02,407 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 94 transitions, 870 flow [2024-06-03 22:23:02,407 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-03 22:23:02,407 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:23:02,408 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:23:02,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-03 22:23:02,408 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-03 22:23:02,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:23:02,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1230249587, now seen corresponding path program 1 times [2024-06-03 22:23:02,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:23:02,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397956794] [2024-06-03 22:23:02,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:23:02,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:23:02,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:23:06,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:23:06,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:23:06,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397956794] [2024-06-03 22:23:06,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397956794] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:23:06,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:23:06,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:23:06,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380353731] [2024-06-03 22:23:06,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:23:06,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:23:06,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:23:06,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:23:06,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:23:06,969 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:23:06,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 94 transitions, 870 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-03 22:23:06,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:23:06,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:23:06,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:23:07,217 INFO L124 PetriNetUnfolderBase]: 248/444 cut-off events. [2024-06-03 22:23:07,217 INFO L125 PetriNetUnfolderBase]: For 9312/9312 co-relation queries the response was YES. [2024-06-03 22:23:07,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2691 conditions, 444 events. 248/444 cut-off events. For 9312/9312 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1645 event pairs, 50 based on Foata normal form. 2/445 useless extension candidates. Maximal degree in co-relation 2636. Up to 416 conditions per place. [2024-06-03 22:23:07,221 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 88 selfloop transitions, 13 changer transitions 0/103 dead transitions. [2024-06-03 22:23:07,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 103 transitions, 1092 flow [2024-06-03 22:23:07,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:23:07,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:23:07,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 86 transitions. [2024-06-03 22:23:07,222 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30824372759856633 [2024-06-03 22:23:07,222 INFO L175 Difference]: Start difference. First operand has 108 places, 94 transitions, 870 flow. Second operand 9 states and 86 transitions. [2024-06-03 22:23:07,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 103 transitions, 1092 flow [2024-06-03 22:23:07,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 103 transitions, 1034 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-03 22:23:07,231 INFO L231 Difference]: Finished difference. Result has 110 places, 94 transitions, 842 flow [2024-06-03 22:23:07,231 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=812, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=842, PETRI_PLACES=110, PETRI_TRANSITIONS=94} [2024-06-03 22:23:07,232 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 80 predicate places. [2024-06-03 22:23:07,232 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 94 transitions, 842 flow [2024-06-03 22:23:07,232 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-03 22:23:07,232 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:23:07,232 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:23:07,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-03 22:23:07,232 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-03 22:23:07,232 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:23:07,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1737454873, now seen corresponding path program 1 times [2024-06-03 22:23:07,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:23:07,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056871955] [2024-06-03 22:23:07,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:23:07,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:23:07,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:23:11,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:23:11,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:23:11,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056871955] [2024-06-03 22:23:11,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056871955] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:23:11,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:23:11,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:23:11,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938783736] [2024-06-03 22:23:11,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:23:11,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:23:11,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:23:11,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:23:11,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:23:11,220 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:23:11,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 94 transitions, 842 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-03 22:23:11,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:23:11,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:23:11,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:23:11,506 INFO L124 PetriNetUnfolderBase]: 252/452 cut-off events. [2024-06-03 22:23:11,506 INFO L125 PetriNetUnfolderBase]: For 9835/9835 co-relation queries the response was YES. [2024-06-03 22:23:11,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2724 conditions, 452 events. 252/452 cut-off events. For 9835/9835 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1705 event pairs, 24 based on Foata normal form. 2/453 useless extension candidates. Maximal degree in co-relation 2668. Up to 374 conditions per place. [2024-06-03 22:23:11,509 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 90 selfloop transitions, 17 changer transitions 0/109 dead transitions. [2024-06-03 22:23:11,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 109 transitions, 1108 flow [2024-06-03 22:23:11,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:23:11,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:23:11,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 85 transitions. [2024-06-03 22:23:11,510 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34274193548387094 [2024-06-03 22:23:11,510 INFO L175 Difference]: Start difference. First operand has 110 places, 94 transitions, 842 flow. Second operand 8 states and 85 transitions. [2024-06-03 22:23:11,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 109 transitions, 1108 flow [2024-06-03 22:23:11,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 109 transitions, 1060 flow, removed 5 selfloop flow, removed 9 redundant places. [2024-06-03 22:23:11,519 INFO L231 Difference]: Finished difference. Result has 109 places, 95 transitions, 848 flow [2024-06-03 22:23:11,520 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=794, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=848, PETRI_PLACES=109, PETRI_TRANSITIONS=95} [2024-06-03 22:23:11,520 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 79 predicate places. [2024-06-03 22:23:11,520 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 95 transitions, 848 flow [2024-06-03 22:23:11,520 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-03 22:23:11,520 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:23:11,520 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:23:11,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-03 22:23:11,521 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-03 22:23:11,521 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:23:11,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1737515447, now seen corresponding path program 1 times [2024-06-03 22:23:11,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:23:11,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436624640] [2024-06-03 22:23:11,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:23:11,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:23:11,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:23:15,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-03 22:23:15,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:23:15,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436624640] [2024-06-03 22:23:15,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436624640] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:23:15,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:23:15,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:23:15,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643712508] [2024-06-03 22:23:15,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:23:15,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:23:15,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:23:15,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:23:15,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:23:15,821 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:23:15,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 95 transitions, 848 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-03 22:23:15,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:23:15,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:23:15,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:23:16,127 INFO L124 PetriNetUnfolderBase]: 250/449 cut-off events. [2024-06-03 22:23:16,127 INFO L125 PetriNetUnfolderBase]: For 9806/9806 co-relation queries the response was YES. [2024-06-03 22:23:16,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2698 conditions, 449 events. 250/449 cut-off events. For 9806/9806 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1688 event pairs, 38 based on Foata normal form. 1/449 useless extension candidates. Maximal degree in co-relation 2643. Up to 365 conditions per place. [2024-06-03 22:23:16,130 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 80 selfloop transitions, 27 changer transitions 0/109 dead transitions. [2024-06-03 22:23:16,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 109 transitions, 1104 flow [2024-06-03 22:23:16,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:23:16,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:23:16,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2024-06-03 22:23:16,133 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2024-06-03 22:23:16,133 INFO L175 Difference]: Start difference. First operand has 109 places, 95 transitions, 848 flow. Second operand 8 states and 88 transitions. [2024-06-03 22:23:16,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 109 transitions, 1104 flow [2024-06-03 22:23:16,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 109 transitions, 1050 flow, removed 11 selfloop flow, removed 6 redundant places. [2024-06-03 22:23:16,144 INFO L231 Difference]: Finished difference. Result has 111 places, 95 transitions, 858 flow [2024-06-03 22:23:16,144 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=794, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=858, PETRI_PLACES=111, PETRI_TRANSITIONS=95} [2024-06-03 22:23:16,146 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 81 predicate places. [2024-06-03 22:23:16,146 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 95 transitions, 858 flow [2024-06-03 22:23:16,146 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-03 22:23:16,146 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:23:16,146 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:23:16,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-03 22:23:16,147 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-03 22:23:16,147 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:23:16,147 INFO L85 PathProgramCache]: Analyzing trace with hash 720964103, now seen corresponding path program 2 times [2024-06-03 22:23:16,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:23:16,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331529355] [2024-06-03 22:23:16,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:23:16,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:23:16,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:23:19,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:23:19,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:23:19,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331529355] [2024-06-03 22:23:19,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331529355] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:23:19,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:23:19,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:23:19,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776950249] [2024-06-03 22:23:19,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:23:19,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:23:19,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:23:19,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:23:19,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:23:19,731 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:23:19,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 95 transitions, 858 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-03 22:23:19,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:23:19,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:23:19,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:23:20,033 INFO L124 PetriNetUnfolderBase]: 254/457 cut-off events. [2024-06-03 22:23:20,034 INFO L125 PetriNetUnfolderBase]: For 11213/11213 co-relation queries the response was YES. [2024-06-03 22:23:20,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2769 conditions, 457 events. 254/457 cut-off events. For 11213/11213 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1742 event pairs, 38 based on Foata normal form. 2/458 useless extension candidates. Maximal degree in co-relation 2713. Up to 378 conditions per place. [2024-06-03 22:23:20,037 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 84 selfloop transitions, 24 changer transitions 0/110 dead transitions. [2024-06-03 22:23:20,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 110 transitions, 1130 flow [2024-06-03 22:23:20,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:23:20,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:23:20,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 87 transitions. [2024-06-03 22:23:20,039 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35080645161290325 [2024-06-03 22:23:20,039 INFO L175 Difference]: Start difference. First operand has 111 places, 95 transitions, 858 flow. Second operand 8 states and 87 transitions. [2024-06-03 22:23:20,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 110 transitions, 1130 flow [2024-06-03 22:23:20,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 110 transitions, 1059 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-03 22:23:20,051 INFO L231 Difference]: Finished difference. Result has 112 places, 96 transitions, 860 flow [2024-06-03 22:23:20,051 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=787, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=860, PETRI_PLACES=112, PETRI_TRANSITIONS=96} [2024-06-03 22:23:20,051 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 82 predicate places. [2024-06-03 22:23:20,052 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 96 transitions, 860 flow [2024-06-03 22:23:20,052 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-03 22:23:20,052 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:23:20,052 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:23:20,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-03 22:23:20,052 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-03 22:23:20,052 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:23:20,053 INFO L85 PathProgramCache]: Analyzing trace with hash 90525055, now seen corresponding path program 1 times [2024-06-03 22:23:20,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:23:20,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390967441] [2024-06-03 22:23:20,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:23:20,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:23:20,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:23:24,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-03 22:23:24,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:23:24,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390967441] [2024-06-03 22:23:24,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390967441] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:23:24,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:23:24,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:23:24,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152870603] [2024-06-03 22:23:24,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:23:24,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:23:24,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:23:24,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:23:24,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:23:24,376 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:23:24,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 96 transitions, 860 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-03 22:23:24,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:23:24,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:23:24,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:23:24,652 INFO L124 PetriNetUnfolderBase]: 260/467 cut-off events. [2024-06-03 22:23:24,652 INFO L125 PetriNetUnfolderBase]: For 12044/12044 co-relation queries the response was YES. [2024-06-03 22:23:24,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2842 conditions, 467 events. 260/467 cut-off events. For 12044/12044 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1789 event pairs, 39 based on Foata normal form. 2/468 useless extension candidates. Maximal degree in co-relation 2785. Up to 386 conditions per place. [2024-06-03 22:23:24,665 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 89 selfloop transitions, 24 changer transitions 0/115 dead transitions. [2024-06-03 22:23:24,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 115 transitions, 1168 flow [2024-06-03 22:23:24,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:23:24,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:23:24,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2024-06-03 22:23:24,667 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34767025089605735 [2024-06-03 22:23:24,667 INFO L175 Difference]: Start difference. First operand has 112 places, 96 transitions, 860 flow. Second operand 9 states and 97 transitions. [2024-06-03 22:23:24,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 115 transitions, 1168 flow [2024-06-03 22:23:24,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 115 transitions, 1096 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-03 22:23:24,680 INFO L231 Difference]: Finished difference. Result has 114 places, 98 transitions, 873 flow [2024-06-03 22:23:24,681 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=788, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=873, PETRI_PLACES=114, PETRI_TRANSITIONS=98} [2024-06-03 22:23:24,681 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 84 predicate places. [2024-06-03 22:23:24,682 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 98 transitions, 873 flow [2024-06-03 22:23:24,682 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-03 22:23:24,682 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:23:24,682 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:23:24,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-03 22:23:24,682 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-03 22:23:24,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:23:24,683 INFO L85 PathProgramCache]: Analyzing trace with hash 839229723, now seen corresponding path program 2 times [2024-06-03 22:23:24,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:23:24,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512062499] [2024-06-03 22:23:24,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:23:24,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:23:24,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:23:28,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:23:28,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:23:28,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512062499] [2024-06-03 22:23:28,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512062499] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:23:28,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:23:28,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:23:28,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460320784] [2024-06-03 22:23:28,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:23:28,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:23:28,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:23:28,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:23:28,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:23:28,419 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:23:28,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 98 transitions, 873 flow. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:28,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:23:28,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:23:28,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:23:28,645 INFO L124 PetriNetUnfolderBase]: 301/533 cut-off events. [2024-06-03 22:23:28,645 INFO L125 PetriNetUnfolderBase]: For 16048/16048 co-relation queries the response was YES. [2024-06-03 22:23:28,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3417 conditions, 533 events. 301/533 cut-off events. For 16048/16048 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2123 event pairs, 41 based on Foata normal form. 2/534 useless extension candidates. Maximal degree in co-relation 3360. Up to 447 conditions per place. [2024-06-03 22:23:28,650 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 97 selfloop transitions, 23 changer transitions 0/122 dead transitions. [2024-06-03 22:23:28,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 122 transitions, 1399 flow [2024-06-03 22:23:28,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:23:28,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:23:28,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2024-06-03 22:23:28,651 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4153225806451613 [2024-06-03 22:23:28,651 INFO L175 Difference]: Start difference. First operand has 114 places, 98 transitions, 873 flow. Second operand 8 states and 103 transitions. [2024-06-03 22:23:28,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 122 transitions, 1399 flow [2024-06-03 22:23:28,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 122 transitions, 1330 flow, removed 12 selfloop flow, removed 7 redundant places. [2024-06-03 22:23:28,668 INFO L231 Difference]: Finished difference. Result has 116 places, 107 transitions, 1000 flow [2024-06-03 22:23:28,668 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=804, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1000, PETRI_PLACES=116, PETRI_TRANSITIONS=107} [2024-06-03 22:23:28,668 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 86 predicate places. [2024-06-03 22:23:28,669 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 107 transitions, 1000 flow [2024-06-03 22:23:28,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:28,669 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:23:28,669 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:23:28,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-03 22:23:28,669 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-03 22:23:28,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:23:28,670 INFO L85 PathProgramCache]: Analyzing trace with hash -2019543001, now seen corresponding path program 3 times [2024-06-03 22:23:28,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:23:28,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141591587] [2024-06-03 22:23:28,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:23:28,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:23:28,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:23:32,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:23:32,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:23:32,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141591587] [2024-06-03 22:23:32,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141591587] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:23:32,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:23:32,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:23:32,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998997847] [2024-06-03 22:23:32,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:23:32,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:23:32,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:23:32,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:23:32,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:23:32,621 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:23:32,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 107 transitions, 1000 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-03 22:23:32,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:23:32,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:23:32,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:23:32,901 INFO L124 PetriNetUnfolderBase]: 295/525 cut-off events. [2024-06-03 22:23:32,901 INFO L125 PetriNetUnfolderBase]: For 16327/16327 co-relation queries the response was YES. [2024-06-03 22:23:32,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3335 conditions, 525 events. 295/525 cut-off events. For 16327/16327 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2093 event pairs, 39 based on Foata normal form. 4/528 useless extension candidates. Maximal degree in co-relation 3277. Up to 446 conditions per place. [2024-06-03 22:23:32,904 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 96 selfloop transitions, 23 changer transitions 0/121 dead transitions. [2024-06-03 22:23:32,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 121 transitions, 1338 flow [2024-06-03 22:23:32,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:23:32,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:23:32,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2024-06-03 22:23:32,905 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35125448028673834 [2024-06-03 22:23:32,905 INFO L175 Difference]: Start difference. First operand has 116 places, 107 transitions, 1000 flow. Second operand 9 states and 98 transitions. [2024-06-03 22:23:32,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 121 transitions, 1338 flow [2024-06-03 22:23:32,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 121 transitions, 1269 flow, removed 28 selfloop flow, removed 3 redundant places. [2024-06-03 22:23:32,921 INFO L231 Difference]: Finished difference. Result has 122 places, 107 transitions, 984 flow [2024-06-03 22:23:32,921 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=931, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=984, PETRI_PLACES=122, PETRI_TRANSITIONS=107} [2024-06-03 22:23:32,921 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 92 predicate places. [2024-06-03 22:23:32,921 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 107 transitions, 984 flow [2024-06-03 22:23:32,921 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-03 22:23:32,921 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:23:32,921 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:23:32,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-03 22:23:32,922 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-03 22:23:32,922 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:23:32,922 INFO L85 PathProgramCache]: Analyzing trace with hash -2001108727, now seen corresponding path program 1 times [2024-06-03 22:23:32,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:23:32,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465754501] [2024-06-03 22:23:32,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:23:32,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:23:32,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:23:37,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:23:37,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:23:37,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465754501] [2024-06-03 22:23:37,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465754501] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:23:37,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:23:37,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:23:37,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325125025] [2024-06-03 22:23:37,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:23:37,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:23:37,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:23:37,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:23:37,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:23:37,505 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:23:37,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 107 transitions, 984 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-03 22:23:37,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:23:37,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:23:37,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:23:37,809 INFO L124 PetriNetUnfolderBase]: 291/518 cut-off events. [2024-06-03 22:23:37,809 INFO L125 PetriNetUnfolderBase]: For 15254/15254 co-relation queries the response was YES. [2024-06-03 22:23:37,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3257 conditions, 518 events. 291/518 cut-off events. For 15254/15254 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2049 event pairs, 45 based on Foata normal form. 1/518 useless extension candidates. Maximal degree in co-relation 3196. Up to 483 conditions per place. [2024-06-03 22:23:37,813 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 98 selfloop transitions, 17 changer transitions 0/117 dead transitions. [2024-06-03 22:23:37,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 117 transitions, 1238 flow [2024-06-03 22:23:37,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:23:37,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:23:37,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 90 transitions. [2024-06-03 22:23:37,814 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3225806451612903 [2024-06-03 22:23:37,814 INFO L175 Difference]: Start difference. First operand has 122 places, 107 transitions, 984 flow. Second operand 9 states and 90 transitions. [2024-06-03 22:23:37,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 117 transitions, 1238 flow [2024-06-03 22:23:37,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 117 transitions, 1188 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-03 22:23:37,830 INFO L231 Difference]: Finished difference. Result has 124 places, 107 transitions, 973 flow [2024-06-03 22:23:37,830 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=934, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=973, PETRI_PLACES=124, PETRI_TRANSITIONS=107} [2024-06-03 22:23:37,830 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 94 predicate places. [2024-06-03 22:23:37,830 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 107 transitions, 973 flow [2024-06-03 22:23:37,830 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-03 22:23:37,830 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:23:37,830 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:23:37,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-03 22:23:37,830 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-03 22:23:37,831 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:23:37,831 INFO L85 PathProgramCache]: Analyzing trace with hash 205811265, now seen corresponding path program 3 times [2024-06-03 22:23:37,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:23:37,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737571349] [2024-06-03 22:23:37,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:23:37,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:23:37,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:23:41,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:23:41,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:23:41,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737571349] [2024-06-03 22:23:41,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737571349] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:23:41,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:23:41,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:23:41,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812459773] [2024-06-03 22:23:41,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:23:41,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:23:41,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:23:41,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:23:41,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:23:41,488 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:23:41,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 107 transitions, 973 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-03 22:23:41,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:23:41,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:23:41,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:23:41,765 INFO L124 PetriNetUnfolderBase]: 295/526 cut-off events. [2024-06-03 22:23:41,765 INFO L125 PetriNetUnfolderBase]: For 16628/16628 co-relation queries the response was YES. [2024-06-03 22:23:41,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3301 conditions, 526 events. 295/526 cut-off events. For 16628/16628 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2111 event pairs, 43 based on Foata normal form. 2/527 useless extension candidates. Maximal degree in co-relation 3239. Up to 442 conditions per place. [2024-06-03 22:23:41,769 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 94 selfloop transitions, 25 changer transitions 0/121 dead transitions. [2024-06-03 22:23:41,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 121 transitions, 1267 flow [2024-06-03 22:23:41,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:23:41,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:23:41,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 87 transitions. [2024-06-03 22:23:41,770 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35080645161290325 [2024-06-03 22:23:41,770 INFO L175 Difference]: Start difference. First operand has 124 places, 107 transitions, 973 flow. Second operand 8 states and 87 transitions. [2024-06-03 22:23:41,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 121 transitions, 1267 flow [2024-06-03 22:23:41,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 121 transitions, 1216 flow, removed 10 selfloop flow, removed 7 redundant places. [2024-06-03 22:23:41,786 INFO L231 Difference]: Finished difference. Result has 125 places, 108 transitions, 996 flow [2024-06-03 22:23:41,787 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=922, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=996, PETRI_PLACES=125, PETRI_TRANSITIONS=108} [2024-06-03 22:23:41,787 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 95 predicate places. [2024-06-03 22:23:41,787 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 108 transitions, 996 flow [2024-06-03 22:23:41,787 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-03 22:23:41,787 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:23:41,787 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:23:41,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-03 22:23:41,787 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-03 22:23:41,788 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:23:41,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1855607963, now seen corresponding path program 4 times [2024-06-03 22:23:41,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:23:41,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747200956] [2024-06-03 22:23:41,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:23:41,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:23:41,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:23:46,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-03 22:23:46,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:23:46,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747200956] [2024-06-03 22:23:46,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747200956] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:23:46,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:23:46,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:23:46,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371315626] [2024-06-03 22:23:46,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:23:46,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:23:46,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:23:46,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:23:46,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:23:46,250 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:23:46,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 108 transitions, 996 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-03 22:23:46,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:23:46,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:23:46,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:23:46,653 INFO L124 PetriNetUnfolderBase]: 316/560 cut-off events. [2024-06-03 22:23:46,653 INFO L125 PetriNetUnfolderBase]: For 19473/19473 co-relation queries the response was YES. [2024-06-03 22:23:46,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3662 conditions, 560 events. 316/560 cut-off events. For 19473/19473 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2271 event pairs, 46 based on Foata normal form. 2/561 useless extension candidates. Maximal degree in co-relation 3599. Up to 369 conditions per place. [2024-06-03 22:23:46,656 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 87 selfloop transitions, 40 changer transitions 0/129 dead transitions. [2024-06-03 22:23:46,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 129 transitions, 1446 flow [2024-06-03 22:23:46,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:23:46,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:23:46,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2024-06-03 22:23:46,659 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3727598566308244 [2024-06-03 22:23:46,659 INFO L175 Difference]: Start difference. First operand has 125 places, 108 transitions, 996 flow. Second operand 9 states and 104 transitions. [2024-06-03 22:23:46,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 129 transitions, 1446 flow [2024-06-03 22:23:46,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 129 transitions, 1382 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-03 22:23:46,685 INFO L231 Difference]: Finished difference. Result has 129 places, 112 transitions, 1116 flow [2024-06-03 22:23:46,685 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=932, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1116, PETRI_PLACES=129, PETRI_TRANSITIONS=112} [2024-06-03 22:23:46,685 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 99 predicate places. [2024-06-03 22:23:46,685 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 112 transitions, 1116 flow [2024-06-03 22:23:46,685 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-03 22:23:46,685 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:23:46,685 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:23:46,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-03 22:23:46,686 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-03 22:23:46,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:23:46,686 INFO L85 PathProgramCache]: Analyzing trace with hash -117720533, now seen corresponding path program 2 times [2024-06-03 22:23:46,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:23:46,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164393865] [2024-06-03 22:23:46,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:23:46,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:23:46,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:23:51,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:23:51,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:23:51,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164393865] [2024-06-03 22:23:51,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164393865] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:23:51,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:23:51,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:23:51,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507909325] [2024-06-03 22:23:51,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:23:51,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:23:51,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:23:51,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:23:51,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:23:51,322 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:23:51,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 112 transitions, 1116 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-03 22:23:51,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:23:51,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:23:51,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:23:51,560 INFO L124 PetriNetUnfolderBase]: 314/557 cut-off events. [2024-06-03 22:23:51,560 INFO L125 PetriNetUnfolderBase]: For 19405/19405 co-relation queries the response was YES. [2024-06-03 22:23:51,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3749 conditions, 557 events. 314/557 cut-off events. For 19405/19405 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2273 event pairs, 49 based on Foata normal form. 1/557 useless extension candidates. Maximal degree in co-relation 3684. Up to 516 conditions per place. [2024-06-03 22:23:51,564 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 100 selfloop transitions, 20 changer transitions 0/122 dead transitions. [2024-06-03 22:23:51,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 122 transitions, 1380 flow [2024-06-03 22:23:51,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:23:51,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:23:51,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 92 transitions. [2024-06-03 22:23:51,565 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32974910394265233 [2024-06-03 22:23:51,565 INFO L175 Difference]: Start difference. First operand has 129 places, 112 transitions, 1116 flow. Second operand 9 states and 92 transitions. [2024-06-03 22:23:51,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 122 transitions, 1380 flow [2024-06-03 22:23:51,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 122 transitions, 1309 flow, removed 21 selfloop flow, removed 5 redundant places. [2024-06-03 22:23:51,587 INFO L231 Difference]: Finished difference. Result has 133 places, 112 transitions, 1091 flow [2024-06-03 22:23:51,587 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1045, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1091, PETRI_PLACES=133, PETRI_TRANSITIONS=112} [2024-06-03 22:23:51,587 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 103 predicate places. [2024-06-03 22:23:51,588 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 112 transitions, 1091 flow [2024-06-03 22:23:51,588 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-03 22:23:51,588 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:23:51,588 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:23:51,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-03 22:23:51,588 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-03 22:23:51,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:23:51,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1004875367, now seen corresponding path program 5 times [2024-06-03 22:23:51,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:23:51,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821428361] [2024-06-03 22:23:51,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:23:51,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:23:51,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:23:55,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:23:55,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:23:55,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821428361] [2024-06-03 22:23:55,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821428361] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:23:55,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:23:55,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:23:55,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917533272] [2024-06-03 22:23:55,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:23:55,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:23:55,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:23:55,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:23:55,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:23:55,420 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:23:55,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 112 transitions, 1091 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:55,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:23:55,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:23:55,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:23:55,652 INFO L124 PetriNetUnfolderBase]: 346/610 cut-off events. [2024-06-03 22:23:55,652 INFO L125 PetriNetUnfolderBase]: For 25023/25023 co-relation queries the response was YES. [2024-06-03 22:23:55,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4236 conditions, 610 events. 346/610 cut-off events. For 25023/25023 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2531 event pairs, 55 based on Foata normal form. 4/611 useless extension candidates. Maximal degree in co-relation 4169. Up to 522 conditions per place. [2024-06-03 22:23:55,656 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 103 selfloop transitions, 25 changer transitions 0/130 dead transitions. [2024-06-03 22:23:55,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 130 transitions, 1551 flow [2024-06-03 22:23:55,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:23:55,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:23:55,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2024-06-03 22:23:55,661 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37992831541218636 [2024-06-03 22:23:55,661 INFO L175 Difference]: Start difference. First operand has 133 places, 112 transitions, 1091 flow. Second operand 9 states and 106 transitions. [2024-06-03 22:23:55,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 130 transitions, 1551 flow [2024-06-03 22:23:55,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 130 transitions, 1479 flow, removed 6 selfloop flow, removed 9 redundant places. [2024-06-03 22:23:55,687 INFO L231 Difference]: Finished difference. Result has 133 places, 117 transitions, 1168 flow [2024-06-03 22:23:55,687 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1019, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1168, PETRI_PLACES=133, PETRI_TRANSITIONS=117} [2024-06-03 22:23:55,687 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 103 predicate places. [2024-06-03 22:23:55,687 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 117 transitions, 1168 flow [2024-06-03 22:23:55,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:55,688 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:23:55,688 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:23:55,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-03 22:23:55,689 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-03 22:23:55,689 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:23:55,689 INFO L85 PathProgramCache]: Analyzing trace with hash 516958611, now seen corresponding path program 3 times [2024-06-03 22:23:55,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:23:55,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713045775] [2024-06-03 22:23:55,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:23:55,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:23:55,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:24:00,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:24:00,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:24:00,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713045775] [2024-06-03 22:24:00,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713045775] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:24:00,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:24:00,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:24:00,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936606816] [2024-06-03 22:24:00,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:24:00,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:24:00,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:24:00,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:24:00,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:24:00,186 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:24:00,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 117 transitions, 1168 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-03 22:24:00,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:24:00,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:24:00,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:24:00,548 INFO L124 PetriNetUnfolderBase]: 349/614 cut-off events. [2024-06-03 22:24:00,548 INFO L125 PetriNetUnfolderBase]: For 24426/24426 co-relation queries the response was YES. [2024-06-03 22:24:00,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4348 conditions, 614 events. 349/614 cut-off events. For 24426/24426 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2541 event pairs, 66 based on Foata normal form. 1/614 useless extension candidates. Maximal degree in co-relation 4281. Up to 582 conditions per place. [2024-06-03 22:24:00,552 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 109 selfloop transitions, 18 changer transitions 0/129 dead transitions. [2024-06-03 22:24:00,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 129 transitions, 1544 flow [2024-06-03 22:24:00,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:24:00,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:24:00,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 97 transitions. [2024-06-03 22:24:00,554 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31290322580645163 [2024-06-03 22:24:00,554 INFO L175 Difference]: Start difference. First operand has 133 places, 117 transitions, 1168 flow. Second operand 10 states and 97 transitions. [2024-06-03 22:24:00,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 129 transitions, 1544 flow [2024-06-03 22:24:00,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 129 transitions, 1467 flow, removed 27 selfloop flow, removed 5 redundant places. [2024-06-03 22:24:00,585 INFO L231 Difference]: Finished difference. Result has 138 places, 119 transitions, 1158 flow [2024-06-03 22:24:00,585 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1091, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1158, PETRI_PLACES=138, PETRI_TRANSITIONS=119} [2024-06-03 22:24:00,585 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 108 predicate places. [2024-06-03 22:24:00,585 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 119 transitions, 1158 flow [2024-06-03 22:24:00,586 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-03 22:24:00,586 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:24:00,586 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:24:00,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-03 22:24:00,586 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-03 22:24:00,586 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:24:00,586 INFO L85 PathProgramCache]: Analyzing trace with hash 2027913337, now seen corresponding path program 6 times [2024-06-03 22:24:00,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:24:00,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750430676] [2024-06-03 22:24:00,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:24:00,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:24:00,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:24:04,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:24:04,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:24:04,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750430676] [2024-06-03 22:24:04,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750430676] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:24:04,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:24:04,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:24:04,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233315912] [2024-06-03 22:24:04,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:24:04,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:24:04,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:24:04,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:24:04,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:24:04,314 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:24:04,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 119 transitions, 1158 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-03 22:24:04,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:24:04,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:24:04,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:24:04,606 INFO L124 PetriNetUnfolderBase]: 373/654 cut-off events. [2024-06-03 22:24:04,606 INFO L125 PetriNetUnfolderBase]: For 29389/29389 co-relation queries the response was YES. [2024-06-03 22:24:04,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4651 conditions, 654 events. 373/654 cut-off events. For 29389/29389 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2768 event pairs, 68 based on Foata normal form. 4/657 useless extension candidates. Maximal degree in co-relation 4582. Up to 595 conditions per place. [2024-06-03 22:24:04,611 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 112 selfloop transitions, 21 changer transitions 0/135 dead transitions. [2024-06-03 22:24:04,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 135 transitions, 1624 flow [2024-06-03 22:24:04,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:24:04,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:24:04,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2024-06-03 22:24:04,612 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33691756272401435 [2024-06-03 22:24:04,612 INFO L175 Difference]: Start difference. First operand has 138 places, 119 transitions, 1158 flow. Second operand 9 states and 94 transitions. [2024-06-03 22:24:04,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 135 transitions, 1624 flow [2024-06-03 22:24:04,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 135 transitions, 1579 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-06-03 22:24:04,643 INFO L231 Difference]: Finished difference. Result has 140 places, 124 transitions, 1265 flow [2024-06-03 22:24:04,643 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1113, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1265, PETRI_PLACES=140, PETRI_TRANSITIONS=124} [2024-06-03 22:24:04,644 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 110 predicate places. [2024-06-03 22:24:04,644 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 124 transitions, 1265 flow [2024-06-03 22:24:04,644 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-03 22:24:04,644 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:24:04,645 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:24:04,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-03 22:24:04,645 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-03 22:24:04,645 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:24:04,645 INFO L85 PathProgramCache]: Analyzing trace with hash 2027913585, now seen corresponding path program 4 times [2024-06-03 22:24:04,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:24:04,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580708649] [2024-06-03 22:24:04,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:24:04,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:24:04,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:24:09,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:24:09,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:24:09,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580708649] [2024-06-03 22:24:09,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580708649] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:24:09,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:24:09,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:24:09,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523080945] [2024-06-03 22:24:09,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:24:09,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:24:09,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:24:09,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:24:09,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:24:09,112 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:24:09,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 124 transitions, 1265 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:24:09,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:24:09,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:24:09,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:24:09,397 INFO L124 PetriNetUnfolderBase]: 369/647 cut-off events. [2024-06-03 22:24:09,398 INFO L125 PetriNetUnfolderBase]: For 28152/28152 co-relation queries the response was YES. [2024-06-03 22:24:09,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4660 conditions, 647 events. 369/647 cut-off events. For 28152/28152 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2723 event pairs, 71 based on Foata normal form. 1/647 useless extension candidates. Maximal degree in co-relation 4590. Up to 622 conditions per place. [2024-06-03 22:24:09,402 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 116 selfloop transitions, 14 changer transitions 0/132 dead transitions. [2024-06-03 22:24:09,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 132 transitions, 1543 flow [2024-06-03 22:24:09,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:24:09,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:24:09,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 96 transitions. [2024-06-03 22:24:09,404 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34408602150537637 [2024-06-03 22:24:09,404 INFO L175 Difference]: Start difference. First operand has 140 places, 124 transitions, 1265 flow. Second operand 9 states and 96 transitions. [2024-06-03 22:24:09,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 132 transitions, 1543 flow [2024-06-03 22:24:09,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 132 transitions, 1442 flow, removed 43 selfloop flow, removed 5 redundant places. [2024-06-03 22:24:09,439 INFO L231 Difference]: Finished difference. Result has 144 places, 124 transitions, 1197 flow [2024-06-03 22:24:09,439 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1164, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1197, PETRI_PLACES=144, PETRI_TRANSITIONS=124} [2024-06-03 22:24:09,439 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 114 predicate places. [2024-06-03 22:24:09,439 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 124 transitions, 1197 flow [2024-06-03 22:24:09,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:24:09,440 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:24:09,440 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:24:09,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-03 22:24:09,440 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-03 22:24:09,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:24:09,440 INFO L85 PathProgramCache]: Analyzing trace with hash 508387483, now seen corresponding path program 7 times [2024-06-03 22:24:09,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:24:09,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921688042] [2024-06-03 22:24:09,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:24:09,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:24:09,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:24:13,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:24:13,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:24:13,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921688042] [2024-06-03 22:24:13,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921688042] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:24:13,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:24:13,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:24:13,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711872182] [2024-06-03 22:24:13,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:24:13,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:24:13,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:24:13,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:24:13,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:24:13,245 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:24:13,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 124 transitions, 1197 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-03 22:24:13,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:24:13,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:24:13,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:24:13,562 INFO L124 PetriNetUnfolderBase]: 401/699 cut-off events. [2024-06-03 22:24:13,563 INFO L125 PetriNetUnfolderBase]: For 34811/34811 co-relation queries the response was YES. [2024-06-03 22:24:13,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5120 conditions, 699 events. 401/699 cut-off events. For 34811/34811 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2995 event pairs, 64 based on Foata normal form. 4/702 useless extension candidates. Maximal degree in co-relation 5048. Up to 464 conditions per place. [2024-06-03 22:24:13,568 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 100 selfloop transitions, 47 changer transitions 0/149 dead transitions. [2024-06-03 22:24:13,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 149 transitions, 1921 flow [2024-06-03 22:24:13,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:24:13,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:24:13,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 116 transitions. [2024-06-03 22:24:13,573 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3741935483870968 [2024-06-03 22:24:13,573 INFO L175 Difference]: Start difference. First operand has 144 places, 124 transitions, 1197 flow. Second operand 10 states and 116 transitions. [2024-06-03 22:24:13,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 149 transitions, 1921 flow [2024-06-03 22:24:13,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 149 transitions, 1880 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-03 22:24:13,613 INFO L231 Difference]: Finished difference. Result has 145 places, 129 transitions, 1368 flow [2024-06-03 22:24:13,613 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1156, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1368, PETRI_PLACES=145, PETRI_TRANSITIONS=129} [2024-06-03 22:24:13,613 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 115 predicate places. [2024-06-03 22:24:13,613 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 129 transitions, 1368 flow [2024-06-03 22:24:13,614 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-03 22:24:13,614 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:24:13,614 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:24:13,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-03 22:24:13,614 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-03 22:24:13,614 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:24:13,615 INFO L85 PathProgramCache]: Analyzing trace with hash 508380973, now seen corresponding path program 8 times [2024-06-03 22:24:13,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:24:13,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404997492] [2024-06-03 22:24:13,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:24:13,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:24:13,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:24:17,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:24:17,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:24:17,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404997492] [2024-06-03 22:24:17,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404997492] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:24:17,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:24:17,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:24:17,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508268625] [2024-06-03 22:24:17,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:24:17,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:24:17,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:24:17,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:24:17,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:24:17,419 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:24:17,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 129 transitions, 1368 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-03 22:24:17,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:24:17,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:24:17,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:24:17,720 INFO L124 PetriNetUnfolderBase]: 397/693 cut-off events. [2024-06-03 22:24:17,720 INFO L125 PetriNetUnfolderBase]: For 33563/33563 co-relation queries the response was YES. [2024-06-03 22:24:17,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5203 conditions, 693 events. 397/693 cut-off events. For 33563/33563 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2974 event pairs, 61 based on Foata normal form. 2/694 useless extension candidates. Maximal degree in co-relation 5130. Up to 463 conditions per place. [2024-06-03 22:24:17,725 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 95 selfloop transitions, 53 changer transitions 0/150 dead transitions. [2024-06-03 22:24:17,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 150 transitions, 1966 flow [2024-06-03 22:24:17,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:24:17,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:24:17,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 114 transitions. [2024-06-03 22:24:17,726 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36774193548387096 [2024-06-03 22:24:17,726 INFO L175 Difference]: Start difference. First operand has 145 places, 129 transitions, 1368 flow. Second operand 10 states and 114 transitions. [2024-06-03 22:24:17,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 150 transitions, 1966 flow [2024-06-03 22:24:17,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 150 transitions, 1796 flow, removed 47 selfloop flow, removed 8 redundant places. [2024-06-03 22:24:17,768 INFO L231 Difference]: Finished difference. Result has 147 places, 131 transitions, 1363 flow [2024-06-03 22:24:17,768 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1210, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1363, PETRI_PLACES=147, PETRI_TRANSITIONS=131} [2024-06-03 22:24:17,768 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 117 predicate places. [2024-06-03 22:24:17,768 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 131 transitions, 1363 flow [2024-06-03 22:24:17,768 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-03 22:24:17,768 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:24:17,769 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:24:17,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-03 22:24:17,769 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-03 22:24:17,769 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:24:17,769 INFO L85 PathProgramCache]: Analyzing trace with hash 2021242137, now seen corresponding path program 4 times [2024-06-03 22:24:17,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:24:17,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407381034] [2024-06-03 22:24:17,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:24:17,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:24:17,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:24:21,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:24:21,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:24:21,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407381034] [2024-06-03 22:24:21,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407381034] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:24:21,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:24:21,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:24:21,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690954039] [2024-06-03 22:24:21,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:24:21,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:24:21,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:24:21,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:24:21,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:24:21,395 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:24:21,396 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 131 transitions, 1363 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-03 22:24:21,396 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:24:21,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:24:21,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:24:21,720 INFO L124 PetriNetUnfolderBase]: 394/689 cut-off events. [2024-06-03 22:24:21,720 INFO L125 PetriNetUnfolderBase]: For 32488/32488 co-relation queries the response was YES. [2024-06-03 22:24:21,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5009 conditions, 689 events. 394/689 cut-off events. For 32488/32488 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2945 event pairs, 55 based on Foata normal form. 2/688 useless extension candidates. Maximal degree in co-relation 4936. Up to 592 conditions per place. [2024-06-03 22:24:21,724 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 111 selfloop transitions, 32 changer transitions 0/145 dead transitions. [2024-06-03 22:24:21,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 145 transitions, 1689 flow [2024-06-03 22:24:21,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:24:21,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:24:21,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 96 transitions. [2024-06-03 22:24:21,726 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34408602150537637 [2024-06-03 22:24:21,726 INFO L175 Difference]: Start difference. First operand has 147 places, 131 transitions, 1363 flow. Second operand 9 states and 96 transitions. [2024-06-03 22:24:21,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 145 transitions, 1689 flow [2024-06-03 22:24:21,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 145 transitions, 1570 flow, removed 17 selfloop flow, removed 7 redundant places. [2024-06-03 22:24:21,771 INFO L231 Difference]: Finished difference. Result has 149 places, 131 transitions, 1312 flow [2024-06-03 22:24:21,771 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1244, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1312, PETRI_PLACES=149, PETRI_TRANSITIONS=131} [2024-06-03 22:24:21,772 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 119 predicate places. [2024-06-03 22:24:21,772 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 131 transitions, 1312 flow [2024-06-03 22:24:21,772 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-03 22:24:21,772 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:24:21,773 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:24:21,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-03 22:24:21,773 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-03 22:24:21,773 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:24:21,773 INFO L85 PathProgramCache]: Analyzing trace with hash 280306843, now seen corresponding path program 9 times [2024-06-03 22:24:21,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:24:21,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105409864] [2024-06-03 22:24:21,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:24:21,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:24:21,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:24:26,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:24:26,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:24:26,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105409864] [2024-06-03 22:24:26,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105409864] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:24:26,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:24:26,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:24:26,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466343411] [2024-06-03 22:24:26,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:24:26,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:24:26,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:24:26,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:24:26,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:24:26,318 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:24:26,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 131 transitions, 1312 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-03 22:24:26,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:24:26,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:24:26,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:24:26,721 INFO L124 PetriNetUnfolderBase]: 390/682 cut-off events. [2024-06-03 22:24:26,721 INFO L125 PetriNetUnfolderBase]: For 31735/31735 co-relation queries the response was YES. [2024-06-03 22:24:26,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4804 conditions, 682 events. 390/682 cut-off events. For 31735/31735 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2896 event pairs, 51 based on Foata normal form. 2/683 useless extension candidates. Maximal degree in co-relation 4730. Up to 304 conditions per place. [2024-06-03 22:24:26,726 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 79 selfloop transitions, 78 changer transitions 0/159 dead transitions. [2024-06-03 22:24:26,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 159 transitions, 2118 flow [2024-06-03 22:24:26,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:24:26,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:24:26,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 120 transitions. [2024-06-03 22:24:26,727 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2024-06-03 22:24:26,727 INFO L175 Difference]: Start difference. First operand has 149 places, 131 transitions, 1312 flow. Second operand 10 states and 120 transitions. [2024-06-03 22:24:26,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 159 transitions, 2118 flow [2024-06-03 22:24:26,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 159 transitions, 2017 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-06-03 22:24:26,767 INFO L231 Difference]: Finished difference. Result has 153 places, 137 transitions, 1569 flow [2024-06-03 22:24:26,767 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1211, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1569, PETRI_PLACES=153, PETRI_TRANSITIONS=137} [2024-06-03 22:24:26,767 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 123 predicate places. [2024-06-03 22:24:26,767 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 137 transitions, 1569 flow [2024-06-03 22:24:26,767 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-03 22:24:26,767 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:24:26,767 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:24:26,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-03 22:24:26,768 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-03 22:24:26,768 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:24:26,768 INFO L85 PathProgramCache]: Analyzing trace with hash 280479823, now seen corresponding path program 10 times [2024-06-03 22:24:26,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:24:26,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775342987] [2024-06-03 22:24:26,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:24:26,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:24:26,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:24:30,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:24:30,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:24:30,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775342987] [2024-06-03 22:24:30,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775342987] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:24:30,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:24:30,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:24:30,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065536460] [2024-06-03 22:24:30,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:24:30,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:24:30,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:24:30,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:24:30,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:24:30,630 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:24:30,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 137 transitions, 1569 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-03 22:24:30,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:24:30,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:24:30,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:24:30,946 INFO L124 PetriNetUnfolderBase]: 386/676 cut-off events. [2024-06-03 22:24:30,947 INFO L125 PetriNetUnfolderBase]: For 30999/30999 co-relation queries the response was YES. [2024-06-03 22:24:30,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4968 conditions, 676 events. 386/676 cut-off events. For 30999/30999 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2886 event pairs, 59 based on Foata normal form. 2/677 useless extension candidates. Maximal degree in co-relation 4891. Up to 594 conditions per place. [2024-06-03 22:24:30,953 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 122 selfloop transitions, 28 changer transitions 0/152 dead transitions. [2024-06-03 22:24:30,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 152 transitions, 1997 flow [2024-06-03 22:24:30,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:24:30,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:24:30,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 108 transitions. [2024-06-03 22:24:30,955 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34838709677419355 [2024-06-03 22:24:30,955 INFO L175 Difference]: Start difference. First operand has 153 places, 137 transitions, 1569 flow. Second operand 10 states and 108 transitions. [2024-06-03 22:24:30,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 152 transitions, 1997 flow [2024-06-03 22:24:31,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 152 transitions, 1825 flow, removed 43 selfloop flow, removed 7 redundant places. [2024-06-03 22:24:31,005 INFO L231 Difference]: Finished difference. Result has 156 places, 137 transitions, 1458 flow [2024-06-03 22:24:31,005 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1397, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1458, PETRI_PLACES=156, PETRI_TRANSITIONS=137} [2024-06-03 22:24:31,005 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 126 predicate places. [2024-06-03 22:24:31,006 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 137 transitions, 1458 flow [2024-06-03 22:24:31,006 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-03 22:24:31,006 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:24:31,006 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:24:31,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-03 22:24:31,006 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-03 22:24:31,006 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:24:31,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1577409179, now seen corresponding path program 1 times [2024-06-03 22:24:31,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:24:31,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370427322] [2024-06-03 22:24:31,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:24:31,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:24:31,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:24:35,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:24:35,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:24:35,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370427322] [2024-06-03 22:24:35,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370427322] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:24:35,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:24:35,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:24:35,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048394909] [2024-06-03 22:24:35,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:24:35,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:24:35,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:24:35,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:24:35,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:24:35,341 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:24:35,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 137 transitions, 1458 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-03 22:24:35,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:24:35,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:24:35,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:24:35,658 INFO L124 PetriNetUnfolderBase]: 390/684 cut-off events. [2024-06-03 22:24:35,658 INFO L125 PetriNetUnfolderBase]: For 32654/32654 co-relation queries the response was YES. [2024-06-03 22:24:35,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4856 conditions, 684 events. 390/684 cut-off events. For 32654/32654 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2937 event pairs, 48 based on Foata normal form. 2/685 useless extension candidates. Maximal degree in co-relation 4779. Up to 598 conditions per place. [2024-06-03 22:24:35,663 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 134 selfloop transitions, 18 changer transitions 0/154 dead transitions. [2024-06-03 22:24:35,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 154 transitions, 1820 flow [2024-06-03 22:24:35,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:24:35,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:24:35,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 93 transitions. [2024-06-03 22:24:35,664 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2024-06-03 22:24:35,664 INFO L175 Difference]: Start difference. First operand has 156 places, 137 transitions, 1458 flow. Second operand 9 states and 93 transitions. [2024-06-03 22:24:35,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 154 transitions, 1820 flow [2024-06-03 22:24:35,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 154 transitions, 1736 flow, removed 7 selfloop flow, removed 8 redundant places. [2024-06-03 22:24:35,725 INFO L231 Difference]: Finished difference. Result has 157 places, 138 transitions, 1432 flow [2024-06-03 22:24:35,725 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1374, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1432, PETRI_PLACES=157, PETRI_TRANSITIONS=138} [2024-06-03 22:24:35,725 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 127 predicate places. [2024-06-03 22:24:35,725 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 138 transitions, 1432 flow [2024-06-03 22:24:35,725 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-03 22:24:35,726 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:24:35,726 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:24:35,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-03 22:24:35,726 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-03 22:24:35,727 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:24:35,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1971598903, now seen corresponding path program 2 times [2024-06-03 22:24:35,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:24:35,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911175362] [2024-06-03 22:24:35,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:24:35,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:24:35,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:24:40,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:24:40,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:24:40,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911175362] [2024-06-03 22:24:40,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911175362] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:24:40,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:24:40,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:24:40,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951750569] [2024-06-03 22:24:40,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:24:40,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:24:40,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:24:40,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:24:40,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:24:40,779 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:24:40,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 138 transitions, 1432 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-03 22:24:40,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:24:40,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:24:40,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:24:41,133 INFO L124 PetriNetUnfolderBase]: 394/692 cut-off events. [2024-06-03 22:24:41,133 INFO L125 PetriNetUnfolderBase]: For 33851/33851 co-relation queries the response was YES. [2024-06-03 22:24:41,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4886 conditions, 692 events. 394/692 cut-off events. For 33851/33851 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2994 event pairs, 58 based on Foata normal form. 2/693 useless extension candidates. Maximal degree in co-relation 4808. Up to 605 conditions per place. [2024-06-03 22:24:41,138 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 128 selfloop transitions, 25 changer transitions 0/155 dead transitions. [2024-06-03 22:24:41,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 155 transitions, 1800 flow [2024-06-03 22:24:41,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:24:41,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:24:41,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2024-06-03 22:24:41,139 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34050179211469533 [2024-06-03 22:24:41,139 INFO L175 Difference]: Start difference. First operand has 157 places, 138 transitions, 1432 flow. Second operand 9 states and 95 transitions. [2024-06-03 22:24:41,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 155 transitions, 1800 flow [2024-06-03 22:24:41,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 155 transitions, 1752 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-03 22:24:41,190 INFO L231 Difference]: Finished difference. Result has 159 places, 139 transitions, 1458 flow [2024-06-03 22:24:41,191 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1384, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1458, PETRI_PLACES=159, PETRI_TRANSITIONS=139} [2024-06-03 22:24:41,191 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 129 predicate places. [2024-06-03 22:24:41,191 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 139 transitions, 1458 flow [2024-06-03 22:24:41,191 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-03 22:24:41,191 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:24:41,191 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:24:41,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-03 22:24:41,191 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-03 22:24:41,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:24:41,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1971595183, now seen corresponding path program 3 times [2024-06-03 22:24:41,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:24:41,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504948628] [2024-06-03 22:24:41,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:24:41,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:24:41,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:24:45,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:24:45,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:24:45,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504948628] [2024-06-03 22:24:45,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504948628] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:24:45,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:24:45,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:24:45,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652015106] [2024-06-03 22:24:45,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:24:45,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:24:45,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:24:45,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:24:45,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:24:45,577 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:24:45,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 139 transitions, 1458 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-03 22:24:45,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:24:45,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:24:45,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:24:45,891 INFO L124 PetriNetUnfolderBase]: 398/700 cut-off events. [2024-06-03 22:24:45,891 INFO L125 PetriNetUnfolderBase]: For 35884/35884 co-relation queries the response was YES. [2024-06-03 22:24:45,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4970 conditions, 700 events. 398/700 cut-off events. For 35884/35884 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3057 event pairs, 60 based on Foata normal form. 2/701 useless extension candidates. Maximal degree in co-relation 4891. Up to 608 conditions per place. [2024-06-03 22:24:45,896 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 126 selfloop transitions, 28 changer transitions 0/156 dead transitions. [2024-06-03 22:24:45,896 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 156 transitions, 1832 flow [2024-06-03 22:24:45,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:24:45,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:24:45,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 96 transitions. [2024-06-03 22:24:45,896 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34408602150537637 [2024-06-03 22:24:45,897 INFO L175 Difference]: Start difference. First operand has 159 places, 139 transitions, 1458 flow. Second operand 9 states and 96 transitions. [2024-06-03 22:24:45,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 156 transitions, 1832 flow [2024-06-03 22:24:45,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 156 transitions, 1768 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-03 22:24:45,954 INFO L231 Difference]: Finished difference. Result has 161 places, 140 transitions, 1477 flow [2024-06-03 22:24:45,955 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1394, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1477, PETRI_PLACES=161, PETRI_TRANSITIONS=140} [2024-06-03 22:24:45,955 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 131 predicate places. [2024-06-03 22:24:45,955 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 140 transitions, 1477 flow [2024-06-03 22:24:45,955 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-03 22:24:45,955 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:24:45,955 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:24:45,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-03 22:24:45,955 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-03 22:24:45,956 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:24:45,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1971595028, now seen corresponding path program 1 times [2024-06-03 22:24:45,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:24:45,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765738743] [2024-06-03 22:24:45,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:24:45,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:24:45,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:24:50,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:24:50,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:24:50,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765738743] [2024-06-03 22:24:50,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765738743] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:24:50,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:24:50,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:24:50,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644251882] [2024-06-03 22:24:50,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:24:50,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:24:50,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:24:50,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:24:50,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:24:50,591 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:24:50,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 140 transitions, 1477 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-03 22:24:50,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:24:50,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:24:50,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:24:50,988 INFO L124 PetriNetUnfolderBase]: 396/697 cut-off events. [2024-06-03 22:24:50,988 INFO L125 PetriNetUnfolderBase]: For 35001/35001 co-relation queries the response was YES. [2024-06-03 22:24:50,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4910 conditions, 697 events. 396/697 cut-off events. For 35001/35001 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3034 event pairs, 59 based on Foata normal form. 1/697 useless extension candidates. Maximal degree in co-relation 4830. Up to 602 conditions per place. [2024-06-03 22:24:50,993 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 125 selfloop transitions, 31 changer transitions 0/158 dead transitions. [2024-06-03 22:24:50,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 158 transitions, 1888 flow [2024-06-03 22:24:50,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:24:50,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:24:50,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2024-06-03 22:24:50,994 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34767025089605735 [2024-06-03 22:24:50,994 INFO L175 Difference]: Start difference. First operand has 161 places, 140 transitions, 1477 flow. Second operand 9 states and 97 transitions. [2024-06-03 22:24:50,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 158 transitions, 1888 flow [2024-06-03 22:24:51,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 158 transitions, 1817 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-06-03 22:24:51,054 INFO L231 Difference]: Finished difference. Result has 163 places, 142 transitions, 1531 flow [2024-06-03 22:24:51,054 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1406, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1531, PETRI_PLACES=163, PETRI_TRANSITIONS=142} [2024-06-03 22:24:51,054 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 133 predicate places. [2024-06-03 22:24:51,054 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 142 transitions, 1531 flow [2024-06-03 22:24:51,055 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-03 22:24:51,055 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:24:51,055 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:24:51,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-03 22:24:51,055 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-03 22:24:51,055 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:24:51,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1705558515, now seen corresponding path program 1 times [2024-06-03 22:24:51,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:24:51,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630866514] [2024-06-03 22:24:51,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:24:51,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:24:51,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:24:56,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:24:56,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:24:56,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630866514] [2024-06-03 22:24:56,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630866514] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:24:56,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:24:56,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:24:56,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121546119] [2024-06-03 22:24:56,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:24:56,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:24:56,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:24:56,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:24:56,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:24:56,800 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:24:56,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 142 transitions, 1531 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-03 22:24:56,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:24:56,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:24:56,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:24:57,172 INFO L124 PetriNetUnfolderBase]: 402/707 cut-off events. [2024-06-03 22:24:57,172 INFO L125 PetriNetUnfolderBase]: For 37439/37439 co-relation queries the response was YES. [2024-06-03 22:24:57,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5002 conditions, 707 events. 402/707 cut-off events. For 37439/37439 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 3079 event pairs, 60 based on Foata normal form. 2/708 useless extension candidates. Maximal degree in co-relation 4921. Up to 618 conditions per place. [2024-06-03 22:24:57,177 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 135 selfloop transitions, 26 changer transitions 0/163 dead transitions. [2024-06-03 22:24:57,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 163 transitions, 1951 flow [2024-06-03 22:24:57,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:24:57,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:24:57,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 106 transitions. [2024-06-03 22:24:57,178 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3419354838709677 [2024-06-03 22:24:57,178 INFO L175 Difference]: Start difference. First operand has 163 places, 142 transitions, 1531 flow. Second operand 10 states and 106 transitions. [2024-06-03 22:24:57,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 163 transitions, 1951 flow [2024-06-03 22:24:57,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 163 transitions, 1855 flow, removed 20 selfloop flow, removed 7 redundant places. [2024-06-03 22:24:57,237 INFO L231 Difference]: Finished difference. Result has 166 places, 144 transitions, 1534 flow [2024-06-03 22:24:57,237 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1435, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1534, PETRI_PLACES=166, PETRI_TRANSITIONS=144} [2024-06-03 22:24:57,238 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 136 predicate places. [2024-06-03 22:24:57,238 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 144 transitions, 1534 flow [2024-06-03 22:24:57,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:24:57,238 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:24:57,238 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:24:57,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-03 22:24:57,239 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-03 22:24:57,239 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:24:57,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1843936563, now seen corresponding path program 4 times [2024-06-03 22:24:57,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:24:57,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513164011] [2024-06-03 22:24:57,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:24:57,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:24:57,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:25:01,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-03 22:25:01,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:25:01,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513164011] [2024-06-03 22:25:01,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513164011] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:25:01,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:25:01,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:25:01,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734238341] [2024-06-03 22:25:01,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:25:01,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:25:01,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:25:01,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:25:01,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:25:01,863 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:25:01,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 144 transitions, 1534 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-03 22:25:01,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:25:01,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:25:01,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:25:02,227 INFO L124 PetriNetUnfolderBase]: 406/715 cut-off events. [2024-06-03 22:25:02,227 INFO L125 PetriNetUnfolderBase]: For 39268/39268 co-relation queries the response was YES. [2024-06-03 22:25:02,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5066 conditions, 715 events. 406/715 cut-off events. For 39268/39268 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3141 event pairs, 60 based on Foata normal form. 2/716 useless extension candidates. Maximal degree in co-relation 4984. Up to 623 conditions per place. [2024-06-03 22:25:02,231 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 131 selfloop transitions, 27 changer transitions 0/160 dead transitions. [2024-06-03 22:25:02,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 160 transitions, 1916 flow [2024-06-03 22:25:02,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:25:02,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:25:02,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 96 transitions. [2024-06-03 22:25:02,232 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34408602150537637 [2024-06-03 22:25:02,232 INFO L175 Difference]: Start difference. First operand has 166 places, 144 transitions, 1534 flow. Second operand 9 states and 96 transitions. [2024-06-03 22:25:02,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 160 transitions, 1916 flow [2024-06-03 22:25:02,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 160 transitions, 1839 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-06-03 22:25:02,289 INFO L231 Difference]: Finished difference. Result has 167 places, 145 transitions, 1539 flow [2024-06-03 22:25:02,289 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1457, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1539, PETRI_PLACES=167, PETRI_TRANSITIONS=145} [2024-06-03 22:25:02,289 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 137 predicate places. [2024-06-03 22:25:02,289 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 145 transitions, 1539 flow [2024-06-03 22:25:02,289 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-03 22:25:02,289 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:25:02,289 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:25:02,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-03 22:25:02,289 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-03 22:25:02,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:25:02,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1689119177, now seen corresponding path program 5 times [2024-06-03 22:25:02,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:25:02,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294480237] [2024-06-03 22:25:02,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:25:02,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:25:02,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:25:06,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:25:06,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:25:06,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294480237] [2024-06-03 22:25:06,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294480237] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:25:06,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:25:06,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:25:06,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127779192] [2024-06-03 22:25:06,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:25:06,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:25:06,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:25:06,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:25:06,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:25:06,748 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:25:06,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 145 transitions, 1539 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-03 22:25:06,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:25:06,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:25:06,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:25:07,119 INFO L124 PetriNetUnfolderBase]: 410/723 cut-off events. [2024-06-03 22:25:07,119 INFO L125 PetriNetUnfolderBase]: For 40971/40971 co-relation queries the response was YES. [2024-06-03 22:25:07,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5129 conditions, 723 events. 410/723 cut-off events. For 40971/40971 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3191 event pairs, 58 based on Foata normal form. 2/724 useless extension candidates. Maximal degree in co-relation 5046. Up to 631 conditions per place. [2024-06-03 22:25:07,124 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 133 selfloop transitions, 26 changer transitions 0/161 dead transitions. [2024-06-03 22:25:07,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 161 transitions, 1923 flow [2024-06-03 22:25:07,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:25:07,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:25:07,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2024-06-03 22:25:07,126 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34050179211469533 [2024-06-03 22:25:07,126 INFO L175 Difference]: Start difference. First operand has 167 places, 145 transitions, 1539 flow. Second operand 9 states and 95 transitions. [2024-06-03 22:25:07,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 161 transitions, 1923 flow [2024-06-03 22:25:07,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 161 transitions, 1851 flow, removed 10 selfloop flow, removed 7 redundant places. [2024-06-03 22:25:07,181 INFO L231 Difference]: Finished difference. Result has 169 places, 146 transitions, 1549 flow [2024-06-03 22:25:07,181 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1467, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1549, PETRI_PLACES=169, PETRI_TRANSITIONS=146} [2024-06-03 22:25:07,182 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 139 predicate places. [2024-06-03 22:25:07,182 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 146 transitions, 1549 flow [2024-06-03 22:25:07,182 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-03 22:25:07,182 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:25:07,182 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:25:07,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-03 22:25:07,182 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-03 22:25:07,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:25:07,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1694629427, now seen corresponding path program 6 times [2024-06-03 22:25:07,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:25:07,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601148470] [2024-06-03 22:25:07,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:25:07,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:25:07,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:25:11,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:25:11,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:25:11,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601148470] [2024-06-03 22:25:11,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601148470] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:25:11,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:25:11,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:25:11,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250379784] [2024-06-03 22:25:11,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:25:11,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:25:11,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:25:11,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:25:11,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:25:11,326 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:25:11,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 146 transitions, 1549 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-03 22:25:11,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:25:11,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:25:11,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:25:11,639 INFO L124 PetriNetUnfolderBase]: 414/731 cut-off events. [2024-06-03 22:25:11,639 INFO L125 PetriNetUnfolderBase]: For 42630/42630 co-relation queries the response was YES. [2024-06-03 22:25:11,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5192 conditions, 731 events. 414/731 cut-off events. For 42630/42630 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3249 event pairs, 64 based on Foata normal form. 2/732 useless extension candidates. Maximal degree in co-relation 5108. Up to 690 conditions per place. [2024-06-03 22:25:11,644 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 141 selfloop transitions, 16 changer transitions 0/159 dead transitions. [2024-06-03 22:25:11,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 159 transitions, 1919 flow [2024-06-03 22:25:11,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:25:11,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:25:11,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 91 transitions. [2024-06-03 22:25:11,645 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32616487455197135 [2024-06-03 22:25:11,645 INFO L175 Difference]: Start difference. First operand has 169 places, 146 transitions, 1549 flow. Second operand 9 states and 91 transitions. [2024-06-03 22:25:11,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 159 transitions, 1919 flow [2024-06-03 22:25:11,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 159 transitions, 1847 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-03 22:25:11,701 INFO L231 Difference]: Finished difference. Result has 171 places, 147 transitions, 1541 flow [2024-06-03 22:25:11,701 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1477, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1541, PETRI_PLACES=171, PETRI_TRANSITIONS=147} [2024-06-03 22:25:11,701 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 141 predicate places. [2024-06-03 22:25:11,701 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 147 transitions, 1541 flow [2024-06-03 22:25:11,701 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-03 22:25:11,701 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:25:11,701 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:25:11,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-03 22:25:11,701 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-03 22:25:11,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:25:11,702 INFO L85 PathProgramCache]: Analyzing trace with hash 2085336673, now seen corresponding path program 2 times [2024-06-03 22:25:11,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:25:11,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605427473] [2024-06-03 22:25:11,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:25:11,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:25:11,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:25:16,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:25:16,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:25:16,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605427473] [2024-06-03 22:25:16,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605427473] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:25:16,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:25:16,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:25:16,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007473447] [2024-06-03 22:25:16,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:25:16,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:25:16,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:25:16,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:25:16,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:25:16,460 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:25:16,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 147 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-03 22:25:16,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:25:16,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:25:16,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:25:16,781 INFO L124 PetriNetUnfolderBase]: 415/733 cut-off events. [2024-06-03 22:25:16,781 INFO L125 PetriNetUnfolderBase]: For 42681/42681 co-relation queries the response was YES. [2024-06-03 22:25:16,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5147 conditions, 733 events. 415/733 cut-off events. For 42681/42681 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3259 event pairs, 60 based on Foata normal form. 2/734 useless extension candidates. Maximal degree in co-relation 5062. Up to 631 conditions per place. [2024-06-03 22:25:16,786 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 134 selfloop transitions, 30 changer transitions 0/166 dead transitions. [2024-06-03 22:25:16,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 166 transitions, 1963 flow [2024-06-03 22:25:16,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:25:16,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:25:16,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 106 transitions. [2024-06-03 22:25:16,787 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3419354838709677 [2024-06-03 22:25:16,787 INFO L175 Difference]: Start difference. First operand has 171 places, 147 transitions, 1541 flow. Second operand 10 states and 106 transitions. [2024-06-03 22:25:16,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 166 transitions, 1963 flow [2024-06-03 22:25:16,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 166 transitions, 1909 flow, removed 12 selfloop flow, removed 7 redundant places. [2024-06-03 22:25:16,857 INFO L231 Difference]: Finished difference. Result has 174 places, 149 transitions, 1598 flow [2024-06-03 22:25:16,857 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1487, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1598, PETRI_PLACES=174, PETRI_TRANSITIONS=149} [2024-06-03 22:25:16,857 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 144 predicate places. [2024-06-03 22:25:16,857 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 149 transitions, 1598 flow [2024-06-03 22:25:16,857 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-03 22:25:16,857 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:25:16,857 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:25:16,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-03 22:25:16,857 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-03 22:25:16,858 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:25:16,858 INFO L85 PathProgramCache]: Analyzing trace with hash 246520441, now seen corresponding path program 3 times [2024-06-03 22:25:16,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:25:16,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804048602] [2024-06-03 22:25:16,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:25:16,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:25:16,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:25:21,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:25:21,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:25:21,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804048602] [2024-06-03 22:25:21,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804048602] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:25:21,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:25:21,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:25:21,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792539230] [2024-06-03 22:25:21,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:25:21,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:25:21,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:25:21,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:25:21,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:25:21,578 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:25:21,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 149 transitions, 1598 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-03 22:25:21,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:25:21,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:25:21,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:25:21,906 INFO L124 PetriNetUnfolderBase]: 421/743 cut-off events. [2024-06-03 22:25:21,906 INFO L125 PetriNetUnfolderBase]: For 44174/44174 co-relation queries the response was YES. [2024-06-03 22:25:21,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5247 conditions, 743 events. 421/743 cut-off events. For 44174/44174 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3326 event pairs, 64 based on Foata normal form. 2/744 useless extension candidates. Maximal degree in co-relation 5161. Up to 683 conditions per place. [2024-06-03 22:25:21,911 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 143 selfloop transitions, 22 changer transitions 0/167 dead transitions. [2024-06-03 22:25:21,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 167 transitions, 2013 flow [2024-06-03 22:25:21,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:25:21,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:25:21,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 104 transitions. [2024-06-03 22:25:21,912 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33548387096774196 [2024-06-03 22:25:21,912 INFO L175 Difference]: Start difference. First operand has 174 places, 149 transitions, 1598 flow. Second operand 10 states and 104 transitions. [2024-06-03 22:25:21,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 167 transitions, 2013 flow [2024-06-03 22:25:21,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 167 transitions, 1924 flow, removed 16 selfloop flow, removed 8 redundant places. [2024-06-03 22:25:21,980 INFO L231 Difference]: Finished difference. Result has 177 places, 152 transitions, 1610 flow [2024-06-03 22:25:21,980 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1509, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1610, PETRI_PLACES=177, PETRI_TRANSITIONS=152} [2024-06-03 22:25:21,980 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 147 predicate places. [2024-06-03 22:25:21,980 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 152 transitions, 1610 flow [2024-06-03 22:25:21,980 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-03 22:25:21,980 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:25:21,980 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:25:21,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-03 22:25:21,980 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-03 22:25:21,981 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:25:21,981 INFO L85 PathProgramCache]: Analyzing trace with hash 2090699053, now seen corresponding path program 4 times [2024-06-03 22:25:21,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:25:21,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883796890] [2024-06-03 22:25:21,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:25:21,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:25:22,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:25:25,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:25:25,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:25:25,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883796890] [2024-06-03 22:25:25,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883796890] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:25:25,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:25:25,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:25:25,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449527553] [2024-06-03 22:25:25,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:25:25,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:25:25,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:25:25,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:25:25,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:25:26,112 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:25:26,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 152 transitions, 1610 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-03 22:25:26,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:25:26,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:25:26,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:25:26,458 INFO L124 PetriNetUnfolderBase]: 417/737 cut-off events. [2024-06-03 22:25:26,458 INFO L125 PetriNetUnfolderBase]: For 42414/42414 co-relation queries the response was YES. [2024-06-03 22:25:26,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5092 conditions, 737 events. 417/737 cut-off events. For 42414/42414 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3281 event pairs, 63 based on Foata normal form. 2/738 useless extension candidates. Maximal degree in co-relation 5004. Up to 660 conditions per place. [2024-06-03 22:25:26,463 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 138 selfloop transitions, 27 changer transitions 0/167 dead transitions. [2024-06-03 22:25:26,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 167 transitions, 1982 flow [2024-06-03 22:25:26,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:25:26,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:25:26,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 107 transitions. [2024-06-03 22:25:26,464 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34516129032258064 [2024-06-03 22:25:26,464 INFO L175 Difference]: Start difference. First operand has 177 places, 152 transitions, 1610 flow. Second operand 10 states and 107 transitions. [2024-06-03 22:25:26,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 167 transitions, 1982 flow [2024-06-03 22:25:26,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 167 transitions, 1910 flow, removed 17 selfloop flow, removed 7 redundant places. [2024-06-03 22:25:26,543 INFO L231 Difference]: Finished difference. Result has 180 places, 152 transitions, 1597 flow [2024-06-03 22:25:26,543 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1538, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1597, PETRI_PLACES=180, PETRI_TRANSITIONS=152} [2024-06-03 22:25:26,543 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 150 predicate places. [2024-06-03 22:25:26,543 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 152 transitions, 1597 flow [2024-06-03 22:25:26,544 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-03 22:25:26,544 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:25:26,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-03 22:25:26,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-03 22:25:26,544 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-03 22:25:26,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:25:26,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1694844908, now seen corresponding path program 1 times [2024-06-03 22:25:26,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:25:26,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435513408] [2024-06-03 22:25:26,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:25:26,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:25:26,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:25:31,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:25:31,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:25:31,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435513408] [2024-06-03 22:25:31,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435513408] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:25:31,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:25:31,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:25:31,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594754431] [2024-06-03 22:25:31,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:25:31,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:25:31,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:25:31,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:25:31,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:25:31,637 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:25:31,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 152 transitions, 1597 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-03 22:25:31,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:25:31,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:25:31,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:25:31,969 INFO L124 PetriNetUnfolderBase]: 421/745 cut-off events. [2024-06-03 22:25:31,970 INFO L125 PetriNetUnfolderBase]: For 43994/43994 co-relation queries the response was YES. [2024-06-03 22:25:31,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5156 conditions, 745 events. 421/745 cut-off events. For 43994/43994 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 3333 event pairs, 69 based on Foata normal form. 2/746 useless extension candidates. Maximal degree in co-relation 5067. Up to 704 conditions per place. [2024-06-03 22:25:31,975 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 145 selfloop transitions, 18 changer transitions 0/165 dead transitions. [2024-06-03 22:25:31,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 165 transitions, 1971 flow [2024-06-03 22:25:31,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:25:31,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:25:31,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 98 transitions. [2024-06-03 22:25:31,976 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3161290322580645 [2024-06-03 22:25:31,976 INFO L175 Difference]: Start difference. First operand has 180 places, 152 transitions, 1597 flow. Second operand 10 states and 98 transitions. [2024-06-03 22:25:31,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 165 transitions, 1971 flow [2024-06-03 22:25:32,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 165 transitions, 1892 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-03 22:25:32,046 INFO L231 Difference]: Finished difference. Result has 180 places, 153 transitions, 1580 flow [2024-06-03 22:25:32,047 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1518, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1580, PETRI_PLACES=180, PETRI_TRANSITIONS=153} [2024-06-03 22:25:32,047 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 150 predicate places. [2024-06-03 22:25:32,047 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 153 transitions, 1580 flow [2024-06-03 22:25:32,047 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-03 22:25:32,047 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:25:32,047 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:25:32,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-03 22:25:32,047 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-03 22:25:32,047 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:25:32,048 INFO L85 PathProgramCache]: Analyzing trace with hash 645416317, now seen corresponding path program 7 times [2024-06-03 22:25:32,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:25:32,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775005627] [2024-06-03 22:25:32,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:25:32,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:25:32,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:25:36,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:25:36,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:25:36,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775005627] [2024-06-03 22:25:36,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775005627] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:25:36,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:25:36,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:25:36,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680083311] [2024-06-03 22:25:36,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:25:36,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:25:36,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:25:36,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:25:36,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:25:36,449 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:25:36,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 153 transitions, 1580 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-03 22:25:36,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:25:36,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:25:36,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:25:36,728 INFO L124 PetriNetUnfolderBase]: 425/753 cut-off events. [2024-06-03 22:25:36,728 INFO L125 PetriNetUnfolderBase]: For 45794/45794 co-relation queries the response was YES. [2024-06-03 22:25:36,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5206 conditions, 753 events. 425/753 cut-off events. For 45794/45794 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3422 event pairs, 67 based on Foata normal form. 2/754 useless extension candidates. Maximal degree in co-relation 5116. Up to 706 conditions per place. [2024-06-03 22:25:36,734 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 145 selfloop transitions, 20 changer transitions 0/167 dead transitions. [2024-06-03 22:25:36,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 167 transitions, 1970 flow [2024-06-03 22:25:36,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:25:36,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:25:36,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 100 transitions. [2024-06-03 22:25:36,734 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3225806451612903 [2024-06-03 22:25:36,734 INFO L175 Difference]: Start difference. First operand has 180 places, 153 transitions, 1580 flow. Second operand 10 states and 100 transitions. [2024-06-03 22:25:36,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 167 transitions, 1970 flow [2024-06-03 22:25:36,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 167 transitions, 1918 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-06-03 22:25:36,811 INFO L231 Difference]: Finished difference. Result has 182 places, 154 transitions, 1602 flow [2024-06-03 22:25:36,811 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1528, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1602, PETRI_PLACES=182, PETRI_TRANSITIONS=154} [2024-06-03 22:25:36,811 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 152 predicate places. [2024-06-03 22:25:36,811 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 154 transitions, 1602 flow [2024-06-03 22:25:36,812 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-03 22:25:36,812 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:25:36,812 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:25:36,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-03 22:25:36,812 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-03 22:25:36,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:25:36,812 INFO L85 PathProgramCache]: Analyzing trace with hash 645624079, now seen corresponding path program 5 times [2024-06-03 22:25:36,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:25:36,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349231589] [2024-06-03 22:25:36,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:25:36,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:25:36,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:25:41,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:25:41,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:25:41,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349231589] [2024-06-03 22:25:41,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349231589] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:25:41,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:25:41,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:25:41,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777232421] [2024-06-03 22:25:41,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:25:41,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:25:41,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:25:41,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:25:41,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:25:42,058 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:25:42,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 154 transitions, 1602 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-03 22:25:42,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:25:42,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:25:42,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:25:42,471 INFO L124 PetriNetUnfolderBase]: 431/764 cut-off events. [2024-06-03 22:25:42,471 INFO L125 PetriNetUnfolderBase]: For 47407/47407 co-relation queries the response was YES. [2024-06-03 22:25:42,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5277 conditions, 764 events. 431/764 cut-off events. For 47407/47407 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3485 event pairs, 68 based on Foata normal form. 2/763 useless extension candidates. Maximal degree in co-relation 5186. Up to 697 conditions per place. [2024-06-03 22:25:42,477 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 143 selfloop transitions, 25 changer transitions 0/170 dead transitions. [2024-06-03 22:25:42,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 170 transitions, 2015 flow [2024-06-03 22:25:42,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:25:42,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:25:42,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 103 transitions. [2024-06-03 22:25:42,477 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33225806451612905 [2024-06-03 22:25:42,478 INFO L175 Difference]: Start difference. First operand has 182 places, 154 transitions, 1602 flow. Second operand 10 states and 103 transitions. [2024-06-03 22:25:42,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 170 transitions, 2015 flow [2024-06-03 22:25:42,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 170 transitions, 1951 flow, removed 13 selfloop flow, removed 8 redundant places. [2024-06-03 22:25:42,547 INFO L231 Difference]: Finished difference. Result has 185 places, 157 transitions, 1643 flow [2024-06-03 22:25:42,548 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1538, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1643, PETRI_PLACES=185, PETRI_TRANSITIONS=157} [2024-06-03 22:25:42,549 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 155 predicate places. [2024-06-03 22:25:42,549 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 157 transitions, 1643 flow [2024-06-03 22:25:42,549 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-03 22:25:42,550 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:25:42,550 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:25:42,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-03 22:25:42,550 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-03 22:25:42,550 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:25:42,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1420063979, now seen corresponding path program 8 times [2024-06-03 22:25:42,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:25:42,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109810814] [2024-06-03 22:25:42,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:25:42,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:25:42,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:25:46,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:25:46,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:25:46,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109810814] [2024-06-03 22:25:46,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109810814] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:25:46,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:25:46,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:25:46,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094566164] [2024-06-03 22:25:46,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:25:46,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:25:46,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:25:46,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:25:46,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:25:46,855 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:25:46,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 157 transitions, 1643 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-03 22:25:46,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:25:46,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:25:46,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:25:47,144 INFO L124 PetriNetUnfolderBase]: 435/772 cut-off events. [2024-06-03 22:25:47,144 INFO L125 PetriNetUnfolderBase]: For 49032/49032 co-relation queries the response was YES. [2024-06-03 22:25:47,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5360 conditions, 772 events. 435/772 cut-off events. For 49032/49032 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3536 event pairs, 68 based on Foata normal form. 2/771 useless extension candidates. Maximal degree in co-relation 5267. Up to 703 conditions per place. [2024-06-03 22:25:47,150 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 141 selfloop transitions, 26 changer transitions 0/169 dead transitions. [2024-06-03 22:25:47,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 169 transitions, 2035 flow [2024-06-03 22:25:47,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:25:47,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:25:47,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 93 transitions. [2024-06-03 22:25:47,153 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2024-06-03 22:25:47,153 INFO L175 Difference]: Start difference. First operand has 185 places, 157 transitions, 1643 flow. Second operand 9 states and 93 transitions. [2024-06-03 22:25:47,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 169 transitions, 2035 flow [2024-06-03 22:25:47,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 169 transitions, 1973 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-06-03 22:25:47,227 INFO L231 Difference]: Finished difference. Result has 187 places, 158 transitions, 1669 flow [2024-06-03 22:25:47,228 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1581, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1669, PETRI_PLACES=187, PETRI_TRANSITIONS=158} [2024-06-03 22:25:47,228 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 157 predicate places. [2024-06-03 22:25:47,228 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 158 transitions, 1669 flow [2024-06-03 22:25:47,228 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-03 22:25:47,228 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:25:47,229 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:25:47,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-03 22:25:47,229 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-03 22:25:47,229 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:25:47,229 INFO L85 PathProgramCache]: Analyzing trace with hash -879367144, now seen corresponding path program 2 times [2024-06-03 22:25:47,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:25:47,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990433204] [2024-06-03 22:25:47,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:25:47,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:25:47,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:25:52,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-03 22:25:52,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:25:52,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990433204] [2024-06-03 22:25:52,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990433204] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:25:52,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:25:52,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:25:52,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072642861] [2024-06-03 22:25:52,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:25:52,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:25:52,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:25:52,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:25:52,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:25:52,685 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:25:52,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 158 transitions, 1669 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-03 22:25:52,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:25:52,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:25:52,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:25:52,977 INFO L124 PetriNetUnfolderBase]: 439/779 cut-off events. [2024-06-03 22:25:52,977 INFO L125 PetriNetUnfolderBase]: For 50798/50798 co-relation queries the response was YES. [2024-06-03 22:25:52,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5437 conditions, 779 events. 439/779 cut-off events. For 50798/50798 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3577 event pairs, 71 based on Foata normal form. 2/780 useless extension candidates. Maximal degree in co-relation 5343. Up to 711 conditions per place. [2024-06-03 22:25:52,983 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 140 selfloop transitions, 32 changer transitions 0/174 dead transitions. [2024-06-03 22:25:52,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 174 transitions, 2107 flow [2024-06-03 22:25:52,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:25:52,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:25:52,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 110 transitions. [2024-06-03 22:25:52,984 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3225806451612903 [2024-06-03 22:25:52,984 INFO L175 Difference]: Start difference. First operand has 187 places, 158 transitions, 1669 flow. Second operand 11 states and 110 transitions. [2024-06-03 22:25:52,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 174 transitions, 2107 flow [2024-06-03 22:25:53,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 174 transitions, 2029 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-03 22:25:53,063 INFO L231 Difference]: Finished difference. Result has 192 places, 161 transitions, 1730 flow [2024-06-03 22:25:53,064 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1591, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1730, PETRI_PLACES=192, PETRI_TRANSITIONS=161} [2024-06-03 22:25:53,064 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 162 predicate places. [2024-06-03 22:25:53,064 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 161 transitions, 1730 flow [2024-06-03 22:25:53,064 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-03 22:25:53,064 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:25:53,065 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:25:53,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-03 22:25:53,065 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-03 22:25:53,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:25:53,065 INFO L85 PathProgramCache]: Analyzing trace with hash 645631798, now seen corresponding path program 3 times [2024-06-03 22:25:53,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:25:53,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571152408] [2024-06-03 22:25:53,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:25:53,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:25:53,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:25:57,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:25:57,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:25:57,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571152408] [2024-06-03 22:25:57,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571152408] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:25:57,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:25:57,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:25:57,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519795357] [2024-06-03 22:25:57,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:25:57,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:25:57,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:25:57,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:25:57,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:25:57,800 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:25:57,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 161 transitions, 1730 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-03 22:25:57,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:25:57,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:25:57,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:25:58,163 INFO L124 PetriNetUnfolderBase]: 443/787 cut-off events. [2024-06-03 22:25:58,163 INFO L125 PetriNetUnfolderBase]: For 52348/52348 co-relation queries the response was YES. [2024-06-03 22:25:58,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5499 conditions, 787 events. 443/787 cut-off events. For 52348/52348 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 3637 event pairs, 71 based on Foata normal form. 2/788 useless extension candidates. Maximal degree in co-relation 5403. Up to 740 conditions per place. [2024-06-03 22:25:58,169 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 151 selfloop transitions, 22 changer transitions 0/175 dead transitions. [2024-06-03 22:25:58,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 175 transitions, 2130 flow [2024-06-03 22:25:58,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:25:58,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:25:58,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 107 transitions. [2024-06-03 22:25:58,171 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31378299120234604 [2024-06-03 22:25:58,171 INFO L175 Difference]: Start difference. First operand has 192 places, 161 transitions, 1730 flow. Second operand 11 states and 107 transitions. [2024-06-03 22:25:58,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 175 transitions, 2130 flow [2024-06-03 22:25:58,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 175 transitions, 2020 flow, removed 25 selfloop flow, removed 8 redundant places. [2024-06-03 22:25:58,266 INFO L231 Difference]: Finished difference. Result has 195 places, 162 transitions, 1694 flow [2024-06-03 22:25:58,266 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1620, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1694, PETRI_PLACES=195, PETRI_TRANSITIONS=162} [2024-06-03 22:25:58,266 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 165 predicate places. [2024-06-03 22:25:58,267 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 162 transitions, 1694 flow [2024-06-03 22:25:58,268 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-03 22:25:58,268 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:25:58,268 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:25:58,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-03 22:25:58,268 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-03 22:25:58,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:25:58,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1280305709, now seen corresponding path program 6 times [2024-06-03 22:25:58,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:25:58,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719710259] [2024-06-03 22:25:58,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:25:58,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:25:58,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:26:02,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:26:02,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:26:02,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719710259] [2024-06-03 22:26:02,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719710259] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:26:02,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:26:02,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:26:02,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302852338] [2024-06-03 22:26:02,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:26:02,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:26:02,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:26:02,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:26:02,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:26:02,869 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:26:02,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 162 transitions, 1694 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-03 22:26:02,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:26:02,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:26:02,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:26:03,241 INFO L124 PetriNetUnfolderBase]: 449/797 cut-off events. [2024-06-03 22:26:03,241 INFO L125 PetriNetUnfolderBase]: For 54091/54091 co-relation queries the response was YES. [2024-06-03 22:26:03,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5517 conditions, 797 events. 449/797 cut-off events. For 54091/54091 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3715 event pairs, 57 based on Foata normal form. 2/798 useless extension candidates. Maximal degree in co-relation 5420. Up to 664 conditions per place. [2024-06-03 22:26:03,247 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 138 selfloop transitions, 43 changer transitions 0/183 dead transitions. [2024-06-03 22:26:03,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 183 transitions, 2156 flow [2024-06-03 22:26:03,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:26:03,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:26:03,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 118 transitions. [2024-06-03 22:26:03,249 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3460410557184751 [2024-06-03 22:26:03,249 INFO L175 Difference]: Start difference. First operand has 195 places, 162 transitions, 1694 flow. Second operand 11 states and 118 transitions. [2024-06-03 22:26:03,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 183 transitions, 2156 flow [2024-06-03 22:26:03,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 183 transitions, 2077 flow, removed 18 selfloop flow, removed 9 redundant places. [2024-06-03 22:26:03,345 INFO L231 Difference]: Finished difference. Result has 199 places, 166 transitions, 1777 flow [2024-06-03 22:26:03,345 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1619, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1777, PETRI_PLACES=199, PETRI_TRANSITIONS=166} [2024-06-03 22:26:03,345 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 169 predicate places. [2024-06-03 22:26:03,345 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 166 transitions, 1777 flow [2024-06-03 22:26:03,346 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-03 22:26:03,346 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:26:03,346 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:26:03,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-03 22:26:03,346 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-03 22:26:03,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:26:03,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1086164489, now seen corresponding path program 7 times [2024-06-03 22:26:03,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:26:03,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237463037] [2024-06-03 22:26:03,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:26:03,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:26:03,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:26:07,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:26:07,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:26:07,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237463037] [2024-06-03 22:26:07,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237463037] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:26:07,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:26:07,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:26:07,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921193045] [2024-06-03 22:26:07,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:26:07,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:26:07,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:26:07,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:26:07,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:26:07,986 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:26:07,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 166 transitions, 1777 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-03 22:26:07,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:26:07,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:26:07,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:26:08,298 INFO L124 PetriNetUnfolderBase]: 445/792 cut-off events. [2024-06-03 22:26:08,298 INFO L125 PetriNetUnfolderBase]: For 51285/51285 co-relation queries the response was YES. [2024-06-03 22:26:08,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5415 conditions, 792 events. 445/792 cut-off events. For 51285/51285 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3674 event pairs, 69 based on Foata normal form. 2/791 useless extension candidates. Maximal degree in co-relation 5315. Up to 725 conditions per place. [2024-06-03 22:26:08,304 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 151 selfloop transitions, 25 changer transitions 0/178 dead transitions. [2024-06-03 22:26:08,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 178 transitions, 2161 flow [2024-06-03 22:26:08,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:26:08,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:26:08,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 102 transitions. [2024-06-03 22:26:08,305 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32903225806451614 [2024-06-03 22:26:08,306 INFO L175 Difference]: Start difference. First operand has 199 places, 166 transitions, 1777 flow. Second operand 10 states and 102 transitions. [2024-06-03 22:26:08,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 178 transitions, 2161 flow [2024-06-03 22:26:08,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 178 transitions, 2055 flow, removed 17 selfloop flow, removed 7 redundant places. [2024-06-03 22:26:08,393 INFO L231 Difference]: Finished difference. Result has 202 places, 166 transitions, 1726 flow [2024-06-03 22:26:08,393 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1671, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1726, PETRI_PLACES=202, PETRI_TRANSITIONS=166} [2024-06-03 22:26:08,394 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 172 predicate places. [2024-06-03 22:26:08,394 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 166 transitions, 1726 flow [2024-06-03 22:26:08,394 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-03 22:26:08,394 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:26:08,394 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:26:08,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-03 22:26:08,394 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-03 22:26:08,394 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:26:08,394 INFO L85 PathProgramCache]: Analyzing trace with hash 99428433, now seen corresponding path program 9 times [2024-06-03 22:26:08,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:26:08,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585303642] [2024-06-03 22:26:08,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:26:08,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:26:08,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:26:12,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:26:12,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:26:12,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585303642] [2024-06-03 22:26:12,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585303642] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:26:12,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:26:12,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:26:12,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064662320] [2024-06-03 22:26:12,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:26:12,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:26:12,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:26:12,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:26:12,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:26:13,021 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:26:13,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 166 transitions, 1726 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-03 22:26:13,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:26:13,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:26:13,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:26:13,343 INFO L124 PetriNetUnfolderBase]: 449/799 cut-off events. [2024-06-03 22:26:13,343 INFO L125 PetriNetUnfolderBase]: For 53013/53013 co-relation queries the response was YES. [2024-06-03 22:26:13,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5441 conditions, 799 events. 449/799 cut-off events. For 53013/53013 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 3728 event pairs, 59 based on Foata normal form. 2/800 useless extension candidates. Maximal degree in co-relation 5340. Up to 695 conditions per place. [2024-06-03 22:26:13,349 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 149 selfloop transitions, 32 changer transitions 0/183 dead transitions. [2024-06-03 22:26:13,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 183 transitions, 2166 flow [2024-06-03 22:26:13,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:26:13,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:26:13,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 105 transitions. [2024-06-03 22:26:13,350 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3387096774193548 [2024-06-03 22:26:13,350 INFO L175 Difference]: Start difference. First operand has 202 places, 166 transitions, 1726 flow. Second operand 10 states and 105 transitions. [2024-06-03 22:26:13,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 183 transitions, 2166 flow [2024-06-03 22:26:13,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 183 transitions, 2091 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-03 22:26:13,444 INFO L231 Difference]: Finished difference. Result has 202 places, 167 transitions, 1753 flow [2024-06-03 22:26:13,445 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1651, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1753, PETRI_PLACES=202, PETRI_TRANSITIONS=167} [2024-06-03 22:26:13,445 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 172 predicate places. [2024-06-03 22:26:13,445 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 167 transitions, 1753 flow [2024-06-03 22:26:13,445 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-03 22:26:13,445 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:26:13,445 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:26:13,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-03 22:26:13,445 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-03 22:26:13,446 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:26:13,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1280103899, now seen corresponding path program 8 times [2024-06-03 22:26:13,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:26:13,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098818850] [2024-06-03 22:26:13,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:26:13,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:26:13,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:26:17,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:26:17,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:26:17,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098818850] [2024-06-03 22:26:17,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098818850] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:26:17,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:26:17,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:26:17,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052716701] [2024-06-03 22:26:17,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:26:17,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:26:17,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:26:17,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:26:17,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:26:17,857 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:26:17,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 167 transitions, 1753 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-03 22:26:17,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:26:17,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:26:17,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:26:18,190 INFO L124 PetriNetUnfolderBase]: 445/793 cut-off events. [2024-06-03 22:26:18,190 INFO L125 PetriNetUnfolderBase]: For 50418/50418 co-relation queries the response was YES. [2024-06-03 22:26:18,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5306 conditions, 793 events. 445/793 cut-off events. For 50418/50418 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 3689 event pairs, 64 based on Foata normal form. 2/794 useless extension candidates. Maximal degree in co-relation 5204. Up to 565 conditions per place. [2024-06-03 22:26:18,196 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 118 selfloop transitions, 65 changer transitions 0/185 dead transitions. [2024-06-03 22:26:18,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 185 transitions, 2299 flow [2024-06-03 22:26:18,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:26:18,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:26:18,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 122 transitions. [2024-06-03 22:26:18,198 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35777126099706746 [2024-06-03 22:26:18,198 INFO L175 Difference]: Start difference. First operand has 202 places, 167 transitions, 1753 flow. Second operand 11 states and 122 transitions. [2024-06-03 22:26:18,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 185 transitions, 2299 flow [2024-06-03 22:26:18,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 185 transitions, 2191 flow, removed 23 selfloop flow, removed 8 redundant places. [2024-06-03 22:26:18,284 INFO L231 Difference]: Finished difference. Result has 205 places, 167 transitions, 1780 flow [2024-06-03 22:26:18,284 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1645, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1780, PETRI_PLACES=205, PETRI_TRANSITIONS=167} [2024-06-03 22:26:18,284 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 175 predicate places. [2024-06-03 22:26:18,284 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 167 transitions, 1780 flow [2024-06-03 22:26:18,284 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-03 22:26:18,284 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:26:18,284 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:26:18,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-03 22:26:18,285 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-03 22:26:18,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:26:18,285 INFO L85 PathProgramCache]: Analyzing trace with hash 99424713, now seen corresponding path program 10 times [2024-06-03 22:26:18,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:26:18,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47313283] [2024-06-03 22:26:18,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:26:18,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:26:18,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:26:23,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:26:23,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:26:23,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47313283] [2024-06-03 22:26:23,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47313283] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:26:23,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:26:23,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:26:23,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84941618] [2024-06-03 22:26:23,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:26:23,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:26:23,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:26:23,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:26:23,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:26:23,324 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:26:23,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 167 transitions, 1780 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-03 22:26:23,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:26:23,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:26:23,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:26:23,619 INFO L124 PetriNetUnfolderBase]: 442/789 cut-off events. [2024-06-03 22:26:23,619 INFO L125 PetriNetUnfolderBase]: For 47185/47185 co-relation queries the response was YES. [2024-06-03 22:26:23,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5170 conditions, 789 events. 442/789 cut-off events. For 47185/47185 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 3671 event pairs, 56 based on Foata normal form. 2/788 useless extension candidates. Maximal degree in co-relation 5067. Up to 609 conditions per place. [2024-06-03 22:26:23,625 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 134 selfloop transitions, 45 changer transitions 0/181 dead transitions. [2024-06-03 22:26:23,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 181 transitions, 2178 flow [2024-06-03 22:26:23,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:26:23,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:26:23,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 100 transitions. [2024-06-03 22:26:23,626 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35842293906810035 [2024-06-03 22:26:23,626 INFO L175 Difference]: Start difference. First operand has 205 places, 167 transitions, 1780 flow. Second operand 9 states and 100 transitions. [2024-06-03 22:26:23,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 181 transitions, 2178 flow [2024-06-03 22:26:23,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 181 transitions, 2013 flow, removed 3 selfloop flow, removed 11 redundant places. [2024-06-03 22:26:23,725 INFO L231 Difference]: Finished difference. Result has 203 places, 167 transitions, 1709 flow [2024-06-03 22:26:23,725 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1615, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1709, PETRI_PLACES=203, PETRI_TRANSITIONS=167} [2024-06-03 22:26:23,726 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 173 predicate places. [2024-06-03 22:26:23,726 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 167 transitions, 1709 flow [2024-06-03 22:26:23,726 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-03 22:26:23,726 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:26:23,726 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:26:23,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-03 22:26:23,726 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-03 22:26:23,726 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:26:23,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1412698658, now seen corresponding path program 4 times [2024-06-03 22:26:23,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:26:23,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55929148] [2024-06-03 22:26:23,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:26:23,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:26:23,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:26:28,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:26:28,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:26:28,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55929148] [2024-06-03 22:26:28,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55929148] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:26:28,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:26:28,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:26:28,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295006916] [2024-06-03 22:26:28,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:26:28,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:26:28,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:26:28,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:26:28,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:26:28,970 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:26:28,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 167 transitions, 1709 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-03 22:26:28,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:26:28,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:26:28,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:26:29,345 INFO L124 PetriNetUnfolderBase]: 446/796 cut-off events. [2024-06-03 22:26:29,345 INFO L125 PetriNetUnfolderBase]: For 48771/48771 co-relation queries the response was YES. [2024-06-03 22:26:29,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5171 conditions, 796 events. 446/796 cut-off events. For 48771/48771 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 3718 event pairs, 79 based on Foata normal form. 2/797 useless extension candidates. Maximal degree in co-relation 5067. Up to 765 conditions per place. [2024-06-03 22:26:29,350 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 161 selfloop transitions, 15 changer transitions 0/178 dead transitions. [2024-06-03 22:26:29,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 178 transitions, 2109 flow [2024-06-03 22:26:29,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:26:29,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:26:29,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 95 transitions. [2024-06-03 22:26:29,352 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3064516129032258 [2024-06-03 22:26:29,352 INFO L175 Difference]: Start difference. First operand has 203 places, 167 transitions, 1709 flow. Second operand 10 states and 95 transitions. [2024-06-03 22:26:29,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 178 transitions, 2109 flow [2024-06-03 22:26:29,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 178 transitions, 1955 flow, removed 16 selfloop flow, removed 8 redundant places. [2024-06-03 22:26:29,447 INFO L231 Difference]: Finished difference. Result has 205 places, 168 transitions, 1617 flow [2024-06-03 22:26:29,447 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1555, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1617, PETRI_PLACES=205, PETRI_TRANSITIONS=168} [2024-06-03 22:26:29,448 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 175 predicate places. [2024-06-03 22:26:29,448 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 168 transitions, 1617 flow [2024-06-03 22:26:29,448 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-03 22:26:29,448 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:26:29,448 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:26:29,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-03 22:26:29,449 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-03 22:26:29,449 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:26:29,449 INFO L85 PathProgramCache]: Analyzing trace with hash 99578535, now seen corresponding path program 9 times [2024-06-03 22:26:29,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:26:29,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048506144] [2024-06-03 22:26:29,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:26:29,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:26:29,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:26:33,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:26:33,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:26:33,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048506144] [2024-06-03 22:26:33,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048506144] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:26:33,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:26:33,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:26:33,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669309613] [2024-06-03 22:26:33,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:26:33,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:26:33,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:26:33,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:26:33,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:26:34,024 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:26:34,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 168 transitions, 1617 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-03 22:26:34,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:26:34,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:26:34,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:26:34,354 INFO L124 PetriNetUnfolderBase]: 442/790 cut-off events. [2024-06-03 22:26:34,354 INFO L125 PetriNetUnfolderBase]: For 44886/44886 co-relation queries the response was YES. [2024-06-03 22:26:34,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4848 conditions, 790 events. 442/790 cut-off events. For 44886/44886 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 3705 event pairs, 57 based on Foata normal form. 2/791 useless extension candidates. Maximal degree in co-relation 4743. Up to 676 conditions per place. [2024-06-03 22:26:34,359 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 149 selfloop transitions, 35 changer transitions 0/186 dead transitions. [2024-06-03 22:26:34,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 186 transitions, 2039 flow [2024-06-03 22:26:34,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:26:34,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:26:34,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 115 transitions. [2024-06-03 22:26:34,360 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33724340175953077 [2024-06-03 22:26:34,360 INFO L175 Difference]: Start difference. First operand has 205 places, 168 transitions, 1617 flow. Second operand 11 states and 115 transitions. [2024-06-03 22:26:34,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 186 transitions, 2039 flow [2024-06-03 22:26:34,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 186 transitions, 1983 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-06-03 22:26:34,448 INFO L231 Difference]: Finished difference. Result has 208 places, 168 transitions, 1636 flow [2024-06-03 22:26:34,449 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1561, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1636, PETRI_PLACES=208, PETRI_TRANSITIONS=168} [2024-06-03 22:26:34,449 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 178 predicate places. [2024-06-03 22:26:34,449 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 168 transitions, 1636 flow [2024-06-03 22:26:34,449 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-03 22:26:34,449 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:26:34,449 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:26:34,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-03 22:26:34,449 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-03 22:26:34,449 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:26:34,450 INFO L85 PathProgramCache]: Analyzing trace with hash -872225023, now seen corresponding path program 10 times [2024-06-03 22:26:34,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:26:34,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901974376] [2024-06-03 22:26:34,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:26:34,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:26:34,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:26:39,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:26:39,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:26:39,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901974376] [2024-06-03 22:26:39,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901974376] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:26:39,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:26:39,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:26:39,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069070276] [2024-06-03 22:26:39,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:26:39,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:26:39,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:26:39,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:26:39,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:26:39,459 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:26:39,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 168 transitions, 1636 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-03 22:26:39,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:26:39,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:26:39,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:26:39,806 INFO L124 PetriNetUnfolderBase]: 438/784 cut-off events. [2024-06-03 22:26:39,807 INFO L125 PetriNetUnfolderBase]: For 41187/41187 co-relation queries the response was YES. [2024-06-03 22:26:39,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4699 conditions, 784 events. 438/784 cut-off events. For 41187/41187 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 3680 event pairs, 75 based on Foata normal form. 2/785 useless extension candidates. Maximal degree in co-relation 4593. Up to 748 conditions per place. [2024-06-03 22:26:39,812 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 161 selfloop transitions, 16 changer transitions 0/179 dead transitions. [2024-06-03 22:26:39,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 179 transitions, 2018 flow [2024-06-03 22:26:39,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:26:39,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:26:39,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 97 transitions. [2024-06-03 22:26:39,816 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31290322580645163 [2024-06-03 22:26:39,816 INFO L175 Difference]: Start difference. First operand has 208 places, 168 transitions, 1636 flow. Second operand 10 states and 97 transitions. [2024-06-03 22:26:39,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 179 transitions, 2018 flow [2024-06-03 22:26:39,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 179 transitions, 1875 flow, removed 20 selfloop flow, removed 10 redundant places. [2024-06-03 22:26:39,881 INFO L231 Difference]: Finished difference. Result has 208 places, 168 transitions, 1530 flow [2024-06-03 22:26:39,882 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1493, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1530, PETRI_PLACES=208, PETRI_TRANSITIONS=168} [2024-06-03 22:26:39,882 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 178 predicate places. [2024-06-03 22:26:39,882 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 168 transitions, 1530 flow [2024-06-03 22:26:39,882 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-03 22:26:39,882 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:26:39,882 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:26:39,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-03 22:26:39,883 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-03 22:26:39,883 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:26:39,883 INFO L85 PathProgramCache]: Analyzing trace with hash 889515624, now seen corresponding path program 5 times [2024-06-03 22:26:39,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:26:39,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39664999] [2024-06-03 22:26:39,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:26:39,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:26:39,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:26:44,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:26:44,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:26:44,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39664999] [2024-06-03 22:26:44,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39664999] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:26:44,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:26:44,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:26:44,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615396460] [2024-06-03 22:26:44,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:26:44,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:26:44,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:26:44,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:26:44,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:26:44,977 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:26:44,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 168 transitions, 1530 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-03 22:26:44,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:26:44,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:26:44,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:26:45,367 INFO L124 PetriNetUnfolderBase]: 442/792 cut-off events. [2024-06-03 22:26:45,367 INFO L125 PetriNetUnfolderBase]: For 42423/42423 co-relation queries the response was YES. [2024-06-03 22:26:45,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4661 conditions, 792 events. 442/792 cut-off events. For 42423/42423 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 3727 event pairs, 79 based on Foata normal form. 2/793 useless extension candidates. Maximal degree in co-relation 4554. Up to 749 conditions per place. [2024-06-03 22:26:45,373 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 158 selfloop transitions, 20 changer transitions 0/180 dead transitions. [2024-06-03 22:26:45,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 180 transitions, 1938 flow [2024-06-03 22:26:45,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:26:45,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:26:45,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 103 transitions. [2024-06-03 22:26:45,374 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3020527859237537 [2024-06-03 22:26:45,375 INFO L175 Difference]: Start difference. First operand has 208 places, 168 transitions, 1530 flow. Second operand 11 states and 103 transitions. [2024-06-03 22:26:45,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 180 transitions, 1938 flow [2024-06-03 22:26:45,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 180 transitions, 1892 flow, removed 1 selfloop flow, removed 9 redundant places. [2024-06-03 22:26:45,455 INFO L231 Difference]: Finished difference. Result has 210 places, 169 transitions, 1560 flow [2024-06-03 22:26:45,455 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1484, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1560, PETRI_PLACES=210, PETRI_TRANSITIONS=169} [2024-06-03 22:26:45,455 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 180 predicate places. [2024-06-03 22:26:45,455 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 169 transitions, 1560 flow [2024-06-03 22:26:45,455 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-03 22:26:45,456 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:26:45,456 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:26:45,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-03 22:26:45,456 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-03 22:26:45,456 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:26:45,456 INFO L85 PathProgramCache]: Analyzing trace with hash -613343434, now seen corresponding path program 6 times [2024-06-03 22:26:45,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:26:45,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930606635] [2024-06-03 22:26:45,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:26:45,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:26:45,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:26:50,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:26:50,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:26:50,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930606635] [2024-06-03 22:26:50,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930606635] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:26:50,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:26:50,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:26:50,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559156055] [2024-06-03 22:26:50,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:26:50,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:26:50,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:26:50,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:26:50,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:26:50,467 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:26:50,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 169 transitions, 1560 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-03 22:26:50,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:26:50,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:26:50,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:26:50,825 INFO L124 PetriNetUnfolderBase]: 439/787 cut-off events. [2024-06-03 22:26:50,825 INFO L125 PetriNetUnfolderBase]: For 38510/38510 co-relation queries the response was YES. [2024-06-03 22:26:50,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4509 conditions, 787 events. 439/787 cut-off events. For 38510/38510 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 3717 event pairs, 76 based on Foata normal form. 2/788 useless extension candidates. Maximal degree in co-relation 4401. Up to 730 conditions per place. [2024-06-03 22:26:50,833 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 158 selfloop transitions, 21 changer transitions 0/181 dead transitions. [2024-06-03 22:26:50,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 181 transitions, 1944 flow [2024-06-03 22:26:50,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:26:50,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:26:50,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 104 transitions. [2024-06-03 22:26:50,834 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30498533724340177 [2024-06-03 22:26:50,834 INFO L175 Difference]: Start difference. First operand has 210 places, 169 transitions, 1560 flow. Second operand 11 states and 104 transitions. [2024-06-03 22:26:50,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 181 transitions, 1944 flow [2024-06-03 22:26:50,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 181 transitions, 1880 flow, removed 14 selfloop flow, removed 9 redundant places. [2024-06-03 22:26:50,915 INFO L231 Difference]: Finished difference. Result has 212 places, 169 transitions, 1542 flow [2024-06-03 22:26:50,915 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1496, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1542, PETRI_PLACES=212, PETRI_TRANSITIONS=169} [2024-06-03 22:26:50,915 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 182 predicate places. [2024-06-03 22:26:50,916 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 169 transitions, 1542 flow [2024-06-03 22:26:50,916 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-03 22:26:50,916 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:26:50,916 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-03 22:26:50,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-03 22:26:50,916 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-03 22:26:50,916 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:26:50,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1655043330, now seen corresponding path program 1 times [2024-06-03 22:26:50,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:26:50,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124768898] [2024-06-03 22:26:50,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:26:50,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:26:50,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:26:55,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-03 22:26:55,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:26:55,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124768898] [2024-06-03 22:26:55,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124768898] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:26:55,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:26:55,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:26:55,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408616932] [2024-06-03 22:26:55,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:26:55,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:26:55,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:26:55,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:26:55,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:26:55,348 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:26:55,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 169 transitions, 1542 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-03 22:26:55,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:26:55,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:26:55,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:26:55,711 INFO L124 PetriNetUnfolderBase]: 443/795 cut-off events. [2024-06-03 22:26:55,711 INFO L125 PetriNetUnfolderBase]: For 38474/38474 co-relation queries the response was YES. [2024-06-03 22:26:55,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4544 conditions, 795 events. 443/795 cut-off events. For 38474/38474 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 3763 event pairs, 56 based on Foata normal form. 2/796 useless extension candidates. Maximal degree in co-relation 4435. Up to 701 conditions per place. [2024-06-03 22:26:55,717 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 167 selfloop transitions, 19 changer transitions 0/188 dead transitions. [2024-06-03 22:26:55,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 188 transitions, 1990 flow [2024-06-03 22:26:55,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:26:55,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:26:55,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 101 transitions. [2024-06-03 22:26:55,718 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3258064516129032 [2024-06-03 22:26:55,718 INFO L175 Difference]: Start difference. First operand has 212 places, 169 transitions, 1542 flow. Second operand 10 states and 101 transitions. [2024-06-03 22:26:55,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 188 transitions, 1990 flow [2024-06-03 22:26:55,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 188 transitions, 1895 flow, removed 13 selfloop flow, removed 10 redundant places. [2024-06-03 22:26:55,808 INFO L231 Difference]: Finished difference. Result has 212 places, 170 transitions, 1521 flow [2024-06-03 22:26:55,808 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1447, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1521, PETRI_PLACES=212, PETRI_TRANSITIONS=170} [2024-06-03 22:26:55,809 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 182 predicate places. [2024-06-03 22:26:55,809 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 170 transitions, 1521 flow [2024-06-03 22:26:55,809 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-03 22:26:55,809 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:26:55,809 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-03 22:26:55,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-03 22:26:55,810 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-03 22:26:55,810 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:26:55,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1596950880, now seen corresponding path program 2 times [2024-06-03 22:26:55,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:26:55,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58970621] [2024-06-03 22:26:55,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:26:55,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:26:55,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:27:00,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:27:00,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:27:00,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58970621] [2024-06-03 22:27:00,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58970621] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:27:00,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:27:00,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:27:00,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968582499] [2024-06-03 22:27:00,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:27:00,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:27:00,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:27:00,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:27:00,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:27:00,286 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:27:00,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 170 transitions, 1521 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-03 22:27:00,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:27:00,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:27:00,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:27:00,653 INFO L124 PetriNetUnfolderBase]: 447/803 cut-off events. [2024-06-03 22:27:00,653 INFO L125 PetriNetUnfolderBase]: For 39526/39526 co-relation queries the response was YES. [2024-06-03 22:27:00,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4581 conditions, 803 events. 447/803 cut-off events. For 39526/39526 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 3831 event pairs, 63 based on Foata normal form. 2/804 useless extension candidates. Maximal degree in co-relation 4471. Up to 708 conditions per place. [2024-06-03 22:27:00,660 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 161 selfloop transitions, 26 changer transitions 0/189 dead transitions. [2024-06-03 22:27:00,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 189 transitions, 1975 flow [2024-06-03 22:27:00,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:27:00,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:27:00,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 103 transitions. [2024-06-03 22:27:00,661 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33225806451612905 [2024-06-03 22:27:00,661 INFO L175 Difference]: Start difference. First operand has 212 places, 170 transitions, 1521 flow. Second operand 10 states and 103 transitions. [2024-06-03 22:27:00,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 189 transitions, 1975 flow [2024-06-03 22:27:00,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 189 transitions, 1911 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-06-03 22:27:00,746 INFO L231 Difference]: Finished difference. Result has 214 places, 171 transitions, 1547 flow [2024-06-03 22:27:00,746 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1457, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1547, PETRI_PLACES=214, PETRI_TRANSITIONS=171} [2024-06-03 22:27:00,746 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 184 predicate places. [2024-06-03 22:27:00,746 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 171 transitions, 1547 flow [2024-06-03 22:27:00,746 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-03 22:27:00,746 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:27:00,746 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-03 22:27:00,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-03 22:27:00,746 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-03 22:27:00,747 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:27:00,747 INFO L85 PathProgramCache]: Analyzing trace with hash -989907566, now seen corresponding path program 3 times [2024-06-03 22:27:00,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:27:00,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61504226] [2024-06-03 22:27:00,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:27:00,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:27:00,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:27:04,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:27:04,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:27:04,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61504226] [2024-06-03 22:27:04,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61504226] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:27:04,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:27:04,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:27:04,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003921590] [2024-06-03 22:27:04,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:27:04,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:27:04,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:27:04,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:27:04,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:27:05,137 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:27:05,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 171 transitions, 1547 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-03 22:27:05,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:27:05,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:27:05,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:27:05,496 INFO L124 PetriNetUnfolderBase]: 458/824 cut-off events. [2024-06-03 22:27:05,496 INFO L125 PetriNetUnfolderBase]: For 48035/48035 co-relation queries the response was YES. [2024-06-03 22:27:05,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4917 conditions, 824 events. 458/824 cut-off events. For 48035/48035 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 3974 event pairs, 66 based on Foata normal form. 2/825 useless extension candidates. Maximal degree in co-relation 4806. Up to 702 conditions per place. [2024-06-03 22:27:05,503 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 158 selfloop transitions, 32 changer transitions 0/192 dead transitions. [2024-06-03 22:27:05,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 192 transitions, 2193 flow [2024-06-03 22:27:05,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:27:05,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:27:05,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 107 transitions. [2024-06-03 22:27:05,504 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34516129032258064 [2024-06-03 22:27:05,504 INFO L175 Difference]: Start difference. First operand has 214 places, 171 transitions, 1547 flow. Second operand 10 states and 107 transitions. [2024-06-03 22:27:05,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 192 transitions, 2193 flow [2024-06-03 22:27:05,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 192 transitions, 2113 flow, removed 15 selfloop flow, removed 8 redundant places. [2024-06-03 22:27:05,603 INFO L231 Difference]: Finished difference. Result has 216 places, 173 transitions, 1605 flow [2024-06-03 22:27:05,603 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1467, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1605, PETRI_PLACES=216, PETRI_TRANSITIONS=173} [2024-06-03 22:27:05,603 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 186 predicate places. [2024-06-03 22:27:05,603 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 173 transitions, 1605 flow [2024-06-03 22:27:05,604 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-03 22:27:05,604 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:27:05,604 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-03 22:27:05,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-03 22:27:05,604 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-03 22:27:05,604 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:27:05,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1586720860, now seen corresponding path program 1 times [2024-06-03 22:27:05,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:27:05,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054504596] [2024-06-03 22:27:05,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:27:05,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:27:05,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:27:10,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:27:10,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:27:10,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054504596] [2024-06-03 22:27:10,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054504596] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:27:10,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:27:10,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:27:10,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443986330] [2024-06-03 22:27:10,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:27:10,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:27:10,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:27:10,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:27:10,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:27:10,309 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:27:10,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 173 transitions, 1605 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-03 22:27:10,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:27:10,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:27:10,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:27:10,701 INFO L124 PetriNetUnfolderBase]: 456/821 cut-off events. [2024-06-03 22:27:10,702 INFO L125 PetriNetUnfolderBase]: For 43578/43578 co-relation queries the response was YES. [2024-06-03 22:27:10,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4801 conditions, 821 events. 456/821 cut-off events. For 43578/43578 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 3958 event pairs, 67 based on Foata normal form. 1/821 useless extension candidates. Maximal degree in co-relation 4689. Up to 715 conditions per place. [2024-06-03 22:27:10,708 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 154 selfloop transitions, 35 changer transitions 0/191 dead transitions. [2024-06-03 22:27:10,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 191 transitions, 2037 flow [2024-06-03 22:27:10,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:27:10,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:27:10,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 106 transitions. [2024-06-03 22:27:10,709 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3419354838709677 [2024-06-03 22:27:10,709 INFO L175 Difference]: Start difference. First operand has 216 places, 173 transitions, 1605 flow. Second operand 10 states and 106 transitions. [2024-06-03 22:27:10,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 191 transitions, 2037 flow [2024-06-03 22:27:10,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 191 transitions, 1945 flow, removed 25 selfloop flow, removed 6 redundant places. [2024-06-03 22:27:10,804 INFO L231 Difference]: Finished difference. Result has 220 places, 173 transitions, 1591 flow [2024-06-03 22:27:10,804 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1513, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1591, PETRI_PLACES=220, PETRI_TRANSITIONS=173} [2024-06-03 22:27:10,805 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 190 predicate places. [2024-06-03 22:27:10,805 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 173 transitions, 1591 flow [2024-06-03 22:27:10,805 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-03 22:27:10,805 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:27:10,805 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-03 22:27:10,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-03 22:27:10,805 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-03 22:27:10,805 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:27:10,805 INFO L85 PathProgramCache]: Analyzing trace with hash 792289134, now seen corresponding path program 4 times [2024-06-03 22:27:10,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:27:10,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349852816] [2024-06-03 22:27:10,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:27:10,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:27:10,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:27:15,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:27:15,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:27:15,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349852816] [2024-06-03 22:27:15,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349852816] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:27:15,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:27:15,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:27:15,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266773114] [2024-06-03 22:27:15,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:27:15,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:27:15,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:27:15,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:27:15,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:27:15,292 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:27:15,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 173 transitions, 1591 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-03 22:27:15,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:27:15,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:27:15,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:27:15,689 INFO L124 PetriNetUnfolderBase]: 453/816 cut-off events. [2024-06-03 22:27:15,689 INFO L125 PetriNetUnfolderBase]: For 41077/41077 co-relation queries the response was YES. [2024-06-03 22:27:15,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4595 conditions, 816 events. 453/816 cut-off events. For 41077/41077 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 3930 event pairs, 66 based on Foata normal form. 2/817 useless extension candidates. Maximal degree in co-relation 4481. Up to 713 conditions per place. [2024-06-03 22:27:15,696 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 157 selfloop transitions, 32 changer transitions 0/191 dead transitions. [2024-06-03 22:27:15,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 191 transitions, 2021 flow [2024-06-03 22:27:15,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:27:15,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:27:15,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 105 transitions. [2024-06-03 22:27:15,698 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3387096774193548 [2024-06-03 22:27:15,698 INFO L175 Difference]: Start difference. First operand has 220 places, 173 transitions, 1591 flow. Second operand 10 states and 105 transitions. [2024-06-03 22:27:15,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 191 transitions, 2021 flow [2024-06-03 22:27:15,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 191 transitions, 1843 flow, removed 24 selfloop flow, removed 11 redundant places. [2024-06-03 22:27:15,794 INFO L231 Difference]: Finished difference. Result has 219 places, 173 transitions, 1482 flow [2024-06-03 22:27:15,794 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1413, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1482, PETRI_PLACES=219, PETRI_TRANSITIONS=173} [2024-06-03 22:27:15,794 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 189 predicate places. [2024-06-03 22:27:15,794 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 173 transitions, 1482 flow [2024-06-03 22:27:15,795 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-03 22:27:15,795 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:27:15,795 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-03 22:27:15,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-03 22:27:15,795 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-03 22:27:15,795 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:27:15,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1702191768, now seen corresponding path program 1 times [2024-06-03 22:27:15,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:27:15,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165027646] [2024-06-03 22:27:15,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:27:15,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:27:15,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:27:20,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-03 22:27:20,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:27:20,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165027646] [2024-06-03 22:27:20,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165027646] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:27:20,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:27:20,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:27:20,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422477245] [2024-06-03 22:27:20,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:27:20,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:27:20,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:27:20,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:27:20,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:27:20,610 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:27:20,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 173 transitions, 1482 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-03 22:27:20,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:27:20,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:27:20,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:27:21,035 INFO L124 PetriNetUnfolderBase]: 469/852 cut-off events. [2024-06-03 22:27:21,035 INFO L125 PetriNetUnfolderBase]: For 62903/62903 co-relation queries the response was YES. [2024-06-03 22:27:21,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4562 conditions, 852 events. 469/852 cut-off events. For 62903/62903 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 4145 event pairs, 72 based on Foata normal form. 10/861 useless extension candidates. Maximal degree in co-relation 4449. Up to 721 conditions per place. [2024-06-03 22:27:21,042 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 162 selfloop transitions, 23 changer transitions 11/198 dead transitions. [2024-06-03 22:27:21,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 198 transitions, 1980 flow [2024-06-03 22:27:21,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:27:21,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:27:21,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 117 transitions. [2024-06-03 22:27:21,043 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34310850439882695 [2024-06-03 22:27:21,043 INFO L175 Difference]: Start difference. First operand has 219 places, 173 transitions, 1482 flow. Second operand 11 states and 117 transitions. [2024-06-03 22:27:21,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 198 transitions, 1980 flow [2024-06-03 22:27:21,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 198 transitions, 1885 flow, removed 2 selfloop flow, removed 10 redundant places. [2024-06-03 22:27:21,142 INFO L231 Difference]: Finished difference. Result has 220 places, 170 transitions, 1410 flow [2024-06-03 22:27:21,142 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1389, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1410, PETRI_PLACES=220, PETRI_TRANSITIONS=170} [2024-06-03 22:27:21,142 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 190 predicate places. [2024-06-03 22:27:21,142 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 170 transitions, 1410 flow [2024-06-03 22:27:21,143 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-03 22:27:21,143 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:27:21,143 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-03 22:27:21,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-03 22:27:21,143 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-03 22:27:21,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:27:21,143 INFO L85 PathProgramCache]: Analyzing trace with hash -954235930, now seen corresponding path program 5 times [2024-06-03 22:27:21,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:27:21,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731893756] [2024-06-03 22:27:21,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:27:21,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:27:21,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:27:25,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:27:25,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:27:25,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731893756] [2024-06-03 22:27:25,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731893756] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:27:25,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:27:25,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:27:25,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356612759] [2024-06-03 22:27:25,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:27:25,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:27:25,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:27:25,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:27:25,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:27:26,067 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:27:26,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 170 transitions, 1410 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-03 22:27:26,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:27:26,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:27:26,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:27:26,470 INFO L124 PetriNetUnfolderBase]: 447/810 cut-off events. [2024-06-03 22:27:26,470 INFO L125 PetriNetUnfolderBase]: For 42418/42418 co-relation queries the response was YES. [2024-06-03 22:27:26,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4370 conditions, 810 events. 447/810 cut-off events. For 42418/42418 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 3902 event pairs, 66 based on Foata normal form. 2/811 useless extension candidates. Maximal degree in co-relation 4257. Up to 727 conditions per place. [2024-06-03 22:27:26,475 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 156 selfloop transitions, 28 changer transitions 0/186 dead transitions. [2024-06-03 22:27:26,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 186 transitions, 1854 flow [2024-06-03 22:27:26,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:27:26,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:27:26,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 106 transitions. [2024-06-03 22:27:26,476 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3419354838709677 [2024-06-03 22:27:26,476 INFO L175 Difference]: Start difference. First operand has 220 places, 170 transitions, 1410 flow. Second operand 10 states and 106 transitions. [2024-06-03 22:27:26,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 186 transitions, 1854 flow [2024-06-03 22:27:26,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 186 transitions, 1802 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-03 22:27:26,573 INFO L231 Difference]: Finished difference. Result has 217 places, 171 transitions, 1456 flow [2024-06-03 22:27:26,573 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1358, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1456, PETRI_PLACES=217, PETRI_TRANSITIONS=171} [2024-06-03 22:27:26,573 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 187 predicate places. [2024-06-03 22:27:26,573 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 171 transitions, 1456 flow [2024-06-03 22:27:26,573 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-03 22:27:26,573 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:27:26,573 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-03 22:27:26,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-03 22:27:26,574 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-03 22:27:26,574 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:27:26,574 INFO L85 PathProgramCache]: Analyzing trace with hash -954240580, now seen corresponding path program 6 times [2024-06-03 22:27:26,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:27:26,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947054717] [2024-06-03 22:27:26,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:27:26,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:27:26,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:27:30,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:27:30,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:27:30,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947054717] [2024-06-03 22:27:30,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947054717] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:27:30,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:27:30,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:27:30,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048128132] [2024-06-03 22:27:30,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:27:30,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:27:30,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:27:30,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:27:30,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:27:30,999 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:27:30,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 171 transitions, 1456 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-03 22:27:30,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:27:30,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:27:30,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:27:31,354 INFO L124 PetriNetUnfolderBase]: 487/890 cut-off events. [2024-06-03 22:27:31,354 INFO L125 PetriNetUnfolderBase]: For 77918/77918 co-relation queries the response was YES. [2024-06-03 22:27:31,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5731 conditions, 890 events. 487/890 cut-off events. For 77918/77918 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 4393 event pairs, 80 based on Foata normal form. 2/891 useless extension candidates. Maximal degree in co-relation 5619. Up to 719 conditions per place. [2024-06-03 22:27:31,361 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 161 selfloop transitions, 30 changer transitions 0/193 dead transitions. [2024-06-03 22:27:31,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 193 transitions, 2146 flow [2024-06-03 22:27:31,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:27:31,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:27:31,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 111 transitions. [2024-06-03 22:27:31,362 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3580645161290323 [2024-06-03 22:27:31,362 INFO L175 Difference]: Start difference. First operand has 217 places, 171 transitions, 1456 flow. Second operand 10 states and 111 transitions. [2024-06-03 22:27:31,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 193 transitions, 2146 flow [2024-06-03 22:27:31,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 193 transitions, 2058 flow, removed 17 selfloop flow, removed 8 redundant places. [2024-06-03 22:27:31,516 INFO L231 Difference]: Finished difference. Result has 219 places, 173 transitions, 1510 flow [2024-06-03 22:27:31,516 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1368, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1510, PETRI_PLACES=219, PETRI_TRANSITIONS=173} [2024-06-03 22:27:31,516 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 189 predicate places. [2024-06-03 22:27:31,516 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 173 transitions, 1510 flow [2024-06-03 22:27:31,516 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-03 22:27:31,516 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:27:31,516 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-03 22:27:31,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-03 22:27:31,517 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-03 22:27:31,517 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:27:31,517 INFO L85 PathProgramCache]: Analyzing trace with hash -954056006, now seen corresponding path program 2 times [2024-06-03 22:27:31,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:27:31,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318862493] [2024-06-03 22:27:31,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:27:31,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:27:31,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:27:35,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:27:35,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:27:35,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318862493] [2024-06-03 22:27:35,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318862493] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:27:35,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:27:35,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:27:35,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913481009] [2024-06-03 22:27:35,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:27:35,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:27:35,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:27:35,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:27:35,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:27:36,009 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:27:36,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 173 transitions, 1510 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-03 22:27:36,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:27:36,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:27:36,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:27:36,442 INFO L124 PetriNetUnfolderBase]: 503/926 cut-off events. [2024-06-03 22:27:36,442 INFO L125 PetriNetUnfolderBase]: For 102641/102641 co-relation queries the response was YES. [2024-06-03 22:27:36,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5846 conditions, 926 events. 503/926 cut-off events. For 102641/102641 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 4623 event pairs, 88 based on Foata normal form. 10/935 useless extension candidates. Maximal degree in co-relation 5733. Up to 797 conditions per place. [2024-06-03 22:27:36,451 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 154 selfloop transitions, 22 changer transitions 16/194 dead transitions. [2024-06-03 22:27:36,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 194 transitions, 1980 flow [2024-06-03 22:27:36,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:27:36,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:27:36,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 119 transitions. [2024-06-03 22:27:36,452 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3489736070381232 [2024-06-03 22:27:36,452 INFO L175 Difference]: Start difference. First operand has 219 places, 173 transitions, 1510 flow. Second operand 11 states and 119 transitions. [2024-06-03 22:27:36,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 194 transitions, 1980 flow [2024-06-03 22:27:36,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 194 transitions, 1900 flow, removed 22 selfloop flow, removed 6 redundant places. [2024-06-03 22:27:36,632 INFO L231 Difference]: Finished difference. Result has 224 places, 167 transitions, 1430 flow [2024-06-03 22:27:36,632 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1430, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1430, PETRI_PLACES=224, PETRI_TRANSITIONS=167} [2024-06-03 22:27:36,633 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 194 predicate places. [2024-06-03 22:27:36,633 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 167 transitions, 1430 flow [2024-06-03 22:27:36,633 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-03 22:27:36,633 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:27:36,633 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-03 22:27:36,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-03 22:27:36,633 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-03 22:27:36,633 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:27:36,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1124938360, now seen corresponding path program 7 times [2024-06-03 22:27:36,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:27:36,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182352276] [2024-06-03 22:27:36,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:27:36,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:27:36,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:27:41,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:27:41,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:27:41,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182352276] [2024-06-03 22:27:41,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182352276] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:27:41,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:27:41,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:27:41,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662406439] [2024-06-03 22:27:41,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:27:41,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:27:41,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:27:41,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:27:41,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:27:41,454 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:27:41,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 167 transitions, 1430 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-03 22:27:41,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:27:41,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:27:41,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:27:41,832 INFO L124 PetriNetUnfolderBase]: 471/866 cut-off events. [2024-06-03 22:27:41,832 INFO L125 PetriNetUnfolderBase]: For 81084/81084 co-relation queries the response was YES. [2024-06-03 22:27:41,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5618 conditions, 866 events. 471/866 cut-off events. For 81084/81084 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 4247 event pairs, 86 based on Foata normal form. 2/867 useless extension candidates. Maximal degree in co-relation 5503. Up to 766 conditions per place. [2024-06-03 22:27:41,840 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 154 selfloop transitions, 29 changer transitions 0/185 dead transitions. [2024-06-03 22:27:41,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 185 transitions, 1886 flow [2024-06-03 22:27:41,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:27:41,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:27:41,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 105 transitions. [2024-06-03 22:27:41,841 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3387096774193548 [2024-06-03 22:27:41,841 INFO L175 Difference]: Start difference. First operand has 224 places, 167 transitions, 1430 flow. Second operand 10 states and 105 transitions. [2024-06-03 22:27:41,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 185 transitions, 1886 flow [2024-06-03 22:27:41,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 185 transitions, 1828 flow, removed 7 selfloop flow, removed 11 redundant places. [2024-06-03 22:27:41,997 INFO L231 Difference]: Finished difference. Result has 217 places, 168 transitions, 1476 flow [2024-06-03 22:27:41,997 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1374, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1476, PETRI_PLACES=217, PETRI_TRANSITIONS=168} [2024-06-03 22:27:41,997 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 187 predicate places. [2024-06-03 22:27:41,997 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 168 transitions, 1476 flow [2024-06-03 22:27:41,997 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-03 22:27:41,998 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:27:41,998 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-03 22:27:41,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-03 22:27:41,998 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-03 22:27:41,998 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:27:41,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1000339388, now seen corresponding path program 8 times [2024-06-03 22:27:41,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:27:41,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786339493] [2024-06-03 22:27:41,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:27:41,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:27:42,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:27:46,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:27:46,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:27:46,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786339493] [2024-06-03 22:27:46,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786339493] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:27:46,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:27:46,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:27:46,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77948072] [2024-06-03 22:27:46,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:27:46,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:27:46,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:27:46,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:27:46,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:27:46,404 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:27:46,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 168 transitions, 1476 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-03 22:27:46,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:27:46,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:27:46,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:27:46,730 INFO L124 PetriNetUnfolderBase]: 455/838 cut-off events. [2024-06-03 22:27:46,731 INFO L125 PetriNetUnfolderBase]: For 69434/69434 co-relation queries the response was YES. [2024-06-03 22:27:46,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4543 conditions, 838 events. 455/838 cut-off events. For 69434/69434 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 4111 event pairs, 74 based on Foata normal form. 12/849 useless extension candidates. Maximal degree in co-relation 4431. Up to 729 conditions per place. [2024-06-03 22:27:46,737 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 158 selfloop transitions, 20 changer transitions 7/187 dead transitions. [2024-06-03 22:27:46,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 187 transitions, 1926 flow [2024-06-03 22:27:46,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:27:46,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:27:46,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 109 transitions. [2024-06-03 22:27:46,738 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35161290322580646 [2024-06-03 22:27:46,738 INFO L175 Difference]: Start difference. First operand has 217 places, 168 transitions, 1476 flow. Second operand 10 states and 109 transitions. [2024-06-03 22:27:46,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 187 transitions, 1926 flow [2024-06-03 22:27:46,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 187 transitions, 1812 flow, removed 29 selfloop flow, removed 8 redundant places. [2024-06-03 22:27:46,843 INFO L231 Difference]: Finished difference. Result has 219 places, 165 transitions, 1382 flow [2024-06-03 22:27:46,844 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1362, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1382, PETRI_PLACES=219, PETRI_TRANSITIONS=165} [2024-06-03 22:27:46,844 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 189 predicate places. [2024-06-03 22:27:46,844 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 165 transitions, 1382 flow [2024-06-03 22:27:46,844 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-03 22:27:46,844 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:27:46,844 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:27:46,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-03 22:27:46,844 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-03 22:27:46,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:27:46,845 INFO L85 PathProgramCache]: Analyzing trace with hash -947560886, now seen corresponding path program 3 times [2024-06-03 22:27:46,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:27:46,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838452871] [2024-06-03 22:27:46,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:27:46,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:27:46,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:27:50,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:27:50,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:27:50,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838452871] [2024-06-03 22:27:50,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838452871] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:27:50,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:27:50,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:27:50,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108989382] [2024-06-03 22:27:50,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:27:50,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:27:50,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:27:50,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:27:50,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:27:50,993 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:27:50,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 165 transitions, 1382 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-03 22:27:50,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:27:50,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:27:50,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:27:51,389 INFO L124 PetriNetUnfolderBase]: 472/877 cut-off events. [2024-06-03 22:27:51,389 INFO L125 PetriNetUnfolderBase]: For 86908/86908 co-relation queries the response was YES. [2024-06-03 22:27:51,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5294 conditions, 877 events. 472/877 cut-off events. For 86908/86908 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 4340 event pairs, 83 based on Foata normal form. 8/884 useless extension candidates. Maximal degree in co-relation 5181. Up to 709 conditions per place. [2024-06-03 22:27:51,395 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 162 selfloop transitions, 16 changer transitions 8/188 dead transitions. [2024-06-03 22:27:51,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 188 transitions, 2014 flow [2024-06-03 22:27:51,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:27:51,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:27:51,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 111 transitions. [2024-06-03 22:27:51,396 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3580645161290323 [2024-06-03 22:27:51,396 INFO L175 Difference]: Start difference. First operand has 219 places, 165 transitions, 1382 flow. Second operand 10 states and 111 transitions. [2024-06-03 22:27:51,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 188 transitions, 2014 flow [2024-06-03 22:27:51,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 188 transitions, 1962 flow, removed 2 selfloop flow, removed 11 redundant places. [2024-06-03 22:27:51,546 INFO L231 Difference]: Finished difference. Result has 218 places, 162 transitions, 1344 flow [2024-06-03 22:27:51,546 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1330, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1344, PETRI_PLACES=218, PETRI_TRANSITIONS=162} [2024-06-03 22:27:51,546 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 188 predicate places. [2024-06-03 22:27:51,546 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 162 transitions, 1344 flow [2024-06-03 22:27:51,546 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-03 22:27:51,546 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:27:51,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-03 22:27:51,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-03 22:27:51,547 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-03 22:27:51,547 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:27:51,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1124943010, now seen corresponding path program 9 times [2024-06-03 22:27:51,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:27:51,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469562974] [2024-06-03 22:27:51,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:27:51,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:27:51,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:27:56,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:27:56,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:27:56,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469562974] [2024-06-03 22:27:56,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469562974] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:27:56,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:27:56,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:27:56,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119174222] [2024-06-03 22:27:56,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:27:56,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:27:56,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:27:56,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:27:56,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:27:56,204 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:27:56,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 162 transitions, 1344 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-03 22:27:56,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:27:56,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:27:56,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:27:56,591 INFO L124 PetriNetUnfolderBase]: 457/844 cut-off events. [2024-06-03 22:27:56,591 INFO L125 PetriNetUnfolderBase]: For 72651/72651 co-relation queries the response was YES. [2024-06-03 22:27:56,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5230 conditions, 844 events. 457/844 cut-off events. For 72651/72651 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 4146 event pairs, 83 based on Foata normal form. 2/845 useless extension candidates. Maximal degree in co-relation 5117. Up to 730 conditions per place. [2024-06-03 22:27:56,598 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 148 selfloop transitions, 30 changer transitions 0/180 dead transitions. [2024-06-03 22:27:56,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 180 transitions, 1788 flow [2024-06-03 22:27:56,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:27:56,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:27:56,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 106 transitions. [2024-06-03 22:27:56,599 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3419354838709677 [2024-06-03 22:27:56,599 INFO L175 Difference]: Start difference. First operand has 218 places, 162 transitions, 1344 flow. Second operand 10 states and 106 transitions. [2024-06-03 22:27:56,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 180 transitions, 1788 flow [2024-06-03 22:27:56,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 180 transitions, 1753 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-03 22:27:56,759 INFO L231 Difference]: Finished difference. Result has 215 places, 163 transitions, 1415 flow [2024-06-03 22:27:56,759 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1309, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1415, PETRI_PLACES=215, PETRI_TRANSITIONS=163} [2024-06-03 22:27:56,760 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 185 predicate places. [2024-06-03 22:27:56,760 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 163 transitions, 1415 flow [2024-06-03 22:27:56,760 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-03 22:27:56,760 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:27:56,760 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-03 22:27:56,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-06-03 22:27:56,760 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-03 22:27:56,761 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:27:56,761 INFO L85 PathProgramCache]: Analyzing trace with hash -947799896, now seen corresponding path program 4 times [2024-06-03 22:27:56,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:27:56,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490021231] [2024-06-03 22:27:56,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:27:56,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:27:56,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:28:00,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:28:00,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:28:00,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490021231] [2024-06-03 22:28:00,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490021231] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:28:00,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:28:00,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:28:00,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797376448] [2024-06-03 22:28:00,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:28:00,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:28:00,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:28:00,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:28:00,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:28:00,875 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:28:00,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 163 transitions, 1415 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:28:00,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:28:00,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:28:00,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:28:01,179 INFO L124 PetriNetUnfolderBase]: 444/821 cut-off events. [2024-06-03 22:28:01,180 INFO L125 PetriNetUnfolderBase]: For 63612/63612 co-relation queries the response was YES. [2024-06-03 22:28:01,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4416 conditions, 821 events. 444/821 cut-off events. For 63612/63612 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 4037 event pairs, 74 based on Foata normal form. 10/830 useless extension candidates. Maximal degree in co-relation 4305. Up to 717 conditions per place. [2024-06-03 22:28:01,186 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 151 selfloop transitions, 12 changer transitions 18/183 dead transitions. [2024-06-03 22:28:01,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 183 transitions, 1859 flow [2024-06-03 22:28:01,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:28:01,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:28:01,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 124 transitions. [2024-06-03 22:28:01,186 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2024-06-03 22:28:01,186 INFO L175 Difference]: Start difference. First operand has 215 places, 163 transitions, 1415 flow. Second operand 11 states and 124 transitions. [2024-06-03 22:28:01,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 183 transitions, 1859 flow [2024-06-03 22:28:01,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 183 transitions, 1763 flow, removed 19 selfloop flow, removed 8 redundant places. [2024-06-03 22:28:01,295 INFO L231 Difference]: Finished difference. Result has 218 places, 156 transitions, 1292 flow [2024-06-03 22:28:01,295 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1319, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1292, PETRI_PLACES=218, PETRI_TRANSITIONS=156} [2024-06-03 22:28:01,295 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 188 predicate places. [2024-06-03 22:28:01,295 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 156 transitions, 1292 flow [2024-06-03 22:28:01,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:28:01,295 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:28:01,296 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-03 22:28:01,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-06-03 22:28:01,296 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-03 22:28:01,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:28:01,296 INFO L85 PathProgramCache]: Analyzing trace with hash 823087898, now seen corresponding path program 10 times [2024-06-03 22:28:01,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:28:01,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257574460] [2024-06-03 22:28:01,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:28:01,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:28:01,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:28:05,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:28:05,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:28:05,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257574460] [2024-06-03 22:28:05,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257574460] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:28:05,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:28:05,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:28:05,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66660143] [2024-06-03 22:28:05,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:28:05,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:28:05,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:28:05,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:28:05,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:28:05,798 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:28:05,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 156 transitions, 1292 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-03 22:28:05,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:28:05,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:28:05,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:28:06,134 INFO L124 PetriNetUnfolderBase]: 413/760 cut-off events. [2024-06-03 22:28:06,135 INFO L125 PetriNetUnfolderBase]: For 42786/42786 co-relation queries the response was YES. [2024-06-03 22:28:06,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4115 conditions, 760 events. 413/760 cut-off events. For 42786/42786 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 3642 event pairs, 60 based on Foata normal form. 2/761 useless extension candidates. Maximal degree in co-relation 4003. Up to 660 conditions per place. [2024-06-03 22:28:06,141 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 145 selfloop transitions, 27 changer transitions 0/174 dead transitions. [2024-06-03 22:28:06,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 174 transitions, 1724 flow [2024-06-03 22:28:06,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:28:06,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:28:06,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 103 transitions. [2024-06-03 22:28:06,142 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33225806451612905 [2024-06-03 22:28:06,142 INFO L175 Difference]: Start difference. First operand has 218 places, 156 transitions, 1292 flow. Second operand 10 states and 103 transitions. [2024-06-03 22:28:06,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 174 transitions, 1724 flow [2024-06-03 22:28:06,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 174 transitions, 1680 flow, removed 10 selfloop flow, removed 11 redundant places. [2024-06-03 22:28:06,247 INFO L231 Difference]: Finished difference. Result has 208 places, 157 transitions, 1350 flow [2024-06-03 22:28:06,248 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1252, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1350, PETRI_PLACES=208, PETRI_TRANSITIONS=157} [2024-06-03 22:28:06,248 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 178 predicate places. [2024-06-03 22:28:06,248 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 157 transitions, 1350 flow [2024-06-03 22:28:06,248 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-03 22:28:06,248 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:28:06,248 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-03 22:28:06,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-06-03 22:28:06,248 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-03 22:28:06,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:28:06,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1120289786, now seen corresponding path program 5 times [2024-06-03 22:28:06,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:28:06,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170683280] [2024-06-03 22:28:06,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:28:06,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:28:06,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:28:10,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-03 22:28:10,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:28:10,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170683280] [2024-06-03 22:28:10,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170683280] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:28:10,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:28:10,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:28:10,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109886290] [2024-06-03 22:28:10,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:28:10,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:28:10,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:28:10,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:28:10,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:28:11,054 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:28:11,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 157 transitions, 1350 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-03 22:28:11,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:28:11,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:28:11,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:28:11,551 INFO L124 PetriNetUnfolderBase]: 429/796 cut-off events. [2024-06-03 22:28:11,552 INFO L125 PetriNetUnfolderBase]: For 58716/58716 co-relation queries the response was YES. [2024-06-03 22:28:11,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4223 conditions, 796 events. 429/796 cut-off events. For 58716/58716 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 3870 event pairs, 72 based on Foata normal form. 10/805 useless extension candidates. Maximal degree in co-relation 4115. Up to 602 conditions per place. [2024-06-03 22:28:11,558 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 134 selfloop transitions, 28 changer transitions 16/180 dead transitions. [2024-06-03 22:28:11,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 180 transitions, 1800 flow [2024-06-03 22:28:11,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:28:11,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:28:11,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 121 transitions. [2024-06-03 22:28:11,559 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2024-06-03 22:28:11,559 INFO L175 Difference]: Start difference. First operand has 208 places, 157 transitions, 1350 flow. Second operand 11 states and 121 transitions. [2024-06-03 22:28:11,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 180 transitions, 1800 flow [2024-06-03 22:28:11,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 180 transitions, 1701 flow, removed 20 selfloop flow, removed 9 redundant places. [2024-06-03 22:28:11,648 INFO L231 Difference]: Finished difference. Result has 210 places, 151 transitions, 1276 flow [2024-06-03 22:28:11,649 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1253, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1276, PETRI_PLACES=210, PETRI_TRANSITIONS=151} [2024-06-03 22:28:11,649 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 180 predicate places. [2024-06-03 22:28:11,649 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 151 transitions, 1276 flow [2024-06-03 22:28:11,649 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-03 22:28:11,649 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:28:11,649 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-03 22:28:11,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-06-03 22:28:11,649 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-03 22:28:11,649 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:28:11,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1035548740, now seen corresponding path program 11 times [2024-06-03 22:28:11,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:28:11,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636085754] [2024-06-03 22:28:11,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:28:11,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:28:11,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:28:15,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:28:15,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:28:15,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636085754] [2024-06-03 22:28:15,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636085754] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:28:15,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:28:15,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:28:15,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786622321] [2024-06-03 22:28:15,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:28:15,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:28:15,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:28:15,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:28:15,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:28:15,972 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:28:15,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 151 transitions, 1276 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-03 22:28:15,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:28:15,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:28:15,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:28:16,263 INFO L124 PetriNetUnfolderBase]: 413/773 cut-off events. [2024-06-03 22:28:16,263 INFO L125 PetriNetUnfolderBase]: For 65631/65631 co-relation queries the response was YES. [2024-06-03 22:28:16,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4116 conditions, 773 events. 413/773 cut-off events. For 65631/65631 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 3743 event pairs, 67 based on Foata normal form. 12/782 useless extension candidates. Maximal degree in co-relation 4008. Up to 641 conditions per place. [2024-06-03 22:28:16,268 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 133 selfloop transitions, 27 changer transitions 7/169 dead transitions. [2024-06-03 22:28:16,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 169 transitions, 1720 flow [2024-06-03 22:28:16,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:28:16,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:28:16,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 108 transitions. [2024-06-03 22:28:16,269 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34838709677419355 [2024-06-03 22:28:16,269 INFO L175 Difference]: Start difference. First operand has 210 places, 151 transitions, 1276 flow. Second operand 10 states and 108 transitions. [2024-06-03 22:28:16,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 169 transitions, 1720 flow [2024-06-03 22:28:16,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 169 transitions, 1648 flow, removed 8 selfloop flow, removed 11 redundant places. [2024-06-03 22:28:16,347 INFO L231 Difference]: Finished difference. Result has 203 places, 149 transitions, 1281 flow [2024-06-03 22:28:16,347 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1208, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1281, PETRI_PLACES=203, PETRI_TRANSITIONS=149} [2024-06-03 22:28:16,347 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 173 predicate places. [2024-06-03 22:28:16,347 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 149 transitions, 1281 flow [2024-06-03 22:28:16,347 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-03 22:28:16,348 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:28:16,348 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-03 22:28:16,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-06-03 22:28:16,348 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-03 22:28:16,348 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:28:16,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1035541796, now seen corresponding path program 6 times [2024-06-03 22:28:16,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:28:16,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450561146] [2024-06-03 22:28:16,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:28:16,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:28:16,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:28:20,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:28:20,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:28:20,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450561146] [2024-06-03 22:28:20,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450561146] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:28:20,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:28:20,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:28:20,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153105799] [2024-06-03 22:28:20,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:28:20,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:28:20,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:28:20,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:28:20,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:28:20,652 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:28:20,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 149 transitions, 1281 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-03 22:28:20,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:28:20,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:28:20,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:28:21,016 INFO L124 PetriNetUnfolderBase]: 405/760 cut-off events. [2024-06-03 22:28:21,017 INFO L125 PetriNetUnfolderBase]: For 55274/55274 co-relation queries the response was YES. [2024-06-03 22:28:21,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4009 conditions, 760 events. 405/760 cut-off events. For 55274/55274 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3669 event pairs, 66 based on Foata normal form. 10/769 useless extension candidates. Maximal degree in co-relation 3904. Up to 631 conditions per place. [2024-06-03 22:28:21,021 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 131 selfloop transitions, 22 changer transitions 16/171 dead transitions. [2024-06-03 22:28:21,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 171 transitions, 1703 flow [2024-06-03 22:28:21,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 22:28:21,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 22:28:21,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 126 transitions. [2024-06-03 22:28:21,022 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3387096774193548 [2024-06-03 22:28:21,022 INFO L175 Difference]: Start difference. First operand has 203 places, 149 transitions, 1281 flow. Second operand 12 states and 126 transitions. [2024-06-03 22:28:21,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 171 transitions, 1703 flow [2024-06-03 22:28:21,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 171 transitions, 1611 flow, removed 17 selfloop flow, removed 10 redundant places. [2024-06-03 22:28:21,105 INFO L231 Difference]: Finished difference. Result has 205 places, 143 transitions, 1192 flow [2024-06-03 22:28:21,106 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1189, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1192, PETRI_PLACES=205, PETRI_TRANSITIONS=143} [2024-06-03 22:28:21,106 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 175 predicate places. [2024-06-03 22:28:21,106 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 143 transitions, 1192 flow [2024-06-03 22:28:21,106 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-03 22:28:21,106 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:28:21,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-03 22:28:21,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-06-03 22:28:21,106 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-03 22:28:21,106 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:28:21,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1035302786, now seen corresponding path program 7 times [2024-06-03 22:28:21,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:28:21,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397280131] [2024-06-03 22:28:21,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:28:21,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:28:21,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:28:25,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:28:25,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:28:25,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397280131] [2024-06-03 22:28:25,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397280131] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:28:25,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:28:25,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:28:25,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203862496] [2024-06-03 22:28:25,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:28:25,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:28:25,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:28:25,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:28:25,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:28:25,542 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:28:25,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 143 transitions, 1192 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-03 22:28:25,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:28:25,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:28:25,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:28:25,881 INFO L124 PetriNetUnfolderBase]: 419/795 cut-off events. [2024-06-03 22:28:25,881 INFO L125 PetriNetUnfolderBase]: For 81490/81490 co-relation queries the response was YES. [2024-06-03 22:28:25,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4969 conditions, 795 events. 419/795 cut-off events. For 81490/81490 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 3857 event pairs, 77 based on Foata normal form. 8/800 useless extension candidates. Maximal degree in co-relation 4864. Up to 613 conditions per place. [2024-06-03 22:28:25,887 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 135 selfloop transitions, 19 changer transitions 9/165 dead transitions. [2024-06-03 22:28:25,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 165 transitions, 1794 flow [2024-06-03 22:28:25,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:28:25,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:28:25,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 109 transitions. [2024-06-03 22:28:25,887 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35161290322580646 [2024-06-03 22:28:25,887 INFO L175 Difference]: Start difference. First operand has 205 places, 143 transitions, 1192 flow. Second operand 10 states and 109 transitions. [2024-06-03 22:28:25,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 165 transitions, 1794 flow [2024-06-03 22:28:25,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 165 transitions, 1726 flow, removed 12 selfloop flow, removed 12 redundant places. [2024-06-03 22:28:25,999 INFO L231 Difference]: Finished difference. Result has 197 places, 139 transitions, 1153 flow [2024-06-03 22:28:25,999 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1136, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1153, PETRI_PLACES=197, PETRI_TRANSITIONS=139} [2024-06-03 22:28:26,000 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 167 predicate places. [2024-06-03 22:28:26,000 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 139 transitions, 1153 flow [2024-06-03 22:28:26,000 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-03 22:28:26,000 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:28:26,000 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-03 22:28:26,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-06-03 22:28:26,000 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-03 22:28:26,000 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:28:26,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1065875686, now seen corresponding path program 12 times [2024-06-03 22:28:26,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:28:26,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291132495] [2024-06-03 22:28:26,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:28:26,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:28:26,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:28:30,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:28:30,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:28:30,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291132495] [2024-06-03 22:28:30,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291132495] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:28:30,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:28:30,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:28:30,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411497613] [2024-06-03 22:28:30,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:28:30,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:28:30,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:28:30,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:28:30,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:28:30,460 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:28:30,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 139 transitions, 1153 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-03 22:28:30,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:28:30,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:28:30,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:28:30,790 INFO L124 PetriNetUnfolderBase]: 419/794 cut-off events. [2024-06-03 22:28:30,790 INFO L125 PetriNetUnfolderBase]: For 84438/84438 co-relation queries the response was YES. [2024-06-03 22:28:30,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4918 conditions, 794 events. 419/794 cut-off events. For 84438/84438 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 3869 event pairs, 80 based on Foata normal form. 12/805 useless extension candidates. Maximal degree in co-relation 4816. Up to 589 conditions per place. [2024-06-03 22:28:30,796 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 109 selfloop transitions, 43 changer transitions 7/161 dead transitions. [2024-06-03 22:28:30,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 161 transitions, 1587 flow [2024-06-03 22:28:30,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:28:30,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:28:30,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 125 transitions. [2024-06-03 22:28:30,797 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36656891495601174 [2024-06-03 22:28:30,797 INFO L175 Difference]: Start difference. First operand has 197 places, 139 transitions, 1153 flow. Second operand 11 states and 125 transitions. [2024-06-03 22:28:30,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 161 transitions, 1587 flow [2024-06-03 22:28:30,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 161 transitions, 1540 flow, removed 6 selfloop flow, removed 11 redundant places. [2024-06-03 22:28:30,896 INFO L231 Difference]: Finished difference. Result has 193 places, 137 transitions, 1209 flow [2024-06-03 22:28:30,897 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1108, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1209, PETRI_PLACES=193, PETRI_TRANSITIONS=137} [2024-06-03 22:28:30,897 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 163 predicate places. [2024-06-03 22:28:30,897 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 137 transitions, 1209 flow [2024-06-03 22:28:30,897 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-03 22:28:30,897 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:28:30,897 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-03 22:28:30,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-06-03 22:28:30,897 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-03 22:28:30,897 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:28:30,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1575253694, now seen corresponding path program 8 times [2024-06-03 22:28:30,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:28:30,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386089153] [2024-06-03 22:28:30,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:28:30,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:28:30,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:28:35,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-03 22:28:35,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:28:35,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386089153] [2024-06-03 22:28:35,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386089153] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:28:35,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:28:35,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:28:35,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528466802] [2024-06-03 22:28:35,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:28:35,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:28:35,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:28:35,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:28:35,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:28:35,738 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:28:35,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 137 transitions, 1209 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-03 22:28:35,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:28:35,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:28:35,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:28:36,147 INFO L124 PetriNetUnfolderBase]: 411/783 cut-off events. [2024-06-03 22:28:36,147 INFO L125 PetriNetUnfolderBase]: For 73044/73044 co-relation queries the response was YES. [2024-06-03 22:28:36,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4857 conditions, 783 events. 411/783 cut-off events. For 73044/73044 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3826 event pairs, 83 based on Foata normal form. 10/790 useless extension candidates. Maximal degree in co-relation 4758. Up to 627 conditions per place. [2024-06-03 22:28:36,155 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 114 selfloop transitions, 32 changer transitions 9/157 dead transitions. [2024-06-03 22:28:36,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 157 transitions, 1599 flow [2024-06-03 22:28:36,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:28:36,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:28:36,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 120 transitions. [2024-06-03 22:28:36,156 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3519061583577713 [2024-06-03 22:28:36,156 INFO L175 Difference]: Start difference. First operand has 193 places, 137 transitions, 1209 flow. Second operand 11 states and 120 transitions. [2024-06-03 22:28:36,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 157 transitions, 1599 flow [2024-06-03 22:28:36,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 157 transitions, 1479 flow, removed 15 selfloop flow, removed 11 redundant places. [2024-06-03 22:28:36,264 INFO L231 Difference]: Finished difference. Result has 193 places, 134 transitions, 1135 flow [2024-06-03 22:28:36,264 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1089, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1135, PETRI_PLACES=193, PETRI_TRANSITIONS=134} [2024-06-03 22:28:36,264 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 163 predicate places. [2024-06-03 22:28:36,265 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 134 transitions, 1135 flow [2024-06-03 22:28:36,265 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-03 22:28:36,265 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:28:36,265 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-03 22:28:36,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-06-03 22:28:36,265 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-03 22:28:36,265 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:28:36,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1466925040, now seen corresponding path program 13 times [2024-06-03 22:28:36,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:28:36,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578933995] [2024-06-03 22:28:36,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:28:36,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:28:36,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:28:40,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-03 22:28:40,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:28:40,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578933995] [2024-06-03 22:28:40,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578933995] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:28:40,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:28:40,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:28:40,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497520919] [2024-06-03 22:28:40,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:28:40,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:28:40,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:28:40,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:28:40,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:28:40,717 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:28:40,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 134 transitions, 1135 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-03 22:28:40,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:28:40,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:28:40,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:28:41,009 INFO L124 PetriNetUnfolderBase]: 382/727 cut-off events. [2024-06-03 22:28:41,009 INFO L125 PetriNetUnfolderBase]: For 53544/53544 co-relation queries the response was YES. [2024-06-03 22:28:41,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4419 conditions, 727 events. 382/727 cut-off events. For 53544/53544 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3471 event pairs, 77 based on Foata normal form. 2/728 useless extension candidates. Maximal degree in co-relation 4320. Up to 664 conditions per place. [2024-06-03 22:28:41,015 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 126 selfloop transitions, 23 changer transitions 0/151 dead transitions. [2024-06-03 22:28:41,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 151 transitions, 1509 flow [2024-06-03 22:28:41,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:28:41,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:28:41,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 111 transitions. [2024-06-03 22:28:41,016 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3255131964809384 [2024-06-03 22:28:41,016 INFO L175 Difference]: Start difference. First operand has 193 places, 134 transitions, 1135 flow. Second operand 11 states and 111 transitions. [2024-06-03 22:28:41,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 151 transitions, 1509 flow [2024-06-03 22:28:41,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 151 transitions, 1439 flow, removed 2 selfloop flow, removed 11 redundant places. [2024-06-03 22:28:41,099 INFO L231 Difference]: Finished difference. Result has 191 places, 135 transitions, 1151 flow [2024-06-03 22:28:41,100 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1065, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1151, PETRI_PLACES=191, PETRI_TRANSITIONS=135} [2024-06-03 22:28:41,100 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 161 predicate places. [2024-06-03 22:28:41,100 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 135 transitions, 1151 flow [2024-06-03 22:28:41,100 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-03 22:28:41,100 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:28:41,100 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-03 22:28:41,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2024-06-03 22:28:41,100 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-03 22:28:41,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:28:41,101 INFO L85 PathProgramCache]: Analyzing trace with hash -148341404, now seen corresponding path program 14 times [2024-06-03 22:28:41,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:28:41,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050944990] [2024-06-03 22:28:41,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:28:41,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:28:41,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:28:45,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:28:45,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:28:45,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050944990] [2024-06-03 22:28:45,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050944990] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:28:45,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:28:45,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:28:45,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645929398] [2024-06-03 22:28:45,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:28:45,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:28:45,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:28:45,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:28:45,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:28:45,712 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:28:45,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 135 transitions, 1151 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-03 22:28:45,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:28:45,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:28:45,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:28:45,999 INFO L124 PetriNetUnfolderBase]: 386/735 cut-off events. [2024-06-03 22:28:45,999 INFO L125 PetriNetUnfolderBase]: For 52593/52593 co-relation queries the response was YES. [2024-06-03 22:28:46,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4469 conditions, 735 events. 386/735 cut-off events. For 52593/52593 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3523 event pairs, 77 based on Foata normal form. 2/736 useless extension candidates. Maximal degree in co-relation 4371. Up to 658 conditions per place. [2024-06-03 22:28:46,004 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 126 selfloop transitions, 24 changer transitions 0/152 dead transitions. [2024-06-03 22:28:46,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 152 transitions, 1527 flow [2024-06-03 22:28:46,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:28:46,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:28:46,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 112 transitions. [2024-06-03 22:28:46,005 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3284457478005865 [2024-06-03 22:28:46,005 INFO L175 Difference]: Start difference. First operand has 191 places, 135 transitions, 1151 flow. Second operand 11 states and 112 transitions. [2024-06-03 22:28:46,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 152 transitions, 1527 flow [2024-06-03 22:28:46,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 152 transitions, 1451 flow, removed 16 selfloop flow, removed 9 redundant places. [2024-06-03 22:28:46,097 INFO L231 Difference]: Finished difference. Result has 193 places, 136 transitions, 1165 flow [2024-06-03 22:28:46,097 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1075, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1165, PETRI_PLACES=193, PETRI_TRANSITIONS=136} [2024-06-03 22:28:46,097 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 163 predicate places. [2024-06-03 22:28:46,097 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 136 transitions, 1165 flow [2024-06-03 22:28:46,097 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-03 22:28:46,097 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:28:46,097 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-03 22:28:46,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2024-06-03 22:28:46,097 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-03 22:28:46,098 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:28:46,098 INFO L85 PathProgramCache]: Analyzing trace with hash -319039184, now seen corresponding path program 15 times [2024-06-03 22:28:46,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:28:46,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065508249] [2024-06-03 22:28:46,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:28:46,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:28:46,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:28:50,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:28:50,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:28:50,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065508249] [2024-06-03 22:28:50,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065508249] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:28:50,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:28:50,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:28:50,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647872719] [2024-06-03 22:28:50,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:28:50,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:28:50,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:28:50,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:28:50,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:28:50,552 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:28:50,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 136 transitions, 1165 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-03 22:28:50,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:28:50,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:28:50,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:28:50,873 INFO L124 PetriNetUnfolderBase]: 390/744 cut-off events. [2024-06-03 22:28:50,874 INFO L125 PetriNetUnfolderBase]: For 54249/54249 co-relation queries the response was YES. [2024-06-03 22:28:50,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4533 conditions, 744 events. 390/744 cut-off events. For 54249/54249 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3583 event pairs, 86 based on Foata normal form. 2/743 useless extension candidates. Maximal degree in co-relation 4434. Up to 631 conditions per place. [2024-06-03 22:28:50,881 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 117 selfloop transitions, 33 changer transitions 0/152 dead transitions. [2024-06-03 22:28:50,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 152 transitions, 1547 flow [2024-06-03 22:28:50,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:28:50,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:28:50,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 104 transitions. [2024-06-03 22:28:50,882 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33548387096774196 [2024-06-03 22:28:50,882 INFO L175 Difference]: Start difference. First operand has 193 places, 136 transitions, 1165 flow. Second operand 10 states and 104 transitions. [2024-06-03 22:28:50,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 152 transitions, 1547 flow [2024-06-03 22:28:50,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 152 transitions, 1467 flow, removed 17 selfloop flow, removed 9 redundant places. [2024-06-03 22:28:50,972 INFO L231 Difference]: Finished difference. Result has 194 places, 137 transitions, 1195 flow [2024-06-03 22:28:50,972 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1085, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1195, PETRI_PLACES=194, PETRI_TRANSITIONS=137} [2024-06-03 22:28:50,972 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 164 predicate places. [2024-06-03 22:28:50,972 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 137 transitions, 1195 flow [2024-06-03 22:28:50,973 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-03 22:28:50,973 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:28:50,973 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-03 22:28:50,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2024-06-03 22:28:50,973 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-03 22:28:50,973 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:28:50,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1490576942, now seen corresponding path program 9 times [2024-06-03 22:28:50,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:28:50,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695287275] [2024-06-03 22:28:50,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:28:50,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:28:51,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:28:55,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:28:55,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:28:55,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695287275] [2024-06-03 22:28:55,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695287275] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:28:55,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:28:55,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:28:55,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399862566] [2024-06-03 22:28:55,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:28:55,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:28:55,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:28:55,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:28:55,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:28:55,217 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:28:55,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 137 transitions, 1195 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-03 22:28:55,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:28:55,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:28:55,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:28:55,540 INFO L124 PetriNetUnfolderBase]: 438/844 cut-off events. [2024-06-03 22:28:55,540 INFO L125 PetriNetUnfolderBase]: For 96093/96093 co-relation queries the response was YES. [2024-06-03 22:28:55,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5765 conditions, 844 events. 438/844 cut-off events. For 96093/96093 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4227 event pairs, 100 based on Foata normal form. 8/849 useless extension candidates. Maximal degree in co-relation 5665. Up to 572 conditions per place. [2024-06-03 22:28:55,546 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 114 selfloop transitions, 36 changer transitions 8/160 dead transitions. [2024-06-03 22:28:55,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 160 transitions, 1785 flow [2024-06-03 22:28:55,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:28:55,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:28:55,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2024-06-03 22:28:55,547 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3774193548387097 [2024-06-03 22:28:55,547 INFO L175 Difference]: Start difference. First operand has 194 places, 137 transitions, 1195 flow. Second operand 10 states and 117 transitions. [2024-06-03 22:28:55,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 160 transitions, 1785 flow [2024-06-03 22:28:55,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 160 transitions, 1685 flow, removed 18 selfloop flow, removed 8 redundant places. [2024-06-03 22:28:55,712 INFO L231 Difference]: Finished difference. Result has 196 places, 134 transitions, 1152 flow [2024-06-03 22:28:55,712 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1095, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1152, PETRI_PLACES=196, PETRI_TRANSITIONS=134} [2024-06-03 22:28:55,712 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 166 predicate places. [2024-06-03 22:28:55,712 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 134 transitions, 1152 flow [2024-06-03 22:28:55,712 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-03 22:28:55,712 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:28:55,712 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-03 22:28:55,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2024-06-03 22:28:55,713 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-03 22:28:55,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:28:55,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1568817660, now seen corresponding path program 16 times [2024-06-03 22:28:55,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:28:55,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935947146] [2024-06-03 22:28:55,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:28:55,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:28:55,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:28:59,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:28:59,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:28:59,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935947146] [2024-06-03 22:28:59,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935947146] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:28:59,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:28:59,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:28:59,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175957718] [2024-06-03 22:28:59,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:28:59,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:28:59,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:28:59,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:28:59,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:28:59,899 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:28:59,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 134 transitions, 1152 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-03 22:28:59,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:28:59,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:28:59,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:29:00,253 INFO L124 PetriNetUnfolderBase]: 416/797 cut-off events. [2024-06-03 22:29:00,253 INFO L125 PetriNetUnfolderBase]: For 79676/79676 co-relation queries the response was YES. [2024-06-03 22:29:00,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5405 conditions, 797 events. 416/797 cut-off events. For 79676/79676 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3920 event pairs, 96 based on Foata normal form. 2/798 useless extension candidates. Maximal degree in co-relation 5304. Up to 651 conditions per place. [2024-06-03 22:29:00,260 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 106 selfloop transitions, 44 changer transitions 0/152 dead transitions. [2024-06-03 22:29:00,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 152 transitions, 1538 flow [2024-06-03 22:29:00,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:29:00,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:29:00,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 120 transitions. [2024-06-03 22:29:00,261 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3519061583577713 [2024-06-03 22:29:00,261 INFO L175 Difference]: Start difference. First operand has 196 places, 134 transitions, 1152 flow. Second operand 11 states and 120 transitions. [2024-06-03 22:29:00,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 152 transitions, 1538 flow [2024-06-03 22:29:00,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 152 transitions, 1466 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-03 22:29:00,394 INFO L231 Difference]: Finished difference. Result has 195 places, 135 transitions, 1214 flow [2024-06-03 22:29:00,394 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1080, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1214, PETRI_PLACES=195, PETRI_TRANSITIONS=135} [2024-06-03 22:29:00,394 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 165 predicate places. [2024-06-03 22:29:00,395 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 135 transitions, 1214 flow [2024-06-03 22:29:00,395 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-03 22:29:00,395 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:29:00,395 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-03 22:29:00,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2024-06-03 22:29:00,395 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-03 22:29:00,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:29:00,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1466745116, now seen corresponding path program 10 times [2024-06-03 22:29:00,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:29:00,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650493265] [2024-06-03 22:29:00,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:29:00,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:29:00,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:29:05,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:29:05,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:29:05,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650493265] [2024-06-03 22:29:05,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650493265] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:29:05,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:29:05,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:29:05,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321509943] [2024-06-03 22:29:05,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:29:05,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:29:05,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:29:05,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:29:05,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:29:05,243 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:29:05,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 135 transitions, 1214 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-03 22:29:05,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:29:05,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:29:05,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:29:05,577 INFO L124 PetriNetUnfolderBase]: 418/807 cut-off events. [2024-06-03 22:29:05,577 INFO L125 PetriNetUnfolderBase]: For 87128/87128 co-relation queries the response was YES. [2024-06-03 22:29:05,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5165 conditions, 807 events. 418/807 cut-off events. For 87128/87128 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3987 event pairs, 98 based on Foata normal form. 10/816 useless extension candidates. Maximal degree in co-relation 5065. Up to 702 conditions per place. [2024-06-03 22:29:05,583 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 125 selfloop transitions, 20 changer transitions 9/156 dead transitions. [2024-06-03 22:29:05,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 156 transitions, 1602 flow [2024-06-03 22:29:05,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 22:29:05,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 22:29:05,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 121 transitions. [2024-06-03 22:29:05,583 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32526881720430106 [2024-06-03 22:29:05,583 INFO L175 Difference]: Start difference. First operand has 195 places, 135 transitions, 1214 flow. Second operand 12 states and 121 transitions. [2024-06-03 22:29:05,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 156 transitions, 1602 flow [2024-06-03 22:29:05,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 156 transitions, 1478 flow, removed 19 selfloop flow, removed 9 redundant places. [2024-06-03 22:29:05,699 INFO L231 Difference]: Finished difference. Result has 198 places, 132 transitions, 1110 flow [2024-06-03 22:29:05,699 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1090, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1110, PETRI_PLACES=198, PETRI_TRANSITIONS=132} [2024-06-03 22:29:05,699 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 168 predicate places. [2024-06-03 22:29:05,699 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 132 transitions, 1110 flow [2024-06-03 22:29:05,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:29:05,699 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:29:05,699 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:29:05,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2024-06-03 22:29:05,700 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-03 22:29:05,700 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:29:05,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1212684910, now seen corresponding path program 17 times [2024-06-03 22:29:05,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:29:05,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677449754] [2024-06-03 22:29:05,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:29:05,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:29:05,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:29:10,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:29:10,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:29:10,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677449754] [2024-06-03 22:29:10,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677449754] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:29:10,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:29:10,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:29:10,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053379943] [2024-06-03 22:29:10,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:29:10,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:29:10,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:29:10,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:29:10,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:29:10,597 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:29:10,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 132 transitions, 1110 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-03 22:29:10,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:29:10,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:29:10,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:29:10,952 INFO L124 PetriNetUnfolderBase]: 396/765 cut-off events. [2024-06-03 22:29:10,952 INFO L125 PetriNetUnfolderBase]: For 71402/71402 co-relation queries the response was YES. [2024-06-03 22:29:10,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4960 conditions, 765 events. 396/765 cut-off events. For 71402/71402 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3735 event pairs, 92 based on Foata normal form. 2/766 useless extension candidates. Maximal degree in co-relation 4859. Up to 639 conditions per place. [2024-06-03 22:29:10,959 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 114 selfloop transitions, 35 changer transitions 0/151 dead transitions. [2024-06-03 22:29:10,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 151 transitions, 1500 flow [2024-06-03 22:29:10,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:29:10,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:29:10,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 115 transitions. [2024-06-03 22:29:10,960 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33724340175953077 [2024-06-03 22:29:10,960 INFO L175 Difference]: Start difference. First operand has 198 places, 132 transitions, 1110 flow. Second operand 11 states and 115 transitions. [2024-06-03 22:29:10,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 151 transitions, 1500 flow [2024-06-03 22:29:11,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 151 transitions, 1454 flow, removed 2 selfloop flow, removed 12 redundant places. [2024-06-03 22:29:11,100 INFO L231 Difference]: Finished difference. Result has 195 places, 133 transitions, 1182 flow [2024-06-03 22:29:11,100 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1064, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1182, PETRI_PLACES=195, PETRI_TRANSITIONS=133} [2024-06-03 22:29:11,100 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 165 predicate places. [2024-06-03 22:29:11,100 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 133 transitions, 1182 flow [2024-06-03 22:29:11,101 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-03 22:29:11,101 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:29:11,101 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-03 22:29:11,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2024-06-03 22:29:11,101 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-03 22:29:11,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:29:11,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1072309426, now seen corresponding path program 18 times [2024-06-03 22:29:11,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:29:11,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539692343] [2024-06-03 22:29:11,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:29:11,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:29:11,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:29:15,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:29:15,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:29:15,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539692343] [2024-06-03 22:29:15,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539692343] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:29:15,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:29:15,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:29:15,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693153277] [2024-06-03 22:29:15,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:29:15,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:29:15,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:29:15,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:29:15,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:29:15,422 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:29:15,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 133 transitions, 1182 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-03 22:29:15,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:29:15,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:29:15,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:29:15,804 INFO L124 PetriNetUnfolderBase]: 436/846 cut-off events. [2024-06-03 22:29:15,805 INFO L125 PetriNetUnfolderBase]: For 97256/97256 co-relation queries the response was YES. [2024-06-03 22:29:15,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6240 conditions, 846 events. 436/846 cut-off events. For 97256/97256 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4260 event pairs, 109 based on Foata normal form. 2/845 useless extension candidates. Maximal degree in co-relation 6140. Up to 613 conditions per place. [2024-06-03 22:29:15,811 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 108 selfloop transitions, 44 changer transitions 0/154 dead transitions. [2024-06-03 22:29:15,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 154 transitions, 1782 flow [2024-06-03 22:29:15,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:29:15,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:29:15,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 115 transitions. [2024-06-03 22:29:15,812 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3709677419354839 [2024-06-03 22:29:15,812 INFO L175 Difference]: Start difference. First operand has 195 places, 133 transitions, 1182 flow. Second operand 10 states and 115 transitions. [2024-06-03 22:29:15,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 154 transitions, 1782 flow [2024-06-03 22:29:15,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 154 transitions, 1674 flow, removed 20 selfloop flow, removed 9 redundant places. [2024-06-03 22:29:15,964 INFO L231 Difference]: Finished difference. Result has 196 places, 135 transitions, 1256 flow [2024-06-03 22:29:15,964 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1074, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1256, PETRI_PLACES=196, PETRI_TRANSITIONS=135} [2024-06-03 22:29:15,964 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 166 predicate places. [2024-06-03 22:29:15,964 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 135 transitions, 1256 flow [2024-06-03 22:29:15,964 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-03 22:29:15,964 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:29:15,965 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-03 22:29:15,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2024-06-03 22:29:15,965 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-03 22:29:15,965 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:29:15,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1212800230, now seen corresponding path program 19 times [2024-06-03 22:29:15,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:29:15,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362682127] [2024-06-03 22:29:15,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:29:15,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:29:16,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:29:20,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:29:20,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:29:20,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362682127] [2024-06-03 22:29:20,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362682127] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:29:20,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:29:20,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:29:20,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295346371] [2024-06-03 22:29:20,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:29:20,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:29:20,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:29:20,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:29:20,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:29:20,803 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:29:20,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 135 transitions, 1256 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-03 22:29:20,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:29:20,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:29:20,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:29:21,168 INFO L124 PetriNetUnfolderBase]: 433/841 cut-off events. [2024-06-03 22:29:21,169 INFO L125 PetriNetUnfolderBase]: For 95458/95458 co-relation queries the response was YES. [2024-06-03 22:29:21,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6044 conditions, 841 events. 433/841 cut-off events. For 95458/95458 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4207 event pairs, 118 based on Foata normal form. 2/840 useless extension candidates. Maximal degree in co-relation 5943. Up to 728 conditions per place. [2024-06-03 22:29:21,175 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 117 selfloop transitions, 31 changer transitions 0/150 dead transitions. [2024-06-03 22:29:21,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 150 transitions, 1592 flow [2024-06-03 22:29:21,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:29:21,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:29:21,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 102 transitions. [2024-06-03 22:29:21,176 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32903225806451614 [2024-06-03 22:29:21,176 INFO L175 Difference]: Start difference. First operand has 196 places, 135 transitions, 1256 flow. Second operand 10 states and 102 transitions. [2024-06-03 22:29:21,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 150 transitions, 1592 flow [2024-06-03 22:29:21,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 150 transitions, 1471 flow, removed 28 selfloop flow, removed 8 redundant places. [2024-06-03 22:29:21,348 INFO L231 Difference]: Finished difference. Result has 198 places, 135 transitions, 1201 flow [2024-06-03 22:29:21,348 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1135, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1201, PETRI_PLACES=198, PETRI_TRANSITIONS=135} [2024-06-03 22:29:21,348 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 168 predicate places. [2024-06-03 22:29:21,348 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 135 transitions, 1201 flow [2024-06-03 22:29:21,349 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-03 22:29:21,349 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:29:21,349 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-03 22:29:21,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2024-06-03 22:29:21,349 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-03 22:29:21,349 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:29:21,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1632978896, now seen corresponding path program 11 times [2024-06-03 22:29:21,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:29:21,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093815999] [2024-06-03 22:29:21,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:29:21,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:29:21,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:29:26,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:29:26,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:29:26,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093815999] [2024-06-03 22:29:26,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093815999] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:29:26,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:29:26,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:29:26,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991676645] [2024-06-03 22:29:26,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:29:26,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:29:26,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:29:26,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:29:26,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:29:26,178 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:29:26,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 135 transitions, 1201 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-03 22:29:26,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:29:26,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:29:26,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:29:26,652 INFO L124 PetriNetUnfolderBase]: 449/876 cut-off events. [2024-06-03 22:29:26,653 INFO L125 PetriNetUnfolderBase]: For 115249/115249 co-relation queries the response was YES. [2024-06-03 22:29:26,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6114 conditions, 876 events. 449/876 cut-off events. For 115249/115249 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 4469 event pairs, 119 based on Foata normal form. 10/885 useless extension candidates. Maximal degree in co-relation 6013. Up to 720 conditions per place. [2024-06-03 22:29:26,659 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 114 selfloop transitions, 32 changer transitions 11/159 dead transitions. [2024-06-03 22:29:26,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 159 transitions, 1609 flow [2024-06-03 22:29:26,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 22:29:26,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 22:29:26,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 126 transitions. [2024-06-03 22:29:26,660 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3387096774193548 [2024-06-03 22:29:26,660 INFO L175 Difference]: Start difference. First operand has 198 places, 135 transitions, 1201 flow. Second operand 12 states and 126 transitions. [2024-06-03 22:29:26,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 159 transitions, 1609 flow [2024-06-03 22:29:26,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 159 transitions, 1450 flow, removed 20 selfloop flow, removed 12 redundant places. [2024-06-03 22:29:26,832 INFO L231 Difference]: Finished difference. Result has 198 places, 132 transitions, 1089 flow [2024-06-03 22:29:26,832 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1042, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1089, PETRI_PLACES=198, PETRI_TRANSITIONS=132} [2024-06-03 22:29:26,832 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 168 predicate places. [2024-06-03 22:29:26,833 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 132 transitions, 1089 flow [2024-06-03 22:29:26,833 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-03 22:29:26,833 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:29:26,833 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-03 22:29:26,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2024-06-03 22:29:26,833 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-03 22:29:26,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:29:26,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1072124852, now seen corresponding path program 12 times [2024-06-03 22:29:26,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:29:26,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387909528] [2024-06-03 22:29:26,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:29:26,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:29:26,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:29:31,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:29:31,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:29:31,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387909528] [2024-06-03 22:29:31,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387909528] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:29:31,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:29:31,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:29:31,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55517047] [2024-06-03 22:29:31,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:29:31,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:29:31,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:29:31,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:29:31,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:29:31,604 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:29:31,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 132 transitions, 1089 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-03 22:29:31,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:29:31,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:29:31,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:29:31,998 INFO L124 PetriNetUnfolderBase]: 425/836 cut-off events. [2024-06-03 22:29:31,998 INFO L125 PetriNetUnfolderBase]: For 107779/107779 co-relation queries the response was YES. [2024-06-03 22:29:32,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5492 conditions, 836 events. 425/836 cut-off events. For 107779/107779 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4232 event pairs, 111 based on Foata normal form. 10/845 useless extension candidates. Maximal degree in co-relation 5394. Up to 681 conditions per place. [2024-06-03 22:29:32,004 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 112 selfloop transitions, 31 changer transitions 9/154 dead transitions. [2024-06-03 22:29:32,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 154 transitions, 1477 flow [2024-06-03 22:29:32,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 22:29:32,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 22:29:32,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 128 transitions. [2024-06-03 22:29:32,005 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34408602150537637 [2024-06-03 22:29:32,005 INFO L175 Difference]: Start difference. First operand has 198 places, 132 transitions, 1089 flow. Second operand 12 states and 128 transitions. [2024-06-03 22:29:32,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 154 transitions, 1477 flow [2024-06-03 22:29:32,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 154 transitions, 1386 flow, removed 4 selfloop flow, removed 12 redundant places. [2024-06-03 22:29:32,154 INFO L231 Difference]: Finished difference. Result has 195 places, 129 transitions, 1046 flow [2024-06-03 22:29:32,154 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1000, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1046, PETRI_PLACES=195, PETRI_TRANSITIONS=129} [2024-06-03 22:29:32,154 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 165 predicate places. [2024-06-03 22:29:32,154 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 129 transitions, 1046 flow [2024-06-03 22:29:32,154 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-03 22:29:32,154 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:29:32,154 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-03 22:29:32,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2024-06-03 22:29:32,154 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-03 22:29:32,155 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:29:32,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1418948644, now seen corresponding path program 13 times [2024-06-03 22:29:32,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:29:32,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309730613] [2024-06-03 22:29:32,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:29:32,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:29:32,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:29:36,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:29:36,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:29:36,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309730613] [2024-06-03 22:29:36,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309730613] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:29:36,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:29:36,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:29:36,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506119152] [2024-06-03 22:29:36,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:29:36,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:29:36,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:29:36,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:29:36,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:29:36,551 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:29:36,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 129 transitions, 1046 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-03 22:29:36,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:29:36,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:29:36,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:29:36,930 INFO L124 PetriNetUnfolderBase]: 440/873 cut-off events. [2024-06-03 22:29:36,930 INFO L125 PetriNetUnfolderBase]: For 123048/123048 co-relation queries the response was YES. [2024-06-03 22:29:36,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6190 conditions, 873 events. 440/873 cut-off events. For 123048/123048 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4486 event pairs, 125 based on Foata normal form. 8/880 useless extension candidates. Maximal degree in co-relation 6094. Up to 627 conditions per place. [2024-06-03 22:29:36,936 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 122 selfloop transitions, 16 changer transitions 9/149 dead transitions. [2024-06-03 22:29:36,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 149 transitions, 1568 flow [2024-06-03 22:29:36,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:29:36,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:29:36,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 107 transitions. [2024-06-03 22:29:36,937 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34516129032258064 [2024-06-03 22:29:36,937 INFO L175 Difference]: Start difference. First operand has 195 places, 129 transitions, 1046 flow. Second operand 10 states and 107 transitions. [2024-06-03 22:29:36,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 149 transitions, 1568 flow [2024-06-03 22:29:37,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 149 transitions, 1496 flow, removed 4 selfloop flow, removed 12 redundant places. [2024-06-03 22:29:37,104 INFO L231 Difference]: Finished difference. Result has 191 places, 125 transitions, 984 flow [2024-06-03 22:29:37,104 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=978, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=984, PETRI_PLACES=191, PETRI_TRANSITIONS=125} [2024-06-03 22:29:37,105 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 161 predicate places. [2024-06-03 22:29:37,105 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 125 transitions, 984 flow [2024-06-03 22:29:37,105 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-03 22:29:37,105 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:29:37,105 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-03 22:29:37,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2024-06-03 22:29:37,106 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-03 22:29:37,106 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:29:37,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1082129478, now seen corresponding path program 14 times [2024-06-03 22:29:37,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:29:37,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635516595] [2024-06-03 22:29:37,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:29:37,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:29:37,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:29:41,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:29:41,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:29:41,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635516595] [2024-06-03 22:29:41,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635516595] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:29:41,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:29:41,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:29:41,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210161503] [2024-06-03 22:29:41,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:29:41,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:29:41,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:29:41,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:29:41,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:29:41,515 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:29:41,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 125 transitions, 984 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-03 22:29:41,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:29:41,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:29:41,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:29:41,829 INFO L124 PetriNetUnfolderBase]: 400/797 cut-off events. [2024-06-03 22:29:41,829 INFO L125 PetriNetUnfolderBase]: For 101659/101659 co-relation queries the response was YES. [2024-06-03 22:29:41,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5007 conditions, 797 events. 400/797 cut-off events. For 101659/101659 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4018 event pairs, 117 based on Foata normal form. 12/808 useless extension candidates. Maximal degree in co-relation 4926. Up to 696 conditions per place. [2024-06-03 22:29:41,834 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 113 selfloop transitions, 16 changer transitions 10/141 dead transitions. [2024-06-03 22:29:41,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 141 transitions, 1326 flow [2024-06-03 22:29:41,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:29:41,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:29:41,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 105 transitions. [2024-06-03 22:29:41,835 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3387096774193548 [2024-06-03 22:29:41,835 INFO L175 Difference]: Start difference. First operand has 191 places, 125 transitions, 984 flow. Second operand 10 states and 105 transitions. [2024-06-03 22:29:41,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 141 transitions, 1326 flow [2024-06-03 22:29:42,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 141 transitions, 1269 flow, removed 15 selfloop flow, removed 9 redundant places. [2024-06-03 22:29:42,009 INFO L231 Difference]: Finished difference. Result has 189 places, 119 transitions, 923 flow [2024-06-03 22:29:42,009 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=927, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=923, PETRI_PLACES=189, PETRI_TRANSITIONS=119} [2024-06-03 22:29:42,010 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 159 predicate places. [2024-06-03 22:29:42,010 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 119 transitions, 923 flow [2024-06-03 22:29:42,010 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-03 22:29:42,010 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:29:42,010 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-03 22:29:42,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2024-06-03 22:29:42,010 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-03 22:29:42,011 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:29:42,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1408829314, now seen corresponding path program 15 times [2024-06-03 22:29:42,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:29:42,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80646626] [2024-06-03 22:29:42,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:29:42,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:29:42,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:29:46,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:29:46,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:29:46,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80646626] [2024-06-03 22:29:46,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80646626] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:29:46,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:29:46,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:29:46,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120838135] [2024-06-03 22:29:46,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:29:46,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:29:46,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:29:46,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:29:46,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:29:46,454 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:29:46,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 119 transitions, 923 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-03 22:29:46,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:29:46,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:29:46,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:29:46,816 INFO L124 PetriNetUnfolderBase]: 377/756 cut-off events. [2024-06-03 22:29:46,816 INFO L125 PetriNetUnfolderBase]: For 84693/84693 co-relation queries the response was YES. [2024-06-03 22:29:46,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4658 conditions, 756 events. 377/756 cut-off events. For 84693/84693 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3753 event pairs, 106 based on Foata normal form. 8/763 useless extension candidates. Maximal degree in co-relation 4578. Up to 596 conditions per place. [2024-06-03 22:29:46,821 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 116 selfloop transitions, 12 changer transitions 11/141 dead transitions. [2024-06-03 22:29:46,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 141 transitions, 1429 flow [2024-06-03 22:29:46,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:29:46,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:29:46,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 114 transitions. [2024-06-03 22:29:46,821 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3343108504398827 [2024-06-03 22:29:46,821 INFO L175 Difference]: Start difference. First operand has 189 places, 119 transitions, 923 flow. Second operand 11 states and 114 transitions. [2024-06-03 22:29:46,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 141 transitions, 1429 flow [2024-06-03 22:29:46,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 141 transitions, 1331 flow, removed 7 selfloop flow, removed 14 redundant places. [2024-06-03 22:29:46,962 INFO L231 Difference]: Finished difference. Result has 184 places, 115 transitions, 836 flow [2024-06-03 22:29:46,962 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=829, PETRI_DIFFERENCE_MINUEND_PLACES=173, 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=11, PETRI_FLOW=836, PETRI_PLACES=184, PETRI_TRANSITIONS=115} [2024-06-03 22:29:46,963 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 154 predicate places. [2024-06-03 22:29:46,963 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 115 transitions, 836 flow [2024-06-03 22:29:46,963 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-03 22:29:46,963 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:29:46,963 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-03 22:29:46,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2024-06-03 22:29:46,963 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-03 22:29:46,963 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:29:46,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1704287524, now seen corresponding path program 16 times [2024-06-03 22:29:46,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:29:46,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516764559] [2024-06-03 22:29:46,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:29:46,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:29:47,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:29:52,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:29:52,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:29:52,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516764559] [2024-06-03 22:29:52,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516764559] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:29:52,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:29:52,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:29:52,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339236679] [2024-06-03 22:29:52,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:29:52,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:29:52,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:29:52,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:29:52,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:29:52,397 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:29:52,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 115 transitions, 836 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-03 22:29:52,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:29:52,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:29:52,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:29:52,761 INFO L124 PetriNetUnfolderBase]: 356/717 cut-off events. [2024-06-03 22:29:52,762 INFO L125 PetriNetUnfolderBase]: For 78347/78347 co-relation queries the response was YES. [2024-06-03 22:29:52,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4110 conditions, 717 events. 356/717 cut-off events. For 78347/78347 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3506 event pairs, 106 based on Foata normal form. 10/726 useless extension candidates. Maximal degree in co-relation 4032. Up to 633 conditions per place. [2024-06-03 22:29:52,767 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 109 selfloop transitions, 12 changer transitions 9/132 dead transitions. [2024-06-03 22:29:52,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 132 transitions, 1162 flow [2024-06-03 22:29:52,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:29:52,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:29:52,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 106 transitions. [2024-06-03 22:29:52,767 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31085043988269795 [2024-06-03 22:29:52,767 INFO L175 Difference]: Start difference. First operand has 184 places, 115 transitions, 836 flow. Second operand 11 states and 106 transitions. [2024-06-03 22:29:52,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 132 transitions, 1162 flow [2024-06-03 22:29:52,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 132 transitions, 1135 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-03 22:29:52,870 INFO L231 Difference]: Finished difference. Result has 180 places, 112 transitions, 816 flow [2024-06-03 22:29:52,870 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=809, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=816, PETRI_PLACES=180, PETRI_TRANSITIONS=112} [2024-06-03 22:29:52,871 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 150 predicate places. [2024-06-03 22:29:52,871 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 112 transitions, 816 flow [2024-06-03 22:29:52,871 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-03 22:29:52,871 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:29:52,871 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-03 22:29:52,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2024-06-03 22:29:52,871 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-03 22:29:52,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:29:52,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1856865672, now seen corresponding path program 1 times [2024-06-03 22:29:52,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:29:52,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581148086] [2024-06-03 22:29:52,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:29:52,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:29:52,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:29:57,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:29:57,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:29:57,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581148086] [2024-06-03 22:29:57,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581148086] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:29:57,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:29:57,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-03 22:29:57,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038794214] [2024-06-03 22:29:57,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:29:57,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-03 22:29:57,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:29:57,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-03 22:29:57,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-06-03 22:29:57,760 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:29:57,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 112 transitions, 816 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-03 22:29:57,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:29:57,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:29:57,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:29:58,155 INFO L124 PetriNetUnfolderBase]: 338/687 cut-off events. [2024-06-03 22:29:58,155 INFO L125 PetriNetUnfolderBase]: For 65797/65797 co-relation queries the response was YES. [2024-06-03 22:29:58,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3928 conditions, 687 events. 338/687 cut-off events. For 65797/65797 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3361 event pairs, 91 based on Foata normal form. 6/692 useless extension candidates. Maximal degree in co-relation 3852. Up to 569 conditions per place. [2024-06-03 22:29:58,160 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 98 selfloop transitions, 13 changer transitions 19/132 dead transitions. [2024-06-03 22:29:58,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 132 transitions, 1132 flow [2024-06-03 22:29:58,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:29:58,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:29:58,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 103 transitions. [2024-06-03 22:29:58,161 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33225806451612905 [2024-06-03 22:29:58,161 INFO L175 Difference]: Start difference. First operand has 180 places, 112 transitions, 816 flow. Second operand 10 states and 103 transitions. [2024-06-03 22:29:58,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 132 transitions, 1132 flow [2024-06-03 22:29:58,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 132 transitions, 1098 flow, removed 4 selfloop flow, removed 11 redundant places. [2024-06-03 22:29:58,255 INFO L231 Difference]: Finished difference. Result has 177 places, 106 transitions, 778 flow [2024-06-03 22:29:58,255 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=784, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=778, PETRI_PLACES=177, PETRI_TRANSITIONS=106} [2024-06-03 22:29:58,255 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 147 predicate places. [2024-06-03 22:29:58,255 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 106 transitions, 778 flow [2024-06-03 22:29:58,255 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-03 22:29:58,255 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:29:58,255 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-03 22:29:58,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2024-06-03 22:29:58,255 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-03 22:29:58,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:29:58,256 INFO L85 PathProgramCache]: Analyzing trace with hash 305083932, now seen corresponding path program 2 times [2024-06-03 22:29:58,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:29:58,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003303809] [2024-06-03 22:29:58,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:29:58,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:29:58,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:30:03,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-03 22:30:03,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:30:03,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003303809] [2024-06-03 22:30:03,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003303809] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:30:03,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:30:03,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-03 22:30:03,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27296478] [2024-06-03 22:30:03,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:30:03,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-03 22:30:03,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:30:03,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-03 22:30:03,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-06-03 22:30:03,387 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:30:03,387 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 106 transitions, 778 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-03 22:30:03,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:30:03,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:30:03,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:30:03,787 INFO L124 PetriNetUnfolderBase]: 311/638 cut-off events. [2024-06-03 22:30:03,787 INFO L125 PetriNetUnfolderBase]: For 63900/63900 co-relation queries the response was YES. [2024-06-03 22:30:03,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3717 conditions, 638 events. 311/638 cut-off events. For 63900/63900 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3072 event pairs, 81 based on Foata normal form. 6/643 useless extension candidates. Maximal degree in co-relation 3642. Up to 519 conditions per place. [2024-06-03 22:30:03,792 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 89 selfloop transitions, 17 changer transitions 17/125 dead transitions. [2024-06-03 22:30:03,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 125 transitions, 1072 flow [2024-06-03 22:30:03,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:30:03,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:30:03,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 107 transitions. [2024-06-03 22:30:03,792 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31378299120234604 [2024-06-03 22:30:03,792 INFO L175 Difference]: Start difference. First operand has 177 places, 106 transitions, 778 flow. Second operand 11 states and 107 transitions. [2024-06-03 22:30:03,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 125 transitions, 1072 flow [2024-06-03 22:30:03,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 125 transitions, 1021 flow, removed 6 selfloop flow, removed 11 redundant places. [2024-06-03 22:30:03,900 INFO L231 Difference]: Finished difference. Result has 169 places, 99 transitions, 704 flow [2024-06-03 22:30:03,900 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=727, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=704, PETRI_PLACES=169, PETRI_TRANSITIONS=99} [2024-06-03 22:30:03,900 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 139 predicate places. [2024-06-03 22:30:03,900 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 99 transitions, 704 flow [2024-06-03 22:30:03,900 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-03 22:30:03,900 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:30:03,900 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:30:03,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2024-06-03 22:30:03,900 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-03 22:30:03,901 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:30:03,901 INFO L85 PathProgramCache]: Analyzing trace with hash -622212750, now seen corresponding path program 3 times [2024-06-03 22:30:03,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:30:03,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445555603] [2024-06-03 22:30:03,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:30:03,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:30:03,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:30:09,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:30:09,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:30:09,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445555603] [2024-06-03 22:30:09,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445555603] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:30:09,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:30:09,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-03 22:30:09,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785218897] [2024-06-03 22:30:09,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:30:09,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-03 22:30:09,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:30:09,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-03 22:30:09,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-06-03 22:30:09,413 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:30:09,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 99 transitions, 704 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-03 22:30:09,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:30:09,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:30:09,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:30:09,782 INFO L124 PetriNetUnfolderBase]: 288/601 cut-off events. [2024-06-03 22:30:09,782 INFO L125 PetriNetUnfolderBase]: For 56103/56103 co-relation queries the response was YES. [2024-06-03 22:30:09,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3320 conditions, 601 events. 288/601 cut-off events. For 56103/56103 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2866 event pairs, 86 based on Foata normal form. 8/608 useless extension candidates. Maximal degree in co-relation 3250. Up to 471 conditions per place. [2024-06-03 22:30:09,785 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 83 selfloop transitions, 23 changer transitions 9/117 dead transitions. [2024-06-03 22:30:09,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 117 transitions, 984 flow [2024-06-03 22:30:09,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:30:09,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:30:09,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 109 transitions. [2024-06-03 22:30:09,786 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3196480938416422 [2024-06-03 22:30:09,786 INFO L175 Difference]: Start difference. First operand has 169 places, 99 transitions, 704 flow. Second operand 11 states and 109 transitions. [2024-06-03 22:30:09,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 117 transitions, 984 flow [2024-06-03 22:30:09,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 117 transitions, 942 flow, removed 4 selfloop flow, removed 10 redundant places. [2024-06-03 22:30:09,857 INFO L231 Difference]: Finished difference. Result has 163 places, 95 transitions, 673 flow [2024-06-03 22:30:09,857 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=662, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=673, PETRI_PLACES=163, PETRI_TRANSITIONS=95} [2024-06-03 22:30:09,857 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 133 predicate places. [2024-06-03 22:30:09,857 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 95 transitions, 673 flow [2024-06-03 22:30:09,857 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-03 22:30:09,857 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:30:09,857 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-03 22:30:09,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2024-06-03 22:30:09,857 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-03 22:30:09,858 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:30:09,858 INFO L85 PathProgramCache]: Analyzing trace with hash -622218330, now seen corresponding path program 4 times [2024-06-03 22:30:09,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:30:09,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554433713] [2024-06-03 22:30:09,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:30:09,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:30:09,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:30:14,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:30:14,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:30:14,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554433713] [2024-06-03 22:30:14,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554433713] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:30:14,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:30:14,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-03 22:30:14,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836066767] [2024-06-03 22:30:14,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:30:14,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-03 22:30:14,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:30:14,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-03 22:30:14,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-06-03 22:30:14,796 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:30:14,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 95 transitions, 673 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-03 22:30:14,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:30:14,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:30:14,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:30:15,128 INFO L124 PetriNetUnfolderBase]: 279/586 cut-off events. [2024-06-03 22:30:15,128 INFO L125 PetriNetUnfolderBase]: For 47210/47210 co-relation queries the response was YES. [2024-06-03 22:30:15,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3179 conditions, 586 events. 279/586 cut-off events. For 47210/47210 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2790 event pairs, 82 based on Foata normal form. 6/591 useless extension candidates. Maximal degree in co-relation 3112. Up to 459 conditions per place. [2024-06-03 22:30:15,132 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 80 selfloop transitions, 19 changer transitions 13/114 dead transitions. [2024-06-03 22:30:15,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 114 transitions, 949 flow [2024-06-03 22:30:15,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:30:15,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:30:15,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 107 transitions. [2024-06-03 22:30:15,132 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31378299120234604 [2024-06-03 22:30:15,132 INFO L175 Difference]: Start difference. First operand has 163 places, 95 transitions, 673 flow. Second operand 11 states and 107 transitions. [2024-06-03 22:30:15,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 114 transitions, 949 flow [2024-06-03 22:30:15,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 114 transitions, 860 flow, removed 7 selfloop flow, removed 12 redundant places. [2024-06-03 22:30:15,193 INFO L231 Difference]: Finished difference. Result has 159 places, 90 transitions, 593 flow [2024-06-03 22:30:15,193 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=586, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=593, PETRI_PLACES=159, PETRI_TRANSITIONS=90} [2024-06-03 22:30:15,193 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 129 predicate places. [2024-06-03 22:30:15,193 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 90 transitions, 593 flow [2024-06-03 22:30:15,194 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-03 22:30:15,194 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:30:15,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-03 22:30:15,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2024-06-03 22:30:15,194 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-03 22:30:15,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:30:15,194 INFO L85 PathProgramCache]: Analyzing trace with hash -622362480, now seen corresponding path program 5 times [2024-06-03 22:30:15,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:30:15,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475142625] [2024-06-03 22:30:15,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:30:15,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:30:15,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:30:19,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:30:19,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:30:19,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475142625] [2024-06-03 22:30:19,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475142625] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:30:19,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:30:19,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-03 22:30:19,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82328646] [2024-06-03 22:30:19,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:30:19,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-03 22:30:19,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:30:19,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-03 22:30:19,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-06-03 22:30:20,059 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:30:20,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 90 transitions, 593 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-03 22:30:20,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:30:20,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:30:20,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:30:20,363 INFO L124 PetriNetUnfolderBase]: 266/563 cut-off events. [2024-06-03 22:30:20,363 INFO L125 PetriNetUnfolderBase]: For 40656/40656 co-relation queries the response was YES. [2024-06-03 22:30:20,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2918 conditions, 563 events. 266/563 cut-off events. For 40656/40656 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2655 event pairs, 80 based on Foata normal form. 6/568 useless extension candidates. Maximal degree in co-relation 2854. Up to 439 conditions per place. [2024-06-03 22:30:20,367 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 69 selfloop transitions, 6 changer transitions 32/109 dead transitions. [2024-06-03 22:30:20,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 109 transitions, 855 flow [2024-06-03 22:30:20,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:30:20,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:30:20,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 106 transitions. [2024-06-03 22:30:20,367 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31085043988269795 [2024-06-03 22:30:20,367 INFO L175 Difference]: Start difference. First operand has 159 places, 90 transitions, 593 flow. Second operand 11 states and 106 transitions. [2024-06-03 22:30:20,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 109 transitions, 855 flow [2024-06-03 22:30:20,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 109 transitions, 811 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-03 22:30:20,409 INFO L231 Difference]: Finished difference. Result has 154 places, 73 transitions, 429 flow [2024-06-03 22:30:20,409 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=549, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=429, PETRI_PLACES=154, PETRI_TRANSITIONS=73} [2024-06-03 22:30:20,410 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 124 predicate places. [2024-06-03 22:30:20,410 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 73 transitions, 429 flow [2024-06-03 22:30:20,410 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-03 22:30:20,410 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:30:20,410 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-03 22:30:20,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2024-06-03 22:30:20,410 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-03 22:30:20,410 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:30:20,410 INFO L85 PathProgramCache]: Analyzing trace with hash 746305010, now seen corresponding path program 6 times [2024-06-03 22:30:20,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:30:20,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637795339] [2024-06-03 22:30:20,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:30:20,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:30:20,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:30:25,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:30:25,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:30:25,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637795339] [2024-06-03 22:30:25,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637795339] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:30:25,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:30:25,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:30:25,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915283494] [2024-06-03 22:30:25,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:30:25,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:30:25,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:30:25,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:30:25,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:30:25,658 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:30:25,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 73 transitions, 429 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-03 22:30:25,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:30:25,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:30:25,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:30:25,922 INFO L124 PetriNetUnfolderBase]: 225/480 cut-off events. [2024-06-03 22:30:25,922 INFO L125 PetriNetUnfolderBase]: For 37408/37408 co-relation queries the response was YES. [2024-06-03 22:30:25,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2518 conditions, 480 events. 225/480 cut-off events. For 37408/37408 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2175 event pairs, 78 based on Foata normal form. 6/485 useless extension candidates. Maximal degree in co-relation 2456. Up to 407 conditions per place. [2024-06-03 22:30:25,926 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 64 selfloop transitions, 7 changer transitions 16/89 dead transitions. [2024-06-03 22:30:25,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 89 transitions, 641 flow [2024-06-03 22:30:25,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:30:25,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:30:25,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 101 transitions. [2024-06-03 22:30:25,927 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2961876832844575 [2024-06-03 22:30:25,927 INFO L175 Difference]: Start difference. First operand has 154 places, 73 transitions, 429 flow. Second operand 11 states and 101 transitions. [2024-06-03 22:30:25,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 89 transitions, 641 flow [2024-06-03 22:30:25,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 89 transitions, 602 flow, removed 8 selfloop flow, removed 14 redundant places. [2024-06-03 22:30:25,966 INFO L231 Difference]: Finished difference. Result has 135 places, 68 transitions, 386 flow [2024-06-03 22:30:25,966 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=386, PETRI_PLACES=135, PETRI_TRANSITIONS=68} [2024-06-03 22:30:25,966 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 105 predicate places. [2024-06-03 22:30:25,966 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 68 transitions, 386 flow [2024-06-03 22:30:25,966 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-03 22:30:25,966 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:30:25,966 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-03 22:30:25,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2024-06-03 22:30:25,966 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-03 22:30:25,967 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:30:25,967 INFO L85 PathProgramCache]: Analyzing trace with hash -2086886980, now seen corresponding path program 7 times [2024-06-03 22:30:25,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:30:25,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618984986] [2024-06-03 22:30:25,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:30:25,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:30:26,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:30:30,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:30:30,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:30:30,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618984986] [2024-06-03 22:30:30,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618984986] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:30:30,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:30:30,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:30:30,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176663289] [2024-06-03 22:30:30,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:30:30,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:30:30,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:30:30,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:30:30,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:30:30,860 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:30:30,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 68 transitions, 386 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-03 22:30:30,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:30:30,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:30:30,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:30:31,151 INFO L124 PetriNetUnfolderBase]: 212/453 cut-off events. [2024-06-03 22:30:31,151 INFO L125 PetriNetUnfolderBase]: For 30272/30272 co-relation queries the response was YES. [2024-06-03 22:30:31,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2292 conditions, 453 events. 212/453 cut-off events. For 30272/30272 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2015 event pairs, 74 based on Foata normal form. 6/458 useless extension candidates. Maximal degree in co-relation 2237. Up to 375 conditions per place. [2024-06-03 22:30:31,153 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 61 selfloop transitions, 8 changer transitions 14/85 dead transitions. [2024-06-03 22:30:31,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 85 transitions, 590 flow [2024-06-03 22:30:31,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:30:31,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:30:31,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 102 transitions. [2024-06-03 22:30:31,154 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2991202346041056 [2024-06-03 22:30:31,154 INFO L175 Difference]: Start difference. First operand has 135 places, 68 transitions, 386 flow. Second operand 11 states and 102 transitions. [2024-06-03 22:30:31,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 85 transitions, 590 flow [2024-06-03 22:30:31,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 85 transitions, 566 flow, removed 5 selfloop flow, removed 10 redundant places. [2024-06-03 22:30:31,185 INFO L231 Difference]: Finished difference. Result has 127 places, 64 transitions, 363 flow [2024-06-03 22:30:31,185 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=363, PETRI_PLACES=127, PETRI_TRANSITIONS=64} [2024-06-03 22:30:31,185 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 97 predicate places. [2024-06-03 22:30:31,185 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 64 transitions, 363 flow [2024-06-03 22:30:31,185 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-03 22:30:31,185 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:30:31,185 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-03 22:30:31,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2024-06-03 22:30:31,186 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-03 22:30:31,186 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:30:31,186 INFO L85 PathProgramCache]: Analyzing trace with hash -254077944, now seen corresponding path program 8 times [2024-06-03 22:30:31,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:30:31,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567467835] [2024-06-03 22:30:31,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:30:31,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:30:31,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:30:36,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:30:36,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:30:36,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567467835] [2024-06-03 22:30:36,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567467835] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:30:36,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:30:36,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-03 22:30:36,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953425676] [2024-06-03 22:30:36,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:30:36,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-03 22:30:36,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:30:36,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-03 22:30:36,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-06-03 22:30:37,134 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:30:37,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 64 transitions, 363 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-03 22:30:37,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:30:37,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:30:37,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:30:37,445 INFO L124 PetriNetUnfolderBase]: 198/427 cut-off events. [2024-06-03 22:30:37,445 INFO L125 PetriNetUnfolderBase]: For 25130/25130 co-relation queries the response was YES. [2024-06-03 22:30:37,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2126 conditions, 427 events. 198/427 cut-off events. For 25130/25130 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1874 event pairs, 70 based on Foata normal form. 6/432 useless extension candidates. Maximal degree in co-relation 2075. Up to 349 conditions per place. [2024-06-03 22:30:37,447 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 51 selfloop transitions, 3 changer transitions 25/81 dead transitions. [2024-06-03 22:30:37,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 81 transitions, 559 flow [2024-06-03 22:30:37,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:30:37,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:30:37,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 101 transitions. [2024-06-03 22:30:37,448 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2961876832844575 [2024-06-03 22:30:37,448 INFO L175 Difference]: Start difference. First operand has 127 places, 64 transitions, 363 flow. Second operand 11 states and 101 transitions. [2024-06-03 22:30:37,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 81 transitions, 559 flow [2024-06-03 22:30:37,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 81 transitions, 535 flow, removed 4 selfloop flow, removed 10 redundant places. [2024-06-03 22:30:37,470 INFO L231 Difference]: Finished difference. Result has 121 places, 55 transitions, 303 flow [2024-06-03 22:30:37,470 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=303, PETRI_PLACES=121, PETRI_TRANSITIONS=55} [2024-06-03 22:30:37,470 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 91 predicate places. [2024-06-03 22:30:37,471 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 55 transitions, 303 flow [2024-06-03 22:30:37,471 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-03 22:30:37,471 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:30:37,471 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-03 22:30:37,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2024-06-03 22:30:37,471 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-03 22:30:37,471 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:30:37,472 INFO L85 PathProgramCache]: Analyzing trace with hash 121476126, now seen corresponding path program 9 times [2024-06-03 22:30:37,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:30:37,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595923104] [2024-06-03 22:30:37,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:30:37,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:30:37,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:30:42,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-03 22:30:42,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:30:42,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595923104] [2024-06-03 22:30:42,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595923104] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:30:42,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:30:42,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:30:42,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496617797] [2024-06-03 22:30:42,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:30:42,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:30:42,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:30:42,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:30:42,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:30:42,860 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:30:42,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 55 transitions, 303 flow. Second operand has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 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-03 22:30:42,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:30:42,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:30:42,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:30:43,018 INFO L124 PetriNetUnfolderBase]: 161/345 cut-off events. [2024-06-03 22:30:43,018 INFO L125 PetriNetUnfolderBase]: For 17228/17228 co-relation queries the response was YES. [2024-06-03 22:30:43,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1604 conditions, 345 events. 161/345 cut-off events. For 17228/17228 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1430 event pairs, 55 based on Foata normal form. 6/350 useless extension candidates. Maximal degree in co-relation 1556. Up to 283 conditions per place. [2024-06-03 22:30:43,020 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 47 selfloop transitions, 9 changer transitions 11/69 dead transitions. [2024-06-03 22:30:43,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 69 transitions, 467 flow [2024-06-03 22:30:43,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:30:43,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:30:43,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 110 transitions. [2024-06-03 22:30:43,020 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3225806451612903 [2024-06-03 22:30:43,020 INFO L175 Difference]: Start difference. First operand has 121 places, 55 transitions, 303 flow. Second operand 11 states and 110 transitions. [2024-06-03 22:30:43,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 69 transitions, 467 flow [2024-06-03 22:30:43,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 69 transitions, 443 flow, removed 8 selfloop flow, removed 12 redundant places. [2024-06-03 22:30:43,032 INFO L231 Difference]: Finished difference. Result has 106 places, 52 transitions, 285 flow [2024-06-03 22:30:43,032 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=285, PETRI_PLACES=106, PETRI_TRANSITIONS=52} [2024-06-03 22:30:43,033 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 76 predicate places. [2024-06-03 22:30:43,033 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 52 transitions, 285 flow [2024-06-03 22:30:43,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 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-03 22:30:43,033 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:30:43,033 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-03 22:30:43,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2024-06-03 22:30:43,033 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-03 22:30:43,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:30:43,033 INFO L85 PathProgramCache]: Analyzing trace with hash 2058282482, now seen corresponding path program 10 times [2024-06-03 22:30:43,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:30:43,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32460085] [2024-06-03 22:30:43,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:30:43,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:30:43,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:30:48,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:30:48,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:30:48,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32460085] [2024-06-03 22:30:48,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32460085] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:30:48,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:30:48,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:30:48,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792129366] [2024-06-03 22:30:48,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:30:48,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:30:48,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:30:48,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:30:48,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:30:48,811 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:30:48,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 52 transitions, 285 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-03 22:30:48,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:30:48,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:30:48,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:30:49,027 INFO L124 PetriNetUnfolderBase]: 151/327 cut-off events. [2024-06-03 22:30:49,027 INFO L125 PetriNetUnfolderBase]: For 12206/12206 co-relation queries the response was YES. [2024-06-03 22:30:49,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1449 conditions, 327 events. 151/327 cut-off events. For 12206/12206 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1330 event pairs, 53 based on Foata normal form. 6/332 useless extension candidates. Maximal degree in co-relation 1408. Up to 265 conditions per place. [2024-06-03 22:30:49,028 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 42 selfloop transitions, 6 changer transitions 16/66 dead transitions. [2024-06-03 22:30:49,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 66 transitions, 443 flow [2024-06-03 22:30:49,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:30:49,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:30:49,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 98 transitions. [2024-06-03 22:30:49,029 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2873900293255132 [2024-06-03 22:30:49,029 INFO L175 Difference]: Start difference. First operand has 106 places, 52 transitions, 285 flow. Second operand 11 states and 98 transitions. [2024-06-03 22:30:49,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 66 transitions, 443 flow [2024-06-03 22:30:49,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 66 transitions, 419 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-03 22:30:49,038 INFO L231 Difference]: Finished difference. Result has 101 places, 47 transitions, 253 flow [2024-06-03 22:30:49,038 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=253, PETRI_PLACES=101, PETRI_TRANSITIONS=47} [2024-06-03 22:30:49,038 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 71 predicate places. [2024-06-03 22:30:49,038 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 47 transitions, 253 flow [2024-06-03 22:30:49,039 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-03 22:30:49,039 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:30:49,039 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-03 22:30:49,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2024-06-03 22:30:49,039 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-03 22:30:49,039 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:30:49,039 INFO L85 PathProgramCache]: Analyzing trace with hash 773156976, now seen corresponding path program 11 times [2024-06-03 22:30:49,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:30:49,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5862801] [2024-06-03 22:30:49,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:30:49,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:30:49,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:30:54,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:30:54,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:30:54,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5862801] [2024-06-03 22:30:54,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5862801] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:30:54,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:30:54,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-03 22:30:54,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355829239] [2024-06-03 22:30:54,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:30:54,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-03 22:30:54,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:30:54,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-03 22:30:54,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-06-03 22:30:55,075 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:30:55,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 47 transitions, 253 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-03 22:30:55,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:30:55,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:30:55,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:30:55,299 INFO L124 PetriNetUnfolderBase]: 138/300 cut-off events. [2024-06-03 22:30:55,299 INFO L125 PetriNetUnfolderBase]: For 10750/10750 co-relation queries the response was YES. [2024-06-03 22:30:55,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1333 conditions, 300 events. 138/300 cut-off events. For 10750/10750 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1177 event pairs, 55 based on Foata normal form. 6/305 useless extension candidates. Maximal degree in co-relation 1294. Up to 233 conditions per place. [2024-06-03 22:30:55,300 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 40 selfloop transitions, 9 changer transitions 9/60 dead transitions. [2024-06-03 22:30:55,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 60 transitions, 397 flow [2024-06-03 22:30:55,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:30:55,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:30:55,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 93 transitions. [2024-06-03 22:30:55,301 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3 [2024-06-03 22:30:55,301 INFO L175 Difference]: Start difference. First operand has 101 places, 47 transitions, 253 flow. Second operand 10 states and 93 transitions. [2024-06-03 22:30:55,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 60 transitions, 397 flow [2024-06-03 22:30:55,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 60 transitions, 375 flow, removed 5 selfloop flow, removed 10 redundant places. [2024-06-03 22:30:55,307 INFO L231 Difference]: Finished difference. Result has 92 places, 44 transitions, 238 flow [2024-06-03 22:30:55,307 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=238, PETRI_PLACES=92, PETRI_TRANSITIONS=44} [2024-06-03 22:30:55,307 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 62 predicate places. [2024-06-03 22:30:55,307 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 44 transitions, 238 flow [2024-06-03 22:30:55,307 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-03 22:30:55,307 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:30:55,307 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:30:55,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2024-06-03 22:30:55,307 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-03 22:30:55,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:30:55,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1061474448, now seen corresponding path program 12 times [2024-06-03 22:30:55,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:30:55,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882458920] [2024-06-03 22:30:55,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:30:55,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:30:55,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:31: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-03 22:31:00,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:31:00,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882458920] [2024-06-03 22:31:00,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882458920] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:31:00,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:31:00,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:31:00,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963714642] [2024-06-03 22:31:00,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:31:00,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:31:00,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:31:00,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:31:00,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:31:00,335 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:31:00,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 44 transitions, 238 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-03 22:31:00,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:31:00,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:31:00,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:31:00,563 INFO L124 PetriNetUnfolderBase]: 128/282 cut-off events. [2024-06-03 22:31:00,563 INFO L125 PetriNetUnfolderBase]: For 8052/8052 co-relation queries the response was YES. [2024-06-03 22:31:00,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1217 conditions, 282 events. 128/282 cut-off events. For 8052/8052 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1099 event pairs, 47 based on Foata normal form. 6/287 useless extension candidates. Maximal degree in co-relation 1182. Up to 215 conditions per place. [2024-06-03 22:31:00,564 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 36 selfloop transitions, 7 changer transitions 14/59 dead transitions. [2024-06-03 22:31:00,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 59 transitions, 384 flow [2024-06-03 22:31:00,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:31:00,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:31:00,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 99 transitions. [2024-06-03 22:31:00,565 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2903225806451613 [2024-06-03 22:31:00,565 INFO L175 Difference]: Start difference. First operand has 92 places, 44 transitions, 238 flow. Second operand 11 states and 99 transitions. [2024-06-03 22:31:00,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 59 transitions, 384 flow [2024-06-03 22:31:00,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 59 transitions, 360 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-03 22:31:00,571 INFO L231 Difference]: Finished difference. Result has 89 places, 40 transitions, 213 flow [2024-06-03 22:31:00,571 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=213, PETRI_PLACES=89, PETRI_TRANSITIONS=40} [2024-06-03 22:31:00,571 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 59 predicate places. [2024-06-03 22:31:00,571 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 40 transitions, 213 flow [2024-06-03 22:31:00,571 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-03 22:31:00,571 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:31:00,571 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-03 22:31:00,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2024-06-03 22:31:00,572 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-03 22:31:00,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:31:00,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1293519962, now seen corresponding path program 13 times [2024-06-03 22:31:00,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:31:00,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200852250] [2024-06-03 22:31:00,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:31:00,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:31:00,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:31:05,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:31:05,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:31:05,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200852250] [2024-06-03 22:31:05,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200852250] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:31:05,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:31:05,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-03 22:31:05,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50719221] [2024-06-03 22:31:05,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:31:05,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-03 22:31:05,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:31:05,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-03 22:31:05,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-06-03 22:31:05,753 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:31:05,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 40 transitions, 213 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-03 22:31:05,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:31:05,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:31:05,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:31:06,012 INFO L124 PetriNetUnfolderBase]: 99/223 cut-off events. [2024-06-03 22:31:06,012 INFO L125 PetriNetUnfolderBase]: For 5146/5146 co-relation queries the response was YES. [2024-06-03 22:31:06,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 889 conditions, 223 events. 99/223 cut-off events. For 5146/5146 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 782 event pairs, 34 based on Foata normal form. 6/228 useless extension candidates. Maximal degree in co-relation 856. Up to 166 conditions per place. [2024-06-03 22:31:06,013 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 30 selfloop transitions, 6 changer transitions 15/53 dead transitions. [2024-06-03 22:31:06,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 53 transitions, 343 flow [2024-06-03 22:31:06,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:31:06,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:31:06,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 96 transitions. [2024-06-03 22:31:06,024 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.28152492668621704 [2024-06-03 22:31:06,024 INFO L175 Difference]: Start difference. First operand has 89 places, 40 transitions, 213 flow. Second operand 11 states and 96 transitions. [2024-06-03 22:31:06,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 53 transitions, 343 flow [2024-06-03 22:31:06,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 53 transitions, 321 flow, removed 4 selfloop flow, removed 10 redundant places. [2024-06-03 22:31:06,029 INFO L231 Difference]: Finished difference. Result has 83 places, 35 transitions, 182 flow [2024-06-03 22:31:06,029 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=182, PETRI_PLACES=83, PETRI_TRANSITIONS=35} [2024-06-03 22:31:06,029 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 53 predicate places. [2024-06-03 22:31:06,029 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 35 transitions, 182 flow [2024-06-03 22:31:06,029 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-03 22:31:06,029 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:31:06,030 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-03 22:31:06,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2024-06-03 22:31:06,030 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-03 22:31:06,030 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:31:06,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1317593096, now seen corresponding path program 14 times [2024-06-03 22:31:06,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:31:06,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535774456] [2024-06-03 22:31:06,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:31:06,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:31:06,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:31:11,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:31:11,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:31:11,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535774456] [2024-06-03 22:31:11,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535774456] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:31:11,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:31:11,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-03 22:31:11,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985195926] [2024-06-03 22:31:11,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:31:11,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-03 22:31:11,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:31:11,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-03 22:31:11,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-06-03 22:31:11,840 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:31:11,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 35 transitions, 182 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-03 22:31:11,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:31:11,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:31:11,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:31:12,057 INFO L124 PetriNetUnfolderBase]: 89/201 cut-off events. [2024-06-03 22:31:12,057 INFO L125 PetriNetUnfolderBase]: For 3932/3932 co-relation queries the response was YES. [2024-06-03 22:31:12,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 786 conditions, 201 events. 89/201 cut-off events. For 3932/3932 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 672 event pairs, 32 based on Foata normal form. 6/206 useless extension candidates. Maximal degree in co-relation 756. Up to 127 conditions per place. [2024-06-03 22:31:12,058 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 27 selfloop transitions, 9 changer transitions 12/50 dead transitions. [2024-06-03 22:31:12,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 50 transitions, 310 flow [2024-06-03 22:31:12,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:31:12,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:31:12,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 100 transitions. [2024-06-03 22:31:12,058 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2932551319648094 [2024-06-03 22:31:12,058 INFO L175 Difference]: Start difference. First operand has 83 places, 35 transitions, 182 flow. Second operand 11 states and 100 transitions. [2024-06-03 22:31:12,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 50 transitions, 310 flow [2024-06-03 22:31:12,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 50 transitions, 290 flow, removed 4 selfloop flow, removed 9 redundant places. [2024-06-03 22:31:12,061 INFO L231 Difference]: Finished difference. Result has 74 places, 31 transitions, 163 flow [2024-06-03 22:31:12,061 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=163, PETRI_PLACES=74, PETRI_TRANSITIONS=31} [2024-06-03 22:31:12,062 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 44 predicate places. [2024-06-03 22:31:12,062 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 31 transitions, 163 flow [2024-06-03 22:31:12,062 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-03 22:31:12,062 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:31:12,062 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-03 22:31:12,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2024-06-03 22:31:12,062 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-03 22:31:12,062 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:31:12,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1118291306, now seen corresponding path program 15 times [2024-06-03 22:31:12,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:31:12,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375947817] [2024-06-03 22:31:12,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:31:12,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:31:12,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:31:16,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:31:16,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:31:16,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375947817] [2024-06-03 22:31:16,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375947817] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:31:16,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:31:16,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-03 22:31:16,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574952097] [2024-06-03 22:31:16,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:31:16,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-03 22:31:16,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:31:16,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-03 22:31:16,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-06-03 22:31:16,841 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:31:16,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 31 transitions, 163 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-03 22:31:16,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:31:16,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:31:16,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:31:17,075 INFO L124 PetriNetUnfolderBase]: 65/149 cut-off events. [2024-06-03 22:31:17,075 INFO L125 PetriNetUnfolderBase]: For 1944/1944 co-relation queries the response was YES. [2024-06-03 22:31:17,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 521 conditions, 149 events. 65/149 cut-off events. For 1944/1944 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 420 event pairs, 19 based on Foata normal form. 6/154 useless extension candidates. Maximal degree in co-relation 494. Up to 84 conditions per place. [2024-06-03 22:31:17,076 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 24 selfloop transitions, 8 changer transitions 11/45 dead transitions. [2024-06-03 22:31:17,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 45 transitions, 279 flow [2024-06-03 22:31:17,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:31:17,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:31:17,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 97 transitions. [2024-06-03 22:31:17,076 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2844574780058651 [2024-06-03 22:31:17,077 INFO L175 Difference]: Start difference. First operand has 74 places, 31 transitions, 163 flow. Second operand 11 states and 97 transitions. [2024-06-03 22:31:17,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 45 transitions, 279 flow [2024-06-03 22:31:17,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 45 transitions, 253 flow, removed 4 selfloop flow, removed 11 redundant places. [2024-06-03 22:31:17,078 INFO L231 Difference]: Finished difference. Result has 68 places, 28 transitions, 141 flow [2024-06-03 22:31:17,078 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=141, PETRI_PLACES=68, PETRI_TRANSITIONS=28} [2024-06-03 22:31:17,078 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 38 predicate places. [2024-06-03 22:31:17,078 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 28 transitions, 141 flow [2024-06-03 22:31:17,078 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-03 22:31:17,079 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:31:17,079 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-03 22:31:17,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2024-06-03 22:31:17,079 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-03 22:31:17,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:31:17,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1118147156, now seen corresponding path program 16 times [2024-06-03 22:31:17,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:31:17,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566209546] [2024-06-03 22:31:17,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:31:17,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:31:17,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:31:22,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:31:22,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:31:22,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566209546] [2024-06-03 22:31:22,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566209546] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:31:22,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:31:22,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:31:22,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96649770] [2024-06-03 22:31:22,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:31:22,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:31:22,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:31:22,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:31:22,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:31:22,445 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:31:22,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 28 transitions, 141 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-03 22:31:22,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:31:22,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:31:22,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:31:22,647 INFO L124 PetriNetUnfolderBase]: 55/131 cut-off events. [2024-06-03 22:31:22,647 INFO L125 PetriNetUnfolderBase]: For 1346/1346 co-relation queries the response was YES. [2024-06-03 22:31:22,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 446 conditions, 131 events. 55/131 cut-off events. For 1346/1346 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 341 event pairs, 17 based on Foata normal form. 6/136 useless extension candidates. Maximal degree in co-relation 422. Up to 66 conditions per place. [2024-06-03 22:31:22,648 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 18 selfloop transitions, 4 changer transitions 18/42 dead transitions. [2024-06-03 22:31:22,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 42 transitions, 251 flow [2024-06-03 22:31:22,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:31:22,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:31:22,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 96 transitions. [2024-06-03 22:31:22,649 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.28152492668621704 [2024-06-03 22:31:22,649 INFO L175 Difference]: Start difference. First operand has 68 places, 28 transitions, 141 flow. Second operand 11 states and 96 transitions. [2024-06-03 22:31:22,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 42 transitions, 251 flow [2024-06-03 22:31:22,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 42 transitions, 229 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-03 22:31:22,650 INFO L231 Difference]: Finished difference. Result has 63 places, 22 transitions, 102 flow [2024-06-03 22:31:22,650 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=102, PETRI_PLACES=63, PETRI_TRANSITIONS=22} [2024-06-03 22:31:22,650 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 33 predicate places. [2024-06-03 22:31:22,650 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 22 transitions, 102 flow [2024-06-03 22:31:22,650 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-03 22:31:22,650 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:31:22,650 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-03 22:31:22,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124 [2024-06-03 22:31:22,650 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-03 22:31:22,651 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:31:22,651 INFO L85 PathProgramCache]: Analyzing trace with hash -879050978, now seen corresponding path program 17 times [2024-06-03 22:31:22,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:31:22,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322935947] [2024-06-03 22:31:22,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:31:22,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:31:22,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:31:27,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:31:27,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:31:27,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322935947] [2024-06-03 22:31:27,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322935947] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:31:27,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:31:27,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-03 22:31:27,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612587627] [2024-06-03 22:31:27,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:31:27,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-03 22:31:27,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:31:27,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-03 22:31:27,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-06-03 22:31:27,819 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-03 22:31:27,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 22 transitions, 102 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-03 22:31:27,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:31:27,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-03 22:31:27,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:31:27,967 INFO L124 PetriNetUnfolderBase]: 26/68 cut-off events. [2024-06-03 22:31:27,967 INFO L125 PetriNetUnfolderBase]: For 508/508 co-relation queries the response was YES. [2024-06-03 22:31:27,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194 conditions, 68 events. 26/68 cut-off events. For 508/508 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 103 event pairs, 0 based on Foata normal form. 6/73 useless extension candidates. Maximal degree in co-relation 172. Up to 24 conditions per place. [2024-06-03 22:31:27,968 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 0 selfloop transitions, 0 changer transitions 31/31 dead transitions. [2024-06-03 22:31:27,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 31 transitions, 152 flow [2024-06-03 22:31:27,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:31:27,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:31:27,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 85 transitions. [2024-06-03 22:31:27,968 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.24926686217008798 [2024-06-03 22:31:27,968 INFO L175 Difference]: Start difference. First operand has 63 places, 22 transitions, 102 flow. Second operand 11 states and 85 transitions. [2024-06-03 22:31:27,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 31 transitions, 152 flow [2024-06-03 22:31:27,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 31 transitions, 126 flow, removed 1 selfloop flow, removed 13 redundant places. [2024-06-03 22:31:27,969 INFO L231 Difference]: Finished difference. Result has 48 places, 0 transitions, 0 flow [2024-06-03 22:31:27,969 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=0, PETRI_PLACES=48, PETRI_TRANSITIONS=0} [2024-06-03 22:31:27,969 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 18 predicate places. [2024-06-03 22:31:27,969 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 0 transitions, 0 flow [2024-06-03 22:31:27,969 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-03 22:31:27,971 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 4 remaining) [2024-06-03 22:31:27,972 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 4 remaining) [2024-06-03 22:31:27,972 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-06-03 22:31:27,972 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-06-03 22:31:27,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable125 [2024-06-03 22:31:27,972 INFO L445 BasicCegarLoop]: Path program histogram: [19, 17, 16, 10, 10, 10, 6, 6, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:31:27,974 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-03 22:31:27,974 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-03 22:31:27,977 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-06-03 22:31:27,977 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-06-03 22:31:27,977 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.06 10:31:27 BasicIcfg [2024-06-03 22:31:27,978 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-03 22:31:27,978 INFO L158 Benchmark]: Toolchain (without parser) took 610606.45ms. Allocated memory was 161.5MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 98.6MB in the beginning and 629.9MB in the end (delta: -531.3MB). Peak memory consumption was 953.4MB. Max. memory is 16.1GB. [2024-06-03 22:31:27,978 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 161.5MB. Free memory is still 122.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-03 22:31:27,978 INFO L158 Benchmark]: Witness Parser took 0.14ms. Allocated memory is still 161.5MB. Free memory is still 106.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-03 22:31:27,978 INFO L158 Benchmark]: CACSL2BoogieTranslator took 706.86ms. Allocated memory is still 161.5MB. Free memory was 98.6MB in the beginning and 109.8MB in the end (delta: -11.2MB). Peak memory consumption was 38.5MB. Max. memory is 16.1GB. [2024-06-03 22:31:27,978 INFO L158 Benchmark]: Boogie Procedure Inliner took 101.86ms. Allocated memory is still 161.5MB. Free memory was 109.8MB in the beginning and 96.0MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-06-03 22:31:27,979 INFO L158 Benchmark]: Boogie Preprocessor took 104.25ms. Allocated memory is still 161.5MB. Free memory was 96.0MB in the beginning and 89.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-06-03 22:31:27,979 INFO L158 Benchmark]: RCFGBuilder took 983.13ms. Allocated memory was 161.5MB in the beginning and 205.5MB in the end (delta: 44.0MB). Free memory was 89.7MB in the beginning and 120.8MB in the end (delta: -31.1MB). Peak memory consumption was 79.7MB. Max. memory is 16.1GB. [2024-06-03 22:31:27,979 INFO L158 Benchmark]: TraceAbstraction took 608705.52ms. Allocated memory was 205.5MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 120.8MB in the beginning and 629.9MB in the end (delta: -509.1MB). Peak memory consumption was 929.5MB. Max. memory is 16.1GB. [2024-06-03 22:31:27,980 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 161.5MB. Free memory is still 122.4MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.14ms. Allocated memory is still 161.5MB. Free memory is still 106.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 706.86ms. Allocated memory is still 161.5MB. Free memory was 98.6MB in the beginning and 109.8MB in the end (delta: -11.2MB). Peak memory consumption was 38.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 101.86ms. Allocated memory is still 161.5MB. Free memory was 109.8MB in the beginning and 96.0MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 104.25ms. Allocated memory is still 161.5MB. Free memory was 96.0MB in the beginning and 89.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 983.13ms. Allocated memory was 161.5MB in the beginning and 205.5MB in the end (delta: 44.0MB). Free memory was 89.7MB in the beginning and 120.8MB in the end (delta: -31.1MB). Peak memory consumption was 79.7MB. Max. memory is 16.1GB. * TraceAbstraction took 608705.52ms. Allocated memory was 205.5MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 120.8MB in the beginning and 629.9MB in the end (delta: -509.1MB). Peak memory consumption was 929.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 813]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 814]: 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, 49 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: 608.6s, OverallIterations: 126, TraceHistogramMax: 1, PathProgramHistogramMax: 19, EmptinessCheckTime: 0.0s, AutomataDifference: 62.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6300 SdHoareTripleChecker+Valid, 34.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5433 mSDsluCounter, 1955 SdHoareTripleChecker+Invalid, 30.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1411 mSDsCounter, 1180 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 45216 IncrementalHoareTripleChecker+Invalid, 46396 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1180 mSolverCounterUnsat, 544 mSDtfsCounter, 45216 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1360 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1334 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2263 ImplicationChecksByTransitivity, 31.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1780occurred in iteration=67, InterpolantAutomatonStates: 1200, 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, 3.6s SatisfiabilityAnalysisTime, 541.0s InterpolantComputationTime, 2096 NumberOfCodeBlocks, 2096 NumberOfCodeBlocksAsserted, 126 NumberOfCheckSat, 1970 ConstructedInterpolants, 0 QuantifiedInterpolants, 85472 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 126 InterpolantComputations, 126 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-03 22:31:28,058 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