/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/parallel-ticket-5.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 04:25:53,648 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 04:25:53,649 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 04:25:53,670 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 04:25:53,670 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 04:25:53,671 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 04:25:53,672 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 04:25:53,673 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 04:25:53,674 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 04:25:53,675 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 04:25:53,676 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 04:25:53,678 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 04:25:53,678 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 04:25:53,683 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 04:25:53,684 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 04:25:53,686 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 04:25:53,687 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 04:25:53,688 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 04:25:53,691 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 04:25:53,693 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 04:25:53,694 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 04:25:53,697 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 04:25:53,698 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 04:25:53,698 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 04:25:53,700 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 04:25:53,700 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 04:25:53,700 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 04:25:53,701 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 04:25:53,701 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 04:25:53,702 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 04:25:53,702 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 04:25:53,702 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 04:25:53,703 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 04:25:53,703 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 04:25:53,704 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 04:25:53,704 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 04:25:53,704 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 04:25:53,705 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 04:25:53,705 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 04:25:53,705 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 04:25:53,706 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 04:25:53,713 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 04:25:53,737 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 04:25:53,737 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 04:25:53,739 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 04:25:53,739 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 04:25:53,751 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 04:25:53,751 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 04:25:53,751 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 04:25:53,751 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 04:25:53,752 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 04:25:53,752 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 04:25:53,752 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 04:25:53,753 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 04:25:53,753 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 04:25:53,753 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 04:25:53,753 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 04:25:53,753 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 04:25:53,753 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 04:25:53,753 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 04:25:53,753 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 04:25:53,753 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 04:25:53,753 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 04:25:53,754 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 04:25:53,754 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 04:25:53,754 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 04:25:53,754 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 04:25:53,754 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 04:25:53,754 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 04:25:53,754 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 04:25:53,754 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.traceabstraction: Use on-demand Petri net difference -> true [2022-12-13 04:25:53,999 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 04:25:54,029 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 04:25:54,031 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 04:25:54,032 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 04:25:54,032 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 04:25:54,034 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-ticket-5.wvr.c [2022-12-13 04:25:55,057 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 04:25:55,341 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 04:25:55,341 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-ticket-5.wvr.c [2022-12-13 04:25:55,365 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/354385713/fbd17cdf4e1543cb882c151426c35d3f/FLAG942a57541 [2022-12-13 04:25:55,381 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/354385713/fbd17cdf4e1543cb882c151426c35d3f [2022-12-13 04:25:55,383 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 04:25:55,384 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 04:25:55,385 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 04:25:55,385 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 04:25:55,388 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 04:25:55,388 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:25:55" (1/1) ... [2022-12-13 04:25:55,389 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d7ece91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:25:55, skipping insertion in model container [2022-12-13 04:25:55,389 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:25:55" (1/1) ... [2022-12-13 04:25:55,394 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 04:25:55,420 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 04:25:55,525 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:55,527 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:55,527 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:55,528 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:55,528 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:55,530 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:55,530 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:55,531 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:55,532 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:55,532 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:55,534 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:55,534 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:55,534 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:55,535 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:55,535 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:55,536 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:55,536 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:55,536 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:55,537 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:55,537 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:55,537 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:55,538 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:55,538 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:55,539 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:55,539 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:55,539 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:55,545 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:55,547 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:55,547 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:55,548 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:55,548 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:55,549 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:55,549 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:55,550 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:55,550 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:55,550 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:55,551 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:55,551 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:55,551 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:55,551 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:55,551 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:55,552 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:55,558 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-ticket-5.wvr.c[3963,3976] [2022-12-13 04:25:55,562 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 04:25:55,570 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 04:25:55,588 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:55,589 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:55,589 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:55,589 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:55,590 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:55,590 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:55,590 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:55,592 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:55,592 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:55,592 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:55,593 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:55,594 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:55,595 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:55,595 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:55,595 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:55,596 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:55,596 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:55,597 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:55,599 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:55,600 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:55,600 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:55,601 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:55,601 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:55,601 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:55,602 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:55,602 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:55,603 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:55,603 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:55,603 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:55,603 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:55,603 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:55,604 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:55,604 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:55,604 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:55,604 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:55,605 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:55,605 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:55,605 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:55,605 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:55,605 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:55,605 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:25:55,606 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:25:55,610 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-ticket-5.wvr.c[3963,3976] [2022-12-13 04:25:55,611 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 04:25:55,620 INFO L208 MainTranslator]: Completed translation [2022-12-13 04:25:55,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:25:55 WrapperNode [2022-12-13 04:25:55,621 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 04:25:55,621 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 04:25:55,621 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 04:25:55,621 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 04:25:55,626 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:25:55" (1/1) ... [2022-12-13 04:25:55,631 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:25:55" (1/1) ... [2022-12-13 04:25:55,661 INFO L138 Inliner]: procedures = 24, calls = 85, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 238 [2022-12-13 04:25:55,661 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 04:25:55,662 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 04:25:55,662 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 04:25:55,662 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 04:25:55,668 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:25:55" (1/1) ... [2022-12-13 04:25:55,669 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:25:55" (1/1) ... [2022-12-13 04:25:55,678 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:25:55" (1/1) ... [2022-12-13 04:25:55,678 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:25:55" (1/1) ... [2022-12-13 04:25:55,682 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:25:55" (1/1) ... [2022-12-13 04:25:55,683 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:25:55" (1/1) ... [2022-12-13 04:25:55,684 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:25:55" (1/1) ... [2022-12-13 04:25:55,685 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:25:55" (1/1) ... [2022-12-13 04:25:55,707 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 04:25:55,708 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 04:25:55,708 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 04:25:55,708 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 04:25:55,709 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:25:55" (1/1) ... [2022-12-13 04:25:55,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 04:25:55,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:25:55,755 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 04:25:55,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 04:25:55,788 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 04:25:55,788 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 04:25:55,789 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 04:25:55,789 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 04:25:55,789 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 04:25:55,790 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-13 04:25:55,790 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-13 04:25:55,790 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-12-13 04:25:55,790 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-12-13 04:25:55,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 04:25:55,790 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2022-12-13 04:25:55,790 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2022-12-13 04:25:55,790 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 04:25:55,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 04:25:55,790 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 04:25:55,791 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 04:25:55,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 04:25:55,791 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 04:25:55,791 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 04:25:55,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 04:25:55,792 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 04:25:55,882 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 04:25:55,883 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 04:25:56,176 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 04:25:56,261 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 04:25:56,261 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 04:25:56,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:25:56 BoogieIcfgContainer [2022-12-13 04:25:56,263 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 04:25:56,265 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 04:25:56,265 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 04:25:56,267 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 04:25:56,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 04:25:55" (1/3) ... [2022-12-13 04:25:56,268 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@509e9884 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:25:56, skipping insertion in model container [2022-12-13 04:25:56,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:25:55" (2/3) ... [2022-12-13 04:25:56,268 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@509e9884 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:25:56, skipping insertion in model container [2022-12-13 04:25:56,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:25:56" (3/3) ... [2022-12-13 04:25:56,269 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-ticket-5.wvr.c [2022-12-13 04:25:56,281 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 04:25:56,281 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 04:25:56,281 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 04:25:56,360 INFO L144 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2022-12-13 04:25:56,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 172 places, 158 transitions, 356 flow [2022-12-13 04:25:56,517 INFO L130 PetriNetUnfolder]: 2/153 cut-off events. [2022-12-13 04:25:56,518 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-13 04:25:56,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174 conditions, 153 events. 2/153 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 63 event pairs, 0 based on Foata normal form. 0/150 useless extension candidates. Maximal degree in co-relation 115. Up to 2 conditions per place. [2022-12-13 04:25:56,521 INFO L82 GeneralOperation]: Start removeDead. Operand has 172 places, 158 transitions, 356 flow [2022-12-13 04:25:56,524 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 153 places, 139 transitions, 308 flow [2022-12-13 04:25:56,525 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:25:56,550 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 153 places, 139 transitions, 308 flow [2022-12-13 04:25:56,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 139 transitions, 308 flow [2022-12-13 04:25:56,598 INFO L130 PetriNetUnfolder]: 2/139 cut-off events. [2022-12-13 04:25:56,598 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-13 04:25:56,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 139 events. 2/139 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 62 event pairs, 0 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 115. Up to 2 conditions per place. [2022-12-13 04:25:56,605 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 153 places, 139 transitions, 308 flow [2022-12-13 04:25:56,605 INFO L226 LiptonReduction]: Number of co-enabled transitions 2082 [2022-12-13 04:26:01,983 INFO L241 LiptonReduction]: Total number of compositions: 107 [2022-12-13 04:26:01,996 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 04:26:02,001 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=REPEATED_LIPTON_PN, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@39614410, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 04:26:02,002 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 04:26:02,010 INFO L130 PetriNetUnfolder]: 0/31 cut-off events. [2022-12-13 04:26:02,010 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-13 04:26:02,010 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:26:02,011 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:26:02,011 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 04:26:02,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:26:02,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1497497654, now seen corresponding path program 1 times [2022-12-13 04:26:02,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:26:02,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128791134] [2022-12-13 04:26:02,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:26:02,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:26:02,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:26:03,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:26:03,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:26:03,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128791134] [2022-12-13 04:26:03,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128791134] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:26:03,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:26:03,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 04:26:03,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31807189] [2022-12-13 04:26:03,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:26:03,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 04:26:03,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:26:03,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 04:26:03,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 04:26:03,350 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 04:26:03,351 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 32 transitions, 94 flow. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:26:03,351 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:26:03,351 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 04:26:03,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:26:04,094 INFO L130 PetriNetUnfolder]: 4951/6871 cut-off events. [2022-12-13 04:26:04,094 INFO L131 PetriNetUnfolder]: For 594/594 co-relation queries the response was YES. [2022-12-13 04:26:04,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14429 conditions, 6871 events. 4951/6871 cut-off events. For 594/594 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 30986 event pairs, 2366 based on Foata normal form. 1/6872 useless extension candidates. Maximal degree in co-relation 14000. Up to 4566 conditions per place. [2022-12-13 04:26:04,137 INFO L137 encePairwiseOnDemand]: 19/32 looper letters, 70 selfloop transitions, 16 changer transitions 22/108 dead transitions. [2022-12-13 04:26:04,137 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 108 transitions, 513 flow [2022-12-13 04:26:04,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 04:26:04,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 04:26:04,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 109 transitions. [2022-12-13 04:26:04,146 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.48660714285714285 [2022-12-13 04:26:04,148 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 6 predicate places. [2022-12-13 04:26:04,149 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 108 transitions, 513 flow [2022-12-13 04:26:04,169 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 86 transitions, 404 flow [2022-12-13 04:26:04,189 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:26:04,190 INFO L89 Accepts]: Start accepts. Operand has 53 places, 86 transitions, 404 flow [2022-12-13 04:26:04,193 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:26:04,193 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:26:04,193 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 86 transitions, 404 flow [2022-12-13 04:26:04,196 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 86 transitions, 404 flow [2022-12-13 04:26:04,196 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:26:04,276 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:26:04,278 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 89 [2022-12-13 04:26:04,278 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 86 transitions, 404 flow [2022-12-13 04:26:04,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:26:04,278 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:26:04,278 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:26:04,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 04:26:04,278 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 04:26:04,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:26:04,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1965521226, now seen corresponding path program 2 times [2022-12-13 04:26:04,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:26:04,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244989029] [2022-12-13 04:26:04,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:26:04,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:26:04,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:26:04,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:26:04,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:26:04,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244989029] [2022-12-13 04:26:04,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244989029] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:26:04,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:26:04,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 04:26:04,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320095295] [2022-12-13 04:26:04,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:26:04,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 04:26:04,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:26:04,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 04:26:04,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-13 04:26:04,712 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-13 04:26:04,713 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 86 transitions, 404 flow. Second operand has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:26:04,713 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:26:04,713 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-13 04:26:04,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:26:05,341 INFO L130 PetriNetUnfolder]: 5549/7757 cut-off events. [2022-12-13 04:26:05,342 INFO L131 PetriNetUnfolder]: For 756/756 co-relation queries the response was YES. [2022-12-13 04:26:05,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24051 conditions, 7757 events. 5549/7757 cut-off events. For 756/756 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 37363 event pairs, 676 based on Foata normal form. 1/7758 useless extension candidates. Maximal degree in co-relation 23418. Up to 6369 conditions per place. [2022-12-13 04:26:05,373 INFO L137 encePairwiseOnDemand]: 25/33 looper letters, 125 selfloop transitions, 24 changer transitions 14/163 dead transitions. [2022-12-13 04:26:05,373 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 163 transitions, 1095 flow [2022-12-13 04:26:05,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 04:26:05,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 04:26:05,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 111 transitions. [2022-12-13 04:26:05,375 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5606060606060606 [2022-12-13 04:26:05,375 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 10 predicate places. [2022-12-13 04:26:05,375 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 163 transitions, 1095 flow [2022-12-13 04:26:05,396 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 149 transitions, 993 flow [2022-12-13 04:26:05,416 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:26:05,416 INFO L89 Accepts]: Start accepts. Operand has 58 places, 149 transitions, 993 flow [2022-12-13 04:26:05,418 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:26:05,418 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:26:05,418 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 149 transitions, 993 flow [2022-12-13 04:26:05,420 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 149 transitions, 993 flow [2022-12-13 04:26:05,420 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:26:05,425 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:26:05,426 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-13 04:26:05,426 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 149 transitions, 993 flow [2022-12-13 04:26:05,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:26:05,426 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:26:05,426 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:26:05,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 04:26:05,427 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 04:26:05,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:26:05,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1427135426, now seen corresponding path program 3 times [2022-12-13 04:26:05,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:26:05,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839904044] [2022-12-13 04:26:05,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:26:05,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:26:05,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:26:05,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:26:05,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:26:05,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839904044] [2022-12-13 04:26:05,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839904044] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:26:05,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:26:05,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 04:26:05,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859040892] [2022-12-13 04:26:05,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:26:05,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 04:26:05,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:26:05,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 04:26:05,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 04:26:05,594 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 04:26:05,594 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 149 transitions, 993 flow. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:26:05,594 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:26:05,594 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 04:26:05,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:26:06,168 INFO L130 PetriNetUnfolder]: 4498/6315 cut-off events. [2022-12-13 04:26:06,168 INFO L131 PetriNetUnfolder]: For 417/417 co-relation queries the response was YES. [2022-12-13 04:26:06,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25876 conditions, 6315 events. 4498/6315 cut-off events. For 417/417 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 30089 event pairs, 444 based on Foata normal form. 60/6375 useless extension candidates. Maximal degree in co-relation 25340. Up to 5945 conditions per place. [2022-12-13 04:26:06,194 INFO L137 encePairwiseOnDemand]: 22/32 looper letters, 185 selfloop transitions, 20 changer transitions 0/205 dead transitions. [2022-12-13 04:26:06,194 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 205 transitions, 1775 flow [2022-12-13 04:26:06,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 04:26:06,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 04:26:06,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2022-12-13 04:26:06,195 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.475 [2022-12-13 04:26:06,196 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 14 predicate places. [2022-12-13 04:26:06,196 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 205 transitions, 1775 flow [2022-12-13 04:26:06,216 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 205 transitions, 1775 flow [2022-12-13 04:26:06,234 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:26:06,234 INFO L89 Accepts]: Start accepts. Operand has 62 places, 205 transitions, 1775 flow [2022-12-13 04:26:06,236 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:26:06,236 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:26:06,236 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 205 transitions, 1775 flow [2022-12-13 04:26:06,238 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 205 transitions, 1775 flow [2022-12-13 04:26:06,238 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:26:06,301 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:26:06,301 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 67 [2022-12-13 04:26:06,301 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 205 transitions, 1779 flow [2022-12-13 04:26:06,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:26:06,302 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:26:06,302 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:26:06,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 04:26:06,302 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 04:26:06,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:26:06,302 INFO L85 PathProgramCache]: Analyzing trace with hash 65350092, now seen corresponding path program 4 times [2022-12-13 04:26:06,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:26:06,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849914163] [2022-12-13 04:26:06,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:26:06,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:26:06,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:26:06,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:26:06,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:26:06,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849914163] [2022-12-13 04:26:06,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849914163] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:26:06,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:26:06,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 04:26:06,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012999661] [2022-12-13 04:26:06,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:26:06,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 04:26:06,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:26:06,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 04:26:06,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 04:26:06,476 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-13 04:26:06,476 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 205 transitions, 1779 flow. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:26:06,476 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:26:06,476 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-13 04:26:06,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:26:06,987 INFO L130 PetriNetUnfolder]: 4350/6141 cut-off events. [2022-12-13 04:26:06,988 INFO L131 PetriNetUnfolder]: For 400/400 co-relation queries the response was YES. [2022-12-13 04:26:06,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31305 conditions, 6141 events. 4350/6141 cut-off events. For 400/400 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 29514 event pairs, 402 based on Foata normal form. 56/6197 useless extension candidates. Maximal degree in co-relation 30658. Up to 5801 conditions per place. [2022-12-13 04:26:07,018 INFO L137 encePairwiseOnDemand]: 24/33 looper letters, 213 selfloop transitions, 26 changer transitions 0/239 dead transitions. [2022-12-13 04:26:07,018 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 239 transitions, 2549 flow [2022-12-13 04:26:07,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 04:26:07,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 04:26:07,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2022-12-13 04:26:07,019 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.43636363636363634 [2022-12-13 04:26:07,020 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 18 predicate places. [2022-12-13 04:26:07,020 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 239 transitions, 2549 flow [2022-12-13 04:26:07,044 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 239 transitions, 2549 flow [2022-12-13 04:26:07,068 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:26:07,068 INFO L89 Accepts]: Start accepts. Operand has 66 places, 239 transitions, 2549 flow [2022-12-13 04:26:07,069 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:26:07,070 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:26:07,070 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 239 transitions, 2549 flow [2022-12-13 04:26:07,072 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 239 transitions, 2549 flow [2022-12-13 04:26:07,072 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:26:07,166 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:26:07,167 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-13 04:26:07,168 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 239 transitions, 2555 flow [2022-12-13 04:26:07,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:26:07,168 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:26:07,168 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:26:07,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 04:26:07,168 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 04:26:07,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:26:07,168 INFO L85 PathProgramCache]: Analyzing trace with hash 2031609760, now seen corresponding path program 5 times [2022-12-13 04:26:07,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:26:07,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457311573] [2022-12-13 04:26:07,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:26:07,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:26:07,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:26:07,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:26:07,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:26:07,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457311573] [2022-12-13 04:26:07,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457311573] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:26:07,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:26:07,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 04:26:07,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838865451] [2022-12-13 04:26:07,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:26:07,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 04:26:07,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:26:07,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 04:26:07,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-12-13 04:26:07,385 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-13 04:26:07,385 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 239 transitions, 2555 flow. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:26:07,385 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:26:07,385 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-13 04:26:07,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:26:08,372 INFO L130 PetriNetUnfolder]: 4973/7066 cut-off events. [2022-12-13 04:26:08,372 INFO L131 PetriNetUnfolder]: For 422/422 co-relation queries the response was YES. [2022-12-13 04:26:08,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43035 conditions, 7066 events. 4973/7066 cut-off events. For 422/422 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 35272 event pairs, 392 based on Foata normal form. 130/7196 useless extension candidates. Maximal degree in co-relation 42269. Up to 6640 conditions per place. [2022-12-13 04:26:08,413 INFO L137 encePairwiseOnDemand]: 22/33 looper letters, 322 selfloop transitions, 215 changer transitions 0/537 dead transitions. [2022-12-13 04:26:08,414 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 537 transitions, 6684 flow [2022-12-13 04:26:08,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 04:26:08,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-13 04:26:08,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 188 transitions. [2022-12-13 04:26:08,416 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3164983164983165 [2022-12-13 04:26:08,416 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 35 predicate places. [2022-12-13 04:26:08,416 INFO L82 GeneralOperation]: Start removeDead. Operand has 83 places, 537 transitions, 6684 flow [2022-12-13 04:26:08,452 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 537 transitions, 6684 flow [2022-12-13 04:26:08,481 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:26:08,482 INFO L89 Accepts]: Start accepts. Operand has 83 places, 537 transitions, 6684 flow [2022-12-13 04:26:08,486 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:26:08,486 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:26:08,486 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 537 transitions, 6684 flow [2022-12-13 04:26:08,494 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 537 transitions, 6684 flow [2022-12-13 04:26:08,494 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:26:08,497 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:26:08,499 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-13 04:26:08,499 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 537 transitions, 6684 flow [2022-12-13 04:26:08,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:26:08,499 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:26:08,499 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:26:08,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 04:26:08,499 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 04:26:08,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:26:08,500 INFO L85 PathProgramCache]: Analyzing trace with hash -304416926, now seen corresponding path program 6 times [2022-12-13 04:26:08,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:26:08,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451093461] [2022-12-13 04:26:08,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:26:08,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:26:08,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:26:08,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:26:08,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:26:08,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451093461] [2022-12-13 04:26:08,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451093461] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:26:08,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:26:08,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 04:26:08,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802597821] [2022-12-13 04:26:08,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:26:08,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 04:26:08,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:26:08,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 04:26:08,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-13 04:26:08,743 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 04:26:08,743 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 537 transitions, 6684 flow. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:26:08,743 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:26:08,743 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 04:26:08,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:26:10,207 INFO L130 PetriNetUnfolder]: 8762/12551 cut-off events. [2022-12-13 04:26:10,208 INFO L131 PetriNetUnfolder]: For 775/775 co-relation queries the response was YES. [2022-12-13 04:26:10,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88872 conditions, 12551 events. 8762/12551 cut-off events. For 775/775 co-relation queries the response was YES. Maximal size of possible extension queue 646. Compared 69676 event pairs, 860 based on Foata normal form. 106/12657 useless extension candidates. Maximal degree in co-relation 87682. Up to 12079 conditions per place. [2022-12-13 04:26:10,343 INFO L137 encePairwiseOnDemand]: 21/32 looper letters, 519 selfloop transitions, 398 changer transitions 1/918 dead transitions. [2022-12-13 04:26:10,343 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 918 transitions, 13257 flow [2022-12-13 04:26:10,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 04:26:10,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 04:26:10,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 175 transitions. [2022-12-13 04:26:10,346 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4971590909090909 [2022-12-13 04:26:10,348 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 45 predicate places. [2022-12-13 04:26:10,348 INFO L82 GeneralOperation]: Start removeDead. Operand has 93 places, 918 transitions, 13257 flow [2022-12-13 04:26:10,399 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 93 places, 917 transitions, 13243 flow [2022-12-13 04:26:10,441 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:26:10,442 INFO L89 Accepts]: Start accepts. Operand has 93 places, 917 transitions, 13243 flow [2022-12-13 04:26:10,445 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:26:10,445 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:26:10,445 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 917 transitions, 13243 flow [2022-12-13 04:26:10,461 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 917 transitions, 13243 flow [2022-12-13 04:26:10,461 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:26:10,465 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:26:10,466 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 25 [2022-12-13 04:26:10,466 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 917 transitions, 13243 flow [2022-12-13 04:26:10,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:26:10,466 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:26:10,466 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:26:10,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 04:26:10,466 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 04:26:10,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:26:10,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1292324068, now seen corresponding path program 7 times [2022-12-13 04:26:10,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:26:10,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381727048] [2022-12-13 04:26:10,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:26:10,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:26:10,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:26:10,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:26:10,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:26:10,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381727048] [2022-12-13 04:26:10,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381727048] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:26:10,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:26:10,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 04:26:10,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871433649] [2022-12-13 04:26:10,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:26:10,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 04:26:10,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:26:10,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 04:26:10,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-13 04:26:10,640 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 04:26:10,640 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 917 transitions, 13243 flow. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:26:10,640 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:26:10,640 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 04:26:10,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:26:12,546 INFO L130 PetriNetUnfolder]: 8840/12689 cut-off events. [2022-12-13 04:26:12,547 INFO L131 PetriNetUnfolder]: For 767/767 co-relation queries the response was YES. [2022-12-13 04:26:12,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102528 conditions, 12689 events. 8840/12689 cut-off events. For 767/767 co-relation queries the response was YES. Maximal size of possible extension queue 650. Compared 70938 event pairs, 834 based on Foata normal form. 76/12765 useless extension candidates. Maximal degree in co-relation 101177. Up to 12191 conditions per place. [2022-12-13 04:26:12,622 INFO L137 encePairwiseOnDemand]: 22/32 looper letters, 731 selfloop transitions, 193 changer transitions 52/976 dead transitions. [2022-12-13 04:26:12,622 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 976 transitions, 16021 flow [2022-12-13 04:26:12,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 04:26:12,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 04:26:12,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 148 transitions. [2022-12-13 04:26:12,623 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.42045454545454547 [2022-12-13 04:26:12,623 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 55 predicate places. [2022-12-13 04:26:12,624 INFO L82 GeneralOperation]: Start removeDead. Operand has 103 places, 976 transitions, 16021 flow [2022-12-13 04:26:12,683 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 103 places, 924 transitions, 15153 flow [2022-12-13 04:26:12,737 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:26:12,737 INFO L89 Accepts]: Start accepts. Operand has 103 places, 924 transitions, 15153 flow [2022-12-13 04:26:12,741 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:26:12,742 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:26:12,742 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 924 transitions, 15153 flow [2022-12-13 04:26:12,753 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 924 transitions, 15153 flow [2022-12-13 04:26:12,753 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:26:12,760 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:26:12,761 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24 [2022-12-13 04:26:12,761 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 924 transitions, 15153 flow [2022-12-13 04:26:12,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:26:12,761 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:26:12,761 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:26:12,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 04:26:12,761 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 04:26:12,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:26:12,762 INFO L85 PathProgramCache]: Analyzing trace with hash -2072758574, now seen corresponding path program 8 times [2022-12-13 04:26:12,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:26:12,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896676953] [2022-12-13 04:26:12,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:26:12,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:26:12,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:26:13,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:26:13,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:26:13,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896676953] [2022-12-13 04:26:13,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896676953] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:26:13,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:26:13,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 04:26:13,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869846191] [2022-12-13 04:26:13,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:26:13,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 04:26:13,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:26:13,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 04:26:13,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 04:26:13,131 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 04:26:13,131 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 924 transitions, 15153 flow. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:26:13,131 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:26:13,131 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 04:26:13,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:26:14,976 INFO L130 PetriNetUnfolder]: 9019/12938 cut-off events. [2022-12-13 04:26:14,976 INFO L131 PetriNetUnfolder]: For 777/777 co-relation queries the response was YES. [2022-12-13 04:26:15,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117459 conditions, 12938 events. 9019/12938 cut-off events. For 777/777 co-relation queries the response was YES. Maximal size of possible extension queue 663. Compared 72550 event pairs, 872 based on Foata normal form. 150/13088 useless extension candidates. Maximal degree in co-relation 115947. Up to 12478 conditions per place. [2022-12-13 04:26:15,092 INFO L137 encePairwiseOnDemand]: 22/32 looper letters, 781 selfloop transitions, 186 changer transitions 52/1019 dead transitions. [2022-12-13 04:26:15,092 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 1019 transitions, 18732 flow [2022-12-13 04:26:15,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 04:26:15,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 04:26:15,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 126 transitions. [2022-12-13 04:26:15,094 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4375 [2022-12-13 04:26:15,096 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 63 predicate places. [2022-12-13 04:26:15,096 INFO L82 GeneralOperation]: Start removeDead. Operand has 111 places, 1019 transitions, 18732 flow [2022-12-13 04:26:15,170 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 967 transitions, 17772 flow [2022-12-13 04:26:15,246 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:26:15,246 INFO L89 Accepts]: Start accepts. Operand has 111 places, 967 transitions, 17772 flow [2022-12-13 04:26:15,257 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:26:15,257 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:26:15,257 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 967 transitions, 17772 flow [2022-12-13 04:26:15,271 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 967 transitions, 17772 flow [2022-12-13 04:26:15,271 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:26:15,277 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:26:15,277 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 31 [2022-12-13 04:26:15,277 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 967 transitions, 17772 flow [2022-12-13 04:26:15,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:26:15,278 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:26:15,278 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:26:15,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 04:26:15,278 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 04:26:15,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:26:15,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1979461608, now seen corresponding path program 9 times [2022-12-13 04:26:15,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:26:15,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006325529] [2022-12-13 04:26:15,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:26:15,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:26:15,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:26:15,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:26:15,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:26:15,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006325529] [2022-12-13 04:26:15,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006325529] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:26:15,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:26:15,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 04:26:15,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152100804] [2022-12-13 04:26:15,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:26:15,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 04:26:15,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:26:15,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 04:26:15,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 04:26:15,449 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 04:26:15,449 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 967 transitions, 17772 flow. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:26:15,449 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:26:15,449 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 04:26:15,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:26:18,366 INFO L130 PetriNetUnfolder]: 12115/17504 cut-off events. [2022-12-13 04:26:18,366 INFO L131 PetriNetUnfolder]: For 1088/1088 co-relation queries the response was YES. [2022-12-13 04:26:18,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 176366 conditions, 17504 events. 12115/17504 cut-off events. For 1088/1088 co-relation queries the response was YES. Maximal size of possible extension queue 941. Compared 104368 event pairs, 894 based on Foata normal form. 266/17770 useless extension candidates. Maximal degree in co-relation 174326. Up to 17108 conditions per place. [2022-12-13 04:26:18,481 INFO L137 encePairwiseOnDemand]: 21/32 looper letters, 805 selfloop transitions, 437 changer transitions 64/1306 dead transitions. [2022-12-13 04:26:18,481 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 1306 transitions, 26603 flow [2022-12-13 04:26:18,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 04:26:18,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 04:26:18,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 144 transitions. [2022-12-13 04:26:18,482 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-13 04:26:18,483 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 71 predicate places. [2022-12-13 04:26:18,483 INFO L82 GeneralOperation]: Start removeDead. Operand has 119 places, 1306 transitions, 26603 flow [2022-12-13 04:26:18,580 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 1242 transitions, 25293 flow [2022-12-13 04:26:18,826 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:26:18,826 INFO L89 Accepts]: Start accepts. Operand has 119 places, 1242 transitions, 25293 flow [2022-12-13 04:26:18,830 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:26:18,830 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:26:18,831 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 1242 transitions, 25293 flow [2022-12-13 04:26:18,849 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 1242 transitions, 25293 flow [2022-12-13 04:26:18,849 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:26:18,855 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:26:18,856 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 30 [2022-12-13 04:26:18,856 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 1242 transitions, 25293 flow [2022-12-13 04:26:18,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:26:18,856 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:26:18,856 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:26:18,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 04:26:18,856 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 04:26:18,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:26:18,857 INFO L85 PathProgramCache]: Analyzing trace with hash 81402584, now seen corresponding path program 10 times [2022-12-13 04:26:18,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:26:18,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880427613] [2022-12-13 04:26:18,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:26:18,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:26:18,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:26:19,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:26:19,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:26:19,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880427613] [2022-12-13 04:26:19,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880427613] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:26:19,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:26:19,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 04:26:19,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572987532] [2022-12-13 04:26:19,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:26:19,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 04:26:19,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:26:19,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 04:26:19,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 04:26:19,013 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 04:26:19,013 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 1242 transitions, 25293 flow. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:26:19,013 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:26:19,014 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 04:26:19,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:26:22,284 INFO L130 PetriNetUnfolder]: 11664/16867 cut-off events. [2022-12-13 04:26:22,284 INFO L131 PetriNetUnfolder]: For 1022/1022 co-relation queries the response was YES. [2022-12-13 04:26:22,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 186819 conditions, 16867 events. 11664/16867 cut-off events. For 1022/1022 co-relation queries the response was YES. Maximal size of possible extension queue 887. Compared 100143 event pairs, 838 based on Foata normal form. 180/17047 useless extension candidates. Maximal degree in co-relation 184674. Up to 16581 conditions per place. [2022-12-13 04:26:22,411 INFO L137 encePairwiseOnDemand]: 22/32 looper letters, 1016 selfloop transitions, 160 changer transitions 84/1260 dead transitions. [2022-12-13 04:26:22,411 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 1260 transitions, 28170 flow [2022-12-13 04:26:22,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 04:26:22,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 04:26:22,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 97 transitions. [2022-12-13 04:26:22,412 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4330357142857143 [2022-12-13 04:26:22,412 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 77 predicate places. [2022-12-13 04:26:22,412 INFO L82 GeneralOperation]: Start removeDead. Operand has 125 places, 1260 transitions, 28170 flow [2022-12-13 04:26:22,526 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 123 places, 1176 transitions, 26292 flow [2022-12-13 04:26:22,632 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:26:22,633 INFO L89 Accepts]: Start accepts. Operand has 123 places, 1176 transitions, 26292 flow [2022-12-13 04:26:22,638 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:26:22,638 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:26:22,639 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 1176 transitions, 26292 flow [2022-12-13 04:26:22,656 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 1176 transitions, 26292 flow [2022-12-13 04:26:22,656 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:26:22,662 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:26:22,663 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 31 [2022-12-13 04:26:22,663 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 1176 transitions, 26292 flow [2022-12-13 04:26:22,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:26:22,663 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:26:22,663 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:26:22,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 04:26:22,663 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 04:26:22,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:26:22,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1621489496, now seen corresponding path program 11 times [2022-12-13 04:26:22,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:26:22,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415616625] [2022-12-13 04:26:22,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:26:22,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:26:22,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:26:22,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:26:22,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:26:22,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415616625] [2022-12-13 04:26:22,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415616625] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:26:22,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:26:22,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 04:26:22,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956954362] [2022-12-13 04:26:22,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:26:22,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 04:26:22,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:26:22,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 04:26:22,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 04:26:22,804 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 04:26:22,804 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 1176 transitions, 26292 flow. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:26:22,804 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:26:22,804 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 04:26:22,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:26:26,138 INFO L130 PetriNetUnfolder]: 11063/16002 cut-off events. [2022-12-13 04:26:26,138 INFO L131 PetriNetUnfolder]: For 1035/1035 co-relation queries the response was YES. [2022-12-13 04:26:26,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193284 conditions, 16002 events. 11063/16002 cut-off events. For 1035/1035 co-relation queries the response was YES. Maximal size of possible extension queue 818. Compared 94109 event pairs, 914 based on Foata normal form. 140/16142 useless extension candidates. Maximal degree in co-relation 190950. Up to 15856 conditions per place. [2022-12-13 04:26:26,243 INFO L137 encePairwiseOnDemand]: 22/32 looper letters, 871 selfloop transitions, 143 changer transitions 84/1098 dead transitions. [2022-12-13 04:26:26,243 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 1098 transitions, 26763 flow [2022-12-13 04:26:26,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 04:26:26,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 04:26:26,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 88 transitions. [2022-12-13 04:26:26,259 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39285714285714285 [2022-12-13 04:26:26,260 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 74 predicate places. [2022-12-13 04:26:26,260 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 1098 transitions, 26763 flow [2022-12-13 04:26:26,376 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 94 places, 1014 transitions, 24723 flow [2022-12-13 04:26:26,481 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:26:26,481 INFO L89 Accepts]: Start accepts. Operand has 94 places, 1014 transitions, 24723 flow [2022-12-13 04:26:26,487 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:26:26,487 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:26:26,488 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 1014 transitions, 24723 flow [2022-12-13 04:26:26,499 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 1014 transitions, 24723 flow [2022-12-13 04:26:26,499 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:26:26,531 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:26:26,532 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 51 [2022-12-13 04:26:26,532 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 1014 transitions, 24723 flow [2022-12-13 04:26:26,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:26:26,532 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:26:26,532 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:26:26,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 04:26:26,533 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 04:26:26,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:26:26,533 INFO L85 PathProgramCache]: Analyzing trace with hash 367185100, now seen corresponding path program 12 times [2022-12-13 04:26:26,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:26:26,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361867622] [2022-12-13 04:26:26,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:26:26,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:26:26,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:26:26,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:26:26,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:26:26,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361867622] [2022-12-13 04:26:26,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361867622] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:26:26,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:26:26,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 04:26:26,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975059238] [2022-12-13 04:26:26,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:26:26,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 04:26:26,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:26:26,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 04:26:26,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 04:26:26,664 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 04:26:26,664 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 1014 transitions, 24723 flow. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:26:26,664 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:26:26,664 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 04:26:26,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:26:30,066 INFO L130 PetriNetUnfolder]: 12207/18040 cut-off events. [2022-12-13 04:26:30,066 INFO L131 PetriNetUnfolder]: For 1118/1118 co-relation queries the response was YES. [2022-12-13 04:26:30,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 235942 conditions, 18040 events. 12207/18040 cut-off events. For 1118/1118 co-relation queries the response was YES. Maximal size of possible extension queue 989. Compared 113400 event pairs, 760 based on Foata normal form. 472/18512 useless extension candidates. Maximal degree in co-relation 233160. Up to 18030 conditions per place. [2022-12-13 04:26:30,348 INFO L137 encePairwiseOnDemand]: 21/32 looper letters, 986 selfloop transitions, 467 changer transitions 0/1453 dead transitions. [2022-12-13 04:26:30,348 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 1453 transitions, 38315 flow [2022-12-13 04:26:30,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 04:26:30,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 04:26:30,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 136 transitions. [2022-12-13 04:26:30,349 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.53125 [2022-12-13 04:26:30,349 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 53 predicate places. [2022-12-13 04:26:30,350 INFO L82 GeneralOperation]: Start removeDead. Operand has 101 places, 1453 transitions, 38315 flow [2022-12-13 04:26:30,448 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 101 places, 1453 transitions, 38315 flow [2022-12-13 04:26:30,527 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:26:30,527 INFO L89 Accepts]: Start accepts. Operand has 101 places, 1453 transitions, 38315 flow [2022-12-13 04:26:30,535 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:26:30,535 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:26:30,535 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 1453 transitions, 38315 flow [2022-12-13 04:26:30,553 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 1453 transitions, 38315 flow [2022-12-13 04:26:30,554 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:26:30,559 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:26:30,560 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 33 [2022-12-13 04:26:30,560 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 1453 transitions, 38315 flow [2022-12-13 04:26:30,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:26:30,560 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:26:30,560 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:26:30,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 04:26:30,560 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 04:26:30,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:26:30,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1947481706, now seen corresponding path program 13 times [2022-12-13 04:26:30,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:26:30,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712450239] [2022-12-13 04:26:30,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:26:30,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:26:30,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:26:30,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:26:30,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:26:30,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712450239] [2022-12-13 04:26:30,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712450239] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:26:30,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:26:30,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 04:26:30,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283173708] [2022-12-13 04:26:30,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:26:30,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 04:26:30,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:26:30,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 04:26:30,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 04:26:30,716 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 04:26:30,716 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 1453 transitions, 38315 flow. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:26:30,716 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:26:30,716 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 04:26:30,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:26:35,163 INFO L130 PetriNetUnfolder]: 12358/18321 cut-off events. [2022-12-13 04:26:35,164 INFO L131 PetriNetUnfolder]: For 1126/1126 co-relation queries the response was YES. [2022-12-13 04:26:35,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 257917 conditions, 18321 events. 12358/18321 cut-off events. For 1126/1126 co-relation queries the response was YES. Maximal size of possible extension queue 1021. Compared 116242 event pairs, 718 based on Foata normal form. 154/18475 useless extension candidates. Maximal degree in co-relation 254926. Up to 18311 conditions per place. [2022-12-13 04:26:35,288 INFO L137 encePairwiseOnDemand]: 21/32 looper letters, 1017 selfloop transitions, 481 changer transitions 0/1498 dead transitions. [2022-12-13 04:26:35,288 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 1498 transitions, 42481 flow [2022-12-13 04:26:35,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 04:26:35,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 04:26:35,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 127 transitions. [2022-12-13 04:26:35,289 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.49609375 [2022-12-13 04:26:35,289 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 60 predicate places. [2022-12-13 04:26:35,289 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 1498 transitions, 42481 flow [2022-12-13 04:26:35,412 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 108 places, 1498 transitions, 42481 flow [2022-12-13 04:26:35,498 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:26:35,498 INFO L89 Accepts]: Start accepts. Operand has 108 places, 1498 transitions, 42481 flow [2022-12-13 04:26:35,507 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:26:35,507 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:26:35,507 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 1498 transitions, 42481 flow [2022-12-13 04:26:35,667 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 1498 transitions, 42481 flow [2022-12-13 04:26:35,667 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:26:35,683 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:26:35,683 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-13 04:26:35,683 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 1498 transitions, 42481 flow [2022-12-13 04:26:35,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:26:35,684 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:26:35,684 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:26:35,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 04:26:35,684 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 04:26:35,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:26:35,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1300659946, now seen corresponding path program 14 times [2022-12-13 04:26:35,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:26:35,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100184659] [2022-12-13 04:26:35,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:26:35,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:26:35,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:26:35,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:26:35,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:26:35,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100184659] [2022-12-13 04:26:35,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100184659] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:26:35,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:26:35,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 04:26:35,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559510250] [2022-12-13 04:26:35,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:26:35,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 04:26:35,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:26:35,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 04:26:35,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-13 04:26:35,841 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 04:26:35,841 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 1498 transitions, 42481 flow. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:26:35,841 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:26:35,841 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 04:26:35,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:26:40,552 INFO L130 PetriNetUnfolder]: 11327/17478 cut-off events. [2022-12-13 04:26:40,552 INFO L131 PetriNetUnfolder]: For 1031/1031 co-relation queries the response was YES. [2022-12-13 04:26:40,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 263548 conditions, 17478 events. 11327/17478 cut-off events. For 1031/1031 co-relation queries the response was YES. Maximal size of possible extension queue 1059. Compared 117580 event pairs, 184 based on Foata normal form. 712/18190 useless extension candidates. Maximal degree in co-relation 259164. Up to 17468 conditions per place. [2022-12-13 04:26:40,674 INFO L137 encePairwiseOnDemand]: 20/32 looper letters, 985 selfloop transitions, 781 changer transitions 14/1780 dead transitions. [2022-12-13 04:26:40,675 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 1780 transitions, 54039 flow [2022-12-13 04:26:40,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 04:26:40,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 04:26:40,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 165 transitions. [2022-12-13 04:26:40,691 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.515625 [2022-12-13 04:26:40,691 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 68 predicate places. [2022-12-13 04:26:40,692 INFO L82 GeneralOperation]: Start removeDead. Operand has 116 places, 1780 transitions, 54039 flow [2022-12-13 04:26:40,801 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 116 places, 1766 transitions, 53619 flow [2022-12-13 04:26:40,896 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:26:40,896 INFO L89 Accepts]: Start accepts. Operand has 116 places, 1766 transitions, 53619 flow [2022-12-13 04:26:40,907 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:26:40,908 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:26:40,908 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 116 places, 1766 transitions, 53619 flow [2022-12-13 04:26:40,937 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 116 places, 1766 transitions, 53619 flow [2022-12-13 04:26:40,937 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:26:40,950 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:26:40,951 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 55 [2022-12-13 04:26:40,951 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 1766 transitions, 53619 flow [2022-12-13 04:26:40,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:26:40,951 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:26:40,951 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:26:40,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 04:26:40,952 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 04:26:40,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:26:40,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1856168552, now seen corresponding path program 15 times [2022-12-13 04:26:40,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:26:40,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021637738] [2022-12-13 04:26:40,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:26:40,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:26:40,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:26:41,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:26:41,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:26:41,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021637738] [2022-12-13 04:26:41,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021637738] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:26:41,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:26:41,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 04:26:41,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720989902] [2022-12-13 04:26:41,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:26:41,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 04:26:41,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:26:41,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 04:26:41,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 04:26:41,110 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 04:26:41,110 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 1766 transitions, 53619 flow. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:26:41,110 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:26:41,110 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 04:26:41,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:26:46,928 INFO L130 PetriNetUnfolder]: 11258/17555 cut-off events. [2022-12-13 04:26:46,929 INFO L131 PetriNetUnfolder]: For 991/991 co-relation queries the response was YES. [2022-12-13 04:26:46,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 282259 conditions, 17555 events. 11258/17555 cut-off events. For 991/991 co-relation queries the response was YES. Maximal size of possible extension queue 1112. Compared 120712 event pairs, 172 based on Foata normal form. 352/17907 useless extension candidates. Maximal degree in co-relation 277588. Up to 17545 conditions per place. [2022-12-13 04:26:47,078 INFO L137 encePairwiseOnDemand]: 21/32 looper letters, 1298 selfloop transitions, 615 changer transitions 29/1942 dead transitions. [2022-12-13 04:26:47,078 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 1942 transitions, 62825 flow [2022-12-13 04:26:47,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 04:26:47,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 04:26:47,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 123 transitions. [2022-12-13 04:26:47,079 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.48046875 [2022-12-13 04:26:47,079 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 75 predicate places. [2022-12-13 04:26:47,079 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 1942 transitions, 62825 flow [2022-12-13 04:26:47,210 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 123 places, 1913 transitions, 61873 flow [2022-12-13 04:26:47,484 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:26:47,484 INFO L89 Accepts]: Start accepts. Operand has 123 places, 1913 transitions, 61873 flow [2022-12-13 04:26:47,494 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:26:47,494 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:26:47,495 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 1913 transitions, 61873 flow [2022-12-13 04:26:47,524 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 1913 transitions, 61873 flow [2022-12-13 04:26:47,524 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:26:47,530 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:26:47,531 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 47 [2022-12-13 04:26:47,531 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 1913 transitions, 61873 flow [2022-12-13 04:26:47,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:26:47,531 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:26:47,531 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:26:47,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 04:26:47,531 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 04:26:47,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:26:47,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1737316696, now seen corresponding path program 16 times [2022-12-13 04:26:47,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:26:47,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063408220] [2022-12-13 04:26:47,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:26:47,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:26:47,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:26:47,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:26:47,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:26:47,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063408220] [2022-12-13 04:26:47,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063408220] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:26:47,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:26:47,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 04:26:47,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766807852] [2022-12-13 04:26:47,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:26:47,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 04:26:47,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:26:47,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 04:26:47,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-13 04:26:47,700 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 04:26:47,700 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 1913 transitions, 61873 flow. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:26:47,700 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:26:47,700 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 04:26:47,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:26:54,260 INFO L130 PetriNetUnfolder]: 11367/17952 cut-off events. [2022-12-13 04:26:54,260 INFO L131 PetriNetUnfolder]: For 1052/1052 co-relation queries the response was YES. [2022-12-13 04:26:54,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 306561 conditions, 17952 events. 11367/17952 cut-off events. For 1052/1052 co-relation queries the response was YES. Maximal size of possible extension queue 1187. Compared 126662 event pairs, 156 based on Foata normal form. 524/18476 useless extension candidates. Maximal degree in co-relation 301468. Up to 17942 conditions per place. [2022-12-13 04:26:54,394 INFO L137 encePairwiseOnDemand]: 21/32 looper letters, 1199 selfloop transitions, 940 changer transitions 30/2169 dead transitions. [2022-12-13 04:26:54,394 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 2169 transitions, 74430 flow [2022-12-13 04:26:54,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 04:26:54,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 04:26:54,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 163 transitions. [2022-12-13 04:26:54,395 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.509375 [2022-12-13 04:26:54,396 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 84 predicate places. [2022-12-13 04:26:54,396 INFO L82 GeneralOperation]: Start removeDead. Operand has 132 places, 2169 transitions, 74430 flow [2022-12-13 04:26:54,526 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 132 places, 2139 transitions, 73410 flow [2022-12-13 04:26:54,963 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:26:54,963 INFO L89 Accepts]: Start accepts. Operand has 132 places, 2139 transitions, 73410 flow [2022-12-13 04:26:54,975 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:26:54,975 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:26:54,975 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 2139 transitions, 73410 flow [2022-12-13 04:26:55,013 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 2139 transitions, 73410 flow [2022-12-13 04:26:55,013 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:26:55,019 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:26:55,020 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 57 [2022-12-13 04:26:55,020 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 2139 transitions, 73410 flow [2022-12-13 04:26:55,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:26:55,020 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:26:55,020 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:26:55,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 04:26:55,021 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 04:26:55,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:26:55,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1488955114, now seen corresponding path program 17 times [2022-12-13 04:26:55,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:26:55,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685055397] [2022-12-13 04:26:55,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:26:55,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:26:55,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:26:55,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:26:55,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:26:55,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685055397] [2022-12-13 04:26:55,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685055397] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:26:55,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:26:55,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 04:26:55,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260435762] [2022-12-13 04:26:55,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:26:55,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 04:26:55,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:26:55,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 04:26:55,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 04:26:55,150 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 04:26:55,150 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 2139 transitions, 73410 flow. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:26:55,150 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:26:55,150 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 04:26:55,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:27:02,747 INFO L130 PetriNetUnfolder]: 11725/18482 cut-off events. [2022-12-13 04:27:02,747 INFO L131 PetriNetUnfolder]: For 1062/1062 co-relation queries the response was YES. [2022-12-13 04:27:02,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 334086 conditions, 18482 events. 11725/18482 cut-off events. For 1062/1062 co-relation queries the response was YES. Maximal size of possible extension queue 1225. Compared 130160 event pairs, 152 based on Foata normal form. 82/18564 useless extension candidates. Maximal degree in co-relation 328698. Up to 18472 conditions per place. [2022-12-13 04:27:02,924 INFO L137 encePairwiseOnDemand]: 22/32 looper letters, 2041 selfloop transitions, 296 changer transitions 33/2370 dead transitions. [2022-12-13 04:27:02,924 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 2370 transitions, 86064 flow [2022-12-13 04:27:02,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 04:27:02,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 04:27:02,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2022-12-13 04:27:02,925 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.41796875 [2022-12-13 04:27:02,926 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 91 predicate places. [2022-12-13 04:27:02,926 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 2370 transitions, 86064 flow [2022-12-13 04:27:03,161 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 2337 transitions, 84861 flow [2022-12-13 04:27:03,276 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:27:03,277 INFO L89 Accepts]: Start accepts. Operand has 139 places, 2337 transitions, 84861 flow [2022-12-13 04:27:03,292 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:27:03,292 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:27:03,292 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 2337 transitions, 84861 flow [2022-12-13 04:27:03,337 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 2337 transitions, 84861 flow [2022-12-13 04:27:03,337 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:27:03,344 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:27:03,344 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 68 [2022-12-13 04:27:03,344 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 2337 transitions, 84861 flow [2022-12-13 04:27:03,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:27:03,344 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:27:03,345 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:27:03,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 04:27:03,345 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 04:27:03,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:27:03,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1549312436, now seen corresponding path program 18 times [2022-12-13 04:27:03,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:27:03,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528751183] [2022-12-13 04:27:03,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:27:03,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:27:03,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:27:03,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:27:03,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:27:03,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528751183] [2022-12-13 04:27:03,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528751183] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:27:03,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:27:03,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 04:27:03,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903708328] [2022-12-13 04:27:03,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:27:03,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 04:27:03,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:27:03,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 04:27:03,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-13 04:27:03,517 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 04:27:03,517 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 2337 transitions, 84861 flow. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:27:03,517 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:27:03,518 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 04:27:03,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:27:13,012 INFO L130 PetriNetUnfolder]: 12454/19571 cut-off events. [2022-12-13 04:27:13,013 INFO L131 PetriNetUnfolder]: For 1081/1081 co-relation queries the response was YES. [2022-12-13 04:27:13,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 373306 conditions, 19571 events. 12454/19571 cut-off events. For 1081/1081 co-relation queries the response was YES. Maximal size of possible extension queue 1320. Compared 138741 event pairs, 146 based on Foata normal form. 120/19691 useless extension candidates. Maximal degree in co-relation 367623. Up to 19561 conditions per place. [2022-12-13 04:27:13,183 INFO L137 encePairwiseOnDemand]: 21/32 looper letters, 2157 selfloop transitions, 533 changer transitions 2/2692 dead transitions. [2022-12-13 04:27:13,183 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 2692 transitions, 103100 flow [2022-12-13 04:27:13,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 04:27:13,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 04:27:13,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 130 transitions. [2022-12-13 04:27:13,184 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3693181818181818 [2022-12-13 04:27:13,184 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 101 predicate places. [2022-12-13 04:27:13,184 INFO L82 GeneralOperation]: Start removeDead. Operand has 149 places, 2692 transitions, 103100 flow [2022-12-13 04:27:13,505 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 149 places, 2690 transitions, 103024 flow [2022-12-13 04:27:13,632 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:27:13,633 INFO L89 Accepts]: Start accepts. Operand has 149 places, 2690 transitions, 103024 flow [2022-12-13 04:27:13,651 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:27:13,651 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:27:13,652 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 2690 transitions, 103024 flow [2022-12-13 04:27:13,705 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 149 places, 2690 transitions, 103024 flow [2022-12-13 04:27:13,705 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:27:13,712 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:27:13,713 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-13 04:27:13,713 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 2690 transitions, 103024 flow [2022-12-13 04:27:13,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:27:13,713 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:27:13,713 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:27:13,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 04:27:13,713 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 04:27:13,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:27:13,714 INFO L85 PathProgramCache]: Analyzing trace with hash -476099364, now seen corresponding path program 19 times [2022-12-13 04:27:13,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:27:13,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824318458] [2022-12-13 04:27:13,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:27:13,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:27:13,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:27:13,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:27:13,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:27:13,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824318458] [2022-12-13 04:27:13,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824318458] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:27:13,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:27:13,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 04:27:13,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047971701] [2022-12-13 04:27:13,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:27:13,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 04:27:13,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:27:13,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 04:27:13,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 04:27:13,878 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 04:27:13,879 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 2690 transitions, 103024 flow. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:27:13,879 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:27:13,879 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 04:27:13,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:27:24,819 INFO L130 PetriNetUnfolder]: 12459/19588 cut-off events. [2022-12-13 04:27:24,820 INFO L131 PetriNetUnfolder]: For 1084/1084 co-relation queries the response was YES. [2022-12-13 04:27:24,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 393220 conditions, 19588 events. 12459/19588 cut-off events. For 1084/1084 co-relation queries the response was YES. Maximal size of possible extension queue 1322. Compared 139092 event pairs, 158 based on Foata normal form. 8/19596 useless extension candidates. Maximal degree in co-relation 387242. Up to 19578 conditions per place. [2022-12-13 04:27:24,986 INFO L137 encePairwiseOnDemand]: 22/32 looper letters, 2354 selfloop transitions, 316 changer transitions 29/2699 dead transitions. [2022-12-13 04:27:24,987 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 2699 transitions, 108767 flow [2022-12-13 04:27:24,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 04:27:24,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 04:27:24,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2022-12-13 04:27:24,987 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.40234375 [2022-12-13 04:27:24,988 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 108 predicate places. [2022-12-13 04:27:24,988 INFO L82 GeneralOperation]: Start removeDead. Operand has 156 places, 2699 transitions, 108767 flow [2022-12-13 04:27:25,163 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 156 places, 2670 transitions, 107586 flow [2022-12-13 04:27:25,322 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:27:25,322 INFO L89 Accepts]: Start accepts. Operand has 156 places, 2670 transitions, 107586 flow [2022-12-13 04:27:25,343 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:27:25,343 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:27:25,343 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 2670 transitions, 107586 flow [2022-12-13 04:27:25,401 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 156 places, 2670 transitions, 107586 flow [2022-12-13 04:27:25,402 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:27:25,409 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:27:25,410 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 88 [2022-12-13 04:27:25,410 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 2670 transitions, 107586 flow [2022-12-13 04:27:25,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:27:25,410 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:27:25,410 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:27:25,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 04:27:25,410 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 04:27:25,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:27:25,411 INFO L85 PathProgramCache]: Analyzing trace with hash -982456600, now seen corresponding path program 20 times [2022-12-13 04:27:25,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:27:25,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802752624] [2022-12-13 04:27:25,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:27:25,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:27:25,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:27:25,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:27:25,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:27:25,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802752624] [2022-12-13 04:27:25,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802752624] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:27:25,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:27:25,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 04:27:25,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293309493] [2022-12-13 04:27:25,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:27:25,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 04:27:25,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:27:25,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 04:27:25,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 04:27:25,581 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 04:27:25,582 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 2670 transitions, 107586 flow. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:27:25,582 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:27:25,582 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 04:27:25,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:27:36,735 INFO L130 PetriNetUnfolder]: 12526/19715 cut-off events. [2022-12-13 04:27:36,735 INFO L131 PetriNetUnfolder]: For 1093/1093 co-relation queries the response was YES. [2022-12-13 04:27:36,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 415482 conditions, 19715 events. 12526/19715 cut-off events. For 1093/1093 co-relation queries the response was YES. Maximal size of possible extension queue 1345. Compared 140480 event pairs, 168 based on Foata normal form. 104/19819 useless extension candidates. Maximal degree in co-relation 409381. Up to 19705 conditions per place. [2022-12-13 04:27:36,934 INFO L137 encePairwiseOnDemand]: 22/32 looper letters, 2657 selfloop transitions, 92 changer transitions 29/2778 dead transitions. [2022-12-13 04:27:36,934 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 2778 transitions, 117498 flow [2022-12-13 04:27:36,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 04:27:36,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 04:27:36,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 97 transitions. [2022-12-13 04:27:36,935 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.37890625 [2022-12-13 04:27:36,935 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 115 predicate places. [2022-12-13 04:27:36,935 INFO L82 GeneralOperation]: Start removeDead. Operand has 163 places, 2778 transitions, 117498 flow [2022-12-13 04:27:37,104 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 163 places, 2749 transitions, 116262 flow [2022-12-13 04:27:37,241 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:27:37,241 INFO L89 Accepts]: Start accepts. Operand has 163 places, 2749 transitions, 116262 flow [2022-12-13 04:27:37,260 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:27:37,260 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:27:37,260 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 2749 transitions, 116262 flow [2022-12-13 04:27:37,318 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 163 places, 2749 transitions, 116262 flow [2022-12-13 04:27:37,318 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:27:37,326 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:27:37,327 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 86 [2022-12-13 04:27:37,327 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 2749 transitions, 116262 flow [2022-12-13 04:27:37,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:27:37,327 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:27:37,327 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:27:37,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 04:27:37,327 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 04:27:37,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:27:37,327 INFO L85 PathProgramCache]: Analyzing trace with hash 500658484, now seen corresponding path program 21 times [2022-12-13 04:27:37,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:27:37,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379663989] [2022-12-13 04:27:37,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:27:37,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:27:37,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:27:37,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:27:37,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:27:37,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379663989] [2022-12-13 04:27:37,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379663989] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:27:37,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:27:37,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 04:27:37,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750995246] [2022-12-13 04:27:37,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:27:37,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 04:27:37,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:27:37,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 04:27:37,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-13 04:27:37,456 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 04:27:37,456 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 2749 transitions, 116262 flow. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:27:37,456 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:27:37,456 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 04:27:37,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:27:48,707 INFO L130 PetriNetUnfolder]: 12496/19649 cut-off events. [2022-12-13 04:27:48,708 INFO L131 PetriNetUnfolder]: For 1073/1073 co-relation queries the response was YES. [2022-12-13 04:27:48,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 433730 conditions, 19649 events. 12496/19649 cut-off events. For 1073/1073 co-relation queries the response was YES. Maximal size of possible extension queue 1337. Compared 139616 event pairs, 124 based on Foata normal form. 8/19657 useless extension candidates. Maximal degree in co-relation 427342. Up to 19639 conditions per place. [2022-12-13 04:27:48,892 INFO L137 encePairwiseOnDemand]: 22/32 looper letters, 2684 selfloop transitions, 102 changer transitions 0/2786 dead transitions. [2022-12-13 04:27:48,892 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 2786 transitions, 123394 flow [2022-12-13 04:27:48,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 04:27:48,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 04:27:48,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2022-12-13 04:27:48,893 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3506944444444444 [2022-12-13 04:27:48,893 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 123 predicate places. [2022-12-13 04:27:48,893 INFO L82 GeneralOperation]: Start removeDead. Operand has 171 places, 2786 transitions, 123394 flow [2022-12-13 04:27:49,073 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 171 places, 2786 transitions, 123394 flow [2022-12-13 04:27:49,343 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:27:49,343 INFO L89 Accepts]: Start accepts. Operand has 171 places, 2786 transitions, 123394 flow [2022-12-13 04:27:49,362 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:27:49,362 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:27:49,362 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 171 places, 2786 transitions, 123394 flow [2022-12-13 04:27:49,421 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 171 places, 2786 transitions, 123394 flow [2022-12-13 04:27:49,421 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:27:49,428 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:27:49,429 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 86 [2022-12-13 04:27:49,429 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 2786 transitions, 123394 flow [2022-12-13 04:27:49,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:27:49,429 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:27:49,429 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:27:49,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 04:27:49,429 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 04:27:49,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:27:49,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1931727208, now seen corresponding path program 22 times [2022-12-13 04:27:49,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:27:49,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684246594] [2022-12-13 04:27:49,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:27:49,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:27:49,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:27:49,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:27:49,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:27:49,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684246594] [2022-12-13 04:27:49,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684246594] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:27:49,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:27:49,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 04:27:49,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080916201] [2022-12-13 04:27:49,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:27:49,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 04:27:49,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:27:49,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 04:27:49,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-12-13 04:27:49,606 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 04:27:49,607 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 2786 transitions, 123394 flow. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:27:49,607 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:27:49,607 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 04:27:49,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:28:03,728 INFO L130 PetriNetUnfolder]: 13169/20942 cut-off events. [2022-12-13 04:28:03,728 INFO L131 PetriNetUnfolder]: For 1092/1092 co-relation queries the response was YES. [2022-12-13 04:28:03,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 483130 conditions, 20942 events. 13169/20942 cut-off events. For 1092/1092 co-relation queries the response was YES. Maximal size of possible extension queue 1502. Compared 153759 event pairs, 146 based on Foata normal form. 548/21490 useless extension candidates. Maximal degree in co-relation 476269. Up to 20932 conditions per place. [2022-12-13 04:28:03,946 INFO L137 encePairwiseOnDemand]: 21/32 looper letters, 1633 selfloop transitions, 1420 changer transitions 90/3143 dead transitions. [2022-12-13 04:28:03,946 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 3143 transitions, 145406 flow [2022-12-13 04:28:03,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 04:28:03,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 04:28:03,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 193 transitions. [2022-12-13 04:28:03,947 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4639423076923077 [2022-12-13 04:28:03,947 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 135 predicate places. [2022-12-13 04:28:03,947 INFO L82 GeneralOperation]: Start removeDead. Operand has 183 places, 3143 transitions, 145406 flow [2022-12-13 04:28:04,299 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 183 places, 3053 transitions, 141248 flow [2022-12-13 04:28:04,448 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:28:04,448 INFO L89 Accepts]: Start accepts. Operand has 183 places, 3053 transitions, 141248 flow [2022-12-13 04:28:04,501 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:28:04,502 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:28:04,502 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 183 places, 3053 transitions, 141248 flow [2022-12-13 04:28:04,592 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 183 places, 3053 transitions, 141248 flow [2022-12-13 04:28:04,592 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:28:04,601 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:28:04,601 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 154 [2022-12-13 04:28:04,602 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 3053 transitions, 141248 flow [2022-12-13 04:28:04,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:28:04,602 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:28:04,602 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:28:04,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-13 04:28:04,602 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 04:28:04,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:28:04,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1539079866, now seen corresponding path program 23 times [2022-12-13 04:28:04,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:28:04,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504495418] [2022-12-13 04:28:04,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:28:04,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:28:04,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:28:04,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:28:04,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:28:04,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504495418] [2022-12-13 04:28:04,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504495418] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:28:04,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:28:04,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 04:28:04,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731968115] [2022-12-13 04:28:04,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:28:04,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 04:28:04,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:28:04,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 04:28:04,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 04:28:04,741 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 04:28:04,741 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 3053 transitions, 141248 flow. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:28:04,741 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:28:04,741 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 04:28:04,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:28:20,654 INFO L130 PetriNetUnfolder]: 13037/20752 cut-off events. [2022-12-13 04:28:20,655 INFO L131 PetriNetUnfolder]: For 1087/1087 co-relation queries the response was YES. [2022-12-13 04:28:20,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 499499 conditions, 20752 events. 13037/20752 cut-off events. For 1087/1087 co-relation queries the response was YES. Maximal size of possible extension queue 1499. Compared 152369 event pairs, 168 based on Foata normal form. 76/20828 useless extension candidates. Maximal degree in co-relation 492343. Up to 20742 conditions per place. [2022-12-13 04:28:20,969 INFO L137 encePairwiseOnDemand]: 22/32 looper letters, 2961 selfloop transitions, 98 changer transitions 66/3125 dead transitions. [2022-12-13 04:28:20,970 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 3125 transitions, 150822 flow [2022-12-13 04:28:20,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 04:28:20,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 04:28:20,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 91 transitions. [2022-12-13 04:28:20,970 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35546875 [2022-12-13 04:28:20,971 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 142 predicate places. [2022-12-13 04:28:20,971 INFO L82 GeneralOperation]: Start removeDead. Operand has 190 places, 3125 transitions, 150822 flow [2022-12-13 04:28:21,160 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 190 places, 3059 transitions, 147624 flow [2022-12-13 04:28:21,305 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:28:21,305 INFO L89 Accepts]: Start accepts. Operand has 190 places, 3059 transitions, 147624 flow [2022-12-13 04:28:21,335 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:28:21,335 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:28:21,335 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 190 places, 3059 transitions, 147624 flow [2022-12-13 04:28:21,404 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 190 places, 3059 transitions, 147624 flow [2022-12-13 04:28:21,404 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:28:21,413 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:28:21,414 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 109 [2022-12-13 04:28:21,414 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 3059 transitions, 147624 flow [2022-12-13 04:28:21,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:28:21,419 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:28:21,419 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:28:21,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-13 04:28:21,419 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 04:28:21,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:28:21,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1153796648, now seen corresponding path program 24 times [2022-12-13 04:28:21,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:28:21,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569690081] [2022-12-13 04:28:21,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:28:21,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:28:21,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:28:21,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:28:21,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:28:21,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569690081] [2022-12-13 04:28:21,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569690081] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:28:21,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:28:21,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 04:28:21,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412441636] [2022-12-13 04:28:21,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:28:21,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 04:28:21,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:28:21,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 04:28:21,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-12-13 04:28:21,616 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 04:28:21,616 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 3059 transitions, 147624 flow. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:28:21,616 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:28:21,616 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 04:28:21,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:28:38,804 INFO L130 PetriNetUnfolder]: 12993/21218 cut-off events. [2022-12-13 04:28:38,804 INFO L131 PetriNetUnfolder]: For 1120/1120 co-relation queries the response was YES. [2022-12-13 04:28:38,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 531932 conditions, 21218 events. 12993/21218 cut-off events. For 1120/1120 co-relation queries the response was YES. Maximal size of possible extension queue 1627. Compared 163344 event pairs, 132 based on Foata normal form. 1086/22304 useless extension candidates. Maximal degree in co-relation 524531. Up to 21208 conditions per place. [2022-12-13 04:28:38,979 INFO L137 encePairwiseOnDemand]: 21/32 looper letters, 1804 selfloop transitions, 1599 changer transitions 220/3623 dead transitions. [2022-12-13 04:28:38,979 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 3623 transitions, 182077 flow [2022-12-13 04:28:38,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 04:28:38,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 04:28:38,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 201 transitions. [2022-12-13 04:28:38,980 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4831730769230769 [2022-12-13 04:28:38,981 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 154 predicate places. [2022-12-13 04:28:38,981 INFO L82 GeneralOperation]: Start removeDead. Operand has 202 places, 3623 transitions, 182077 flow [2022-12-13 04:28:39,179 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 202 places, 3403 transitions, 170966 flow [2022-12-13 04:28:39,329 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:28:39,329 INFO L89 Accepts]: Start accepts. Operand has 202 places, 3403 transitions, 170966 flow [2022-12-13 04:28:39,363 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:28:39,364 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:28:39,364 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 202 places, 3403 transitions, 170966 flow [2022-12-13 04:28:39,453 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 202 places, 3403 transitions, 170966 flow [2022-12-13 04:28:39,454 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:28:39,462 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:28:39,462 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 04:28:39,462 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 3403 transitions, 170966 flow [2022-12-13 04:28:39,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:28:39,462 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:28:39,463 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:28:39,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-13 04:28:39,464 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 04:28:39,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:28:39,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1275782186, now seen corresponding path program 25 times [2022-12-13 04:28:39,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:28:39,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958778605] [2022-12-13 04:28:39,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:28:39,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:28:39,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:28:39,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:28:39,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:28:39,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958778605] [2022-12-13 04:28:39,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958778605] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:28:39,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:28:39,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 04:28:39,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976741340] [2022-12-13 04:28:39,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:28:39,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 04:28:39,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:28:39,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 04:28:39,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-12-13 04:28:39,612 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 04:28:39,613 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 3403 transitions, 170966 flow. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:28:39,613 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:28:39,613 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 04:28:39,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:29:02,524 INFO L130 PetriNetUnfolder]: 12860/21277 cut-off events. [2022-12-13 04:29:02,525 INFO L131 PetriNetUnfolder]: For 1087/1087 co-relation queries the response was YES. [2022-12-13 04:29:02,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 554636 conditions, 21277 events. 12860/21277 cut-off events. For 1087/1087 co-relation queries the response was YES. Maximal size of possible extension queue 1692. Compared 167141 event pairs, 128 based on Foata normal form. 662/21939 useless extension candidates. Maximal degree in co-relation 546942. Up to 21267 conditions per place. [2022-12-13 04:29:02,845 INFO L137 encePairwiseOnDemand]: 20/32 looper letters, 1839 selfloop transitions, 1772 changer transitions 90/3701 dead transitions. [2022-12-13 04:29:02,845 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 3701 transitions, 193301 flow [2022-12-13 04:29:02,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 04:29:02,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 04:29:02,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 186 transitions. [2022-12-13 04:29:02,847 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.484375 [2022-12-13 04:29:02,847 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 165 predicate places. [2022-12-13 04:29:02,847 INFO L82 GeneralOperation]: Start removeDead. Operand has 213 places, 3701 transitions, 193301 flow [2022-12-13 04:29:03,071 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 213 places, 3611 transitions, 188612 flow [2022-12-13 04:29:03,267 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:29:03,267 INFO L89 Accepts]: Start accepts. Operand has 213 places, 3611 transitions, 188612 flow [2022-12-13 04:29:03,313 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:29:03,313 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:29:03,313 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 213 places, 3611 transitions, 188612 flow [2022-12-13 04:29:03,418 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 213 places, 3611 transitions, 188612 flow [2022-12-13 04:29:03,418 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:29:03,427 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:29:03,428 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 161 [2022-12-13 04:29:03,428 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 3611 transitions, 188612 flow [2022-12-13 04:29:03,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:29:03,429 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:29:03,429 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:29:03,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-13 04:29:03,429 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 04:29:03,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:29:03,429 INFO L85 PathProgramCache]: Analyzing trace with hash -452492318, now seen corresponding path program 26 times [2022-12-13 04:29:03,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:29:03,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148246630] [2022-12-13 04:29:03,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:29:03,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:29:03,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:29:03,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:29:03,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:29:03,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148246630] [2022-12-13 04:29:03,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148246630] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:29:03,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:29:03,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 04:29:03,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467804984] [2022-12-13 04:29:03,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:29:03,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 04:29:03,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:29:03,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 04:29:03,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-12-13 04:29:03,591 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 04:29:03,591 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 3611 transitions, 188612 flow. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:29:03,591 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:29:03,591 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 04:29:03,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:29:28,286 INFO L130 PetriNetUnfolder]: 12809/21318 cut-off events. [2022-12-13 04:29:28,287 INFO L131 PetriNetUnfolder]: For 1197/1197 co-relation queries the response was YES. [2022-12-13 04:29:28,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 577046 conditions, 21318 events. 12809/21318 cut-off events. For 1197/1197 co-relation queries the response was YES. Maximal size of possible extension queue 1658. Compared 168358 event pairs, 28 based on Foata normal form. 170/21488 useless extension candidates. Maximal degree in co-relation 569179. Up to 21308 conditions per place. [2022-12-13 04:29:28,536 INFO L137 encePairwiseOnDemand]: 20/32 looper letters, 1835 selfloop transitions, 2133 changer transitions 40/4008 dead transitions. [2022-12-13 04:29:28,536 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 4008 transitions, 217401 flow [2022-12-13 04:29:28,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 04:29:28,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 04:29:28,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 191 transitions. [2022-12-13 04:29:28,537 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.45913461538461536 [2022-12-13 04:29:28,537 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 177 predicate places. [2022-12-13 04:29:28,537 INFO L82 GeneralOperation]: Start removeDead. Operand has 225 places, 4008 transitions, 217401 flow [2022-12-13 04:29:28,788 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 225 places, 3968 transitions, 215241 flow [2022-12-13 04:29:29,129 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:29:29,130 INFO L89 Accepts]: Start accepts. Operand has 225 places, 3968 transitions, 215241 flow [2022-12-13 04:29:29,191 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:29:29,191 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:29:29,191 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 225 places, 3968 transitions, 215241 flow [2022-12-13 04:29:29,303 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 225 places, 3968 transitions, 215241 flow [2022-12-13 04:29:29,303 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:29:29,312 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:29:29,313 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-13 04:29:29,313 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 3968 transitions, 215241 flow [2022-12-13 04:29:29,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:29:29,313 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:29:29,313 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:29:29,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-13 04:29:29,314 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 04:29:29,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:29:29,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1060939566, now seen corresponding path program 27 times [2022-12-13 04:29:29,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:29:29,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673745646] [2022-12-13 04:29:29,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:29:29,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:29:29,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:29:29,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:29:29,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:29:29,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673745646] [2022-12-13 04:29:29,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673745646] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:29:29,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:29:29,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 04:29:29,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772519115] [2022-12-13 04:29:29,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:29:29,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 04:29:29,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:29:29,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 04:29:29,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-12-13 04:29:29,589 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 04:29:29,589 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 3968 transitions, 215241 flow. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:29:29,589 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:29:29,589 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 04:29:29,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:29:57,179 INFO L130 PetriNetUnfolder]: 12637/21098 cut-off events. [2022-12-13 04:29:57,179 INFO L131 PetriNetUnfolder]: For 1238/1238 co-relation queries the response was YES. [2022-12-13 04:29:57,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 592202 conditions, 21098 events. 12637/21098 cut-off events. For 1238/1238 co-relation queries the response was YES. Maximal size of possible extension queue 1645. Compared 166883 event pairs, 30 based on Foata normal form. 184/21282 useless extension candidates. Maximal degree in co-relation 584160. Up to 21088 conditions per place. [2022-12-13 04:29:57,381 INFO L137 encePairwiseOnDemand]: 21/32 looper letters, 1884 selfloop transitions, 2138 changer transitions 47/4069 dead transitions. [2022-12-13 04:29:57,381 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 4069 transitions, 228860 flow [2022-12-13 04:29:57,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 04:29:57,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 04:29:57,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 196 transitions. [2022-12-13 04:29:57,382 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4375 [2022-12-13 04:29:57,383 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 190 predicate places. [2022-12-13 04:29:57,383 INFO L82 GeneralOperation]: Start removeDead. Operand has 238 places, 4069 transitions, 228860 flow [2022-12-13 04:29:57,621 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 238 places, 4022 transitions, 226204 flow [2022-12-13 04:29:57,795 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:29:57,795 INFO L89 Accepts]: Start accepts. Operand has 238 places, 4022 transitions, 226204 flow [2022-12-13 04:29:57,849 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:29:57,850 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:29:57,850 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 238 places, 4022 transitions, 226204 flow [2022-12-13 04:29:57,969 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 238 places, 4022 transitions, 226204 flow [2022-12-13 04:29:57,970 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:29:57,978 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:29:57,978 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-13 04:29:57,978 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 4022 transitions, 226204 flow [2022-12-13 04:29:57,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:29:57,979 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:29:57,979 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:29:57,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-13 04:29:57,979 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 04:29:57,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:29:57,979 INFO L85 PathProgramCache]: Analyzing trace with hash -866529054, now seen corresponding path program 28 times [2022-12-13 04:29:57,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:29:57,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577407852] [2022-12-13 04:29:57,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:29:57,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:29:57,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:29:58,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:29:58,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:29:58,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577407852] [2022-12-13 04:29:58,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577407852] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:29:58,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:29:58,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 04:29:58,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550347578] [2022-12-13 04:29:58,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:29:58,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 04:29:58,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:29:58,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 04:29:58,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-12-13 04:29:58,139 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 04:29:58,139 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 4022 transitions, 226204 flow. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:29:58,139 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:29:58,139 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 04:29:58,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:30:29,585 INFO L130 PetriNetUnfolder]: 12800/21489 cut-off events. [2022-12-13 04:30:29,585 INFO L131 PetriNetUnfolder]: For 1247/1247 co-relation queries the response was YES. [2022-12-13 04:30:29,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 624641 conditions, 21489 events. 12800/21489 cut-off events. For 1247/1247 co-relation queries the response was YES. Maximal size of possible extension queue 1696. Compared 171904 event pairs, 26 based on Foata normal form. 216/21705 useless extension candidates. Maximal degree in co-relation 616316. Up to 21479 conditions per place. [2022-12-13 04:30:29,820 INFO L137 encePairwiseOnDemand]: 21/32 looper letters, 1934 selfloop transitions, 2179 changer transitions 93/4206 dead transitions. [2022-12-13 04:30:29,821 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 4206 transitions, 244947 flow [2022-12-13 04:30:29,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 04:30:29,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 04:30:29,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 211 transitions. [2022-12-13 04:30:29,822 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.412109375 [2022-12-13 04:30:29,822 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 205 predicate places. [2022-12-13 04:30:29,822 INFO L82 GeneralOperation]: Start removeDead. Operand has 253 places, 4206 transitions, 244947 flow [2022-12-13 04:30:30,082 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 253 places, 4113 transitions, 239535 flow [2022-12-13 04:30:30,399 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:30:30,400 INFO L89 Accepts]: Start accepts. Operand has 253 places, 4113 transitions, 239535 flow [2022-12-13 04:30:30,435 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:30:30,435 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:30:30,436 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 253 places, 4113 transitions, 239535 flow [2022-12-13 04:30:30,560 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 253 places, 4113 transitions, 239535 flow [2022-12-13 04:30:30,561 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:30:30,569 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:30:30,573 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-13 04:30:30,573 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 4113 transitions, 239535 flow [2022-12-13 04:30:30,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:30:30,573 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:30:30,573 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:30:30,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-13 04:30:30,573 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 04:30:30,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:30:30,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1562006662, now seen corresponding path program 29 times [2022-12-13 04:30:30,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:30:30,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988235606] [2022-12-13 04:30:30,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:30:30,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:30:30,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:30:30,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:30:30,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:30:30,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988235606] [2022-12-13 04:30:30,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988235606] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:30:30,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:30:30,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 04:30:30,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355715746] [2022-12-13 04:30:30,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:30:30,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 04:30:30,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:30:30,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 04:30:30,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-12-13 04:30:30,739 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 04:30:30,739 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 4113 transitions, 239535 flow. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:30:30,739 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:30:30,739 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 04:30:30,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:31:09,057 INFO L130 PetriNetUnfolder]: 13156/22229 cut-off events. [2022-12-13 04:31:09,058 INFO L131 PetriNetUnfolder]: For 1248/1248 co-relation queries the response was YES. [2022-12-13 04:31:09,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 668314 conditions, 22229 events. 13156/22229 cut-off events. For 1248/1248 co-relation queries the response was YES. Maximal size of possible extension queue 1806. Compared 180429 event pairs, 38 based on Foata normal form. 192/22421 useless extension candidates. Maximal degree in co-relation 659706. Up to 22219 conditions per place. [2022-12-13 04:31:09,294 INFO L137 encePairwiseOnDemand]: 21/32 looper letters, 2026 selfloop transitions, 2361 changer transitions 78/4465 dead transitions. [2022-12-13 04:31:09,295 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 4465 transitions, 268899 flow [2022-12-13 04:31:09,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 04:31:09,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-13 04:31:09,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 251 transitions. [2022-12-13 04:31:09,296 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3921875 [2022-12-13 04:31:09,298 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 224 predicate places. [2022-12-13 04:31:09,298 INFO L82 GeneralOperation]: Start removeDead. Operand has 272 places, 4465 transitions, 268899 flow [2022-12-13 04:31:09,565 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 272 places, 4387 transitions, 264189 flow [2022-12-13 04:31:09,908 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:31:09,909 INFO L89 Accepts]: Start accepts. Operand has 272 places, 4387 transitions, 264189 flow [2022-12-13 04:31:09,947 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:31:09,947 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:31:09,947 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 272 places, 4387 transitions, 264189 flow [2022-12-13 04:31:10,082 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 272 places, 4387 transitions, 264189 flow [2022-12-13 04:31:10,082 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:31:10,091 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:31:10,091 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-13 04:31:10,091 INFO L495 AbstractCegarLoop]: Abstraction has has 272 places, 4387 transitions, 264189 flow [2022-12-13 04:31:10,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:31:10,091 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:31:10,092 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:31:10,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-13 04:31:10,092 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 04:31:10,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:31:10,092 INFO L85 PathProgramCache]: Analyzing trace with hash -427614558, now seen corresponding path program 30 times [2022-12-13 04:31:10,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:31:10,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606371053] [2022-12-13 04:31:10,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:31:10,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:31:10,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:31:10,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:31:10,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:31:10,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606371053] [2022-12-13 04:31:10,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606371053] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:31:10,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:31:10,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 04:31:10,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889237215] [2022-12-13 04:31:10,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:31:10,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 04:31:10,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:31:10,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 04:31:10,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-12-13 04:31:10,240 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 04:31:10,240 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 4387 transitions, 264189 flow. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:31:10,240 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:31:10,240 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 04:31:10,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:31:47,329 INFO L130 PetriNetUnfolder]: 13257/22476 cut-off events. [2022-12-13 04:31:47,329 INFO L131 PetriNetUnfolder]: For 1242/1242 co-relation queries the response was YES. [2022-12-13 04:31:47,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 698189 conditions, 22476 events. 13257/22476 cut-off events. For 1242/1242 co-relation queries the response was YES. Maximal size of possible extension queue 1853. Compared 183963 event pairs, 38 based on Foata normal form. 212/22688 useless extension candidates. Maximal degree in co-relation 689298. Up to 22466 conditions per place. [2022-12-13 04:31:47,563 INFO L137 encePairwiseOnDemand]: 20/32 looper letters, 1985 selfloop transitions, 2328 changer transitions 221/4534 dead transitions. [2022-12-13 04:31:47,563 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 4534 transitions, 282092 flow [2022-12-13 04:31:47,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 04:31:47,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 04:31:47,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 204 transitions. [2022-12-13 04:31:47,564 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.45535714285714285 [2022-12-13 04:31:47,565 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 237 predicate places. [2022-12-13 04:31:47,565 INFO L82 GeneralOperation]: Start removeDead. Operand has 285 places, 4534 transitions, 282092 flow [2022-12-13 04:31:47,961 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 285 places, 4313 transitions, 268366 flow [2022-12-13 04:31:48,162 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:31:48,162 INFO L89 Accepts]: Start accepts. Operand has 285 places, 4313 transitions, 268366 flow [2022-12-13 04:31:48,208 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:31:48,209 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:31:48,209 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 285 places, 4313 transitions, 268366 flow [2022-12-13 04:31:48,345 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 285 places, 4313 transitions, 268366 flow [2022-12-13 04:31:48,346 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:31:48,355 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:31:48,355 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 193 [2022-12-13 04:31:48,356 INFO L495 AbstractCegarLoop]: Abstraction has has 285 places, 4313 transitions, 268366 flow [2022-12-13 04:31:48,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:31:48,356 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:31:48,356 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:31:48,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-13 04:31:48,356 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 04:31:48,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:31:48,357 INFO L85 PathProgramCache]: Analyzing trace with hash 913463256, now seen corresponding path program 31 times [2022-12-13 04:31:48,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:31:48,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158339531] [2022-12-13 04:31:48,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:31:48,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:31:48,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:31:48,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:31:48,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:31:48,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158339531] [2022-12-13 04:31:48,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158339531] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:31:48,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:31:48,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 04:31:48,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365964314] [2022-12-13 04:31:48,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:31:48,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 04:31:48,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:31:48,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 04:31:48,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-12-13 04:31:48,585 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 04:31:48,585 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 4313 transitions, 268366 flow. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:31:48,585 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:31:48,585 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 04:31:48,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:32:27,473 INFO L130 PetriNetUnfolder]: 13254/22629 cut-off events. [2022-12-13 04:32:27,473 INFO L131 PetriNetUnfolder]: For 1238/1238 co-relation queries the response was YES. [2022-12-13 04:32:27,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 725558 conditions, 22629 events. 13254/22629 cut-off events. For 1238/1238 co-relation queries the response was YES. Maximal size of possible extension queue 1909. Compared 187242 event pairs, 34 based on Foata normal form. 188/22817 useless extension candidates. Maximal degree in co-relation 716384. Up to 22619 conditions per place. [2022-12-13 04:32:27,681 INFO L137 encePairwiseOnDemand]: 20/32 looper letters, 1999 selfloop transitions, 2330 changer transitions 312/4641 dead transitions. [2022-12-13 04:32:27,682 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 4641 transitions, 298011 flow [2022-12-13 04:32:27,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 04:32:27,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-13 04:32:27,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 244 transitions. [2022-12-13 04:32:27,683 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4236111111111111 [2022-12-13 04:32:27,683 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 254 predicate places. [2022-12-13 04:32:27,683 INFO L82 GeneralOperation]: Start removeDead. Operand has 302 places, 4641 transitions, 298011 flow [2022-12-13 04:32:27,954 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 302 places, 4329 transitions, 278022 flow [2022-12-13 04:32:28,335 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:32:28,335 INFO L89 Accepts]: Start accepts. Operand has 302 places, 4329 transitions, 278022 flow [2022-12-13 04:32:28,374 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:32:28,375 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:32:28,375 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 302 places, 4329 transitions, 278022 flow [2022-12-13 04:32:28,514 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 302 places, 4329 transitions, 278022 flow [2022-12-13 04:32:28,514 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:32:28,523 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:32:28,524 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 189 [2022-12-13 04:32:28,524 INFO L495 AbstractCegarLoop]: Abstraction has has 302 places, 4329 transitions, 278022 flow [2022-12-13 04:32:28,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:32:28,524 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:32:28,524 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:32:28,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-13 04:32:28,525 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 04:32:28,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:32:28,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1433117270, now seen corresponding path program 32 times [2022-12-13 04:32:28,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:32:28,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867470589] [2022-12-13 04:32:28,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:32:28,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:32:28,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:32:28,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:32:28,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:32:28,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867470589] [2022-12-13 04:32:28,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867470589] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:32:28,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:32:28,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 04:32:28,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293815111] [2022-12-13 04:32:28,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:32:28,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 04:32:28,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:32:28,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 04:32:28,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-12-13 04:32:28,687 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 04:32:28,687 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 4329 transitions, 278022 flow. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:32:28,687 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:32:28,687 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 04:32:28,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:33:07,762 INFO L130 PetriNetUnfolder]: 12754/21977 cut-off events. [2022-12-13 04:33:07,762 INFO L131 PetriNetUnfolder]: For 1262/1262 co-relation queries the response was YES. [2022-12-13 04:33:07,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 726663 conditions, 21977 events. 12754/21977 cut-off events. For 1262/1262 co-relation queries the response was YES. Maximal size of possible extension queue 1827. Compared 183443 event pairs, 34 based on Foata normal form. 394/22371 useless extension candidates. Maximal degree in co-relation 717206. Up to 21967 conditions per place. [2022-12-13 04:33:07,990 INFO L137 encePairwiseOnDemand]: 21/32 looper letters, 2016 selfloop transitions, 2348 changer transitions 202/4566 dead transitions. [2022-12-13 04:33:07,990 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 4566 transitions, 302382 flow [2022-12-13 04:33:07,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 04:33:07,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 04:33:07,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 223 transitions. [2022-12-13 04:33:07,991 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.435546875 [2022-12-13 04:33:07,992 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 269 predicate places. [2022-12-13 04:33:07,992 INFO L82 GeneralOperation]: Start removeDead. Operand has 317 places, 4566 transitions, 302382 flow [2022-12-13 04:33:08,259 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 317 places, 4364 transitions, 289002 flow [2022-12-13 04:33:08,611 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:33:08,611 INFO L89 Accepts]: Start accepts. Operand has 317 places, 4364 transitions, 289002 flow [2022-12-13 04:33:08,648 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:33:08,648 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:33:08,648 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 317 places, 4364 transitions, 289002 flow [2022-12-13 04:33:08,791 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 317 places, 4364 transitions, 289002 flow [2022-12-13 04:33:08,792 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:33:08,801 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:33:08,802 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 191 [2022-12-13 04:33:08,802 INFO L495 AbstractCegarLoop]: Abstraction has has 317 places, 4364 transitions, 289002 flow [2022-12-13 04:33:08,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:33:08,802 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:33:08,802 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:33:08,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-12-13 04:33:08,803 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 04:33:08,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:33:08,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1209700282, now seen corresponding path program 33 times [2022-12-13 04:33:08,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:33:08,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838383271] [2022-12-13 04:33:08,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:33:08,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:33:08,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:33:08,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:33:08,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:33:08,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838383271] [2022-12-13 04:33:08,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838383271] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:33:08,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:33:08,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 04:33:08,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100006431] [2022-12-13 04:33:08,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:33:08,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 04:33:08,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:33:08,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 04:33:08,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-12-13 04:33:08,956 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 04:33:08,956 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 4364 transitions, 289002 flow. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:33:08,957 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:33:08,957 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 04:33:08,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:33:45,299 INFO L130 PetriNetUnfolder]: 12601/21882 cut-off events. [2022-12-13 04:33:45,299 INFO L131 PetriNetUnfolder]: For 1279/1279 co-relation queries the response was YES. [2022-12-13 04:33:45,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 745390 conditions, 21882 events. 12601/21882 cut-off events. For 1279/1279 co-relation queries the response was YES. Maximal size of possible extension queue 1832. Compared 184350 event pairs, 40 based on Foata normal form. 270/22152 useless extension candidates. Maximal degree in co-relation 736684. Up to 21872 conditions per place. [2022-12-13 04:33:45,719 INFO L137 encePairwiseOnDemand]: 21/32 looper letters, 2029 selfloop transitions, 2367 changer transitions 234/4630 dead transitions. [2022-12-13 04:33:45,720 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 4630 transitions, 315851 flow [2022-12-13 04:33:45,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 04:33:45,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-13 04:33:45,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 271 transitions. [2022-12-13 04:33:45,721 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4234375 [2022-12-13 04:33:45,721 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 288 predicate places. [2022-12-13 04:33:45,721 INFO L82 GeneralOperation]: Start removeDead. Operand has 336 places, 4630 transitions, 315851 flow [2022-12-13 04:33:46,014 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 336 places, 4396 transitions, 299897 flow [2022-12-13 04:33:46,278 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:33:46,278 INFO L89 Accepts]: Start accepts. Operand has 336 places, 4396 transitions, 299897 flow [2022-12-13 04:33:46,380 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:33:46,380 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:33:46,380 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 336 places, 4396 transitions, 299897 flow [2022-12-13 04:33:46,546 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 336 places, 4396 transitions, 299897 flow [2022-12-13 04:33:46,547 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:33:46,556 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:33:46,557 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 280 [2022-12-13 04:33:46,557 INFO L495 AbstractCegarLoop]: Abstraction has has 336 places, 4396 transitions, 299897 flow [2022-12-13 04:33:46,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:33:46,557 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:33:46,557 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:33:46,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-12-13 04:33:46,557 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 04:33:46,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:33:46,558 INFO L85 PathProgramCache]: Analyzing trace with hash 782443370, now seen corresponding path program 34 times [2022-12-13 04:33:46,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:33:46,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665166149] [2022-12-13 04:33:46,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:33:46,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:33:46,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:33:46,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:33:46,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:33:46,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665166149] [2022-12-13 04:33:46,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665166149] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:33:46,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:33:46,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 04:33:46,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985492398] [2022-12-13 04:33:46,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:33:46,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 04:33:46,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:33:46,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 04:33:46,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-13 04:33:46,747 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 04:33:46,748 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 4396 transitions, 299897 flow. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:33:46,748 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:33:46,748 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 04:33:46,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:34:19,501 INFO L130 PetriNetUnfolder]: 11328/19775 cut-off events. [2022-12-13 04:34:19,501 INFO L131 PetriNetUnfolder]: For 1187/1187 co-relation queries the response was YES. [2022-12-13 04:34:19,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 693412 conditions, 19775 events. 11328/19775 cut-off events. For 1187/1187 co-relation queries the response was YES. Maximal size of possible extension queue 1682. Compared 165557 event pairs, 48 based on Foata normal form. 524/20299 useless extension candidates. Maximal degree in co-relation 685941. Up to 19765 conditions per place. [2022-12-13 04:34:19,940 INFO L137 encePairwiseOnDemand]: 21/32 looper letters, 2291 selfloop transitions, 2111 changer transitions 116/4518 dead transitions. [2022-12-13 04:34:19,940 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 4518 transitions, 317256 flow [2022-12-13 04:34:19,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 04:34:19,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 04:34:19,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 160 transitions. [2022-12-13 04:34:19,941 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-13 04:34:19,941 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 297 predicate places. [2022-12-13 04:34:19,941 INFO L82 GeneralOperation]: Start removeDead. Operand has 345 places, 4518 transitions, 317256 flow [2022-12-13 04:34:20,192 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 345 places, 4402 transitions, 309124 flow [2022-12-13 04:34:20,363 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:34:20,363 INFO L89 Accepts]: Start accepts. Operand has 345 places, 4402 transitions, 309124 flow [2022-12-13 04:34:20,419 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:34:20,419 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:34:20,419 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 345 places, 4402 transitions, 309124 flow [2022-12-13 04:34:20,562 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 345 places, 4402 transitions, 309124 flow [2022-12-13 04:34:20,562 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:34:20,570 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:34:20,570 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 207 [2022-12-13 04:34:20,570 INFO L495 AbstractCegarLoop]: Abstraction has has 345 places, 4402 transitions, 309124 flow [2022-12-13 04:34:20,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:34:20,570 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:34:20,570 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:34:20,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-12-13 04:34:20,571 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 04:34:20,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:34:20,571 INFO L85 PathProgramCache]: Analyzing trace with hash 2047103720, now seen corresponding path program 35 times [2022-12-13 04:34:20,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:34:20,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67848537] [2022-12-13 04:34:20,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:34:20,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:34:20,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:34:20,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:34:20,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:34:20,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67848537] [2022-12-13 04:34:20,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67848537] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:34:20,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:34:20,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 04:34:20,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634103323] [2022-12-13 04:34:20,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:34:20,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 04:34:20,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:34:20,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 04:34:20,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-12-13 04:34:20,854 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 04:34:20,854 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 4402 transitions, 309124 flow. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:34:20,854 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:34:20,854 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 04:34:20,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:34:54,093 INFO L130 PetriNetUnfolder]: 10655/19094 cut-off events. [2022-12-13 04:34:54,094 INFO L131 PetriNetUnfolder]: For 1114/1114 co-relation queries the response was YES. [2022-12-13 04:34:54,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 688642 conditions, 19094 events. 10655/19094 cut-off events. For 1114/1114 co-relation queries the response was YES. Maximal size of possible extension queue 1726. Compared 164860 event pairs, 54 based on Foata normal form. 532/19626 useless extension candidates. Maximal degree in co-relation 680960. Up to 19084 conditions per place. [2022-12-13 04:34:54,304 INFO L137 encePairwiseOnDemand]: 21/32 looper letters, 2398 selfloop transitions, 2148 changer transitions 174/4720 dead transitions. [2022-12-13 04:34:54,304 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 4720 transitions, 340875 flow [2022-12-13 04:34:54,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 04:34:54,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 04:34:54,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 196 transitions. [2022-12-13 04:34:54,368 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.47115384615384615 [2022-12-13 04:34:54,368 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 309 predicate places. [2022-12-13 04:34:54,368 INFO L82 GeneralOperation]: Start removeDead. Operand has 357 places, 4720 transitions, 340875 flow [2022-12-13 04:34:54,635 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 357 places, 4546 transitions, 328329 flow [2022-12-13 04:34:54,877 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:34:54,877 INFO L89 Accepts]: Start accepts. Operand has 357 places, 4546 transitions, 328329 flow [2022-12-13 04:34:54,921 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:34:54,922 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:34:54,922 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 357 places, 4546 transitions, 328329 flow [2022-12-13 04:34:55,081 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 357 places, 4546 transitions, 328329 flow [2022-12-13 04:34:55,082 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:34:55,091 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:34:55,092 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 215 [2022-12-13 04:34:55,092 INFO L495 AbstractCegarLoop]: Abstraction has has 357 places, 4546 transitions, 328329 flow [2022-12-13 04:34:55,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:34:55,092 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:34:55,092 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:34:55,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-12-13 04:34:55,092 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 04:34:55,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:34:55,092 INFO L85 PathProgramCache]: Analyzing trace with hash -341175850, now seen corresponding path program 36 times [2022-12-13 04:34:55,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:34:55,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982641008] [2022-12-13 04:34:55,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:34:55,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:34:55,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:34:55,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:34:55,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:34:55,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982641008] [2022-12-13 04:34:55,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982641008] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:34:55,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:34:55,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 04:34:55,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052254866] [2022-12-13 04:34:55,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:34:55,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 04:34:55,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:34:55,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 04:34:55,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-12-13 04:34:55,224 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 04:34:55,224 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 4546 transitions, 328329 flow. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:34:55,224 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:34:55,224 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 04:34:55,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:35:32,350 INFO L130 PetriNetUnfolder]: 10123/18402 cut-off events. [2022-12-13 04:35:32,351 INFO L131 PetriNetUnfolder]: For 1113/1113 co-relation queries the response was YES. [2022-12-13 04:35:32,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 682114 conditions, 18402 events. 10123/18402 cut-off events. For 1113/1113 co-relation queries the response was YES. Maximal size of possible extension queue 1654. Compared 160903 event pairs, 58 based on Foata normal form. 252/18654 useless extension candidates. Maximal degree in co-relation 674221. Up to 18392 conditions per place. [2022-12-13 04:35:32,572 INFO L137 encePairwiseOnDemand]: 21/32 looper letters, 2186 selfloop transitions, 2276 changer transitions 210/4672 dead transitions. [2022-12-13 04:35:32,572 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 4672 transitions, 346766 flow [2022-12-13 04:35:32,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 04:35:32,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 04:35:32,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 217 transitions. [2022-12-13 04:35:32,575 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.423828125 [2022-12-13 04:35:32,575 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 324 predicate places. [2022-12-13 04:35:32,575 INFO L82 GeneralOperation]: Start removeDead. Operand has 372 places, 4672 transitions, 346766 flow [2022-12-13 04:35:32,811 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 372 places, 4462 transitions, 331205 flow [2022-12-13 04:35:32,982 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:35:32,982 INFO L89 Accepts]: Start accepts. Operand has 372 places, 4462 transitions, 331205 flow [2022-12-13 04:35:33,059 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:35:33,059 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:35:33,059 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 372 places, 4462 transitions, 331205 flow [2022-12-13 04:35:33,217 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 372 places, 4462 transitions, 331205 flow [2022-12-13 04:35:33,217 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:35:33,225 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:35:33,226 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 244 [2022-12-13 04:35:33,226 INFO L495 AbstractCegarLoop]: Abstraction has has 372 places, 4462 transitions, 331205 flow [2022-12-13 04:35:33,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:35:33,226 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:35:33,226 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:35:33,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-12-13 04:35:33,226 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 04:35:33,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:35:33,226 INFO L85 PathProgramCache]: Analyzing trace with hash -35279332, now seen corresponding path program 37 times [2022-12-13 04:35:33,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:35:33,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369203145] [2022-12-13 04:35:33,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:35:33,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:35:33,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:35:33,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:35:33,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:35:33,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369203145] [2022-12-13 04:35:33,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369203145] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:35:33,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:35:33,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 04:35:33,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215667267] [2022-12-13 04:35:33,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:35:33,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 04:35:33,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:35:33,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 04:35:33,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-12-13 04:35:33,370 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 04:35:33,370 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 4462 transitions, 331205 flow. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:35:33,370 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:35:33,370 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 04:35:33,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:36:10,618 INFO L130 PetriNetUnfolder]: 9914/18209 cut-off events. [2022-12-13 04:36:10,618 INFO L131 PetriNetUnfolder]: For 1142/1142 co-relation queries the response was YES. [2022-12-13 04:36:10,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 693184 conditions, 18209 events. 9914/18209 cut-off events. For 1142/1142 co-relation queries the response was YES. Maximal size of possible extension queue 1656. Compared 161104 event pairs, 50 based on Foata normal form. 160/18369 useless extension candidates. Maximal degree in co-relation 685080. Up to 18199 conditions per place. [2022-12-13 04:36:10,918 INFO L137 encePairwiseOnDemand]: 21/32 looper letters, 2180 selfloop transitions, 2250 changer transitions 259/4689 dead transitions. [2022-12-13 04:36:10,918 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 391 places, 4689 transitions, 357411 flow [2022-12-13 04:36:10,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 04:36:10,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-13 04:36:10,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 261 transitions. [2022-12-13 04:36:10,943 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4078125 [2022-12-13 04:36:10,943 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 343 predicate places. [2022-12-13 04:36:10,943 INFO L82 GeneralOperation]: Start removeDead. Operand has 391 places, 4689 transitions, 357411 flow [2022-12-13 04:36:11,225 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 390 places, 4430 transitions, 337694 flow [2022-12-13 04:36:11,403 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:36:11,403 INFO L89 Accepts]: Start accepts. Operand has 390 places, 4430 transitions, 337694 flow [2022-12-13 04:36:11,464 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:36:11,464 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:36:11,464 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 390 places, 4430 transitions, 337694 flow [2022-12-13 04:36:11,632 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 390 places, 4430 transitions, 337694 flow [2022-12-13 04:36:11,632 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:36:11,641 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:36:11,642 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 239 [2022-12-13 04:36:11,642 INFO L495 AbstractCegarLoop]: Abstraction has has 390 places, 4430 transitions, 337694 flow [2022-12-13 04:36:11,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:36:11,642 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:36:11,642 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:36:11,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-12-13 04:36:11,642 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 04:36:11,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:36:11,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1654183172, now seen corresponding path program 38 times [2022-12-13 04:36:11,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:36:11,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549478160] [2022-12-13 04:36:11,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:36:11,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:36:11,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:36:11,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:36:11,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:36:11,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549478160] [2022-12-13 04:36:11,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549478160] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:36:11,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:36:11,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 04:36:11,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975465117] [2022-12-13 04:36:11,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:36:11,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 04:36:11,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:36:11,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 04:36:11,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-12-13 04:36:11,796 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 04:36:11,796 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 4430 transitions, 337694 flow. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:36:11,796 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:36:11,796 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 04:36:11,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:36:42,182 INFO L130 PetriNetUnfolder]: 8708/15637 cut-off events. [2022-12-13 04:36:42,183 INFO L131 PetriNetUnfolder]: For 1077/1077 co-relation queries the response was YES. [2022-12-13 04:36:42,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 610940 conditions, 15637 events. 8708/15637 cut-off events. For 1077/1077 co-relation queries the response was YES. Maximal size of possible extension queue 1390. Compared 130364 event pairs, 94 based on Foata normal form. 4/15641 useless extension candidates. Maximal degree in co-relation 604113. Up to 15627 conditions per place. [2022-12-13 04:36:42,384 INFO L137 encePairwiseOnDemand]: 22/32 looper letters, 4356 selfloop transitions, 129 changer transitions 10/4495 dead transitions. [2022-12-13 04:36:42,384 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 406 places, 4495 transitions, 351627 flow [2022-12-13 04:36:42,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 04:36:42,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-13 04:36:42,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 125 transitions. [2022-12-13 04:36:42,385 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.22977941176470587 [2022-12-13 04:36:42,385 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 358 predicate places. [2022-12-13 04:36:42,385 INFO L82 GeneralOperation]: Start removeDead. Operand has 406 places, 4495 transitions, 351627 flow [2022-12-13 04:36:42,779 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 406 places, 4485 transitions, 350847 flow [2022-12-13 04:36:42,953 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:36:42,953 INFO L89 Accepts]: Start accepts. Operand has 406 places, 4485 transitions, 350847 flow [2022-12-13 04:36:43,050 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:36:43,050 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:36:43,050 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 406 places, 4485 transitions, 350847 flow [2022-12-13 04:36:43,225 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 406 places, 4485 transitions, 350847 flow [2022-12-13 04:36:43,225 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:36:43,233 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:36:43,235 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 282 [2022-12-13 04:36:43,235 INFO L495 AbstractCegarLoop]: Abstraction has has 406 places, 4485 transitions, 350847 flow [2022-12-13 04:36:43,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:36:43,235 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:36:43,235 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:36:43,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-12-13 04:36:43,236 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 04:36:43,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:36:43,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1459772660, now seen corresponding path program 39 times [2022-12-13 04:36:43,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:36:43,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807011601] [2022-12-13 04:36:43,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:36:43,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:36:43,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:36:43,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:36:43,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:36:43,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807011601] [2022-12-13 04:36:43,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807011601] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:36:43,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:36:43,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 04:36:43,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525676342] [2022-12-13 04:36:43,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:36:43,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 04:36:43,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:36:43,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 04:36:43,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-12-13 04:36:43,388 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 04:36:43,388 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 406 places, 4485 transitions, 350847 flow. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:36:43,388 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:36:43,388 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 04:36:43,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:37:18,922 INFO L130 PetriNetUnfolder]: 8726/15699 cut-off events. [2022-12-13 04:37:18,922 INFO L131 PetriNetUnfolder]: For 1081/1081 co-relation queries the response was YES. [2022-12-13 04:37:18,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 629062 conditions, 15699 events. 8726/15699 cut-off events. For 1081/1081 co-relation queries the response was YES. Maximal size of possible extension queue 1395. Compared 131475 event pairs, 54 based on Foata normal form. 2/15701 useless extension candidates. Maximal degree in co-relation 622062. Up to 15689 conditions per place. [2022-12-13 04:37:19,115 INFO L137 encePairwiseOnDemand]: 21/32 looper letters, 2811 selfloop transitions, 1689 changer transitions 13/4513 dead transitions. [2022-12-13 04:37:19,115 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 420 places, 4513 transitions, 362063 flow [2022-12-13 04:37:19,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 04:37:19,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 04:37:19,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 170 transitions. [2022-12-13 04:37:19,116 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3541666666666667 [2022-12-13 04:37:19,117 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 372 predicate places. [2022-12-13 04:37:19,117 INFO L82 GeneralOperation]: Start removeDead. Operand has 420 places, 4513 transitions, 362063 flow [2022-12-13 04:37:19,542 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 420 places, 4500 transitions, 361014 flow [2022-12-13 04:37:19,699 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:37:19,700 INFO L89 Accepts]: Start accepts. Operand has 420 places, 4500 transitions, 361014 flow [2022-12-13 04:37:19,780 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:37:19,780 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:37:19,780 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 420 places, 4500 transitions, 361014 flow [2022-12-13 04:37:19,953 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 420 places, 4500 transitions, 361014 flow [2022-12-13 04:37:19,953 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:37:19,961 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:37:19,962 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 263 [2022-12-13 04:37:19,962 INFO L495 AbstractCegarLoop]: Abstraction has has 420 places, 4500 transitions, 361014 flow [2022-12-13 04:37:19,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:37:19,962 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:37:19,962 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:37:19,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-12-13 04:37:19,963 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 04:37:19,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:37:19,963 INFO L85 PathProgramCache]: Analyzing trace with hash -212248408, now seen corresponding path program 40 times [2022-12-13 04:37:19,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:37:19,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828009902] [2022-12-13 04:37:19,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:37:19,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:37:19,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:37:20,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:37:20,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:37:20,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828009902] [2022-12-13 04:37:20,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828009902] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:37:20,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:37:20,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 04:37:20,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455649421] [2022-12-13 04:37:20,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:37:20,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 04:37:20,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:37:20,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 04:37:20,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-12-13 04:37:20,136 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 04:37:20,136 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 420 places, 4500 transitions, 361014 flow. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:37:20,136 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:37:20,136 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 04:37:20,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:37:58,764 INFO L130 PetriNetUnfolder]: 8706/15663 cut-off events. [2022-12-13 04:37:58,764 INFO L131 PetriNetUnfolder]: For 1075/1075 co-relation queries the response was YES. [2022-12-13 04:37:58,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 643278 conditions, 15663 events. 8706/15663 cut-off events. For 1075/1075 co-relation queries the response was YES. Maximal size of possible extension queue 1391. Compared 131018 event pairs, 54 based on Foata normal form. 4/15667 useless extension candidates. Maximal degree in co-relation 636105. Up to 15653 conditions per place. [2022-12-13 04:37:58,956 INFO L137 encePairwiseOnDemand]: 22/32 looper letters, 4403 selfloop transitions, 82 changer transitions 18/4503 dead transitions. [2022-12-13 04:37:58,956 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 438 places, 4503 transitions, 370260 flow [2022-12-13 04:37:58,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-13 04:37:58,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-13 04:37:58,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 123 transitions. [2022-12-13 04:37:58,957 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.20230263157894737 [2022-12-13 04:37:58,957 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 390 predicate places. [2022-12-13 04:37:58,957 INFO L82 GeneralOperation]: Start removeDead. Operand has 438 places, 4503 transitions, 370260 flow [2022-12-13 04:37:59,361 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 434 places, 4485 transitions, 368778 flow [2022-12-13 04:37:59,518 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:37:59,518 INFO L89 Accepts]: Start accepts. Operand has 434 places, 4485 transitions, 368778 flow [2022-12-13 04:37:59,591 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:37:59,592 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:37:59,592 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 434 places, 4485 transitions, 368778 flow [2022-12-13 04:37:59,763 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 434 places, 4485 transitions, 368778 flow [2022-12-13 04:37:59,763 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:37:59,770 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:37:59,771 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 253 [2022-12-13 04:37:59,771 INFO L495 AbstractCegarLoop]: Abstraction has has 434 places, 4485 transitions, 368778 flow [2022-12-13 04:37:59,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:37:59,771 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:37:59,771 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:37:59,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-12-13 04:37:59,771 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 04:37:59,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:37:59,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1993783452, now seen corresponding path program 41 times [2022-12-13 04:37:59,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:37:59,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359873860] [2022-12-13 04:37:59,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:37:59,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:37:59,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:37:59,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:37:59,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:37:59,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359873860] [2022-12-13 04:37:59,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359873860] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:37:59,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:37:59,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 04:37:59,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228284527] [2022-12-13 04:37:59,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:37:59,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 04:37:59,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:37:59,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 04:37:59,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-12-13 04:37:59,928 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 04:37:59,928 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 434 places, 4485 transitions, 368778 flow. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:37:59,928 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:37:59,928 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 04:37:59,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:38:34,669 INFO L130 PetriNetUnfolder]: 8698/15651 cut-off events. [2022-12-13 04:38:34,670 INFO L131 PetriNetUnfolder]: For 1075/1075 co-relation queries the response was YES. [2022-12-13 04:38:34,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 658434 conditions, 15651 events. 8698/15651 cut-off events. For 1075/1075 co-relation queries the response was YES. Maximal size of possible extension queue 1391. Compared 130999 event pairs, 58 based on Foata normal form. 2/15653 useless extension candidates. Maximal degree in co-relation 651088. Up to 15641 conditions per place. [2022-12-13 04:38:34,846 INFO L137 encePairwiseOnDemand]: 22/32 looper letters, 4408 selfloop transitions, 67 changer transitions 24/4499 dead transitions. [2022-12-13 04:38:34,847 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 450 places, 4499 transitions, 378924 flow [2022-12-13 04:38:34,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 04:38:34,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-13 04:38:34,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 109 transitions. [2022-12-13 04:38:34,847 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.20036764705882354 [2022-12-13 04:38:34,848 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 402 predicate places. [2022-12-13 04:38:34,848 INFO L82 GeneralOperation]: Start removeDead. Operand has 450 places, 4499 transitions, 378924 flow [2022-12-13 04:38:35,240 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 444 places, 4475 transitions, 376902 flow [2022-12-13 04:38:35,396 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:38:35,396 INFO L89 Accepts]: Start accepts. Operand has 444 places, 4475 transitions, 376902 flow [2022-12-13 04:38:35,484 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:38:35,485 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:38:35,485 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 444 places, 4475 transitions, 376902 flow [2022-12-13 04:38:35,656 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 444 places, 4475 transitions, 376902 flow [2022-12-13 04:38:35,656 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:38:35,663 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:38:35,664 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 268 [2022-12-13 04:38:35,664 INFO L495 AbstractCegarLoop]: Abstraction has has 444 places, 4475 transitions, 376902 flow [2022-12-13 04:38:35,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:38:35,664 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:38:35,664 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:38:35,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-12-13 04:38:35,664 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 04:38:35,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:38:35,664 INFO L85 PathProgramCache]: Analyzing trace with hash 509199080, now seen corresponding path program 42 times [2022-12-13 04:38:35,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:38:35,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209263878] [2022-12-13 04:38:35,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:38:35,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:38:35,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:38:35,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:38:35,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:38:35,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209263878] [2022-12-13 04:38:35,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209263878] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:38:35,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:38:35,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 04:38:35,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289170611] [2022-12-13 04:38:35,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:38:35,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 04:38:35,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:38:35,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 04:38:35,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-12-13 04:38:35,834 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 04:38:35,834 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 444 places, 4475 transitions, 376902 flow. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:38:35,834 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:38:35,834 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 04:38:35,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:39:12,692 INFO L130 PetriNetUnfolder]: 8685/15620 cut-off events. [2022-12-13 04:39:12,692 INFO L131 PetriNetUnfolder]: For 1071/1071 co-relation queries the response was YES. [2022-12-13 04:39:12,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 672749 conditions, 15620 events. 8685/15620 cut-off events. For 1071/1071 co-relation queries the response was YES. Maximal size of possible extension queue 1392. Compared 130804 event pairs, 58 based on Foata normal form. 6/15626 useless extension candidates. Maximal degree in co-relation 665230. Up to 15610 conditions per place. [2022-12-13 04:39:12,883 INFO L137 encePairwiseOnDemand]: 21/32 looper letters, 4359 selfloop transitions, 89 changer transitions 31/4479 dead transitions. [2022-12-13 04:39:12,883 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 456 places, 4479 transitions, 386196 flow [2022-12-13 04:39:12,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 04:39:12,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 04:39:12,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 99 transitions. [2022-12-13 04:39:12,884 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.23798076923076922 [2022-12-13 04:39:12,884 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 408 predicate places. [2022-12-13 04:39:12,884 INFO L82 GeneralOperation]: Start removeDead. Operand has 456 places, 4479 transitions, 386196 flow [2022-12-13 04:39:13,226 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 454 places, 4448 transitions, 383530 flow [2022-12-13 04:39:13,447 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:39:13,448 INFO L89 Accepts]: Start accepts. Operand has 454 places, 4448 transitions, 383530 flow [2022-12-13 04:39:13,488 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:39:13,489 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:39:13,489 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 454 places, 4448 transitions, 383530 flow [2022-12-13 04:39:13,650 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 454 places, 4448 transitions, 383530 flow [2022-12-13 04:39:13,650 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:39:13,657 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:39:13,658 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 211 [2022-12-13 04:39:13,658 INFO L495 AbstractCegarLoop]: Abstraction has has 454 places, 4448 transitions, 383530 flow [2022-12-13 04:39:13,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:39:13,658 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:39:13,658 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:39:13,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-12-13 04:39:13,658 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 04:39:13,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:39:13,658 INFO L85 PathProgramCache]: Analyzing trace with hash -623792558, now seen corresponding path program 43 times [2022-12-13 04:39:13,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:39:13,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744581210] [2022-12-13 04:39:13,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:39:13,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:39:13,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:39:13,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:39:13,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:39:13,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744581210] [2022-12-13 04:39:13,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744581210] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:39:13,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:39:13,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 04:39:13,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712985185] [2022-12-13 04:39:13,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:39:13,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 04:39:13,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:39:13,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 04:39:13,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-12-13 04:39:13,849 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 04:39:13,849 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 454 places, 4448 transitions, 383530 flow. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:39:13,849 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:39:13,850 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 04:39:13,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2022-12-13 04:39:46,537 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 04:39:46,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 04:39:46,559 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-13 04:39:46,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-12-13 04:39:46,559 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (11states, 0/32 universal loopers) in iteration 43,while PetriNetUnfolder was constructing finite prefix that currently has 612962 conditions, 13914 events (7742/13913 cut-off events. For 651/651 co-relation queries the response was YES. Maximal size of possible extension queue 1385. Compared 119899 event pairs, 24 based on Foata normal form. 6/14091 useless extension candidates. Maximal degree in co-relation 612465. Up to 13903 conditions per place.). [2022-12-13 04:39:46,560 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 6 remaining) [2022-12-13 04:39:46,560 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-13 04:39:46,560 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-13 04:39:46,560 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-13 04:39:46,560 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2022-12-13 04:39:46,561 INFO L445 BasicCegarLoop]: Path program histogram: [43] [2022-12-13 04:39:46,563 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 04:39:46,563 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 04:39:46,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 04:39:46 BasicIcfg [2022-12-13 04:39:46,566 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 04:39:46,567 INFO L158 Benchmark]: Toolchain (without parser) took 831182.42ms. Allocated memory was 184.5MB in the beginning and 4.4GB in the end (delta: 4.3GB). Free memory was 160.2MB in the beginning and 417.1MB in the end (delta: -256.9MB). Peak memory consumption was 4.3GB. Max. memory is 8.0GB. [2022-12-13 04:39:46,567 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 184.5MB. Free memory was 162.3MB in the beginning and 162.2MB in the end (delta: 62.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 04:39:46,567 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.63ms. Allocated memory is still 184.5MB. Free memory was 159.7MB in the beginning and 143.5MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-12-13 04:39:46,567 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.75ms. Allocated memory is still 184.5MB. Free memory was 143.5MB in the beginning and 140.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 04:39:46,567 INFO L158 Benchmark]: Boogie Preprocessor took 45.74ms. Allocated memory is still 184.5MB. Free memory was 140.8MB in the beginning and 139.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 04:39:46,568 INFO L158 Benchmark]: RCFGBuilder took 555.27ms. Allocated memory is still 184.5MB. Free memory was 139.3MB in the beginning and 114.1MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-13 04:39:46,568 INFO L158 Benchmark]: TraceAbstraction took 830301.34ms. Allocated memory was 184.5MB in the beginning and 4.4GB in the end (delta: 4.3GB). Free memory was 113.1MB in the beginning and 417.1MB in the end (delta: -304.1MB). Peak memory consumption was 4.2GB. Max. memory is 8.0GB. [2022-12-13 04:39:46,569 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 184.5MB. Free memory was 162.3MB in the beginning and 162.2MB in the end (delta: 62.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 235.63ms. Allocated memory is still 184.5MB. Free memory was 159.7MB in the beginning and 143.5MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.75ms. Allocated memory is still 184.5MB. Free memory was 143.5MB in the beginning and 140.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.74ms. Allocated memory is still 184.5MB. Free memory was 140.8MB in the beginning and 139.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 555.27ms. Allocated memory is still 184.5MB. Free memory was 139.3MB in the beginning and 114.1MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 830301.34ms. Allocated memory was 184.5MB in the beginning and 4.4GB in the end (delta: 4.3GB). Free memory was 113.1MB in the beginning and 417.1MB in the end (delta: -304.1MB). Peak memory consumption was 4.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.4s, 153 PlacesBefore, 48 PlacesAfterwards, 139 TransitionsBefore, 32 TransitionsAfterwards, 2082 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 63 TrivialYvCompositions, 42 ConcurrentYvCompositions, 2 ChoiceCompositions, 107 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1151, independent: 1115, independent conditional: 1115, independent unconditional: 0, dependent: 36, dependent conditional: 36, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1151, independent: 1115, independent conditional: 0, independent unconditional: 1115, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1151, independent: 1115, independent conditional: 0, independent unconditional: 1115, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1151, independent: 1115, independent conditional: 0, independent unconditional: 1115, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1106, independent: 1076, independent conditional: 0, independent unconditional: 1076, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1106, independent: 1013, independent conditional: 0, independent unconditional: 1013, dependent: 93, dependent conditional: 0, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 93, independent: 63, independent conditional: 0, independent unconditional: 63, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 192, independent: 114, independent conditional: 0, independent unconditional: 114, dependent: 78, dependent conditional: 0, dependent unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1151, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 1106, unknown conditional: 0, unknown unconditional: 1106] , Statistics on independence cache: Total cache size (in pairs): 1572, Positive cache size: 1542, Positive conditional cache size: 0, Positive unconditional cache size: 1542, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 53 PlacesBefore, 53 PlacesAfterwards, 86 TransitionsBefore, 86 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 58 PlacesBefore, 58 PlacesAfterwards, 149 TransitionsBefore, 149 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 62 PlacesBefore, 62 PlacesAfterwards, 205 TransitionsBefore, 205 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 66 PlacesBefore, 66 PlacesAfterwards, 239 TransitionsBefore, 239 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 83 PlacesBefore, 83 PlacesAfterwards, 537 TransitionsBefore, 537 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 93 PlacesBefore, 93 PlacesAfterwards, 917 TransitionsBefore, 917 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 103 PlacesBefore, 103 PlacesAfterwards, 924 TransitionsBefore, 924 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 111 PlacesBefore, 111 PlacesAfterwards, 967 TransitionsBefore, 967 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 119 PlacesBefore, 119 PlacesAfterwards, 1242 TransitionsBefore, 1242 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 123 PlacesBefore, 123 PlacesAfterwards, 1176 TransitionsBefore, 1176 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 94 PlacesBefore, 94 PlacesAfterwards, 1014 TransitionsBefore, 1014 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 101 PlacesBefore, 101 PlacesAfterwards, 1453 TransitionsBefore, 1453 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 108 PlacesBefore, 108 PlacesAfterwards, 1498 TransitionsBefore, 1498 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 116 PlacesBefore, 116 PlacesAfterwards, 1766 TransitionsBefore, 1766 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 123 PlacesBefore, 123 PlacesAfterwards, 1913 TransitionsBefore, 1913 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 132 PlacesBefore, 132 PlacesAfterwards, 2139 TransitionsBefore, 2139 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 139 PlacesBefore, 139 PlacesAfterwards, 2337 TransitionsBefore, 2337 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 149 PlacesBefore, 149 PlacesAfterwards, 2690 TransitionsBefore, 2690 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 156 PlacesBefore, 156 PlacesAfterwards, 2670 TransitionsBefore, 2670 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 163 PlacesBefore, 163 PlacesAfterwards, 2749 TransitionsBefore, 2749 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 171 PlacesBefore, 171 PlacesAfterwards, 2786 TransitionsBefore, 2786 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 183 PlacesBefore, 183 PlacesAfterwards, 3053 TransitionsBefore, 3053 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 190 PlacesBefore, 190 PlacesAfterwards, 3059 TransitionsBefore, 3059 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 202 PlacesBefore, 202 PlacesAfterwards, 3403 TransitionsBefore, 3403 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 213 PlacesBefore, 213 PlacesAfterwards, 3611 TransitionsBefore, 3611 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 225 PlacesBefore, 225 PlacesAfterwards, 3968 TransitionsBefore, 3968 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 238 PlacesBefore, 238 PlacesAfterwards, 4022 TransitionsBefore, 4022 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 253 PlacesBefore, 253 PlacesAfterwards, 4113 TransitionsBefore, 4113 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 272 PlacesBefore, 272 PlacesAfterwards, 4387 TransitionsBefore, 4387 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 285 PlacesBefore, 285 PlacesAfterwards, 4313 TransitionsBefore, 4313 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 302 PlacesBefore, 302 PlacesAfterwards, 4329 TransitionsBefore, 4329 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 317 PlacesBefore, 317 PlacesAfterwards, 4364 TransitionsBefore, 4364 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 336 PlacesBefore, 336 PlacesAfterwards, 4396 TransitionsBefore, 4396 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 345 PlacesBefore, 345 PlacesAfterwards, 4402 TransitionsBefore, 4402 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 357 PlacesBefore, 357 PlacesAfterwards, 4546 TransitionsBefore, 4546 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 372 PlacesBefore, 372 PlacesAfterwards, 4462 TransitionsBefore, 4462 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 390 PlacesBefore, 390 PlacesAfterwards, 4430 TransitionsBefore, 4430 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 406 PlacesBefore, 406 PlacesAfterwards, 4485 TransitionsBefore, 4485 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 420 PlacesBefore, 420 PlacesAfterwards, 4500 TransitionsBefore, 4500 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 434 PlacesBefore, 434 PlacesAfterwards, 4485 TransitionsBefore, 4485 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 444 PlacesBefore, 444 PlacesAfterwards, 4475 TransitionsBefore, 4475 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 454 PlacesBefore, 454 PlacesAfterwards, 4448 TransitionsBefore, 4448 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 168]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (11states, 0/32 universal loopers) in iteration 43,while PetriNetUnfolder was constructing finite prefix that currently has 612962 conditions, 13914 events (7742/13913 cut-off events. For 651/651 co-relation queries the response was YES. Maximal size of possible extension queue 1385. Compared 119899 event pairs, 24 based on Foata normal form. 6/14091 useless extension candidates. Maximal degree in co-relation 612465. Up to 13903 conditions per place.). - TimeoutResultAtElement [Line: 156]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (11states, 0/32 universal loopers) in iteration 43,while PetriNetUnfolder was constructing finite prefix that currently has 612962 conditions, 13914 events (7742/13913 cut-off events. For 651/651 co-relation queries the response was YES. Maximal size of possible extension queue 1385. Compared 119899 event pairs, 24 based on Foata normal form. 6/14091 useless extension candidates. Maximal degree in co-relation 612465. Up to 13903 conditions per place.). - TimeoutResultAtElement [Line: 158]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (11states, 0/32 universal loopers) in iteration 43,while PetriNetUnfolder was constructing finite prefix that currently has 612962 conditions, 13914 events (7742/13913 cut-off events. For 651/651 co-relation queries the response was YES. Maximal size of possible extension queue 1385. Compared 119899 event pairs, 24 based on Foata normal form. 6/14091 useless extension candidates. Maximal degree in co-relation 612465. Up to 13903 conditions per place.). - TimeoutResultAtElement [Line: 157]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (11states, 0/32 universal loopers) in iteration 43,while PetriNetUnfolder was constructing finite prefix that currently has 612962 conditions, 13914 events (7742/13913 cut-off events. For 651/651 co-relation queries the response was YES. Maximal size of possible extension queue 1385. Compared 119899 event pairs, 24 based on Foata normal form. 6/14091 useless extension candidates. Maximal degree in co-relation 612465. Up to 13903 conditions per place.). - TimeoutResultAtElement [Line: 160]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (11states, 0/32 universal loopers) in iteration 43,while PetriNetUnfolder was constructing finite prefix that currently has 612962 conditions, 13914 events (7742/13913 cut-off events. For 651/651 co-relation queries the response was YES. Maximal size of possible extension queue 1385. Compared 119899 event pairs, 24 based on Foata normal form. 6/14091 useless extension candidates. Maximal degree in co-relation 612465. Up to 13903 conditions per place.). - TimeoutResultAtElement [Line: 159]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (11states, 0/32 universal loopers) in iteration 43,while PetriNetUnfolder was constructing finite prefix that currently has 612962 conditions, 13914 events (7742/13913 cut-off events. For 651/651 co-relation queries the response was YES. Maximal size of possible extension queue 1385. Compared 119899 event pairs, 24 based on Foata normal form. 6/14091 useless extension candidates. Maximal degree in co-relation 612465. Up to 13903 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 11 procedures, 198 locations, 6 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: 830.2s, OverallIterations: 43, TraceHistogramMax: 1, PathProgramHistogramMax: 43, EmptinessCheckTime: 0.0s, AutomataDifference: 794.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3356 SdHoareTripleChecker+Valid, 9.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3356 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 7.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 1513 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 19812 IncrementalHoareTripleChecker+Invalid, 21325 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1513 mSolverCounterUnsat, 0 mSDtfsCounter, 19812 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 570 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 489 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 943 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=383530occurred in iteration=42, InterpolantAutomatonStates: 500, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 1376 NumberOfCodeBlocks, 1376 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 1333 ConstructedInterpolants, 0 QuantifiedInterpolants, 5583 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 43 InterpolantComputations, 43 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 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown